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-10.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-10.pddl Parsing... Parsing: [0.020s CPU, 0.022s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock] Preparing model... [0.010s CPU, 0.016s wall-clock] Generated 35 rules. Computing model... [0.110s CPU, 0.105s wall-clock] 779 relevant atoms 517 auxiliary atoms 1296 final queue length 1751 total queue pushes Completing instantiation... [0.100s CPU, 0.101s wall-clock] Instantiating: [0.250s CPU, 0.251s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.020s CPU, 0.012s 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.040s CPU, 0.041s 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.006s wall-clock] Translating task: [0.120s CPU, 0.111s wall-clock] 36 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 11 propositions removed Detecting unreachable propositions: [0.060s CPU, 0.060s wall-clock] Reordering and filtering variables... 14 of 14 variables necessary. 3 of 14 mutex groups necessary. 516 of 516 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.016s wall-clock] Translator variables: 14 Translator derived variables: 0 Translator facts: 114 Translator goal facts: 8 Translator mutex groups: 3 Translator total mutex groups size: 9 Translator operators: 516 Translator axioms: 0 Translator task size: 2245 Translator peak memory: 37836 KB Writing output... [0.040s CPU, 0.049s wall-clock] Done! [0.550s CPU, 0.558s wall-clock] planner.py version 0.0.1 Time: 0.09s 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: 54MB (+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: 55MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package2","truck1","s0")),1) occurs(action(("load-truck","package3","truck2","s4")),1) occurs(action(("load-truck","package4","truck2","s4")),1) occurs(action(("load-truck","package5","truck2","s4")),1) occurs(action(("board-truck","driver1","truck2","s4")),1) occurs(action(("board-truck","driver2","truck1","s0")),1) occurs(action(("drive-truck","truck2","s4","s3","driver1")),2) occurs(action(("drive-truck","truck1","s0","s1","driver2")),2) occurs(action(("disembark-truck","driver2","truck1","s0")),2) occurs(action(("unload-truck","package2","truck1","s1")),3) occurs(action(("unload-truck","package5","truck2","s3")),3) occurs(action(("drive-truck","truck2","s3","s1","driver1")),3) occurs(action(("unload-truck","package4","truck2","s1")),4) occurs(action(("disembark-truck","driver1","truck2","s1")),4) occurs(action(("load-truck","package1","truck2","s1")),4) occurs(action(("drive-truck","truck2","s1","s5","driver1")),4) occurs(action(("unload-truck","package1","truck2","s5")),5) occurs(action(("unload-truck","package3","truck2","s5")),5) Solving Time: 0.00s Memory: 56MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 2 Time : 0.132s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.128s Choices : 109 (Domain: 109) Conflicts : 45 (Analyzed: 45) Restarts : 0 Model-Level : 25.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 45 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 1 (Ratio: 2.22%) Conflict : 45 (Average Length: 17.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 45 (Average: 2.02 Max: 7 Sum: 91) Executed : 45 (Average: 2.02 Max: 7 Sum: 91 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 7355 Atoms : 7355 Bodies : 1 (Original: 0) Tight : Yes Variables : 2951 (Eliminated: 0 Frozen: 332) Constraints : 6820 (Binary: 92.2% Ternary: 4.8% Other: 3.1%) Memory Peak : 56MB Max. Length : 5 steps Sol. Length : 5 steps