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.021s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock] Preparing model... [0.010s CPU, 0.017s wall-clock] Generated 35 rules. Computing model... [0.120s CPU, 0.114s wall-clock] 917 relevant atoms 608 auxiliary atoms 1525 final queue length 2071 total queue pushes Completing instantiation... [0.110s CPU, 0.109s wall-clock] Instantiating: [0.270s CPU, 0.268s 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.010s CPU, 0.012s 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.000s CPU, 0.001s wall-clock] Computing fact groups: [0.040s CPU, 0.040s 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.006s wall-clock] Translating task: [0.120s CPU, 0.117s 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.060s CPU, 0.064s 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.017s 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: 34904 KB Writing output... [0.050s CPU, 0.053s wall-clock] Done! [0.580s CPU, 0.589s wall-clock] planner.py version 0.0.1 Time: 0.12s Memory: 51MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.04s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.06s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.02s Memory: 53MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.03s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.02s Memory: 55MB (+1MB) Unblocking actions... Solving... Answer: 1 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","s5","driver2")),2) occurs(action(("walk","driver1","p2-6","s2")),2) occurs(action(("load-truck","package5","truck1","s5")),3) occurs(action(("board-truck","driver1","truck2","s2")),3) occurs(action(("drive-truck","truck1","s5","s1","driver2")),4) occurs(action(("drive-truck","truck2","s2","s1","driver1")),4) occurs(action(("unload-truck","package5","truck1","s1")),5) occurs(action(("drive-truck","truck2","s1","s3","driver1")),5) occurs(action(("unload-truck","package2","truck2","s3")),6) occurs(action(("load-truck","package3","truck2","s3")),6) occurs(action(("drive-truck","truck1","s1","s6","driver2")),6) occurs(action(("unload-truck","package4","truck1","s6")),7) occurs(action(("drive-truck","truck2","s3","s6","driver1")),7) occurs(action(("drive-truck","truck2","s6","s4","driver1")),8) occurs(action(("drive-truck","truck1","s6","s4","driver2")),8) occurs(action(("unload-truck","package3","truck2","s4")),9) occurs(action(("disembark-truck","driver2","truck1","s4")),9) Solving Time: 0.01s Memory: 55MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.258s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s) CPU Time : 0.250s Choices : 420 Conflicts : 212 (Analyzed: 210) Restarts : 2 (Average: 105.00 Last: 12) Model-Level : 20.0 Problems : 3 (Average Length: 9.00 Splits: 0) Lemmas : 210 (Deleted: 0) Binary : 14 (Ratio: 6.67%) Ternary : 8 (Ratio: 3.81%) Conflict : 210 (Average Length: 24.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 210 (Average: 2.30 Max: 17 Sum: 483) Executed : 198 (Average: 1.96 Max: 17 Sum: 411 Ratio: 85.09%) Bounded : 12 (Average: 6.00 Max: 11 Sum: 72 Ratio: 14.91%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 7141 (Eliminated: 0 Frozen: 4671) Constraints : 27063 (Binary: 93.6% Ternary: 3.7% Other: 2.6%) Memory Peak : 56MB Max. Length : 9 steps Sol. Length : 9 steps