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-48.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-48.pddl Parsing... Parsing: [0.020s CPU, 0.022s 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.000s CPU, 0.009s wall-clock] Preparing model... [0.020s CPU, 0.019s wall-clock] Generated 18 rules. Computing model... [0.070s CPU, 0.071s wall-clock] 741 relevant atoms 490 auxiliary atoms 1231 final queue length 1592 total queue pushes Completing instantiation... [0.070s CPU, 0.065s wall-clock] Instantiating: [0.170s CPU, 0.171s 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... 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.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.038s 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.340s CPU, 0.346s wall-clock] planner.py version 0.0.1 Time: 0.08s Memory: 48MB Iteration 1 Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 48MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.03s Memory: 49MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+1MB) UNSAT Iteration Time: 0.05s Iteration 3 Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.03s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 52MB (+1MB) UNSAT Iteration Time: 0.05s Iteration 4 Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.03s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.14s Memory: 55MB (+2MB) UNSAT Iteration Time: 0.18s Iteration 5 Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.02s Memory: 56MB (+1MB) Unblocking actions... Solving... Solving Time: 0.87s Memory: 57MB (+1MB) UNKNOWN Iteration Time: 0.91s Iteration 6 Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.02s Memory: 58MB (+1MB) Unblocking actions... Solving... Solving Time: 0.87s Memory: 60MB (+2MB) UNKNOWN Iteration Time: 0.91s Iteration 7 Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 20, 25] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.02s Memory: 61MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p9")),1) occurs(action(("up","f0","f2")),2) occurs(action(("board","f2","p6")),3) occurs(action(("up","f2","f15")),4) occurs(action(("board","f15","p8")),5) occurs(action(("down","f15","f4")),6) occurs(action(("board","f4","p1")),7) occurs(action(("up","f4","f13")),8) occurs(action(("board","f13","p2")),9) occurs(action(("down","f13","f6")),10) occurs(action(("depart","f6","p6")),11) occurs(action(("down","f6","f4")),12) occurs(action(("up","f4","f19")),13) occurs(action(("board","f19","p4")),14) occurs(action(("down","f19","f3")),15) occurs(action(("board","f3","p0")),16) occurs(action(("board","f3","p5")),16) occurs(action(("up","f3","f10")),17) occurs(action(("depart","f10","p4")),18) occurs(action(("board","f10","p3")),18) occurs(action(("up","f10","f14")),19) occurs(action(("depart","f14","p2")),20) occurs(action(("depart","f14","p3")),20) occurs(action(("board","f14","p7")),20) occurs(action(("down","f14","f5")),21) occurs(action(("depart","f5","p7")),22) occurs(action(("depart","f5","p9")),22) occurs(action(("down","f5","f2")),23) occurs(action(("depart","f2","p1")),24) occurs(action(("down","f2","f0")),25) occurs(action(("depart","f0","p0")),26) occurs(action(("up","f0","f4")),27) occurs(action(("depart","f4","p8")),28) occurs(action(("up","f4","f11")),29) occurs(action(("depart","f11","p5")),30) Solving Time: 0.01s Memory: 61MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 2.217s (Solving: 1.90s 1st Model: 0.01s Unsat: 0.15s) CPU Time : 2.220s Choices : 27259 Conflicts : 19107 (Analyzed: 19104) Restarts : 217 (Average: 88.04 Last: 96) Model-Level : 59.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 19104 (Deleted: 12400) Binary : 233 (Ratio: 1.22%) Ternary : 1073 (Ratio: 5.62%) Conflict : 19104 (Average Length: 13.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 19104 (Average: 1.35 Max: 41 Sum: 25697) Executed : 19078 (Average: 1.34 Max: 41 Sum: 25532 Ratio: 99.36%) Bounded : 26 (Average: 6.35 Max: 22 Sum: 165 Ratio: 0.64%) Rules : 5156 Atoms : 5156 Bodies : 1 (Original: 0) Tight : Yes Variables : 15027 (Eliminated: 0 Frozen: 11669) Constraints : 74275 (Binary: 96.8% Ternary: 2.2% Other: 1.0%) Memory Peak : 63MB Max. Length : 30 steps Sol. Length : 30 steps