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.030s CPU, 0.027s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock] Preparing model... [0.020s CPU, 0.020s wall-clock] Generated 35 rules. Computing model... [0.140s CPU, 0.133s wall-clock] 917 relevant atoms 608 auxiliary atoms 1525 final queue length 2071 total queue pushes Completing instantiation... [0.120s CPU, 0.123s wall-clock] Instantiating: [0.310s CPU, 0.309s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.020s 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.003s wall-clock] Building translation key... [0.000s CPU, 0.002s wall-clock] Computing fact groups: [0.040s 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.010s 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.072s 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.660s CPU, 0.665s 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.09s Memory: 63MB (+0MB) UNSAT Iteration Time: 0.23s 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: 63MB (+0MB) Unblocking actions... Solving... Solving Time: 0.93s Memory: 66MB (+3MB) UNKNOWN Iteration Time: 0.98s 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.03s Memory: 67MB (+1MB) Unblocking actions... Solving... Solving Time: 1.03s Memory: 70MB (+3MB) UNKNOWN Iteration Time: 1.08s 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.03s Memory: 70MB (+0MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 72MB (+2MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 72MB (+0MB) Answer: 2 occurs(action(("load-truck","package2","truck3","s2")),1) occurs(action(("walk","driver1","s6","p2-6")),2) occurs(action(("walk","driver1","p2-6","s2")),3) occurs(action(("board-truck","driver1","truck3","s2")),4) occurs(action(("drive-truck","truck3","s2","s6","driver1")),5) occurs(action(("drive-truck","truck3","s6","s3","driver1")),6) occurs(action(("unload-truck","package2","truck3","s3")),7) occurs(action(("board-truck","driver2","truck1","s0")),8) occurs(action(("drive-truck","truck1","s0","s2","driver2")),9) occurs(action(("disembark-truck","driver2","truck1","s2")),10) occurs(action(("board-truck","driver2","truck2","s2")),11) occurs(action(("drive-truck","truck2","s2","s0","driver2")),12) occurs(action(("load-truck","package4","truck2","s0")),13) occurs(action(("drive-truck","truck2","s0","s6","driver2")),14) occurs(action(("unload-truck","package4","truck2","s6")),15) occurs(action(("load-truck","package3","truck3","s3")),16) occurs(action(("drive-truck","truck3","s3","s1","driver1")),17) occurs(action(("drive-truck","truck3","s1","s4","driver1")),18) occurs(action(("unload-truck","package3","truck3","s4")),19) occurs(action(("drive-truck","truck2","s6","s5","driver2")),20) occurs(action(("load-truck","package5","truck2","s5")),21) occurs(action(("drive-truck","truck2","s5","s1","driver2")),22) occurs(action(("unload-truck","package5","truck2","s1")),23) occurs(action(("drive-truck","truck2","s1","s4","driver2")),24) occurs(action(("disembark-truck","driver2","truck2","s4")),25) SATISFIABLE Models : 1+ Calls : 7 Time : 2.475s (Solving: 2.10s 1st Model: 0.05s Unsat: 0.09s) CPU Time : 2.468s Choices : 104090 (Domain: 104083) Conflicts : 20599 (Analyzed: 20597) Restarts : 221 (Average: 93.20 Last: 81) Model-Level : 200.5 Problems : 7 (Average Length: 14.14 Splits: 0) Lemmas : 20597 (Deleted: 16487) Binary : 338 (Ratio: 1.64%) Ternary : 295 (Ratio: 1.43%) Conflict : 20597 (Average Length: 223.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 20597 (Average: 3.85 Max: 193 Sum: 79341) Executed : 20560 (Average: 3.84 Max: 193 Sum: 79048 Ratio: 99.63%) Bounded : 37 (Average: 7.92 Max: 17 Sum: 293 Ratio: 0.37%) Rules : 8167 Atoms : 8157 Bodies : 21 (Original: 20) Count : 10 Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20) Tight : Yes Variables : 18471 (Eliminated: 0 Frozen: 13897) Constraints : 76384 (Binary: 93.2% Ternary: 3.7% Other: 3.0%) Memory Peak : 73MB Max. Length : 25 steps Sol. Length : 25 steps Models : 2