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-13.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-13.pddl Parsing... Parsing: [0.020s CPU, 0.030s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.011s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock] Preparing model... [0.030s CPU, 0.026s wall-clock] Generated 35 rules. Computing model... [0.210s CPU, 0.211s wall-clock] 1675 relevant atoms 1119 auxiliary atoms 2794 final queue length 3819 total queue pushes Completing instantiation... [0.230s CPU, 0.223s wall-clock] Instantiating: [0.500s CPU, 0.493s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.022s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.030s CPU, 0.022s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 3 uncovered facts Choosing groups: [0.000s CPU, 0.004s wall-clock] Building translation key... [0.000s CPU, 0.003s wall-clock] Computing fact groups: [0.060s CPU, 0.063s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.002s 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.013s wall-clock] Translating task: [0.240s CPU, 0.244s wall-clock] 72 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 11 propositions removed Detecting unreachable propositions: [0.130s CPU, 0.131s wall-clock] Reordering and filtering variables... 13 of 14 variables necessary. 3 of 14 mutex groups necessary. 1076 of 1148 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.030s CPU, 0.032s wall-clock] Translator variables: 13 Translator derived variables: 0 Translator facts: 197 Translator goal facts: 8 Translator mutex groups: 3 Translator total mutex groups size: 9 Translator operators: 1076 Translator axioms: 0 Translator task size: 4547 Translator peak memory: 39628 KB Writing output... [0.080s CPU, 0.099s wall-clock] Done! [1.090s CPU, 1.108s wall-clock] planner.py version 0.0.1 Time: 0.20s Memory: 60MB 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: 60MB (+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.05s Memory: 60MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 62MB (+2MB) UNSAT Iteration Time: 0.08s 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.06s Memory: 66MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 68MB (+2MB) SAT Testing... NOT SERIALIZABLE Testing Time: 1.24s Memory: 131MB (+63MB) Solving... Solving Time: 0.02s Memory: 132MB (+1MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 132MB (+0MB) Answer: 2 occurs(action(("load-truck","package6","truck3","s2")),1) occurs(action(("board-truck","driver2","truck2","s9")),1) occurs(action(("walk","driver1","s0","p0-2")),1) occurs(action(("drive-truck","truck2","s9","s11","driver2")),2) occurs(action(("walk","driver1","p0-2","s2")),2) occurs(action(("board-truck","driver1","truck3","s2")),3) occurs(action(("drive-truck","truck2","s11","s6","driver2")),3) occurs(action(("load-truck","package2","truck2","s6")),4) occurs(action(("load-truck","package4","truck2","s6")),4) occurs(action(("drive-truck","truck2","s6","s11","driver2")),4) occurs(action(("drive-truck","truck3","s2","s5","driver1")),4) occurs(action(("unload-truck","package6","truck3","s5")),5) occurs(action(("drive-truck","truck3","s5","s4","driver1")),5) occurs(action(("load-truck","package3","truck3","s5")),5) occurs(action(("drive-truck","truck2","s11","s0","driver2")),5) occurs(action(("unload-truck","package2","truck2","s0")),6) occurs(action(("unload-truck","package3","truck3","s4")),6) occurs(action(("unload-truck","package4","truck2","s0")),6) occurs(action(("drive-truck","truck2","s0","s4","driver2")),6) occurs(action(("disembark-truck","driver1","truck3","s4")),6) occurs(action(("load-truck","package1","truck2","s4")),7) occurs(action(("walk","driver1","s4","p11-4")),7) occurs(action(("drive-truck","truck2","s4","s5","driver2")),7) occurs(action(("unload-truck","package1","truck2","s5")),8) occurs(action(("walk","driver1","p11-4","s11")),8) occurs(action(("drive-truck","truck2","s5","s8","driver2")),8) occurs(action(("disembark-truck","driver2","truck2","s8")),9) occurs(action(("board-truck","driver2","truck2","s8")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 1.513s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s) CPU Time : 1.500s Choices : 313 (Domain: 311) Conflicts : 78 (Analyzed: 77) Restarts : 1 (Average: 77.00 Last: 1) Model-Level : 94.5 Problems : 4 (Average Length: 8.25 Splits: 0) Lemmas : 82 (Deleted: 0) Binary : 5 (Ratio: 6.10%) Ternary : 0 (Ratio: 0.00%) Conflict : 77 (Average Length: 370.7 Ratio: 93.90%) Loop : 5 (Average Length: 2.0 Ratio: 6.10%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 77 (Average: 1.61 Max: 17 Sum: 124) Executed : 77 (Average: 1.61 Max: 17 Sum: 124 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 789745 Acyc : 56520 Atoms : 733225 Bodies : 11 (Original: 10) Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20) Tight : Yes Variables : 13434 (Eliminated: 0 Frozen: 4771) Constraints : 40955 (Binary: 93.9% Ternary: 3.8% Other: 2.3%) Memory Peak : 133MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2