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-8.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-8.pddl Parsing... Parsing: [0.010s CPU, 0.014s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.015s wall-clock] Preparing model... [0.010s CPU, 0.009s wall-clock] Generated 35 rules. Computing model... [0.050s CPU, 0.049s wall-clock] 440 relevant atoms 282 auxiliary atoms 722 final queue length 954 total queue pushes Completing instantiation... [0.040s CPU, 0.049s wall-clock] Instantiating: [0.130s CPU, 0.128s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.010s CPU, 0.017s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.010s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 3 uncovered facts Choosing groups: [0.000s CPU, 0.002s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.030s CPU, 0.034s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.003s wall-clock] Translating task: [0.050s CPU, 0.052s wall-clock] 27 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 13 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.028s wall-clock] Reordering and filtering variables... 16 of 16 variables necessary. 3 of 16 mutex groups necessary. 270 of 270 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock] Translator variables: 16 Translator derived variables: 0 Translator facts: 84 Translator goal facts: 11 Translator mutex groups: 3 Translator total mutex groups size: 12 Translator operators: 270 Translator axioms: 0 Translator task size: 1248 Translator peak memory: 33624 KB Writing output... [0.030s CPU, 0.026s wall-clock] Done! [0.290s CPU, 0.297s wall-clock] planner.py version 0.0.1 Time: 0.07s Memory: 48MB 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: 48MB (+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.03s Memory: 49MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 49MB (+0MB) UNSAT Iteration Time: 0.04s 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: 51MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package7","truck2","s2")),1) occurs(action(("board-truck","driver1","truck2","s2")),1) occurs(action(("walk","driver3","s1","p2-1")),1) occurs(action(("walk","driver2","s0","p2-0")),1) occurs(action(("drive-truck","truck2","s2","s1","driver1")),2) occurs(action(("walk","driver2","p2-0","s2")),2) occurs(action(("walk","driver3","p2-1","s2")),2) occurs(action(("unload-truck","package7","truck2","s1")),3) occurs(action(("board-truck","driver2","truck3","s2")),3) occurs(action(("board-truck","driver3","truck1","s2")),3) occurs(action(("disembark-truck","driver1","truck2","s1")),3) occurs(action(("drive-truck","truck3","s2","s0","driver2")),4) occurs(action(("drive-truck","truck1","s2","s1","driver3")),4) occurs(action(("walk","driver1","s1","p2-1")),4) occurs(action(("load-truck","package2","truck1","s1")),5) occurs(action(("load-truck","package3","truck3","s0")),5) occurs(action(("walk","driver1","p2-1","s2")),5) occurs(action(("drive-truck","truck1","s1","s0","driver3")),6) occurs(action(("drive-truck","truck3","s0","s1","driver2")),6) occurs(action(("unload-truck","package2","truck1","s0")),7) occurs(action(("unload-truck","package3","truck3","s1")),7) occurs(action(("load-truck","package1","truck1","s0")),7) occurs(action(("load-truck","package4","truck1","s0")),7) occurs(action(("drive-truck","truck3","s1","s0","driver2")),8) occurs(action(("drive-truck","truck1","s0","s2","driver3")),8) occurs(action(("unload-truck","package1","truck1","s2")),9) occurs(action(("unload-truck","package4","truck1","s2")),9) occurs(action(("disembark-truck","driver2","truck3","s0")),9) occurs(action(("disembark-truck","driver3","truck1","s2")),10) Solving Time: 0.00s Memory: 51MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 3 Time : 0.150s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.140s Choices : 177 (Domain: 175) Conflicts : 18 (Analyzed: 17) Restarts : 0 Model-Level : 88.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 17 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 17 (Average Length: 19.5 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 17 (Average: 7.18 Max: 38 Sum: 122) Executed : 14 (Average: 5.94 Max: 38 Sum: 101 Ratio: 82.79%) Bounded : 3 (Average: 7.00 Max: 7 Sum: 21 Ratio: 17.21%) Rules : 4312 Atoms : 4312 Bodies : 1 (Original: 0) Tight : Yes Variables : 3934 (Eliminated: 0 Frozen: 2487) Constraints : 17378 (Binary: 91.4% Ternary: 4.0% Other: 4.6%) Memory Peak : 51MB Max. Length : 10 steps Sol. Length : 10 steps