219 lines
9.1 KiB
Plaintext
219 lines
9.1 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-5.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-1998/domains/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-5.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Generated 24 rules.
|
||
|
|
Computing model... [0.020s CPU, 0.024s wall-clock]
|
||
|
|
201 relevant atoms
|
||
|
|
140 auxiliary atoms
|
||
|
|
341 final queue length
|
||
|
|
452 total queue pushes
|
||
|
|
Completing instantiation... [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Instantiating: [0.070s CPU, 0.073s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
10 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 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.020s CPU, 0.019s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.001s wall-clock]
|
||
|
|
Translating task: [0.030s CPU, 0.026s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
3 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
15 of 15 variables necessary.
|
||
|
|
12 of 15 mutex groups necessary.
|
||
|
|
98 of 98 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Translator variables: 15
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 64
|
||
|
|
Translator goal facts: 12
|
||
|
|
Translator mutex groups: 12
|
||
|
|
Translator total mutex groups size: 48
|
||
|
|
Translator operators: 98
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 673
|
||
|
|
Translator peak memory: 33368 KB
|
||
|
|
Writing output... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Done! [0.160s CPU, 0.167s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.05s
|
||
|
|
Memory: 46MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [5]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 48MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 48MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [7]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 48MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 48MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.03s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [9]
|
||
|
|
Grounded Until: 7
|
||
|
|
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 48MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.06s
|
||
|
|
Memory: 49MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.07s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [14]
|
||
|
|
Grounded Until: 9
|
||
|
|
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 49MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.40s
|
||
|
|
Memory: 50MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.42s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [19, 14]
|
||
|
|
Grounded Until: 14
|
||
|
|
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.45s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.47s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [14, 27, 19]
|
||
|
|
Grounded Until: 19
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.46s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.46s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [27, 19, 39]
|
||
|
|
Grounded Until: 19
|
||
|
|
Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
|
||
|
|
Grounding Time: 0.02s
|
||
|
|
Memory: 54MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.55s
|
||
|
|
Memory: 55MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.58s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [19, 39, 55, 27]
|
||
|
|
Grounded Until: 27
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.51s
|
||
|
|
Memory: 55MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 0.52s
|
||
|
|
|
||
|
|
Iteration 9
|
||
|
|
Queue: [39, 55, 27, 78, 19]
|
||
|
|
Grounded Until: 27
|
||
|
|
Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 57MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("pick","ball2","rooma","left")),1) occurs(action(("pick","ball11","rooma","right")),1) occurs(action(("move","rooma","roomb")),2) occurs(action(("drop","ball2","roomb","left")),3) occurs(action(("drop","ball11","roomb","right")),3) occurs(action(("pick","ball11","roomb","right")),4) occurs(action(("pick","ball2","roomb","left")),5) occurs(action(("move","roomb","rooma")),6) occurs(action(("move","rooma","roomb")),7) occurs(action(("move","roomb","rooma")),8) occurs(action(("move","rooma","roomb")),9) occurs(action(("drop","ball2","roomb","left")),10) occurs(action(("drop","ball11","roomb","right")),10) occurs(action(("move","roomb","rooma")),11) occurs(action(("pick","ball6","rooma","left")),12) occurs(action(("pick","ball12","rooma","right")),12) occurs(action(("move","rooma","roomb")),13) occurs(action(("drop","ball6","roomb","left")),14) occurs(action(("drop","ball12","roomb","right")),14) occurs(action(("move","roomb","rooma")),15) occurs(action(("pick","ball9","rooma","right")),16) occurs(action(("pick","ball10","rooma","left")),17) occurs(action(("move","rooma","roomb")),18) occurs(action(("drop","ball9","roomb","right")),19) occurs(action(("drop","ball10","roomb","left")),19) occurs(action(("move","roomb","rooma")),20) occurs(action(("pick","ball8","rooma","right")),21) occurs(action(("pick","ball1","rooma","left")),22) occurs(action(("drop","ball8","rooma","right")),22) occurs(action(("drop","ball1","rooma","left")),23) occurs(action(("pick","ball8","rooma","left")),24) occurs(action(("pick","ball5","rooma","right")),24) occurs(action(("move","rooma","roomb")),25) occurs(action(("drop","ball8","roomb","left")),26) occurs(action(("drop","ball5","roomb","right")),26) occurs(action(("move","roomb","rooma")),27) occurs(action(("pick","ball4","rooma","left")),28) occurs(action(("move","rooma","roomb")),29) occurs(action(("pick","ball10","roomb","right")),30) occurs(action(("drop","ball4","roomb","left")),31) occurs(action(("drop","ball10","roomb","right")),31) occurs(action(("move","roomb","rooma")),32) occurs(action(("pick","ball7","rooma","left")),33) occurs(action(("pick","ball1","rooma","right")),33) occurs(action(("move","rooma","roomb")),34) occurs(action(("drop","ball7","roomb","left")),35) occurs(action(("move","roomb","rooma")),36) occurs(action(("pick","ball3","rooma","left")),37) occurs(action(("move","rooma","roomb")),38) occurs(action(("drop","ball3","roomb","left")),39) occurs(action(("drop","ball1","roomb","right")),39)
|
||
|
|
Solving Time: 0.15s
|
||
|
|
Memory: 58MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 9
|
||
|
|
Time : 2.823s (Solving: 2.59s 1st Model: 0.15s Unsat: 0.53s)
|
||
|
|
CPU Time : 2.820s
|
||
|
|
|
||
|
|
Choices : 81944
|
||
|
|
Conflicts : 48809 (Analyzed: 48805)
|
||
|
|
Restarts : 532 (Average: 91.74 Last: 123)
|
||
|
|
Model-Level : 198.0
|
||
|
|
Problems : 9 (Average Length: 20.44 Splits: 0)
|
||
|
|
Lemmas : 48805 (Deleted: 37603)
|
||
|
|
Binary : 576 (Ratio: 1.18%)
|
||
|
|
Ternary : 1074 (Ratio: 2.20%)
|
||
|
|
Conflict : 48805 (Average Length: 19.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 48805 (Average: 1.51 Max: 131 Sum: 73464)
|
||
|
|
Executed : 48747 (Average: 1.50 Max: 131 Sum: 73032 Ratio: 99.41%)
|
||
|
|
Bounded : 58 (Average: 7.45 Max: 29 Sum: 432 Ratio: 0.59%)
|
||
|
|
|
||
|
|
Rules : 0
|
||
|
|
Atoms : 0
|
||
|
|
Bodies : 0
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 10661 (Eliminated: 0 Frozen: 5090)
|
||
|
|
Constraints : 51627 (Binary: 87.2% Ternary: 9.5% Other: 3.4%)
|
||
|
|
|
||
|
|
Memory Peak : 59MB
|
||
|
|
Max. Length : 39 steps
|
||
|
|
Sol. Length : 39 steps
|
||
|
|
|
||
|
|
|