INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-58.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-58.pddl Parsing... Parsing: [0.040s CPU, 0.032s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.030s CPU, 0.031s wall-clock] Generated 18 rules. Computing model... [0.110s CPU, 0.104s wall-clock] 1033 relevant atoms 684 auxiliary atoms 1717 final queue length 2246 total queue pushes Completing instantiation... [0.090s CPU, 0.090s wall-clock] Instantiating: [0.240s CPU, 0.246s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.000s CPU, 0.005s wall-clock] Checking invariant weight... [0.010s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.001s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 24 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.010s CPU, 0.010s 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.010s CPU, 0.005s wall-clock] Translating task: [0.090s CPU, 0.089s wall-clock] 12 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.050s CPU, 0.052s wall-clock] Reordering and filtering variables... 25 of 25 variables necessary. 0 of 1 mutex groups necessary. 576 of 576 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock] Translator variables: 25 Translator derived variables: 0 Translator facts: 72 Translator goal facts: 12 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 576 Translator axioms: 0 Translator task size: 1861 Translator peak memory: 34392 KB Writing output... [0.040s CPU, 0.043s wall-clock] Done! [0.490s CPU, 0.492s wall-clock] planner.py version 0.0.1 Time: 0.10s 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.04s Memory: 51MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) UNSAT Iteration Time: 0.06s 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.04s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.06s 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.03s Memory: 57MB (+3MB) Unblocking actions... Solving... Solving Time: 0.34s Memory: 59MB (+2MB) UNSAT Iteration Time: 0.39s 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.05s Memory: 60MB (+1MB) Unblocking actions... Solving... Solving Time: 1.42s Memory: 61MB (+1MB) UNKNOWN Iteration Time: 1.49s 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.05s Memory: 63MB (+2MB) Unblocking actions... Solving... Solving Time: 1.47s Memory: 65MB (+2MB) UNKNOWN Iteration Time: 1.55s 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.04s Memory: 67MB (+2MB) Unblocking actions... Solving... Solving Time: 1.34s Memory: 68MB (+1MB) UNKNOWN Iteration Time: 1.40s 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.31s Memory: 68MB (+0MB) UNSAT Iteration Time: 0.31s 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.79s Memory: 69MB (+1MB) UNKNOWN Iteration Time: 0.80s 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: 1.17s Memory: 69MB (+0MB) UNKNOWN Iteration Time: 1.17s 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.03s Memory: 70MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f8")),1) occurs(action(("board","f8","p10")),2) occurs(action(("up","f8","f16")),3) occurs(action(("depart","f16","p10")),4) occurs(action(("down","f16","f2")),5) occurs(action(("board","f2","p6")),6) occurs(action(("up","f2","f9")),7) occurs(action(("board","f9","p2")),8) occurs(action(("down","f9","f6")),9) occurs(action(("depart","f6","p2")),10) occurs(action(("board","f6","p7")),10) occurs(action(("up","f6","f15")),11) occurs(action(("board","f15","p4")),12) occurs(action(("board","f15","p8")),12) occurs(action(("down","f15","f12")),13) occurs(action(("depart","f12","p8")),14) occurs(action(("down","f12","f4")),15) occurs(action(("board","f4","p1")),16) occurs(action(("up","f4","f14")),17) occurs(action(("board","f14","p3")),18) occurs(action(("up","f14","f19")),19) occurs(action(("board","f19","p0")),20) occurs(action(("down","f19","f11")),21) occurs(action(("board","f11","p5")),22) occurs(action(("down","f11","f2")),23) occurs(action(("depart","f2","p4")),24) occurs(action(("board","f2","p6")),24) occurs(action(("up","f2","f7")),25) occurs(action(("depart","f7","p3")),26) occurs(action(("depart","f7","p5")),26) occurs(action(("up","f7","f18")),27) occurs(action(("depart","f18","p1")),28) occurs(action(("depart","f18","p6")),28) occurs(action(("down","f18","f0")),29) occurs(action(("depart","f0","p0")),30) occurs(action(("board","f0","p11")),30) occurs(action(("board","f0","p9")),30) occurs(action(("up","f0","f1")),31) occurs(action(("depart","f1","p7")),32) occurs(action(("depart","f1","p9")),32) occurs(action(("up","f1","f15")),33) occurs(action(("up","f15","f17")),34) occurs(action(("depart","f17","p11")),35) Solving Time: 0.92s Memory: 73MB (+3MB) SAT SATISFIABLE Models : 1+ Calls : 11 Time : 8.281s (Solving: 7.75s 1st Model: 0.92s Unsat: 0.65s) CPU Time : 8.280s Choices : 86189 Conflicts : 57102 (Analyzed: 57098) Restarts : 651 (Average: 87.71 Last: 95) Model-Level : 84.0 Problems : 11 (Average Length: 22.91 Splits: 0) Lemmas : 57098 (Deleted: 41889) Binary : 326 (Ratio: 0.57%) Ternary : 1853 (Ratio: 3.25%) Conflict : 57098 (Average Length: 15.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 57098 (Average: 1.39 Max: 54 Sum: 79336) Executed : 57067 (Average: 1.39 Max: 54 Sum: 79125 Ratio: 99.73%) Bounded : 31 (Average: 6.81 Max: 27 Sum: 211 Ratio: 0.27%) Rules : 7338 Atoms : 7338 Bodies : 1 (Original: 0) Tight : Yes Variables : 24353 (Eliminated: 0 Frozen: 19666) Constraints : 124096 (Binary: 97.3% Ternary: 1.9% Other: 0.8%) Memory Peak : 74MB Max. Length : 35 steps Sol. Length : 35 steps