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-5.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-5.pddl Parsing... Parsing: [0.010s CPU, 0.017s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock] Preparing model... [0.000s CPU, 0.011s wall-clock] Generated 35 rules. Computing model... [0.050s CPU, 0.046s wall-clock] 302 relevant atoms 216 auxiliary atoms 518 final queue length 659 total queue pushes Completing instantiation... [0.030s CPU, 0.035s wall-clock] Instantiating: [0.120s CPU, 0.115s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.010s CPU, 0.016s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.006s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 2 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.010s CPU, 0.001s wall-clock] Computing fact groups: [0.030s CPU, 0.028s 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.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.002s wall-clock] Translating task: [0.030s CPU, 0.033s wall-clock] 18 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 10 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.020s wall-clock] Reordering and filtering variables... 12 of 12 variables necessary. 2 of 12 mutex groups necessary. 168 of 168 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock] Translator variables: 12 Translator derived variables: 0 Translator facts: 59 Translator goal facts: 8 Translator mutex groups: 2 Translator total mutex groups size: 8 Translator operators: 168 Translator axioms: 0 Translator task size: 777 Translator peak memory: 33368 KB Writing output... [0.020s CPU, 0.018s wall-clock] Done! [0.240s CPU, 0.241s wall-clock] planner.py version 0.0.1 Time: 0.05s Memory: 47MB 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: 47MB (+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.02s Memory: 47MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 48MB (+1MB) UNSAT Iteration Time: 0.03s 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.02s Memory: 49MB (+1MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 49MB (+0MB) UNSAT Iteration Time: 0.05s 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.01s Memory: 49MB (+0MB) Unblocking actions... Solving... Solving Time: 0.30s Memory: 50MB (+1MB) UNKNOWN Iteration Time: 0.32s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.01s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.36s Memory: 52MB (+1MB) UNKNOWN Iteration Time: 0.38s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.01s Memory: 53MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("walk","driver2","s0","p0-1")),1) occurs(action(("board-truck","driver1","truck1","s1")),2) occurs(action(("drive-truck","truck1","s1","s2","driver1")),3) occurs(action(("walk","driver2","p0-1","s1")),4) occurs(action(("load-truck","package4","truck1","s2")),5) occurs(action(("load-truck","package3","truck1","s2")),6) occurs(action(("drive-truck","truck1","s2","s0","driver1")),7) occurs(action(("disembark-truck","driver1","truck1","s0")),8) occurs(action(("board-truck","driver2","truck2","s1")),9) occurs(action(("board-truck","driver3","truck1","s0")),10) occurs(action(("load-truck","package2","truck1","s0")),11) occurs(action(("load-truck","package1","truck1","s0")),12) occurs(action(("unload-truck","package4","truck1","s0")),13) occurs(action(("drive-truck","truck2","s1","s0","driver2")),14) occurs(action(("disembark-truck","driver2","truck2","s0")),15) occurs(action(("board-truck","driver1","truck2","s0")),16) occurs(action(("drive-truck","truck1","s0","s1","driver3")),17) occurs(action(("disembark-truck","driver1","truck2","s0")),18) occurs(action(("board-truck","driver2","truck2","s0")),19) occurs(action(("unload-truck","package1","truck1","s1")),20) occurs(action(("unload-truck","package3","truck1","s1")),21) occurs(action(("unload-truck","package2","truck1","s1")),22) occurs(action(("drive-truck","truck2","s0","s2","driver2")),23) occurs(action(("drive-truck","truck1","s1","s2","driver3")),24) occurs(action(("disembark-truck","driver2","truck2","s2")),25) Solving Time: 0.09s Memory: 54MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 0.920s (Solving: 0.76s 1st Model: 0.08s Unsat: 0.02s) CPU Time : 0.920s Choices : 34430 Conflicts : 21571 (Analyzed: 21569) Restarts : 224 (Average: 96.29 Last: 100) Model-Level : 62.0 Problems : 6 (Average Length: 14.50 Splits: 0) Lemmas : 21569 (Deleted: 12204) Binary : 1619 (Ratio: 7.51%) Ternary : 1179 (Ratio: 5.47%) Conflict : 21569 (Average Length: 19.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 21569 (Average: 1.52 Max: 41 Sum: 32828) Executed : 21509 (Average: 1.50 Max: 41 Sum: 32346 Ratio: 98.53%) Bounded : 60 (Average: 8.03 Max: 27 Sum: 482 Ratio: 1.47%) Rules : 2558 Atoms : 2558 Bodies : 1 (Original: 0) Tight : Yes Variables : 6747 (Eliminated: 0 Frozen: 4339) Constraints : 26336 (Binary: 89.6% Ternary: 6.7% Other: 3.8%) Memory Peak : 54MB Max. Length : 25 steps Sol. Length : 25 steps