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

289 lines
12 KiB
Plaintext
Raw Permalink 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.027s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 35 rules.
Computing model... [0.180s CPU, 0.177s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.190s CPU, 0.186s wall-clock]
Instantiating: [0.410s CPU, 0.416s 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.010s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.050s 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.020s CPU, 0.012s wall-clock]
Translating task: [0.200s CPU, 0.200s 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.120s 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.020s 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.080s CPU, 0.088s wall-clock]
Done! [0.920s CPU, 0.934s wall-clock]
planner.py version 0.0.1
Time: 0.15s
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.04s
Memory: 71MB (+0MB)
UNSAT
Iteration Time: 0.26s
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: 1.40s
Memory: 75MB (+4MB)
UNKNOWN
Iteration Time: 1.49s
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.05s
Memory: 77MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 1.57s
Memory: 84MB (+7MB)
UNKNOWN
Iteration Time: 1.65s
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: 85MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.95s
Memory: 92MB (+7MB)
UNKNOWN
Iteration Time: 2.03s
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: 92MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 2.32s
Memory: 102MB (+10MB)
UNKNOWN
Iteration Time: 2.41s
Iteration 8
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 1.94s
Memory: 102MB (+0MB)
UNKNOWN
Iteration Time: 1.94s
Iteration 9
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 2.70s
Memory: 102MB (+0MB)
UNKNOWN
Iteration Time: 2.70s
Iteration 10
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 2.30s
Memory: 102MB (+0MB)
UNKNOWN
Iteration Time: 2.30s
Iteration 11
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 1.97s
Memory: 102MB (+0MB)
UNKNOWN
Iteration Time: 1.97s
Iteration 12
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.07s
Memory: 103MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 2.27s
Memory: 108MB (+5MB)
UNKNOWN
Iteration Time: 2.38s
Iteration 13
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.05s
Memory: 110MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 2.43s
Memory: 113MB (+3MB)
UNKNOWN
Iteration Time: 2.52s
Iteration 14
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.05s
Memory: 115MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 1.08s
Memory: 123MB (+8MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 123MB (+0MB)
Answer: 2
occurs(action(("walk","driver1","s1","p1-7")),1) occurs(action(("walk","driver1","p1-7","s7")),2) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s0","driver1")),6) occurs(action(("walk","driver2","s3","p3-9")),7) occurs(action(("walk","driver2","p3-9","s9")),8) occurs(action(("board-truck","driver2","truck2","s9")),9) occurs(action(("drive-truck","truck2","s9","s8","driver2")),10) occurs(action(("drive-truck","truck2","s8","s5","driver2")),11) occurs(action(("disembark-truck","driver2","truck2","s5")),12) occurs(action(("walk","driver2","s5","p5-9")),13) occurs(action(("walk","driver2","p5-9","s9")),14) occurs(action(("disembark-truck","driver1","truck3","s0")),15) occurs(action(("walk","driver1","s0","p0-8")),16) occurs(action(("walk","driver1","p0-8","s8")),17) occurs(action(("walk","driver1","s8","p8-7")),18) occurs(action(("walk","driver1","p8-7","s7")),19) occurs(action(("board-truck","driver1","truck1","s7")),20) occurs(action(("drive-truck","truck1","s7","s9","driver1")),21) occurs(action(("drive-truck","truck1","s9","s3","driver1")),22) occurs(action(("load-truck","package1","truck1","s3")),23) occurs(action(("drive-truck","truck1","s3","s9","driver1")),24) occurs(action(("drive-truck","truck1","s9","s2","driver1")),25) occurs(action(("unload-truck","package1","truck1","s2")),26) occurs(action(("drive-truck","truck1","s2","s7","driver1")),27) occurs(action(("load-truck","package4","truck1","s7")),28) occurs(action(("drive-truck","truck1","s7","s1","driver1")),29) occurs(action(("unload-truck","package4","truck1","s1")),30) occurs(action(("drive-truck","truck1","s1","s4","driver1")),31) occurs(action(("load-truck","package5","truck1","s4")),32) occurs(action(("drive-truck","truck1","s4","s0","driver1")),33) occurs(action(("unload-truck","package5","truck1","s0")),34) occurs(action(("drive-truck","truck1","s0","s1","driver1")),35) occurs(action(("load-truck","package6","truck1","s1")),36) occurs(action(("drive-truck","truck1","s1","s2","driver1")),37) occurs(action(("unload-truck","package6","truck1","s2")),38) occurs(action(("drive-truck","truck1","s2","s4","driver1")),39) occurs(action(("load-truck","package2","truck1","s4")),40) occurs(action(("drive-truck","truck1","s4","s2","driver1")),41) occurs(action(("unload-truck","package2","truck1","s2")),42) occurs(action(("drive-truck","truck1","s2","s7","driver1")),43) occurs(action(("drive-truck","truck1","s7","s4","driver1")),44) occurs(action(("disembark-truck","driver1","truck1","s4")),45)
SATISFIABLE
Models : 1+
Calls : 15
Time : 22.924s (Solving: 21.91s 1st Model: 1.08s Unsat: 0.03s)
CPU Time : 22.932s
Choices : 1207119 (Domain: 1207119)
Conflicts : 93771 (Analyzed: 93770)
Restarts : 1047 (Average: 89.56 Last: 113)
Model-Level : 578.5
Problems : 15 (Average Length: 25.67 Splits: 0)
Lemmas : 93770 (Deleted: 85274)
Binary : 482 (Ratio: 0.51%)
Ternary : 297 (Ratio: 0.32%)
Conflict : 93770 (Average Length: 651.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 93770 (Average: 8.83 Max: 1369 Sum: 828048)
Executed : 93708 (Average: 8.82 Max: 1369 Sum: 827340 Ratio: 99.91%)
Bounded : 62 (Average: 11.42 Max: 42 Sum: 708 Ratio: 0.09%)
Rules : 13273
Atoms : 13263
Bodies : 21 (Original: 20)
Count : 10
Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20)
Tight : Yes
Variables : 53915 (Eliminated: 0 Frozen: 42473)
Constraints : 233972 (Binary: 94.0% Ternary: 3.5% Other: 2.5%)
Memory Peak : 123MB
Max. Length : 45 steps
Sol. Length : 45 steps
Models : 2