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-14.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-14.pddl Parsing... Parsing: [0.020s CPU, 0.022s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.019s wall-clock] Preparing model... [0.020s CPU, 0.020s wall-clock] Generated 35 rules. Computing model... [0.180s CPU, 0.181s wall-clock] 1580 relevant atoms 947 auxiliary atoms 2527 final queue length 3598 total queue pushes Completing instantiation... [0.210s CPU, 0.203s wall-clock] Instantiating: [0.430s CPU, 0.433s 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.050s 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.020s CPU, 0.012s wall-clock] Translating task: [0.220s CPU, 0.221s wall-clock] 90 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 12 propositions removed Detecting unreachable propositions: [0.130s CPU, 0.118s wall-clock] Reordering and filtering variables... 15 of 15 variables necessary. 3 of 15 mutex groups necessary. 1158 of 1158 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.030s CPU, 0.033s wall-clock] Translator variables: 15 Translator derived variables: 0 Translator facts: 195 Translator goal facts: 9 Translator mutex groups: 3 Translator total mutex groups size: 12 Translator operators: 1158 Translator axioms: 0 Translator task size: 4965 Translator peak memory: 36440 KB Writing output... [0.090s CPU, 0.099s wall-clock] Done! [0.980s CPU, 0.992s wall-clock] planner.py version 0.0.1 Time: 0.19s Memory: 57MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.07s Memory: 59MB (+2MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 62MB (+3MB) UNSAT Iteration Time: 0.11s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.03s Memory: 62MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 63MB (+1MB) UNSAT Iteration Time: 0.05s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.04s Memory: 65MB (+2MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 66MB (+1MB) UNSAT Iteration Time: 0.07s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.08s Memory: 69MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("board-truck","driver3","truck1","s2")),1) occurs(action(("walk","driver1","s9","p7-9")),1) occurs(action(("walk","driver2","s2","p1-2")),1) occurs(action(("drive-truck","truck1","s2","s3","driver3")),2) occurs(action(("walk","driver1","p7-9","s7")),2) occurs(action(("walk","driver2","p1-2","s1")),2) occurs(action(("board-truck","driver2","truck2","s1")),3) occurs(action(("drive-truck","truck1","s3","s9","driver3")),3) occurs(action(("walk","driver1","s7","p3-7")),3) occurs(action(("load-truck","package3","truck1","s9")),4) occurs(action(("drive-truck","truck2","s1","s4","driver2")),4) occurs(action(("walk","driver1","p3-7","s3")),4) occurs(action(("load-truck","package6","truck2","s4")),5) occurs(action(("drive-truck","truck1","s9","s3","driver3")),5) occurs(action(("walk","driver1","s3","p8-3")),5) occurs(action(("drive-truck","truck1","s3","s0","driver3")),6) occurs(action(("drive-truck","truck2","s4","s5","driver2")),6) occurs(action(("walk","driver1","p8-3","s8")),6) occurs(action(("unload-truck","package6","truck2","s5")),7) occurs(action(("load-truck","package1","truck2","s5")),7) occurs(action(("load-truck","package2","truck2","s5")),7) occurs(action(("board-truck","driver1","truck3","s8")),7) occurs(action(("unload-truck","package3","truck1","s0")),7) occurs(action(("drive-truck","truck2","s5","s0","driver2")),8) occurs(action(("drive-truck","truck3","s8","s1","driver1")),8) occurs(action(("drive-truck","truck1","s0","s1","driver3")),8) occurs(action(("unload-truck","package1","truck2","s0")),9) occurs(action(("unload-truck","package2","truck2","s0")),9) occurs(action(("drive-truck","truck3","s1","s3","driver1")),9) occurs(action(("drive-truck","truck1","s1","s6","driver3")),9) occurs(action(("load-truck","package3","truck2","s0")),9) occurs(action(("drive-truck","truck2","s0","s3","driver2")),10) occurs(action(("drive-truck","truck3","s3","s2","driver1")),10) occurs(action(("disembark-truck","driver3","truck1","s6")),10) occurs(action(("unload-truck","package5","truck2","s3")),11) occurs(action(("load-truck","package4","truck2","s3")),11) occurs(action(("disembark-truck","driver1","truck3","s2")),11) occurs(action(("walk","driver3","s6","p6-2")),11) occurs(action(("board-truck","driver1","truck3","s2")),12) occurs(action(("drive-truck","truck2","s3","s9","driver2")),12) occurs(action(("walk","driver3","p6-2","s2")),12) occurs(action(("drive-truck","truck3","s2","s3","driver1")),13) occurs(action(("drive-truck","truck2","s9","s4","driver2")),13) occurs(action(("walk","driver3","s2","p1-2")),13) occurs(action(("unload-truck","package3","truck2","s4")),14) occurs(action(("unload-truck","package4","truck2","s4")),14) occurs(action(("walk","driver3","p1-2","s1")),14) occurs(action(("disembark-truck","driver1","truck3","s3")),14) occurs(action(("disembark-truck","driver2","truck2","s4")),14) Solving Time: 0.22s Memory: 73MB (+4MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 0.780s (Solving: 0.23s 1st Model: 0.22s Unsat: 0.01s) CPU Time : 0.760s Choices : 4955 Conflicts : 1765 (Analyzed: 1763) Restarts : 19 (Average: 92.79 Last: 73) Model-Level : 41.0 Problems : 4 (Average Length: 10.75 Splits: 0) Lemmas : 1763 (Deleted: 0) Binary : 102 (Ratio: 5.79%) Ternary : 46 (Ratio: 2.61%) Conflict : 1763 (Average Length: 41.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1763 (Average: 3.26 Max: 56 Sum: 5753) Executed : 1687 (Average: 2.76 Max: 56 Sum: 4869 Ratio: 84.63%) Bounded : 76 (Average: 11.63 Max: 16 Sum: 884 Ratio: 15.37%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 21992 (Eliminated: 0 Frozen: 16421) Constraints : 96620 (Binary: 95.0% Ternary: 2.9% Other: 2.0%) Memory Peak : 73MB Max. Length : 14 steps Sol. Length : 14 steps