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-4.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-4.pddl Parsing... Parsing: [0.010s CPU, 0.018s 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.020s wall-clock] Preparing model... [0.010s CPU, 0.011s wall-clock] Generated 35 rules. Computing model... [0.040s CPU, 0.043s wall-clock] 265 relevant atoms 191 auxiliary atoms 456 final queue length 580 total queue pushes Completing instantiation... [0.040s CPU, 0.034s wall-clock] Instantiating: [0.120s CPU, 0.113s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.010s CPU, 0.017s wall-clock] Checking invariant weight... [0.010s CPU, 0.001s wall-clock] Instantiating groups... [0.000s 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.000s CPU, 0.001s wall-clock] Computing fact groups: [0.020s 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.010s CPU, 0.002s wall-clock] Translating task: [0.040s CPU, 0.030s wall-clock] 18 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 9 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.018s wall-clock] Reordering and filtering variables... 11 of 11 variables necessary. 2 of 11 mutex groups necessary. 144 of 144 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock] Translator variables: 11 Translator derived variables: 0 Translator facts: 51 Translator goal facts: 9 Translator mutex groups: 2 Translator total mutex groups size: 8 Translator operators: 144 Translator axioms: 0 Translator task size: 685 Translator peak memory: 33368 KB Writing output... [0.010s CPU, 0.015s wall-clock] Done! [0.220s CPU, 0.231s wall-clock] planner.py version 0.0.1 Time: 0.04s Memory: 47MB Iteration 1 Queue: [5] 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 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.01s Memory: 48MB (+0MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package3","truck2","s0")),1) occurs(action(("load-truck","package4","truck1","s1")),1) occurs(action(("walk","driver2","s1","p0-1")),1) occurs(action(("board-truck","driver3","truck2","s0")),1) occurs(action(("board-truck","driver1","truck1","s1")),1) occurs(action(("drive-truck","truck2","s0","s2","driver3")),2) occurs(action(("drive-truck","truck1","s1","s2","driver1")),2) occurs(action(("unload-truck","package3","truck2","s2")),3) occurs(action(("walk","driver2","p0-1","s0")),3) occurs(action(("load-truck","package1","truck1","s2")),3) occurs(action(("disembark-truck","driver3","truck2","s2")),3) occurs(action(("walk","driver3","s2","p1-2")),4) occurs(action(("drive-truck","truck1","s2","s0","driver1")),4) occurs(action(("unload-truck","package4","truck1","s0")),5) occurs(action(("walk","driver3","p1-2","s1")),5) occurs(action(("walk","driver2","s0","p0-1")),5) occurs(action(("walk","driver3","s1","p1-2")),6) occurs(action(("drive-truck","truck1","s0","s1","driver1")),6) occurs(action(("unload-truck","package1","truck1","s1")),7) occurs(action(("walk","driver3","p1-2","s1")),7) occurs(action(("walk","driver2","p0-1","s0")),7) occurs(action(("disembark-truck","driver1","truck1","s1")),7) Solving Time: 0.00s Memory: 48MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 2 Time : 0.082s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.080s Choices : 75 Conflicts : 19 (Analyzed: 18) Restarts : 0 Model-Level : 37.0 Problems : 2 (Average Length: 8.00 Splits: 0) Lemmas : 18 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 3 (Ratio: 16.67%) Conflict : 18 (Average Length: 9.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 18 (Average: 3.33 Max: 12 Sum: 60) Executed : 13 (Average: 2.61 Max: 12 Sum: 47 Ratio: 78.33%) Bounded : 5 (Average: 2.60 Max: 9 Sum: 13 Ratio: 21.67%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 1753 (Eliminated: 0 Frozen: 894) Constraints : 6837 (Binary: 89.7% Ternary: 5.9% Other: 4.4%) Memory Peak : 48MB Max. Length : 7 steps Sol. Length : 7 steps