tplp-planning-benchmark/gc-ta5-tt0/ipc-2002_driverlog-strips-automatic_12.out

290 lines
10 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-12.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-12.pddl
Parsing...
Parsing: [0.030s CPU, 0.032s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
Preparing model... [0.030s CPU, 0.025s wall-clock]
Generated 35 rules.
Computing model... [0.180s CPU, 0.181s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.190s CPU, 0.188s wall-clock]
Instantiating: [0.430s CPU, 0.428s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.017s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.018s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.051s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.011s wall-clock]
Translating task: [0.200s CPU, 0.199s wall-clock]
60 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.110s CPU, 0.110s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
948 of 948 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.028s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 176
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 948
Translator axioms: 0
Translator task size: 4037
Translator peak memory: 39116 KB
Writing output... [0.090s CPU, 0.089s wall-clock]
Done! [0.950s CPU, 0.952s wall-clock]
planner.py version 0.0.1
Time: 0.17s
Memory: 59MB
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: 59MB (+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.04s
Memory: 59MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+1MB)
UNSAT
Iteration Time: 0.07s
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.04s
Memory: 63MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 64MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 71MB (+7MB)
Solving...
Solving Time: 0.14s
Memory: 71MB (+0MB)
UNSAT
Iteration Time: 0.35s
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.05s
Memory: 71MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 72MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 78MB (+6MB)
Solving...
Solving Time: 0.13s
Memory: 72MB (+-6MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 79MB (+7MB)
Solving...
Solving Time: 1.60s
Memory: 79MB (+0MB)
UNKNOWN
Iteration Time: 2.07s
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.04s
Memory: 79MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 80MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 85MB (+5MB)
Solving...
Solving Time: 0.17s
Memory: 80MB (+-5MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 88MB (+8MB)
Solving...
Solving Time: 2.34s
Memory: 89MB (+1MB)
UNKNOWN
Iteration Time: 2.85s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.05s
Memory: 90MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 93MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 95MB (+2MB)
Solving...
Solving Time: 0.02s
Memory: 95MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 95MB (+0MB)
Solving...
Solving Time: 0.09s
Memory: 95MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 97MB (+2MB)
Solving...
Solving Time: 0.98s
Memory: 97MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 97MB (+0MB)
Solving...
Solving Time: 1.97s
Memory: 97MB (+0MB)
UNKNOWN
Iteration Time: 3.67s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.05s
Memory: 97MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 97MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 98MB (+1MB)
Solving...
Solving Time: 0.03s
Memory: 98MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.13s
Memory: 99MB (+1MB)
Solving...
Solving Time: 0.06s
Memory: 99MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.12s
Memory: 99MB (+0MB)
Answer: 12
occurs(action(("walk","driver2","s3","p3-9")),1) occurs(action(("walk","driver1","s1","p1-7")),1) occurs(action(("walk","driver2","p3-9","s9")),2) occurs(action(("walk","driver1","p1-7","s7")),2) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("drive-truck","truck2","s9","s4","driver2")),4) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("load-truck","package5","truck2","s4")),5) occurs(action(("drive-truck","truck2","s4","s0","driver2")),6) occurs(action(("unload-truck","package5","truck2","s0")),7) occurs(action(("board-truck","driver1","truck3","s2")),8) occurs(action(("drive-truck","truck3","s2","s1","driver1")),9) occurs(action(("load-truck","package6","truck3","s1")),10) occurs(action(("drive-truck","truck3","s1","s2","driver1")),11) occurs(action(("unload-truck","package6","truck3","s2")),12) occurs(action(("drive-truck","truck3","s2","s1","driver1")),13) occurs(action(("drive-truck","truck3","s1","s3","driver1")),14) occurs(action(("load-truck","package1","truck3","s3")),15) occurs(action(("drive-truck","truck3","s3","s9","driver1")),16) occurs(action(("drive-truck","truck3","s9","s2","driver1")),17) occurs(action(("unload-truck","package1","truck3","s2")),18) occurs(action(("drive-truck","truck3","s2","s7","driver1")),19) occurs(action(("load-truck","package4","truck3","s7")),20) occurs(action(("drive-truck","truck3","s7","s1","driver1")),21) occurs(action(("unload-truck","package4","truck3","s1")),22) occurs(action(("drive-truck","truck3","s1","s0","driver1")),23) occurs(action(("drive-truck","truck2","s0","s4","driver2")),24) occurs(action(("load-truck","package2","truck2","s4")),25) occurs(action(("drive-truck","truck2","s4","s2","driver2")),25) occurs(action(("disembark-truck","driver1","truck3","s0")),25) occurs(action(("unload-truck","package2","truck2","s2")),26) occurs(action(("drive-truck","truck2","s2","s5","driver2")),26) occurs(action(("walk","driver1","s0","p6-0")),26) occurs(action(("disembark-truck","driver2","truck2","s5")),27) occurs(action(("walk","driver1","p6-0","s6")),28) occurs(action(("walk","driver2","s5","p5-9")),29) occurs(action(("walk","driver1","s6","p6-4")),29) occurs(action(("walk","driver2","p5-9","s9")),30) occurs(action(("walk","driver1","p6-4","s4")),30)
SATISFIABLE
Models : 1+
Calls : 18
Time : 8.366s (Solving: 7.57s 1st Model: 1.52s Unsat: 0.14s)
CPU Time : 8.360s
Choices : 202904 (Domain: 202898)
Conflicts : 36719 (Analyzed: 36718)
Restarts : 409 (Average: 89.78 Last: 131)
Model-Level : 354.8
Problems : 18 (Average Length: 21.17 Splits: 0)
Lemmas : 36718 (Deleted: 33166)
Binary : 118 (Ratio: 0.32%)
Ternary : 102 (Ratio: 0.28%)
Conflict : 36718 (Average Length: 608.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 36718 (Average: 3.25 Max: 431 Sum: 119206)
Executed : 36689 (Average: 3.24 Max: 431 Sum: 118907 Ratio: 99.75%)
Bounded : 29 (Average: 10.31 Max: 27 Sum: 299 Ratio: 0.25%)
Rules : 13591
Atoms : 13569
Bodies : 263 (Original: 262)
Count : 22
Equivalences : 720 (Atom=Atom: 240 Body=Body: 0 Other: 480)
Tight : Yes
Variables : 35462 (Eliminated: 0 Frozen: 23053)
Constraints : 146397 (Binary: 93.9% Ternary: 3.5% Other: 2.5%)
Memory Peak : 101MB
Max. Length : 30 steps
Sol. Length : 30 steps
Models : 12