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.020s CPU, 0.029s wall-clock] Normalizing task... [0.010s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.020s wall-clock] Preparing model... [0.020s CPU, 0.023s wall-clock] Generated 35 rules. Computing model... [0.180s CPU, 0.177s wall-clock] 1376 relevant atoms 903 auxiliary atoms 2279 final queue length 3128 total queue pushes Completing instantiation... [0.190s CPU, 0.186s wall-clock] Instantiating: [0.410s CPU, 0.419s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.017s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.020s 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.000s CPU, 0.011s wall-clock] Translating task: [0.200s CPU, 0.199s 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.090s wall-clock] Done! [0.920s CPU, 0.940s wall-clock] planner.py version 0.0.1 Time: 0.18s 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.05s Memory: 63MB (+3MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 65MB (+2MB) SAT Testing... NOT SERIALIZABLE Testing Time: 1.05s Memory: 134MB (+69MB) Solving... Solving Time: 0.05s Memory: 135MB (+1MB) UNSAT Iteration Time: 1.19s 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.15s Memory: 140MB (+5MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 143MB (+3MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 143MB (+0MB) Answer: 2 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","driver2","truck2","s9")),3) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("drive-truck","truck2","s9","s3","driver2")),4) occurs(action(("load-truck","package1","truck2","s3")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck2","s3","s9","driver2")),5) occurs(action(("drive-truck","truck3","s2","s0","driver1")),6) occurs(action(("drive-truck","truck2","s9","s2","driver2")),6) occurs(action(("unload-truck","package1","truck2","s2")),7) occurs(action(("drive-truck","truck2","s2","s4","driver2")),7) occurs(action(("disembark-truck","driver1","truck3","s0")),7) occurs(action(("load-truck","package2","truck2","s4")),8) occurs(action(("load-truck","package5","truck2","s4")),8) occurs(action(("drive-truck","truck2","s4","s0","driver2")),8) occurs(action(("walk","driver1","s0","p0-8")),8) occurs(action(("unload-truck","package5","truck2","s0")),9) occurs(action(("drive-truck","truck2","s0","s1","driver2")),9) occurs(action(("walk","driver1","p0-8","s8")),9) occurs(action(("load-truck","package6","truck2","s1")),10) occurs(action(("drive-truck","truck2","s1","s2","driver2")),10) occurs(action(("walk","driver1","s8","p8-7")),10) occurs(action(("unload-truck","package2","truck2","s2")),11) occurs(action(("unload-truck","package6","truck2","s2")),11) occurs(action(("drive-truck","truck2","s2","s5","driver2")),11) occurs(action(("walk","driver1","p8-7","s7")),11) occurs(action(("board-truck","driver1","truck1","s7")),12) occurs(action(("disembark-truck","driver2","truck2","s5")),12) occurs(action(("drive-truck","truck1","s7","s1","driver1")),13) occurs(action(("walk","driver2","s5","p5-9")),13) occurs(action(("unload-truck","package4","truck1","s1")),14) occurs(action(("walk","driver2","p5-9","s9")),14) occurs(action(("drive-truck","truck1","s1","s4","driver1")),14) occurs(action(("disembark-truck","driver1","truck1","s4")),15) SATISFIABLE Models : 1+ Calls : 5 Time : 1.548s (Solving: 0.06s 1st Model: 0.04s Unsat: 0.02s) CPU Time : 1.536s Choices : 1991 (Domain: 1973) Conflicts : 543 (Analyzed: 542) Restarts : 6 (Average: 90.33 Last: 55) Model-Level : 144.5 Problems : 5 (Average Length: 10.00 Splits: 0) Lemmas : 542 (Deleted: 0) Binary : 30 (Ratio: 5.54%) Ternary : 6 (Ratio: 1.11%) Conflict : 542 (Average Length: 164.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 542 (Average: 3.01 Max: 59 Sum: 1633) Executed : 538 (Average: 3.01 Max: 59 Sum: 1629 Ratio: 99.76%) Bounded : 4 (Average: 1.00 Max: 1 Sum: 4 Ratio: 0.24%) Rules : 529674 Atoms : 522953 Bodies : 13419 (Original: 13418) Equivalences : 25075 (Atom=Atom: 6952 Body=Body: 4739 Other: 13384) Tight : No (SCCs: 304 Non-Hcfs: 0 Nodes: 10402 Gammas: 0) Variables : 25324 (Eliminated: 0 Frozen: 14898) Constraints : 58862 (Binary: 93.8% Ternary: 3.7% Other: 2.5%) Memory Peak : 143MB Max. Length : 15 steps Sol. Length : 15 steps Models : 2