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-11.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-11.pddl Parsing... Parsing: [0.020s CPU, 0.027s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock] Preparing model... [0.020s CPU, 0.019s wall-clock] Generated 35 rules. Computing model... [0.130s CPU, 0.128s wall-clock] 917 relevant atoms 608 auxiliary atoms 1525 final queue length 2071 total queue pushes Completing instantiation... [0.120s CPU, 0.122s wall-clock] Instantiating: [0.300s CPU, 0.301s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.018s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.013s 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.010s CPU, 0.002s wall-clock] Computing fact groups: [0.050s CPU, 0.043s 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.007s wall-clock] Translating task: [0.130s CPU, 0.130s wall-clock] 42 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 11 propositions removed Detecting unreachable propositions: [0.070s CPU, 0.074s wall-clock] Reordering and filtering variables... 13 of 14 variables necessary. 3 of 14 mutex groups necessary. 574 of 616 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.019s wall-clock] Translator variables: 13 Translator derived variables: 0 Translator facts: 119 Translator goal facts: 7 Translator mutex groups: 3 Translator total mutex groups size: 9 Translator operators: 574 Translator axioms: 0 Translator task size: 2482 Translator peak memory: 38092 KB Writing output... [0.040s CPU, 0.054s wall-clock] Done! [0.640s CPU, 0.658s wall-clock] planner.py version 0.0.1 Time: 0.11s Memory: 54MB 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: 55MB (+1MB) 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.03s Memory: 55MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 56MB (+1MB) UNSAT Iteration Time: 0.04s 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.03s Memory: 58MB (+2MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 59MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.08s Memory: 63MB (+4MB) Solving... Solving Time: 0.02s Memory: 63MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.08s Memory: 64MB (+1MB) Solving... Solving Time: 0.59s Memory: 64MB (+0MB) UNKNOWN Iteration Time: 0.83s 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.03s Memory: 64MB (+0MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 65MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.08s Memory: 68MB (+3MB) Solving... Solving Time: 0.00s Memory: 68MB (+0MB) SAT Testing... SERIALIZABLE Testing Time: 0.07s Memory: 68MB (+0MB) Answer: 4 occurs(action(("load-truck","package2","truck2","s2")),1) occurs(action(("load-truck","package4","truck1","s0")),1) occurs(action(("board-truck","driver2","truck1","s0")),1) occurs(action(("walk","driver1","s6","p2-6")),1) occurs(action(("drive-truck","truck1","s0","s6","driver2")),2) occurs(action(("walk","driver1","p2-6","s2")),2) occurs(action(("unload-truck","package4","truck1","s6")),3) occurs(action(("board-truck","driver1","truck2","s2")),3) occurs(action(("drive-truck","truck1","s6","s2","driver2")),3) occurs(action(("drive-truck","truck2","s2","s5","driver1")),4) occurs(action(("load-truck","package5","truck2","s5")),5) occurs(action(("drive-truck","truck2","s5","s1","driver1")),6) occurs(action(("unload-truck","package5","truck2","s1")),7) occurs(action(("disembark-truck","driver2","truck1","s2")),8) occurs(action(("board-truck","driver2","truck3","s2")),9) occurs(action(("drive-truck","truck2","s1","s3","driver1")),10) occurs(action(("drive-truck","truck3","s2","s6","driver2")),10) occurs(action(("unload-truck","package2","truck2","s3")),11) occurs(action(("drive-truck","truck3","s6","s3","driver2")),11) occurs(action(("drive-truck","truck2","s3","s6","driver1")),11) occurs(action(("drive-truck","truck2","s6","s4","driver1")),12) occurs(action(("load-truck","package3","truck3","s3")),12) occurs(action(("drive-truck","truck3","s3","s6","driver2")),12) occurs(action(("drive-truck","truck3","s6","s4","driver2")),13) occurs(action(("disembark-truck","driver1","truck2","s4")),13) occurs(action(("unload-truck","package3","truck3","s4")),14) occurs(action(("disembark-truck","driver2","truck3","s4")),15) occurs(action(("board-truck","driver1","truck2","s4")),15) SATISFIABLE Models : 1+ Calls : 7 Time : 0.911s (Solving: 0.64s 1st Model: 0.04s Unsat: 0.00s) CPU Time : 0.904s Choices : 26151 (Domain: 26133) Conflicts : 8389 (Analyzed: 8388) Restarts : 106 (Average: 79.13 Last: 93) Model-Level : 102.2 Problems : 7 (Average Length: 11.29 Splits: 0) Lemmas : 8388 (Deleted: 4704) Binary : 85 (Ratio: 1.01%) Ternary : 50 (Ratio: 0.60%) Conflict : 8388 (Average Length: 77.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 8388 (Average: 2.90 Max: 88 Sum: 24311) Executed : 8370 (Average: 2.87 Max: 88 Sum: 24106 Ratio: 99.16%) Bounded : 18 (Average: 11.39 Max: 12 Sum: 205 Ratio: 0.84%) Rules : 8201 Atoms : 8194 Bodies : 43 (Original: 42) Count : 7 Equivalences : 105 (Atom=Atom: 35 Body=Body: 0 Other: 70) Tight : Yes Variables : 10819 (Eliminated: 0 Frozen: 4751) Constraints : 40716 (Binary: 93.2% Ternary: 3.8% Other: 3.0%) Memory Peak : 68MB Max. Length : 15 steps Sol. Length : 15 steps Models : 4