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.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.030s CPU, 0.024s wall-clock] Preparing model... [0.020s CPU, 0.021s wall-clock] Generated 35 rules. Computing model... [0.130s CPU, 0.136s wall-clock] 917 relevant atoms 608 auxiliary atoms 1525 final queue length 2071 total queue pushes Completing instantiation... [0.120s CPU, 0.123s wall-clock] Instantiating: [0.320s CPU, 0.317s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.018s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.014s 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.040s CPU, 0.044s 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.007s wall-clock] Translating task: [0.140s CPU, 0.131s 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.070s CPU, 0.072s 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.019s 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: 38092 KB Writing output... [0.050s CPU, 0.055s wall-clock] Done! [0.670s CPU, 0.680s wall-clock] planner.py version 0.0.1 Time: 0.12s Memory: 54MB 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: 55MB (+1MB) 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.03s Memory: 55MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 56MB (+1MB) UNSAT Iteration Time: 0.05s 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.03s Memory: 58MB (+2MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 60MB (+2MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.08s Memory: 63MB (+3MB) Solving... Solving Time: 0.00s Memory: 63MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.07s Memory: 63MB (+0MB) Solving... Solving Time: 0.01s Memory: 60MB (+-3MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.08s Memory: 63MB (+3MB) Solving... Solving Time: 0.01s Memory: 60MB (+-3MB) SAT Testing... SERIALIZABLE Testing Time: 0.07s Memory: 63MB (+3MB) Answer: 4 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","s6","driver2")),2) occurs(action(("walk","driver1","p2-6","s2")),2) occurs(action(("unload-truck","package4","truck1","s6")),3) occurs(action(("board-truck","driver1","truck2","s2")),3) occurs(action(("drive-truck","truck1","s6","s2","driver2")),3) occurs(action(("drive-truck","truck2","s2","s4","driver1")),4) occurs(action(("load-truck","package2","truck1","s2")),4) occurs(action(("drive-truck","truck1","s2","s6","driver2")),4) occurs(action(("drive-truck","truck1","s6","s3","driver2")),5) occurs(action(("disembark-truck","driver1","truck2","s4")),5) occurs(action(("unload-truck","package2","truck1","s3")),6) occurs(action(("load-truck","package3","truck1","s3")),6) occurs(action(("drive-truck","truck1","s3","s6","driver2")),6) occurs(action(("walk","driver1","s4","p4-2")),6) occurs(action(("drive-truck","truck1","s6","s5","driver2")),7) occurs(action(("walk","driver1","p4-2","s2")),7) occurs(action(("load-truck","package5","truck1","s5")),8) occurs(action(("drive-truck","truck1","s5","s1","driver2")),8) occurs(action(("walk","driver1","s2","p4-2")),8) occurs(action(("unload-truck","package5","truck1","s1")),9) occurs(action(("drive-truck","truck1","s1","s4","driver2")),9) occurs(action(("walk","driver1","p4-2","s4")),9) occurs(action(("unload-truck","package3","truck1","s4")),10) occurs(action(("disembark-truck","driver2","truck1","s4")),10) occurs(action(("board-truck","driver1","truck2","s4")),10) SATISFIABLE Models : 1+ Calls : 6 Time : 0.258s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s) CPU Time : 0.256s Choices : 1003 (Domain: 987) Conflicts : 293 (Analyzed: 292) Restarts : 2 (Average: 146.00 Last: 52) Model-Level : 89.0 Problems : 6 (Average Length: 9.50 Splits: 0) Lemmas : 292 (Deleted: 0) Binary : 1 (Ratio: 0.34%) Ternary : 1 (Ratio: 0.34%) Conflict : 292 (Average Length: 175.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 292 (Average: 2.15 Max: 36 Sum: 628) Executed : 292 (Average: 2.15 Max: 36 Sum: 628 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 8302 Atoms : 8252 Bodies : 81 (Original: 80) Equivalences : 90 (Atom=Atom: 30 Body=Body: 0 Other: 60) Tight : Yes Variables : 6993 (Eliminated: 0 Frozen: 939) Constraints : 23235 (Binary: 93.1% Ternary: 3.9% Other: 3.0%) Memory Peak : 63MB Max. Length : 10 steps Sol. Length : 10 steps Models : 4