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-46.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-46.pddl Parsing... Parsing: [0.020s CPU, 0.024s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.030s CPU, 0.021s wall-clock] Generated 18 rules. Computing model... [0.070s CPU, 0.073s wall-clock] 741 relevant atoms 490 auxiliary atoms 1231 final queue length 1592 total queue pushes Completing instantiation... [0.060s CPU, 0.064s 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.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.003s wall-clock] Translating task: [0.060s CPU, 0.061s 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.033s wall-clock] Done! [0.340s CPU, 0.354s 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.27s 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.87s Memory: 134MB (+3MB) UNKNOWN Iteration Time: 2.11s 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: 146MB (+12MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f13")),1) occurs(action(("board","f13","p2")),2) occurs(action(("board","f2","p5")),2) occurs(action(("down","f13","f2")),2) occurs(action(("board","f9","p4")),3) occurs(action(("board","f2","p5")),3) occurs(action(("up","f2","f9")),3) occurs(action(("depart","f1","p4")),4) occurs(action(("down","f9","f1")),4) occurs(action(("board","f17","p1")),5) occurs(action(("up","f1","f17")),5) occurs(action(("board","f17","p1")),6) occurs(action(("down","f17","f15")),6) occurs(action(("depart","f15","p1")),7) occurs(action(("depart","f15","p2")),7) occurs(action(("depart","f6","p8")),7) occurs(action(("board","f6","p3")),7) occurs(action(("down","f15","f6")),7) occurs(action(("board","f3","p0")),8) occurs(action(("board","f6","p3")),8) occurs(action(("board","f3","p7")),8) occurs(action(("down","f6","f3")),8) occurs(action(("board","f3","p0")),9) occurs(action(("up","f3","f12")),9) occurs(action(("board","f3","p7")),9) occurs(action(("board","f12","p9")),9) occurs(action(("board","f10","p6")),10) occurs(action(("board","f12","p9")),10) occurs(action(("down","f12","f10")),10) occurs(action(("board","f10","p6")),11) occurs(action(("up","f10","f16")),11) occurs(action(("depart","f7","p5")),12) occurs(action(("depart","f16","p9")),12) occurs(action(("down","f16","f7")),12) occurs(action(("board","f6","p3")),13) occurs(action(("down","f7","f6")),13) occurs(action(("depart","f6","p0")),14) occurs(action(("depart","f12","p3")),14) occurs(action(("depart","f6","p7")),14) occurs(action(("up","f6","f12")),14) occurs(action(("board","f12","p9")),14) occurs(action(("depart","f19","p6")),15) occurs(action(("up","f12","f19")),15) Solving Time: 1.97s Memory: 150MB (+4MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 5.247s (Solving: 3.84s 1st Model: 1.95s Unsat: 0.03s) CPU Time : 5.240s Choices : 21310 Conflicts : 15931 (Analyzed: 15930) Restarts : 191 (Average: 83.40 Last: 62) Model-Level : 68.0 Problems : 4 (Average Length: 9.50 Splits: 0) Lemmas : 16001 (Deleted: 11833) Binary : 163 (Ratio: 1.02%) Ternary : 110 (Ratio: 0.69%) Conflict : 15930 (Average Length: 73.4 Ratio: 99.56%) Loop : 71 (Average Length: 30.4 Ratio: 0.44%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 15930 (Average: 1.23 Max: 84 Sum: 19653) Executed : 15906 (Average: 1.22 Max: 84 Sum: 19377 Ratio: 98.60%) Bounded : 24 (Average: 11.50 Max: 17 Sum: 276 Ratio: 1.40%) Rules : 293256 Atoms : 293256 Bodies : 1 (Original: 0) Tight : Yes Variables : 31871 (Eliminated: 0 Frozen: 30218) Constraints : 69122 (Binary: 88.9% Ternary: 10.2% Other: 0.9%) Memory Peak : 151MB Max. Length : 15 steps Sol. Length : 15 steps