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-1.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-1.pddl Parsing... Parsing: [0.010s CPU, 0.015s 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.023s wall-clock] Preparing model... [0.010s CPU, 0.012s wall-clock] Generated 51 rules. Computing model... [0.110s CPU, 0.105s wall-clock] 643 relevant atoms 678 auxiliary atoms 1321 final queue length 1575 total queue pushes Completing instantiation... [0.090s CPU, 0.083s wall-clock] Instantiating: [0.240s CPU, 0.228s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.000s CPU, 0.009s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.020s CPU, 0.010s 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.002s wall-clock] Computing fact groups: [0.030s CPU, 0.031s 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.000s CPU, 0.004s wall-clock] Translating task: [0.070s CPU, 0.069s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 14 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.036s wall-clock] Reordering and filtering variables... 14 of 14 variables necessary. 0 of 14 mutex groups necessary. 360 of 360 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock] Translator variables: 14 Translator derived variables: 0 Translator facts: 144 Translator goal facts: 6 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 360 Translator axioms: 0 Translator task size: 1532 Translator peak memory: 34136 KB Writing output... [0.020s CPU, 0.031s wall-clock] Done! [0.420s CPU, 0.427s wall-clock] planner.py version 0.0.1 Time: 0.08s Memory: 49MB 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: 49MB (+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.03s Memory: 49MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+1MB) UNSAT Iteration Time: 0.04s 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.03s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) UNSAT Iteration Time: 0.04s 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.02s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.39s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.42s 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.02s Memory: 56MB (+2MB) Unblocking actions... Solving... Solving Time: 0.50s Memory: 57MB (+1MB) UNKNOWN Iteration Time: 0.53s 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.02s Memory: 58MB (+1MB) Unblocking actions... Solving... Solving Time: 0.61s Memory: 60MB (+2MB) UNKNOWN Iteration Time: 0.64s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.02s Memory: 61MB (+1MB) Unblocking actions... Solving... Solving Time: 0.71s Memory: 62MB (+1MB) UNKNOWN Iteration Time: 0.74s Iteration 8 Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Blocking actions... Solving... Solving Time: 0.65s Memory: 62MB (+0MB) UNKNOWN Iteration Time: 0.65s Iteration 9 Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 0.74s Memory: 62MB (+0MB) UNKNOWN Iteration Time: 0.74s Iteration 10 Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 0.81s Memory: 62MB (+0MB) UNKNOWN Iteration Time: 0.81s Iteration 11 Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.02s Memory: 64MB (+2MB) Unblocking actions... Solving... Solving Time: 0.87s Memory: 66MB (+2MB) UNKNOWN Iteration Time: 0.90s Iteration 12 Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 0.02s Memory: 67MB (+1MB) Unblocking actions... Solving... Solving Time: 0.92s Memory: 68MB (+1MB) UNKNOWN Iteration Time: 0.96s Iteration 13 Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 0.02s Memory: 69MB (+1MB) Unblocking actions... Solving... Solving Time: 1.05s Memory: 70MB (+1MB) UNKNOWN Iteration Time: 1.09s Iteration 14 Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 45 Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])] Grounding Time: 0.03s Memory: 72MB (+2MB) Unblocking actions... Solving... Solving Time: 1.01s Memory: 74MB (+2MB) UNKNOWN Iteration Time: 1.05s Iteration 15 Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 50 Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.02s Memory: 75MB (+1MB) Unblocking actions... Solving... Solving Time: 1.14s Memory: 76MB (+1MB) UNKNOWN Iteration Time: 1.18s Iteration 16 Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])] Grounding Time: 0.02s Memory: 77MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package4","truck1","city1-1")),1) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),2) occurs(action(("unload-truck","package4","truck1","city1-2")),3) occurs(action(("fly-airplane","plane2","city4-2","city1-2")),4) occurs(action(("load-airplane","package4","plane2","city1-2")),5) occurs(action(("fly-airplane","plane2","city1-2","city6-2")),6) occurs(action(("fly-airplane","plane2","city6-2","city1-2")),7) occurs(action(("unload-airplane","package4","plane2","city1-2")),8) occurs(action(("fly-airplane","plane1","city4-2","city5-2")),9) occurs(action(("load-truck","package6","truck3","city3-1")),10) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),11) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),12) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),13) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),14) occurs(action(("fly-airplane","plane1","city5-2","city4-2")),15) occurs(action(("fly-airplane","plane1","city4-2","city1-2")),16) occurs(action(("fly-airplane","plane1","city1-2","city4-2")),17) occurs(action(("load-airplane","package5","plane1","city4-2")),18) occurs(action(("fly-airplane","plane1","city4-2","city6-2")),19) occurs(action(("unload-airplane","package5","plane1","city6-2")),20) occurs(action(("fly-airplane","plane2","city1-2","city3-2")),21) occurs(action(("unload-truck","package6","truck3","city3-2")),22) occurs(action(("load-airplane","package6","plane2","city3-2")),23) occurs(action(("fly-airplane","plane2","city3-2","city4-2")),24) occurs(action(("fly-airplane","plane1","city6-2","city1-2")),25) occurs(action(("fly-airplane","plane2","city4-2","city1-2")),26) occurs(action(("load-airplane","package2","plane2","city1-2")),27) occurs(action(("fly-airplane","plane2","city1-2","city6-2")),28) occurs(action(("unload-airplane","package2","plane2","city6-2")),29) occurs(action(("fly-airplane","plane2","city6-2","city4-2")),30) occurs(action(("load-airplane","package4","plane1","city1-2")),31) occurs(action(("fly-airplane","plane1","city1-2","city3-2")),32) occurs(action(("unload-airplane","package4","plane1","city3-2")),33) occurs(action(("fly-airplane","plane1","city3-2","city6-2")),34) occurs(action(("fly-airplane","plane1","city6-2","city4-2")),35) occurs(action(("fly-airplane","plane2","city4-2","city3-2")),36) occurs(action(("load-airplane","package4","plane2","city3-2")),37) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),38) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),39) occurs(action(("load-truck","package3","truck1","city1-1")),40) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),41) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),42) occurs(action(("unload-truck","package3","truck1","city1-2")),43) occurs(action(("load-airplane","package3","plane2","city1-2")),44) occurs(action(("fly-airplane","plane2","city1-2","city6-2")),45) occurs(action(("unload-airplane","package3","plane2","city6-2")),46) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),47) occurs(action(("load-truck","package3","truck6","city6-2")),48) occurs(action(("fly-airplane","plane2","city6-2","city1-2")),49) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),50) occurs(action(("unload-airplane","package6","plane2","city1-2")),51) occurs(action(("load-truck","package6","truck1","city1-2")),52) occurs(action(("unload-truck","package6","truck1","city1-2")),53) occurs(action(("load-truck","package6","truck1","city1-2")),54) occurs(action(("fly-airplane","plane2","city1-2","city3-2")),55) occurs(action(("unload-truck","package3","truck6","city6-1")),56) occurs(action(("unload-truck","package6","truck1","city1-2")),57) occurs(action(("unload-airplane","package4","plane2","city3-2")),58) occurs(action(("load-truck","package3","truck6","city6-1")),59) occurs(action(("unload-truck","package3","truck6","city6-1")),60) Solving Time: 0.73s Memory: 78MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 16 Time : 10.668s (Solving: 10.09s 1st Model: 0.73s Unsat: 0.39s) CPU Time : 10.650s Choices : 247053 Conflicts : 130605 (Analyzed: 130603) Restarts : 1248 (Average: 104.65 Last: 154) Model-Level : 123.0 Problems : 16 (Average Length: 32.00 Splits: 0) Lemmas : 130603 (Deleted: 80577) Binary : 12100 (Ratio: 9.26%) Ternary : 8792 (Ratio: 6.73%) Conflict : 130603 (Average Length: 27.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 130603 (Average: 1.71 Max: 108 Sum: 223279) Executed : 130419 (Average: 1.69 Max: 108 Sum: 220856 Ratio: 98.91%) Bounded : 184 (Average: 13.17 Max: 62 Sum: 2423 Ratio: 1.09%) Rules : 5102 Atoms : 5102 Bodies : 1 (Original: 0) Tight : Yes Variables : 31648 (Eliminated: 0 Frozen: 24317) Constraints : 112733 (Binary: 89.2% Ternary: 7.5% Other: 3.3%) Memory Peak : 82MB Max. Length : 60 steps Sol. Length : 60 steps