tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_driverlog-strips-automatic_8.out

158 lines
7.1 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-8.pddl
Parsing...
Parsing: [0.030s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.020s CPU, 0.014s wall-clock]
Generated 35 rules.
Computing model... [0.060s CPU, 0.070s wall-clock]
440 relevant atoms
282 auxiliary atoms
722 final queue length
954 total queue pushes
Completing instantiation... [0.060s CPU, 0.062s wall-clock]
Instantiating: [0.170s CPU, 0.175s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.010s CPU, 0.015s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 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.030s CPU, 0.033s 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.010s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.058s wall-clock]
27 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
13 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.034s wall-clock]
Reordering and filtering variables...
16 of 16 variables necessary.
3 of 16 mutex groups necessary.
270 of 270 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.010s wall-clock]
Translator variables: 16
Translator derived variables: 0
Translator facts: 84
Translator goal facts: 11
Translator mutex groups: 3
Translator total mutex groups size: 12
Translator operators: 270
Translator axioms: 0
Translator task size: 1248
Translator peak memory: 36812 KB
Writing output... [0.020s CPU, 0.027s wall-clock]
Done! [0.360s CPU, 0.366s wall-clock]
planner.py version 0.0.1
Time: 0.06s
Memory: 52MB
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: 52MB (+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: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 53MB (+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: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.05s
Memory: 56MB (+1MB)
Solving...
Solving Time: 0.00s
Memory: 56MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 56MB (+0MB)
Answer: 2
occurs(action(("load-truck","package7","truck2","s2")),1) occurs(action(("board-truck","driver1","truck2","s2")),1) occurs(action(("walk","driver3","s1","p2-1")),1) occurs(action(("walk","driver2","s0","p2-0")),1) occurs(action(("drive-truck","truck2","s2","s1","driver1")),2) occurs(action(("walk","driver2","p2-0","s2")),2) occurs(action(("walk","driver3","p2-1","s2")),2) occurs(action(("unload-truck","package7","truck2","s1")),3) occurs(action(("board-truck","driver2","truck3","s2")),3) occurs(action(("board-truck","driver3","truck1","s2")),3) occurs(action(("disembark-truck","driver1","truck2","s1")),3) occurs(action(("drive-truck","truck3","s2","s0","driver2")),4) occurs(action(("drive-truck","truck1","s2","s0","driver3")),4) occurs(action(("walk","driver1","s1","p2-1")),4) occurs(action(("load-truck","package1","truck1","s0")),5) occurs(action(("load-truck","package3","truck3","s0")),5) occurs(action(("load-truck","package4","truck1","s0")),5) occurs(action(("walk","driver1","p2-1","s2")),5) occurs(action(("drive-truck","truck3","s0","s1","driver2")),6) occurs(action(("drive-truck","truck1","s0","s2","driver3")),6) occurs(action(("unload-truck","package1","truck1","s2")),7) occurs(action(("unload-truck","package3","truck3","s1")),7) occurs(action(("unload-truck","package4","truck1","s2")),7) occurs(action(("load-truck","package2","truck3","s1")),7) occurs(action(("disembark-truck","driver3","truck1","s2")),7) occurs(action(("drive-truck","truck3","s1","s0","driver2")),8) occurs(action(("unload-truck","package2","truck3","s0")),9) occurs(action(("disembark-truck","driver2","truck3","s0")),9) occurs(action(("walk","driver3","s2","p2-0")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.134s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.128s
Choices : 328 (Domain: 320)
Conflicts : 28 (Analyzed: 27)
Restarts : 0
Model-Level : 107.5
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 27 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 1 (Ratio: 3.70%)
Conflict : 27 (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 : 27 (Average: 5.11 Max: 38 Sum: 138)
Executed : 26 (Average: 5.07 Max: 38 Sum: 137 Ratio: 99.28%)
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.72%)
Rules : 8145 (Original: 8042)
Atoms : 4606
Bodies : 3608 (Original: 3504)
Count : 106 (Original: 118)
Equivalences : 1926 (Atom=Atom: 16 Body=Body: 0 Other: 1910)
Tight : Yes
Variables : 4025 (Eliminated: 0 Frozen: 2065)
Constraints : 17847 (Binary: 91.1% Ternary: 4.5% Other: 4.5%)
Memory Peak : 56MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2