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-52.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-52.pddl Parsing... Parsing: [0.030s CPU, 0.028s 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.010s wall-clock] Preparing model... [0.030s CPU, 0.026s wall-clock] Generated 18 rules. Computing model... [0.090s CPU, 0.091s wall-clock] 881 relevant atoms 583 auxiliary atoms 1464 final queue length 1905 total queue pushes Completing instantiation... [0.070s CPU, 0.076s wall-clock] Instantiating: [0.210s CPU, 0.212s 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.001s 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.010s CPU, 0.004s wall-clock] Translating task: [0.080s 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.040s 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.020s 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.039s wall-clock] Done! [0.430s CPU, 0.427s wall-clock] planner.py version 0.0.1 Time: 0.08s Memory: 49MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.04s Memory: 50MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+1MB) UNSAT Iteration Time: 0.05s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.01s Memory: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) UNSAT Iteration Time: 0.02s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.01s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.02s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.03s Memory: 54MB (+2MB) Unblocking actions... Solving... Solving Time: 0.11s Memory: 56MB (+2MB) UNSAT Iteration Time: 0.15s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.03s Memory: 57MB (+1MB) Unblocking actions... Solving... Solving Time: 0.94s Memory: 59MB (+2MB) UNKNOWN Iteration Time: 0.98s Iteration 6 Queue: [27, 19] Grounded Until: 19 Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])] Grounding Time: 0.04s Memory: 62MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p0")),1) occurs(action(("up","f0","f11")),2) occurs(action(("board","f11","p1")),3) occurs(action(("up","f11","f16")),4) occurs(action(("depart","f16","p1")),5) occurs(action(("board","f16","p10")),5) occurs(action(("down","f16","f13")),6) occurs(action(("depart","f13","p10")),7) occurs(action(("board","f13","p3")),7) occurs(action(("up","f13","f20")),8) occurs(action(("board","f20","p5")),9) occurs(action(("down","f20","f14")),10) occurs(action(("board","f14","p8")),11) occurs(action(("board","f14","p9")),11) occurs(action(("down","f14","f4")),12) occurs(action(("board","f4","p2")),13) occurs(action(("board","f4","p7")),13) occurs(action(("up","f4","f15")),14) occurs(action(("depart","f15","p7")),15) occurs(action(("board","f15","p6")),15) occurs(action(("up","f15","f17")),16) occurs(action(("depart","f17","p2")),17) occurs(action(("depart","f17","p6")),17) occurs(action(("depart","f17","p9")),17) occurs(action(("board","f17","p4")),17) occurs(action(("up","f17","f18")),18) occurs(action(("depart","f18","p3")),19) occurs(action(("down","f18","f7")),20) occurs(action(("depart","f7","p4")),21) occurs(action(("up","f7","f16")),22) occurs(action(("down","f16","f2")),23) occurs(action(("depart","f2","p5")),24) occurs(action(("depart","f2","p8")),24) occurs(action(("down","f2","f1")),25) occurs(action(("depart","f1","p0")),26) occurs(action(("up","f1","f18")),27) Solving Time: 0.49s Memory: 64MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 1.859s (Solving: 1.53s 1st Model: 0.48s Unsat: 0.11s) CPU Time : 1.850s Choices : 18448 Conflicts : 13337 (Analyzed: 13333) Restarts : 163 (Average: 81.80 Last: 63) Model-Level : 66.0 Problems : 6 (Average Length: 15.50 Splits: 0) Lemmas : 13333 (Deleted: 7205) Binary : 138 (Ratio: 1.04%) Ternary : 615 (Ratio: 4.61%) Conflict : 13333 (Average Length: 16.5 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 13333 (Average: 1.29 Max: 34 Sum: 17180) Executed : 13314 (Average: 1.28 Max: 34 Sum: 17033 Ratio: 99.14%) Bounded : 19 (Average: 7.74 Max: 21 Sum: 147 Ratio: 0.86%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 16155 (Eliminated: 0 Frozen: 12544) Constraints : 80694 (Binary: 97.0% Ternary: 2.2% Other: 0.9%) Memory Peak : 64MB Max. Length : 27 steps Sol. Length : 27 steps