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.020s CPU, 0.019s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock] Preparing model... [0.020s CPU, 0.012s wall-clock] Generated 35 rules. Computing model... [0.040s CPU, 0.051s wall-clock] 302 relevant atoms 216 auxiliary atoms 518 final queue length 659 total queue pushes Completing instantiation... [0.030s CPU, 0.039s wall-clock] Instantiating: [0.120s CPU, 0.128s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.023s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.007s 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.030s CPU, 0.036s 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.040s CPU, 0.037s 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.022s 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.007s 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: 36556 KB Writing output... [0.010s CPU, 0.018s wall-clock] Done! [0.260s CPU, 0.272s wall-clock] planner.py version 0.0.1 Time: 0.04s Memory: 50MB 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: 51MB (+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.01s Memory: 51MB (+0MB) Unblocking actions... Solving... Answer: 1 occurs(action(("walk","driver2","s0","p0-2")),1) occurs(action(("board-truck","driver1","truck2","s1")),1) occurs(action(("walk","driver3","s0","p0-1")),1) occurs(action(("walk","driver2","p0-2","s2")),2) occurs(action(("drive-truck","truck2","s1","s2","driver1")),2) occurs(action(("walk","driver3","p0-1","s1")),2) occurs(action(("load-truck","package3","truck2","s2")),3) occurs(action(("load-truck","package4","truck2","s2")),3) occurs(action(("drive-truck","truck2","s2","s0","driver1")),3) occurs(action(("board-truck","driver3","truck1","s1")),3) occurs(action(("unload-truck","package4","truck2","s0")),4) occurs(action(("drive-truck","truck1","s1","s2","driver3")),4) occurs(action(("load-truck","package1","truck2","s0")),4) occurs(action(("load-truck","package2","truck2","s0")),4) occurs(action(("drive-truck","truck2","s0","s1","driver1")),4) occurs(action(("unload-truck","package1","truck2","s1")),5) occurs(action(("unload-truck","package2","truck2","s1")),5) occurs(action(("unload-truck","package3","truck2","s1")),5) occurs(action(("drive-truck","truck2","s1","s2","driver1")),5) Solving Time: 0.00s Memory: 52MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 2 Time : 0.066s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.064s Choices : 14 (Domain: 12) Conflicts : 2 (Analyzed: 2) Restarts : 0 Model-Level : 19.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 2 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 2 (Average Length: 4.5 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2 (Average: 1.00 Max: 1 Sum: 2) Executed : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 2558 Atoms : 2558 Bodies : 1 (Original: 0) Tight : Yes Variables : 1183 (Eliminated: 0 Frozen: 107) Constraints : 3125 (Binary: 89.4% Ternary: 6.9% Other: 3.6%) Memory Peak : 52MB Max. Length : 5 steps Sol. Length : 5 steps