1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-1998_gripper-round-1-strips_5.out

161 lines
7.4 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.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.006s wall-clock]
Generated 24 rules.
Computing model... [0.030s CPU, 0.025s wall-clock]
201 relevant atoms
140 auxiliary atoms
341 final queue length
452 total queue pushes
Completing instantiation... [0.030s CPU, 0.030s wall-clock]
Instantiating: [0.070s CPU, 0.075s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.010s CPU, 0.009s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.021s 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.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.020s CPU, 0.016s 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.000s CPU, 0.007s 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: 36300 KB
Writing output... [0.020s CPU, 0.016s wall-clock]
Done! [0.180s CPU, 0.180s wall-clock]
planner.py version 0.0.1
Time: 0.03s
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.01s
Memory: 52MB (+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.01s
Memory: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.36s
Memory: 54MB (+2MB)
UNKNOWN
Iteration Time: 0.38s
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.01s
Memory: 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.02s
Memory: 56MB (+1MB)
Answer: 1
occurs(action(("pick","ball2","rooma","left")),1) occurs(action(("pick","ball1","rooma","right")),1) occurs(action(("move","rooma","roomb")),1) occurs(action(("drop","ball2","roomb","left")),2) occurs(action(("drop","ball1","roomb","right")),2) occurs(action(("move","roomb","rooma")),2) occurs(action(("pick","ball4","rooma","left")),3) occurs(action(("pick","ball11","rooma","right")),3) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball4","roomb","left")),4) occurs(action(("drop","ball11","roomb","right")),4) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball3","rooma","left")),5) occurs(action(("pick","ball12","rooma","right")),5) occurs(action(("move","rooma","roomb")),5) occurs(action(("drop","ball3","roomb","left")),6) occurs(action(("drop","ball12","roomb","right")),6) occurs(action(("move","roomb","rooma")),6) occurs(action(("pick","ball5","rooma","left")),7) occurs(action(("pick","ball10","rooma","right")),7) occurs(action(("move","rooma","roomb")),7) occurs(action(("drop","ball5","roomb","left")),8) occurs(action(("drop","ball10","roomb","right")),8) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball7","rooma","right")),9) occurs(action(("pick","ball6","rooma","left")),9) occurs(action(("move","rooma","roomb")),9) occurs(action(("drop","ball7","roomb","right")),10) occurs(action(("drop","ball6","roomb","left")),10) occurs(action(("move","roomb","rooma")),10) occurs(action(("pick","ball9","rooma","left")),11) occurs(action(("pick","ball8","rooma","right")),11) occurs(action(("move","rooma","roomb")),11) occurs(action(("drop","ball9","roomb","left")),12) occurs(action(("drop","ball8","roomb","right")),12) occurs(action(("move","roomb","rooma")),12) occurs(action(("move","rooma","roomb")),13) occurs(action(("move","roomb","rooma")),14) occurs(action(("move","rooma","roomb")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.463s (Solving: 0.37s 1st Model: 0.00s Unsat: 0.01s)
CPU Time : 0.460s
Choices : 19505 (Domain: 19505)
Conflicts : 8717 (Analyzed: 8716)
Restarts : 105 (Average: 83.01 Last: 66)
Model-Level : 164.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 8716 (Deleted: 4686)
Binary : 3 (Ratio: 0.03%)
Ternary : 17 (Ratio: 0.20%)
Conflict : 8716 (Average Length: 75.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 8716 (Average: 1.67 Max: 18 Sum: 14588)
Executed : 8714 (Average: 1.67 Max: 18 Sum: 14586 Ratio: 99.99%)
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.01%)
Rules : 2094
Atoms : 2094
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 3495 (Eliminated: 0 Frozen: 390)
Constraints : 14960 (Binary: 86.7% Ternary: 11.5% Other: 1.7%)
Memory Peak : 56MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1