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-11.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-11.pddl Parsing... Parsing: [0.020s CPU, 0.021s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock] Preparing model... [0.020s CPU, 0.017s wall-clock] Generated 51 rules. Computing model... [0.240s CPU, 0.247s wall-clock] 2133 relevant atoms 1362 auxiliary atoms 3495 final queue length 4747 total queue pushes Completing instantiation... [0.350s CPU, 0.344s wall-clock] Instantiating: [0.640s CPU, 0.644s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.014s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.040s CPU, 0.039s wall-clock] Collecting mutex groups... [0.010s CPU, 0.002s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.000s CPU, 0.007s wall-clock] Building translation key... [0.010s CPU, 0.004s wall-clock] Computing fact groups: [0.090s CPU, 0.088s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.002s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.020s CPU, 0.015s wall-clock] Translating task: [0.280s CPU, 0.277s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 36 propositions removed Detecting unreachable propositions: [0.140s CPU, 0.150s wall-clock] Reordering and filtering variables... 36 of 36 variables necessary. 0 of 36 mutex groups necessary. 1512 of 1512 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.040s CPU, 0.040s wall-clock] Translator variables: 36 Translator derived variables: 0 Translator facts: 380 Translator goal facts: 8 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 1512 Translator axioms: 0 Translator task size: 6304 Translator peak memory: 37720 KB Writing output... [0.110s CPU, 0.126s wall-clock] Done! [1.340s CPU, 1.367s wall-clock] planner.py version 0.0.1 Time: 0.24s Memory: 60MB 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: 60MB (+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.05s Memory: 60MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+0MB) UNSAT Iteration Time: 0.08s 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.06s Memory: 63MB (+3MB) Unblocking actions... Solving... Solving Time: 0.17s Memory: 66MB (+3MB) UNSAT Iteration Time: 0.26s 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.06s Memory: 69MB (+3MB) Unblocking actions... Solving... Solving Time: 0.73s Memory: 72MB (+3MB) UNKNOWN Iteration Time: 0.83s 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.06s Memory: 76MB (+4MB) Unblocking actions... Solving... Solving Time: 0.92s Memory: 80MB (+4MB) UNKNOWN Iteration Time: 1.02s 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.06s Memory: 82MB (+2MB) Unblocking actions... Solving... Solving Time: 1.06s Memory: 86MB (+4MB) UNKNOWN Iteration Time: 1.16s 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.07s Memory: 91MB (+5MB) Unblocking actions... Solving... Solving Time: 1.23s Memory: 93MB (+2MB) UNKNOWN Iteration Time: 1.35s Iteration 8 Queue: [(3,15,1,True), (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)] Grounded Until: 30 Blocking actions... Solving... Solving Time: 0.93s Memory: 93MB (+0MB) UNKNOWN Iteration Time: 0.93s Iteration 9 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)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 1.11s Memory: 93MB (+0MB) UNKNOWN Iteration Time: 1.11s Iteration 10 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)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 1.29s Memory: 93MB (+0MB) UNKNOWN Iteration Time: 1.29s Iteration 11 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)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 1.41s Memory: 93MB (+0MB) UNKNOWN Iteration Time: 1.42s Iteration 12 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)] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.06s Memory: 98MB (+5MB) Unblocking actions... Solving... Solving Time: 1.33s Memory: 104MB (+6MB) UNKNOWN Iteration Time: 1.43s Iteration 13 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)] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 0.06s Memory: 106MB (+2MB) Unblocking actions... Solving... Solving Time: 1.47s Memory: 108MB (+2MB) UNKNOWN Iteration Time: 1.59s Iteration 14 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)] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 0.06s Memory: 111MB (+3MB) Unblocking actions... Solving... Solving Time: 1.51s Memory: 115MB (+4MB) UNKNOWN Iteration Time: 1.63s Iteration 15 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)] Grounded Until: 45 Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])] Grounding Time: 0.06s Memory: 117MB (+2MB) Unblocking actions... Solving... Solving Time: 1.75s Memory: 125MB (+8MB) UNKNOWN Iteration Time: 1.86s Iteration 16 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)] Grounded Until: 50 Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.06s Memory: 125MB (+0MB) Unblocking actions... Solving... Solving Time: 1.72s Memory: 128MB (+3MB) UNKNOWN Iteration Time: 1.84s Iteration 17 Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])] Grounding Time: 0.06s Memory: 130MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("load-truck","package3","truck3","city2-2")),1) occurs(action(("drive-truck","truck3","city2-2","city2-3","city2")),2) occurs(action(("drive-truck","truck12","city2-2","city2-1","city2")),3) occurs(action(("drive-truck","truck16","city2-1","city2-3","city2")),4) occurs(action(("drive-truck","truck20","city1-2","city1-1","city1")),5) occurs(action(("unload-truck","package3","truck3","city2-3")),6) occurs(action(("fly-airplane","plane1","city1-3","city2-3")),7) occurs(action(("load-airplane","package3","plane1","city2-3")),8) occurs(action(("drive-truck","truck11","city3-3","city3-2","city3")),9) occurs(action(("load-truck","package2","truck11","city3-2")),10) occurs(action(("drive-truck","truck11","city3-2","city3-3","city3")),11) occurs(action(("unload-truck","package2","truck11","city3-3")),12) occurs(action(("load-truck","package8","truck13","city1-2")),13) occurs(action(("drive-truck","truck13","city1-2","city1-3","city1")),14) occurs(action(("unload-truck","package8","truck13","city1-3")),15) occurs(action(("load-airplane","package8","plane5","city1-3")),16) occurs(action(("fly-airplane","plane1","city2-3","city1-3")),17) occurs(action(("fly-airplane","plane5","city1-3","city3-3")),18) occurs(action(("fly-airplane","plane2","city2-3","city1-3")),19) occurs(action(("drive-truck","truck2","city1-1","city1-2","city1")),20) occurs(action(("fly-airplane","plane2","city1-3","city3-3")),21) occurs(action(("fly-airplane","plane3","city2-3","city3-3")),22) occurs(action(("load-airplane","package1","plane1","city1-3")),23) occurs(action(("load-airplane","package2","plane2","city3-3")),24) occurs(action(("fly-airplane","plane2","city3-3","city1-3")),25) occurs(action(("fly-airplane","plane2","city1-3","city3-3")),26) occurs(action(("drive-truck","truck14","city2-2","city2-1","city2")),27) occurs(action(("fly-airplane","plane5","city3-3","city1-3")),28) occurs(action(("unload-airplane","package3","plane1","city1-3")),29) occurs(action(("fly-airplane","plane5","city1-3","city2-3")),30) occurs(action(("load-truck","package7","truck14","city2-1")),31) occurs(action(("drive-truck","truck14","city2-1","city2-3","city2")),32) occurs(action(("unload-truck","package7","truck14","city2-3")),33) occurs(action(("load-airplane","package7","plane5","city2-3")),34) occurs(action(("fly-airplane","plane5","city2-3","city3-3")),35) occurs(action(("fly-airplane","plane2","city3-3","city1-3")),36) occurs(action(("unload-airplane","package7","plane5","city3-3")),37) occurs(action(("fly-airplane","plane6","city2-3","city1-3")),38) occurs(action(("fly-airplane","plane2","city1-3","city2-3")),39) occurs(action(("drive-truck","truck12","city2-1","city2-3","city2")),40) occurs(action(("load-truck","package3","truck13","city1-3")),41) occurs(action(("drive-truck","truck13","city1-3","city1-2","city1")),42) occurs(action(("drive-truck","truck17","city2-2","city2-3","city2")),43) occurs(action(("unload-airplane","package8","plane5","city3-3")),44) occurs(action(("drive-truck","truck2","city1-2","city1-3","city1")),45) occurs(action(("fly-airplane","plane6","city1-3","city3-3")),46) occurs(action(("drive-truck","truck13","city1-2","city1-3","city1")),47) occurs(action(("drive-truck","truck13","city1-3","city1-2","city1")),48) occurs(action(("drive-truck","truck2","city1-3","city1-1","city1")),49) occurs(action(("unload-truck","package3","truck13","city1-2")),50) occurs(action(("load-airplane","package7","plane6","city3-3")),51) occurs(action(("unload-airplane","package1","plane1","city1-3")),52) occurs(action(("unload-airplane","package7","plane6","city3-3")),53) occurs(action(("unload-airplane","package2","plane2","city2-3")),54) occurs(action(("drive-truck","truck20","city1-1","city1-3","city1")),55) occurs(action(("load-airplane","package7","plane4","city3-3")),56) occurs(action(("load-truck","package1","truck20","city1-3")),57) occurs(action(("unload-airplane","package7","plane4","city3-3")),58) occurs(action(("drive-truck","truck20","city1-3","city1-1","city1")),59) occurs(action(("unload-truck","package1","truck20","city1-1")),60) Solving Time: 1.26s Memory: 134MB (+4MB) SAT SATISFIABLE Models : 1+ Calls : 17 Time : 19.445s (Solving: 17.76s 1st Model: 1.24s Unsat: 0.17s) CPU Time : 19.440s Choices : 385616 Conflicts : 147034 (Analyzed: 147033) Restarts : 1375 (Average: 106.93 Last: 179) Model-Level : 641.0 Problems : 17 (Average Length: 32.00 Splits: 0) Lemmas : 147033 (Deleted: 77784) Binary : 21579 (Ratio: 14.68%) Ternary : 9314 (Ratio: 6.33%) Conflict : 147033 (Average Length: 29.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 147033 (Average: 2.32 Max: 1045 Sum: 340925) Executed : 146725 (Average: 2.28 Max: 1045 Sum: 335520 Ratio: 98.41%) Bounded : 308 (Average: 17.55 Max: 57 Sum: 5405 Ratio: 1.59%) Rules : 20306 Atoms : 20306 Bodies : 1 (Original: 0) Tight : Yes Variables : 93685 (Eliminated: 0 Frozen: 70368) Constraints : 365898 (Binary: 91.1% Ternary: 6.0% Other: 2.9%) Memory Peak : 144MB Max. Length : 60 steps Sol. Length : 60 steps