148 lines
5.5 KiB
Plaintext
148 lines
5.5 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-8.pddl']
|
|
INFO translator arguments: []
|
|
INFO translator time limit: None
|
|
INFO translator memory limit: None
|
|
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-8.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.014s wall-clock]
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
|
|
Preparing model... [0.000s CPU, 0.005s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.030s CPU, 0.027s wall-clock]
|
|
158 relevant atoms
|
|
102 auxiliary atoms
|
|
260 final queue length
|
|
421 total queue pushes
|
|
Completing instantiation... [0.040s CPU, 0.036s wall-clock]
|
|
Instantiating: [0.080s CPU, 0.085s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.034s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.002s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
7 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.040s CPU, 0.045s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
|
Translating task: [0.030s CPU, 0.032s wall-clock]
|
|
102 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
12 propositions removed
|
|
Detecting unreachable propositions: [0.010s CPU, 0.016s wall-clock]
|
|
Reordering and filtering variables...
|
|
13 of 13 variables necessary.
|
|
7 of 13 mutex groups necessary.
|
|
72 of 72 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.010s wall-clock]
|
|
Translator variables: 13
|
|
Translator derived variables: 0
|
|
Translator facts: 56
|
|
Translator goal facts: 5
|
|
Translator mutex groups: 7
|
|
Translator total mutex groups size: 49
|
|
Translator operators: 72
|
|
Translator axioms: 0
|
|
Translator task size: 645
|
|
Translator peak memory: 36300 KB
|
|
Writing output... [0.010s CPU, 0.014s wall-clock]
|
|
Done! [0.220s CPU, 0.223s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.04s
|
|
Memory: 50MB
|
|
|
|
Iteration 1
|
|
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 0
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.00s
|
|
|
|
Iteration 2
|
|
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 0
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.01s
|
|
Memory: 51MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 51MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.02s
|
|
|
|
Iteration 3
|
|
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 5
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.01s
|
|
Memory: 52MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 52MB (+0MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.02s
|
|
Memory: 52MB (+0MB)
|
|
Answer: 1
|
|
occurs(action(("unstack","a","f")),1) occurs(action(("stack","a","d")),2) occurs(action(("pick-up","b")),3) occurs(action(("stack","b","a")),4) occurs(action(("pick-up","c")),5) occurs(action(("stack","c","b")),6) occurs(action(("pick-up","f")),7) occurs(action(("stack","f","c")),8) occurs(action(("pick-up","e")),9) occurs(action(("stack","e","f")),10)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 3
|
|
Time : 0.077s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
|
CPU Time : 0.072s
|
|
|
|
Choices : 9 (Domain: 9)
|
|
Conflicts : 1 (Analyzed: 0)
|
|
Restarts : 0
|
|
Model-Level : 21.0
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
|
Lemmas : 0 (Deleted: 0)
|
|
Binary : 0 (Ratio: 0.00%)
|
|
Ternary : 0 (Ratio: 0.00%)
|
|
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
|
|
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
|
|
|
|
Rules : 2007
|
|
Atoms : 2007
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 1545 (Eliminated: 0 Frozen: 484)
|
|
Constraints : 8064 (Binary: 89.7% Ternary: 5.8% Other: 4.5%)
|
|
|
|
Memory Peak : 52MB
|
|
Max. Length : 10 steps
|
|
Sol. Length : 10 steps
|
|
Models : 1
|
|
|
|
|