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-26.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-26.pddl Parsing... Parsing: [0.020s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.011s wall-clock] Preparing model... [0.010s CPU, 0.011s wall-clock] Generated 18 rules. Computing model... [0.040s CPU, 0.038s wall-clock] 301 relevant atoms 198 auxiliary atoms 499 final queue length 620 total queue pushes Completing instantiation... [0.030s CPU, 0.028s wall-clock] Instantiating: [0.090s CPU, 0.094s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.006s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 12 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.008s 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.001s wall-clock] Translating task: [0.020s CPU, 0.025s wall-clock] 6 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.015s wall-clock] Reordering and filtering variables... 13 of 13 variables necessary. 0 of 1 mutex groups necessary. 144 of 144 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock] Translator variables: 13 Translator derived variables: 0 Translator facts: 36 Translator goal facts: 6 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 144 Translator axioms: 0 Translator task size: 499 Translator peak memory: 33112 KB Writing output... [0.010s CPU, 0.013s wall-clock] Done! [0.180s CPU, 0.178s wall-clock] planner.py version 0.0.1 Time: 0.03s Memory: 46MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.02s Memory: 47MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 47MB (+0MB) UNSAT Iteration Time: 0.02s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.01s Memory: 47MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 48MB (+1MB) UNSAT Iteration Time: 0.01s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.01s Memory: 48MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 48MB (+0MB) UNSAT Iteration Time: 0.01s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.02s Memory: 49MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f5")),1) occurs(action(("board","f5","p2")),2) occurs(action(("up","f5","f9")),3) occurs(action(("board","f9","p1")),4) occurs(action(("board","f9","p4")),4) occurs(action(("down","f9","f2")),5) occurs(action(("board","f2","p5")),6) occurs(action(("up","f2","f7")),7) occurs(action(("depart","f7","p1")),8) occurs(action(("depart","f7","p2")),8) occurs(action(("depart","f7","p5")),8) occurs(action(("board","f7","p0")),8) occurs(action(("up","f7","f10")),9) occurs(action(("depart","f10","p0")),10) occurs(action(("board","f10","p3")),10) occurs(action(("down","f10","f1")),11) occurs(action(("depart","f1","p4")),12) occurs(action(("down","f1","f0")),13) occurs(action(("depart","f0","p3")),14) Solving Time: 0.01s Memory: 49MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 0.112s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s) CPU Time : 0.120s Choices : 222 Conflicts : 128 (Analyzed: 125) Restarts : 0 Model-Level : 26.0 Problems : 4 (Average Length: 10.75 Splits: 0) Lemmas : 125 (Deleted: 0) Binary : 9 (Ratio: 7.20%) Ternary : 22 (Ratio: 17.60%) Conflict : 125 (Average Length: 8.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 125 (Average: 1.78 Max: 15 Sum: 222) Executed : 121 (Average: 1.70 Max: 15 Sum: 212 Ratio: 95.50%) Bounded : 4 (Average: 2.50 Max: 7 Sum: 10 Ratio: 4.50%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 2946 (Eliminated: 0 Frozen: 1849) Constraints : 12812 (Binary: 94.5% Ternary: 3.8% Other: 1.7%) Memory Peak : 49MB Max. Length : 14 steps Sol. Length : 14 steps