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-55.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-55.pddl Parsing... Parsing: [0.020s CPU, 0.026s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock] Preparing model... [0.020s CPU, 0.024s wall-clock] Generated 18 rules. Computing model... [0.090s CPU, 0.087s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.080s CPU, 0.076s wall-clock] Instantiating: [0.210s CPU, 0.205s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.000s CPU, 0.005s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 22 uncovered facts Choosing groups: [0.000s CPU, 0.000s 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.000s CPU, 0.004s wall-clock] Translating task: [0.070s CPU, 0.076s wall-clock] 11 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.044s wall-clock] Reordering and filtering variables... 23 of 23 variables necessary. 0 of 1 mutex groups necessary. 484 of 484 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock] Translator variables: 23 Translator derived variables: 0 Translator facts: 66 Translator goal facts: 11 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 484 Translator axioms: 0 Translator task size: 1574 Translator peak memory: 34136 KB Writing output... [0.040s CPU, 0.038s wall-clock] Done! [0.410s CPU, 0.416s wall-clock] planner.py version 0.0.1 Time: 0.86s Memory: 100MB 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: 100MB (+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.26s Memory: 134MB (+34MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 137MB (+3MB) UNSAT Iteration Time: 0.35s 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.29s Memory: 153MB (+16MB) Unblocking actions... Solving... Solving Time: 2.22s Memory: 156MB (+3MB) UNKNOWN Iteration Time: 2.56s 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.43s Memory: 186MB (+30MB) Unblocking actions... Solving... Solving Time: 2.86s Memory: 191MB (+5MB) UNKNOWN Iteration Time: 3.36s 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.28s Memory: 205MB (+14MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f19","p8")),1) occurs(action(("up","f0","f19")),1) occurs(action(("board","f15","p0")),2) occurs(action(("board","f19","p10")),2) occurs(action(("down","f19","f15")),2) occurs(action(("board","f15","p0")),3) occurs(action(("board","f5","p9")),3) occurs(action(("down","f15","f5")),3) occurs(action(("board","f18","p2")),4) occurs(action(("board","f5","p9")),4) occurs(action(("up","f5","f18")),4) occurs(action(("board","f18","p2")),5) occurs(action(("board","f5","p9")),5) occurs(action(("down","f18","f5")),5) occurs(action(("up","f5","f8")),6) occurs(action(("board","f5","p9")),6) occurs(action(("board","f5","p9")),7) occurs(action(("down","f8","f5")),7) occurs(action(("depart","f9","p0")),8) occurs(action(("up","f5","f9")),8) occurs(action(("board","f5","p9")),8) occurs(action(("board","f17","p6")),9) occurs(action(("up","f9","f17")),9) occurs(action(("depart","f16","p8")),10) occurs(action(("board","f16","p3")),10) occurs(action(("board","f17","p6")),10) occurs(action(("down","f17","f16")),10) occurs(action(("depart","f16","p10")),11) occurs(action(("board","f16","p3")),11) occurs(action(("down","f16","f8")),11) occurs(action(("depart","f8","p6")),12) occurs(action(("board","f8","p5")),12) occurs(action(("up","f8","f10")),12) occurs(action(("depart","f21","p3")),13) occurs(action(("depart","f21","p9")),13) occurs(action(("board","f21","p4")),13) occurs(action(("board","f21","p7")),13) occurs(action(("up","f10","f21")),13) occurs(action(("depart","f15","p4")),14) occurs(action(("board","f15","p0")),14) occurs(action(("down","f21","f15")),14) occurs(action(("board","f21","p7")),14) occurs(action(("board","f15","p0")),15) occurs(action(("down","f15","f14")),15) occurs(action(("board","f14","p1")),16) occurs(action(("board","f18","p2")),16) occurs(action(("up","f14","f18")),16) occurs(action(("board","f18","p2")),17) occurs(action(("down","f18","f10")),17) occurs(action(("depart","f10","p5")),18) occurs(action(("up","f10","f12")),18) occurs(action(("depart","f0","p1")),19) occurs(action(("down","f12","f0")),19) occurs(action(("depart","f4","p2")),20) occurs(action(("depart","f4","p7")),20) occurs(action(("up","f0","f4")),20) Solving Time: 0.31s Memory: 212MB (+7MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 7.801s (Solving: 5.35s 1st Model: 0.29s Unsat: 0.03s) CPU Time : 7.800s Choices : 23691 Conflicts : 17754 (Analyzed: 17753) Restarts : 209 (Average: 84.94 Last: 99) Model-Level : 82.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 17842 (Deleted: 14364) Binary : 202 (Ratio: 1.13%) Ternary : 120 (Ratio: 0.67%) Conflict : 17753 (Average Length: 113.6 Ratio: 99.50%) Loop : 89 (Average Length: 38.7 Ratio: 0.50%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 17753 (Average: 1.25 Max: 95 Sum: 22114) Executed : 17737 (Average: 1.24 Max: 95 Sum: 21943 Ratio: 99.23%) Bounded : 16 (Average: 10.69 Max: 12 Sum: 171 Ratio: 0.77%) Rules : 432229 Atoms : 432229 Bodies : 1 (Original: 0) Tight : Yes Variables : 51168 (Eliminated: 0 Frozen: 48752) Constraints : 111213 (Binary: 89.0% Ternary: 10.1% Other: 0.8%) Memory Peak : 212MB Max. Length : 20 steps Sol. Length : 20 steps