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-50.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-50.pddl Parsing... Parsing: [0.030s CPU, 0.026s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock] Preparing model... [0.010s CPU, 0.019s wall-clock] Generated 18 rules. Computing model... [0.070s CPU, 0.072s wall-clock] 741 relevant atoms 490 auxiliary atoms 1231 final queue length 1592 total queue pushes Completing instantiation... [0.070s CPU, 0.063s wall-clock] Instantiating: [0.170s CPU, 0.176s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s 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... 20 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.009s 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.003s wall-clock] Translating task: [0.060s CPU, 0.062s wall-clock] 10 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.040s CPU, 0.036s wall-clock] Reordering and filtering variables... 21 of 21 variables necessary. 0 of 1 mutex groups necessary. 400 of 400 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 60 Translator goal facts: 10 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 400 Translator axioms: 0 Translator task size: 1311 Translator peak memory: 33880 KB Writing output... [0.030s CPU, 0.031s wall-clock] Done! [0.350s CPU, 0.355s wall-clock] planner.py version 0.0.1 Time: 0.55s Memory: 82MB 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: 82MB (+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.28s Memory: 115MB (+33MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 117MB (+2MB) 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.20s Memory: 131MB (+14MB) Unblocking actions... Solving... Solving Time: 1.78s Memory: 134MB (+3MB) UNKNOWN Iteration Time: 2.03s 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.21s Memory: 147MB (+13MB) Unblocking actions... Solving... Solving Time: 2.26s Memory: 151MB (+4MB) UNKNOWN Iteration Time: 2.52s 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.22s Memory: 162MB (+11MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f9")),1) occurs(action(("up","f9","f18")),2) occurs(action(("board","f9","p4")),2) occurs(action(("board","f18","p7")),2) occurs(action(("depart","f4","p4")),3) occurs(action(("down","f18","f4")),3) occurs(action(("board","f18","p7")),3) occurs(action(("board","f7","p3")),4) occurs(action(("up","f4","f7")),4) occurs(action(("board","f7","p3")),5) occurs(action(("up","f7","f15")),5) occurs(action(("board","f15","p0")),6) occurs(action(("up","f15","f19")),6) occurs(action(("down","f19","f5")),7) occurs(action(("depart","f5","p3")),8) occurs(action(("board","f2","p1")),8) occurs(action(("board","f2","p2")),8) occurs(action(("down","f5","f2")),8) occurs(action(("board","f2","p1")),9) occurs(action(("board","f2","p2")),9) occurs(action(("board","f2","p6")),9) occurs(action(("up","f2","f19")),9) occurs(action(("down","f19","f13")),10) occurs(action(("depart","f0","p1")),11) occurs(action(("depart","f13","p7")),11) occurs(action(("depart","f13","p8")),11) occurs(action(("down","f13","f0")),11) occurs(action(("up","f0","f19")),12) occurs(action(("board","f10","p5")),13) occurs(action(("down","f19","f10")),13) occurs(action(("board","f10","p5")),14) occurs(action(("up","f10","f19")),14) occurs(action(("depart","f19","p6")),15) occurs(action(("depart","f11","p0")),16) occurs(action(("down","f19","f11")),16) occurs(action(("down","f11","f4")),17) occurs(action(("depart","f18","p2")),18) occurs(action(("up","f4","f18")),18) occurs(action(("board","f18","p7")),18) occurs(action(("board","f18","p7")),19) occurs(action(("board","f3","p9")),19) occurs(action(("down","f18","f3")),19) occurs(action(("depart","f9","p5")),20) occurs(action(("depart","f9","p9")),20) occurs(action(("board","f9","p4")),20) occurs(action(("up","f3","f9")),20) Solving Time: 0.77s Memory: 167MB (+5MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 6.510s (Solving: 4.79s 1st Model: 0.75s Unsat: 0.03s) CPU Time : 6.510s Choices : 26853 Conflicts : 19554 (Analyzed: 19553) Restarts : 230 (Average: 85.01 Last: 69) Model-Level : 68.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 19716 (Deleted: 15583) Binary : 207 (Ratio: 1.05%) Ternary : 94 (Ratio: 0.48%) Conflict : 19553 (Average Length: 90.2 Ratio: 99.17%) Loop : 163 (Average Length: 25.4 Ratio: 0.83%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 19553 (Average: 1.26 Max: 81 Sum: 24693) Executed : 19535 (Average: 1.25 Max: 81 Sum: 24494 Ratio: 99.19%) Bounded : 18 (Average: 11.06 Max: 22 Sum: 199 Ratio: 0.81%) Rules : 293256 Atoms : 293256 Bodies : 1 (Original: 0) Tight : Yes Variables : 42511 (Eliminated: 0 Frozen: 40317) Constraints : 92273 (Binary: 88.9% Ternary: 10.2% Other: 0.9%) Memory Peak : 168MB Max. Length : 20 steps Sol. Length : 20 steps