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.026s 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.010s CPU, 0.018s wall-clock] Preparing model... [0.030s CPU, 0.023s wall-clock] Generated 35 rules. Computing model... [0.160s CPU, 0.164s wall-clock] 1376 relevant atoms 903 auxiliary atoms 2279 final queue length 3128 total queue pushes Completing instantiation... [0.170s CPU, 0.167s wall-clock] Instantiating: [0.380s CPU, 0.383s 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.015s 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.048s 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.010s CPU, 0.009s wall-clock] Translating task: [0.180s CPU, 0.178s 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.100s CPU, 0.099s 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.025s 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: 35928 KB Writing output... [0.080s CPU, 0.082s wall-clock] Done! [0.850s CPU, 0.856s wall-clock] planner.py version 0.0.1 Time: 0.17s Memory: 55MB 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 (+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.06s Memory: 55MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 57MB (+2MB) UNSAT Iteration Time: 0.08s 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.06s Memory: 59MB (+2MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 61MB (+2MB) UNSAT Iteration Time: 0.09s 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.06s Memory: 65MB (+4MB) Unblocking actions... Solving... Solving Time: 0.83s Memory: 67MB (+2MB) UNSAT Iteration Time: 0.93s 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.06s Memory: 71MB (+4MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package4","truck1","s7")),1) 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","driver1","truck1","s7")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("drive-truck","truck1","s7","s2","driver1")),4) occurs(action(("drive-truck","truck2","s9","s3","driver2")),4) occurs(action(("load-truck","package1","truck2","s3")),5) occurs(action(("disembark-truck","driver1","truck1","s2")),5) occurs(action(("drive-truck","truck2","s3","s1","driver2")),6) occurs(action(("board-truck","driver1","truck3","s2")),6) occurs(action(("drive-truck","truck3","s2","s9","driver1")),7) occurs(action(("drive-truck","truck2","s1","s2","driver2")),7) occurs(action(("unload-truck","package4","truck1","s2")),7) occurs(action(("unload-truck","package1","truck2","s2")),8) occurs(action(("load-truck","package4","truck2","s2")),8) occurs(action(("drive-truck","truck3","s9","s2","driver1")),8) occurs(action(("load-truck","package1","truck3","s2")),9) occurs(action(("drive-truck","truck2","s2","s4","driver2")),9) occurs(action(("load-truck","package2","truck2","s4")),10) occurs(action(("load-truck","package5","truck2","s4")),10) occurs(action(("drive-truck","truck3","s2","s7","driver1")),10) occurs(action(("drive-truck","truck2","s4","s1","driver2")),11) occurs(action(("unload-truck","package1","truck3","s7")),11) occurs(action(("unload-truck","package4","truck2","s1")),12) occurs(action(("load-truck","package1","truck3","s7")),12) occurs(action(("load-truck","package6","truck2","s1")),12) occurs(action(("drive-truck","truck2","s1","s0","driver2")),13) occurs(action(("drive-truck","truck3","s7","s2","driver1")),13) occurs(action(("unload-truck","package1","truck3","s2")),14) occurs(action(("unload-truck","package5","truck2","s0")),14) occurs(action(("drive-truck","truck3","s2","s0","driver1")),15) occurs(action(("load-truck","package1","truck1","s2")),15) occurs(action(("drive-truck","truck2","s0","s2","driver2")),15) occurs(action(("unload-truck","package1","truck1","s2")),16) occurs(action(("unload-truck","package2","truck2","s2")),16) occurs(action(("unload-truck","package6","truck2","s2")),16) occurs(action(("disembark-truck","driver1","truck3","s0")),16) occurs(action(("drive-truck","truck2","s2","s5","driver2")),17) occurs(action(("load-truck","package6","truck1","s2")),17) occurs(action(("walk","driver1","s0","p6-0")),17) occurs(action(("load-truck","package1","truck1","s2")),18) occurs(action(("load-truck","package2","truck1","s2")),18) occurs(action(("load-truck","package5","truck3","s0")),18) occurs(action(("walk","driver1","p6-0","s6")),18) occurs(action(("disembark-truck","driver2","truck2","s5")),18) occurs(action(("unload-truck","package1","truck1","s2")),19) occurs(action(("unload-truck","package5","truck3","s0")),19) occurs(action(("unload-truck","package6","truck1","s2")),19) occurs(action(("walk","driver2","s5","p5-9")),19) occurs(action(("walk","driver1","s6","p6-4")),19) occurs(action(("unload-truck","package2","truck1","s2")),20) occurs(action(("walk","driver2","p5-9","s9")),20) occurs(action(("walk","driver1","p6-4","s4")),20) Solving Time: 0.11s Memory: 74MB (+3MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 1.492s (Solving: 0.95s 1st Model: 0.11s Unsat: 0.84s) CPU Time : 1.480s Choices : 10340 Conflicts : 6038 (Analyzed: 6036) Restarts : 67 (Average: 90.09 Last: 57) Model-Level : 55.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 6036 (Deleted: 2385) Binary : 149 (Ratio: 2.47%) Ternary : 111 (Ratio: 1.84%) Conflict : 6036 (Average Length: 72.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 6036 (Average: 1.90 Max: 42 Sum: 11467) Executed : 5932 (Average: 1.68 Max: 42 Sum: 10119 Ratio: 88.24%) Bounded : 104 (Average: 12.96 Max: 22 Sum: 1348 Ratio: 11.76%) Rules : 14185 Atoms : 14185 Bodies : 1 (Original: 0) Tight : Yes Variables : 23682 (Eliminated: 0 Frozen: 19495) Constraints : 112690 (Binary: 94.9% Ternary: 2.8% Other: 2.3%) Memory Peak : 75MB Max. Length : 20 steps Sol. Length : 20 steps