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.031s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock] Preparing model... [0.030s CPU, 0.025s wall-clock] Generated 35 rules. Computing model... [0.180s CPU, 0.184s wall-clock] 1376 relevant atoms 903 auxiliary atoms 2279 final queue length 3128 total queue pushes Completing instantiation... [0.180s CPU, 0.187s wall-clock] Instantiating: [0.430s CPU, 0.429s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.010s CPU, 0.018s wall-clock] Checking invariant weight... [0.010s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.018s 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.051s 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.011s wall-clock] Translating task: [0.200s CPU, 0.201s 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.110s CPU, 0.110s 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.028s 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: 39116 KB Writing output... [0.080s CPU, 0.088s wall-clock] Done! [0.940s CPU, 0.952s wall-clock] planner.py version 0.0.1 Time: 0.16s Memory: 59MB 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: 59MB (+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.04s Memory: 59MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+1MB) UNSAT Iteration Time: 0.07s 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.04s Memory: 63MB (+3MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 64MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.90s Memory: 116MB (+52MB) Solving... Solving Time: 0.04s Memory: 116MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.14s Memory: 125MB (+9MB) Solving... Solving Time: 0.07s Memory: 125MB (+0MB) UNSAT Iteration Time: 1.24s 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.04s Memory: 125MB (+0MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 124MB (+-1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.13s Memory: 130MB (+6MB) Solving... Solving Time: 0.01s Memory: 130MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.13s Memory: 131MB (+1MB) Solving... Solving Time: 0.01s Memory: 131MB (+0MB) SAT Testing... SERIALIZABLE Testing Time: 0.12s Memory: 131MB (+0MB) Answer: 5 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","driver2","truck2","s9")),3) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("drive-truck","truck2","s9","s7","driver2")),4) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("load-truck","package4","truck2","s7")),5) occurs(action(("drive-truck","truck2","s7","s1","driver2")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("unload-truck","package4","truck2","s1")),6) occurs(action(("drive-truck","truck3","s2","s0","driver1")),6) occurs(action(("load-truck","package6","truck2","s1")),6) occurs(action(("drive-truck","truck2","s1","s4","driver2")),6) occurs(action(("load-truck","package2","truck2","s4")),7) occurs(action(("load-truck","package5","truck2","s4")),7) occurs(action(("drive-truck","truck2","s4","s0","driver2")),7) occurs(action(("disembark-truck","driver1","truck3","s0")),7) occurs(action(("unload-truck","package5","truck2","s0")),8) occurs(action(("drive-truck","truck2","s0","s8","driver2")),8) occurs(action(("walk","driver1","s0","p6-0")),8) occurs(action(("walk","driver1","p6-0","s6")),9) occurs(action(("drive-truck","truck2","s8","s3","driver2")),9) occurs(action(("load-truck","package1","truck2","s3")),10) occurs(action(("drive-truck","truck2","s3","s1","driver2")),10) occurs(action(("walk","driver1","s6","p6-4")),10) occurs(action(("walk","driver1","p6-4","s4")),11) occurs(action(("drive-truck","truck2","s1","s2","driver2")),11) occurs(action(("unload-truck","package1","truck2","s2")),12) occurs(action(("unload-truck","package2","truck2","s2")),12) occurs(action(("unload-truck","package6","truck2","s2")),12) occurs(action(("drive-truck","truck2","s2","s5","driver2")),12) occurs(action(("disembark-truck","driver2","truck2","s5")),13) occurs(action(("walk","driver2","s5","p5-9")),14) occurs(action(("walk","driver2","p5-9","s9")),15) SATISFIABLE Models : 1+ Calls : 8 Time : 1.378s (Solving: 0.15s 1st Model: 0.08s Unsat: 0.06s) CPU Time : 1.372s Choices : 4807 (Domain: 4801) Conflicts : 1684 (Analyzed: 1683) Restarts : 18 (Average: 93.50 Last: 76) Model-Level : 108.8 Problems : 8 (Average Length: 12.00 Splits: 0) Lemmas : 1740 (Deleted: 0) Binary : 76 (Ratio: 4.37%) Ternary : 11 (Ratio: 0.63%) Conflict : 1683 (Average Length: 121.4 Ratio: 96.72%) Loop : 57 (Average Length: 2.0 Ratio: 3.28%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1683 (Average: 2.40 Max: 150 Sum: 4037) Executed : 1678 (Average: 2.39 Max: 150 Sum: 4021 Ratio: 99.60%) Bounded : 5 (Average: 3.20 Max: 12 Sum: 16 Ratio: 0.40%) Rules : 545096 Acyc : 44280 Atoms : 500816 Bodies : 51 (Original: 50) Equivalences : 150 (Atom=Atom: 50 Body=Body: 0 Other: 100) Tight : Yes Variables : 17009 (Eliminated: 0 Frozen: 5780) Constraints : 58853 (Binary: 93.8% Ternary: 3.7% Other: 2.5%) Memory Peak : 131MB Max. Length : 15 steps Sol. Length : 15 steps Models : 5