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.040s CPU, 0.033s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.012s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock] Preparing model... [0.030s CPU, 0.026s wall-clock] Generated 35 rules. Computing model... [0.180s CPU, 0.180s wall-clock] 1376 relevant atoms 903 auxiliary atoms 2279 final queue length 3128 total queue pushes Completing instantiation... [0.160s CPU, 0.167s wall-clock] Instantiating: [0.400s CPU, 0.409s 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.016s 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.049s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.010s 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.010s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.010s wall-clock] Translating task: [0.180s CPU, 0.179s 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.090s CPU, 0.097s 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.026s 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.070s CPU, 0.080s wall-clock] Done! [0.880s CPU, 0.887s wall-clock] planner.py version 0.0.1 Time: 0.73s Memory: 92MB 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: 92MB (+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: 1.27s Memory: 239MB (+147MB) Unblocking actions... Solving... Solving Time: 0.12s Memory: 251MB (+12MB) UNSAT Iteration Time: 1.65s 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: 1.56s Memory: 336MB (+85MB) Unblocking actions... Solving... Answer: 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(("load-truck","package1","truck2","s3")),3) occurs(action(("load-truck","package2","truck1","s4")),3) occurs(action(("load-truck","package4","truck1","s7")),3) occurs(action(("load-truck","package5","truck1","s4")),3) occurs(action(("board-truck","driver1","truck1","s7")),3) occurs(action(("drive-truck","truck1","s7","s4","driver1")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("drive-truck","truck2","s9","s3","driver2")),3) occurs(action(("drive-truck","truck2","s3","s1","driver2")),4) occurs(action(("drive-truck","truck1","s4","s2","driver1")),4) occurs(action(("load-truck","package6","truck2","s1")),4) occurs(action(("unload-truck","package4","truck1","s2")),4) occurs(action(("unload-truck","package5","truck1","s2")),4) occurs(action(("disembark-truck","driver1","truck1","s2")),4) occurs(action(("disembark-truck","driver2","truck2","s1")),4) occurs(action(("unload-truck","package6","truck2","s2")),5) occurs(action(("load-truck","package4","truck3","s2")),5) occurs(action(("load-truck","package5","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s1","driver1")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck2","s1","s2","driver2")),5) occurs(action(("board-truck","driver2","truck2","s1")),5) occurs(action(("unload-truck","package1","truck2","s2")),6) occurs(action(("unload-truck","package2","truck1","s2")),6) occurs(action(("unload-truck","package4","truck3","s1")),6) occurs(action(("drive-truck","truck3","s1","s0","driver1")),6) occurs(action(("load-truck","package6","truck1","s2")),6) occurs(action(("disembark-truck","driver1","truck3","s0")),6) occurs(action(("disembark-truck","driver2","truck2","s2")),6) occurs(action(("drive-truck","truck2","s2","s5","driver2")),7) occurs(action(("load-truck","package1","truck1","s2")),7) occurs(action(("board-truck","driver2","truck2","s2")),7) occurs(action(("walk","driver1","s0","p6-0")),7) occurs(action(("unload-truck","package1","truck1","s2")),8) occurs(action(("unload-truck","package6","truck1","s2")),8) occurs(action(("load-truck","package2","truck1","s2")),8) occurs(action(("walk","driver1","p6-0","s6")),8) occurs(action(("disembark-truck","driver2","truck2","s5")),8) occurs(action(("unload-truck","package5","truck3","s0")),9) occurs(action(("load-truck","package1","truck1","s2")),9) occurs(action(("walk","driver2","s5","p5-9")),9) occurs(action(("walk","driver1","s6","p6-4")),9) occurs(action(("unload-truck","package1","truck1","s2")),10) occurs(action(("unload-truck","package2","truck1","s2")),10) occurs(action(("walk","driver2","p5-9","s9")),10) occurs(action(("walk","driver1","p6-4","s4")),10) Solving Time: 2.03s Memory: 340MB (+4MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 6.307s (Solving: 2.01s 1st Model: 1.95s Unsat: 0.05s) CPU Time : 6.290s Choices : 14401 Conflicts : 7433 (Analyzed: 7432) Restarts : 81 (Average: 91.75 Last: 87) Model-Level : 57.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 8558 (Deleted: 3965) Binary : 693 (Ratio: 8.10%) Ternary : 291 (Ratio: 3.40%) Conflict : 7432 (Average Length: 46.9 Ratio: 86.84%) Loop : 1126 (Average Length: 32.7 Ratio: 13.16%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 7432 (Average: 2.29 Max: 44 Sum: 16985) Executed : 7163 (Average: 1.91 Max: 44 Sum: 14179 Ratio: 83.48%) Bounded : 269 (Average: 10.43 Max: 12 Sum: 2806 Ratio: 16.52%) Rules : 265523 Atoms : 265523 Bodies : 1 (Original: 0) Tight : Yes Variables : 56102 (Eliminated: 0 Frozen: 51493) Constraints : 112844 (Binary: 85.0% Ternary: 12.3% Other: 2.7%) Memory Peak : 342MB Max. Length : 10 steps Sol. Length : 10 steps