169 lines
8.3 KiB
Plaintext
169 lines
8.3 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.020s CPU, 0.017s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock]
|
||
|
Preparing model... [0.010s CPU, 0.009s wall-clock]
|
||
|
Generated 24 rules.
|
||
|
Computing model... [0.030s CPU, 0.032s wall-clock]
|
||
|
201 relevant atoms
|
||
|
140 auxiliary atoms
|
||
|
341 final queue length
|
||
|
452 total queue pushes
|
||
|
Completing instantiation... [0.040s CPU, 0.036s wall-clock]
|
||
|
Instantiating: [0.090s CPU, 0.095s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
10 initial candidates
|
||
|
Finding invariants: [0.010s CPU, 0.010s wall-clock]
|
||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating groups... [0.010s CPU, 0.006s 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.023s 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.040s CPU, 0.029s 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.015s 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: 33112 KB
|
||
|
Writing output... [0.010s CPU, 0.014s wall-clock]
|
||
|
Done! [0.200s CPU, 0.205s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.06s
|
||
|
Memory: 48MB
|
||
|
|
||
|
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: 48MB (+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.02s
|
||
|
Memory: 49MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 50MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
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.02s
|
||
|
Memory: 51MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.27s
|
||
|
Memory: 51MB (+0MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.30s
|
||
|
|
||
|
Iteration 4
|
||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 10
|
||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 53MB (+2MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.31s
|
||
|
Memory: 54MB (+1MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.33s
|
||
|
|
||
|
Iteration 5
|
||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 15
|
||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 55MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("pick","ball9","rooma","right")),1) occurs(action(("pick","ball6","rooma","left")),1) occurs(action(("move","rooma","roomb")),1) occurs(action(("drop","ball9","roomb","right")),2) occurs(action(("drop","ball6","roomb","left")),2) occurs(action(("move","roomb","rooma")),2) occurs(action(("pick","ball2","rooma","left")),3) occurs(action(("pick","ball1","rooma","right")),3) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball2","roomb","left")),4) occurs(action(("drop","ball1","roomb","right")),4) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball5","rooma","left")),5) occurs(action(("pick","ball12","rooma","right")),5) occurs(action(("move","rooma","roomb")),5) occurs(action(("drop","ball5","roomb","left")),6) occurs(action(("drop","ball12","roomb","right")),6) occurs(action(("move","roomb","rooma")),6) occurs(action(("pick","ball7","rooma","left")),7) occurs(action(("pick","ball4","rooma","right")),7) occurs(action(("move","rooma","roomb")),7) occurs(action(("drop","ball7","roomb","left")),8) occurs(action(("drop","ball4","roomb","right")),8) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball3","rooma","left")),9) occurs(action(("pick","ball11","rooma","right")),9) occurs(action(("move","rooma","roomb")),9) occurs(action(("drop","ball3","roomb","left")),10) occurs(action(("drop","ball11","roomb","right")),10) occurs(action(("move","roomb","rooma")),10) occurs(action(("pick","ball8","rooma","right")),11) occurs(action(("move","rooma","roomb")),11) occurs(action(("drop","ball8","roomb","right")),12) occurs(action(("pick","ball3","roomb","left")),12) occurs(action(("drop","ball3","roomb","left")),13) occurs(action(("pick","ball6","roomb","right")),13) occurs(action(("move","roomb","rooma")),13) occurs(action(("move","rooma","roomb")),14) occurs(action(("drop","ball6","rooma","right")),14) occurs(action(("pick","ball5","roomb","left")),15) occurs(action(("pick","ball3","roomb","right")),15) occurs(action(("move","roomb","rooma")),15) occurs(action(("move","rooma","roomb")),16) occurs(action(("drop","ball5","roomb","left")),17) occurs(action(("drop","ball3","roomb","right")),17) occurs(action(("move","roomb","rooma")),17) occurs(action(("pick","ball6","rooma","right")),18) occurs(action(("pick","ball10","rooma","left")),18) occurs(action(("move","rooma","roomb")),18) occurs(action(("drop","ball6","roomb","right")),19) occurs(action(("drop","ball10","roomb","left")),19) occurs(action(("move","roomb","rooma")),20)
|
||
|
Solving Time: 0.02s
|
||
|
Memory: 55MB (+0MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 5
|
||
|
Time : 0.770s (Solving: 0.60s 1st Model: 0.02s Unsat: 0.00s)
|
||
|
CPU Time : 0.770s
|
||
|
|
||
|
Choices : 29479
|
||
|
Conflicts : 18804 (Analyzed: 18803)
|
||
|
Restarts : 207 (Average: 90.84 Last: 128)
|
||
|
Model-Level : 62.0
|
||
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||
|
Lemmas : 18803 (Deleted: 12834)
|
||
|
Binary : 289 (Ratio: 1.54%)
|
||
|
Ternary : 460 (Ratio: 2.45%)
|
||
|
Conflict : 18803 (Average Length: 23.4 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 18803 (Average: 1.41 Max: 30 Sum: 26427)
|
||
|
Executed : 18800 (Average: 1.41 Max: 30 Sum: 26424 Ratio: 99.99%)
|
||
|
Bounded : 3 (Average: 1.00 Max: 1 Sum: 3 Ratio: 0.01%)
|
||
|
|
||
|
Rules : 16212
|
||
|
Atoms : 16212
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 5925 (Eliminated: 0 Frozen: 2262)
|
||
|
Constraints : 20930 (Binary: 86.6% Ternary: 11.7% Other: 1.6%)
|
||
|
|
||
|
Memory Peak : 55MB
|
||
|
Max. Length : 20 steps
|
||
|
Sol. Length : 20 steps
|
||
|
|
||
|
|