INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-32.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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-32.pddl Parsing... Parsing: [0.020s CPU, 0.017s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.003s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.027s wall-clock] Preparing model... [0.010s CPU, 0.012s wall-clock] Generated 51 rules. Computing model... [0.070s CPU, 0.067s wall-clock] 336 relevant atoms 369 auxiliary atoms 705 final queue length 820 total queue pushes Completing instantiation... [0.050s CPU, 0.047s wall-clock] Instantiating: [0.160s CPU, 0.158s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.013s 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.001s wall-clock] Choosing groups... 0 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.020s CPU, 0.027s 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.002s wall-clock] Translating task: [0.030s CPU, 0.036s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 12 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.019s wall-clock] Reordering and filtering variables... 10 of 12 variables necessary. 0 of 12 mutex groups necessary. 108 of 168 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock] Translator variables: 10 Translator derived variables: 0 Translator facts: 54 Translator goal facts: 3 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 108 Translator axioms: 0 Translator task size: 481 Translator peak memory: 36812 KB Writing output... [0.010s CPU, 0.012s wall-clock] Done! [0.280s CPU, 0.279s wall-clock] planner.py version 0.0.1 Time: 0.03s 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: 50MB (+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 Expected Memory: 50MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.01s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) UNSAT Iteration Time: 0.02s 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 Expected Memory: 52.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.01s Memory: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) SAT Testing... SERIALIZABLE Testing Time: 0.02s Memory: 52MB (+0MB) Answer: 1 occurs(action(("drive-truck","truck5","city2-1","city2-2","city2")),1) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),1) occurs(action(("drive-truck","truck4","city1-1","city1-2","city1")),1) occurs(action(("load-truck","package5","truck5","city2-1")),1) occurs(action(("load-truck","package3","truck4","city1-1")),1) occurs(action(("drive-truck","truck6","city3-1","city3-2","city3")),2) occurs(action(("unload-truck","package5","truck5","city2-2")),2) occurs(action(("unload-truck","package3","truck4","city1-2")),2) occurs(action(("drive-truck","truck4","city1-2","city1-1","city1")),2) occurs(action(("load-airplane","package5","plane1","city2-2")),3) occurs(action(("drive-truck","truck6","city3-2","city3-1","city3")),3) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),3) occurs(action(("unload-airplane","package5","plane1","city3-2")),4) occurs(action(("fly-airplane","plane1","city3-2","city1-2")),4) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),5) occurs(action(("load-airplane","package3","plane1","city1-2")),5) occurs(action(("load-airplane","package4","plane1","city1-2")),5) occurs(action(("unload-airplane","package3","plane1","city2-2")),6) occurs(action(("unload-airplane","package4","plane1","city2-2")),6) occurs(action(("fly-airplane","plane1","city2-2","city1-2")),6) occurs(action(("load-truck","package3","truck1","city2-2")),7) occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),7) occurs(action(("load-truck","package4","truck5","city2-2")),7) occurs(action(("drive-truck","truck5","city2-2","city2-1","city2")),7) occurs(action(("unload-truck","package3","truck1","city2-1")),8) occurs(action(("unload-truck","package4","truck5","city2-1")),8) occurs(action(("drive-truck","truck6","city3-1","city3-2","city3")),8) occurs(action(("drive-truck","truck5","city2-1","city2-2","city2")),8) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),8) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),9) occurs(action(("drive-truck","truck5","city2-2","city2-1","city2")),9) occurs(action(("fly-airplane","plane1","city1-2","city3-2")),9) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),9) occurs(action(("drive-truck","truck6","city3-2","city3-1","city3")),10) SATISFIABLE Models : 1+ Calls : 3 Time : 0.067s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.068s Choices : 99 (Domain: 91) Conflicts : 2 (Analyzed: 2) Restarts : 0 Model-Level : 109.0 Problems : 3 (Average Length: 7.00 Splits: 0) Lemmas : 2 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 2 (Average Length: 10.0 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 : 1638 Atoms : 1638 Bodies : 1 (Original: 0) Tight : Yes Variables : 2007 (Eliminated: 0 Frozen: 351) Constraints : 5239 (Binary: 86.3% Ternary: 11.1% Other: 2.6%) Memory Peak : 52MB Max. Length : 10 steps Sol. Length : 10 steps Models : 1