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-36.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-36.pddl Parsing... Parsing: [0.010s CPU, 0.015s 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.008s wall-clock] Preparing model... [0.020s CPU, 0.012s wall-clock] Generated 18 rules. Computing model... [0.040s CPU, 0.046s wall-clock] 497 relevant atoms 328 auxiliary atoms 825 final queue length 1050 total queue pushes Completing instantiation... [0.050s CPU, 0.042s wall-clock] Instantiating: [0.120s CPU, 0.114s 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... 16 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.000s 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.010s CPU, 0.002s wall-clock] Translating task: [0.040s CPU, 0.040s wall-clock] 8 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.030s CPU, 0.023s wall-clock] Reordering and filtering variables... 17 of 17 variables necessary. 0 of 1 mutex groups necessary. 256 of 256 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.006s wall-clock] Translator variables: 17 Translator derived variables: 0 Translator facts: 48 Translator goal facts: 8 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 256 Translator axioms: 0 Translator task size: 857 Translator peak memory: 33624 KB Writing output... [0.010s CPU, 0.021s wall-clock] Done! [0.220s CPU, 0.232s wall-clock] planner.py version 0.0.1 Time: 0.05s Memory: 47MB 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: 47MB (+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: 48MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 48MB (+0MB) UNSAT Iteration Time: 0.03s 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.02s Memory: 49MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 50MB (+1MB) UNSAT Iteration Time: 0.04s 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.02s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.14s Memory: 52MB (+1MB) UNSAT Iteration Time: 0.17s 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: 52MB (+0MB) Unblocking actions... Solving... Solving Time: 0.61s Memory: 53MB (+1MB) UNKNOWN Iteration Time: 0.63s 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: 54MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f1")),1) occurs(action(("board","f1","p2")),2) occurs(action(("up","f1","f10")),3) occurs(action(("board","f10","p3")),4) occurs(action(("board","f10","p5")),4) occurs(action(("down","f10","f2")),5) occurs(action(("board","f2","p6")),6) occurs(action(("up","f2","f7")),7) occurs(action(("board","f7","p0")),8) occurs(action(("up","f7","f15")),9) occurs(action(("depart","f15","p2")),10) occurs(action(("down","f15","f9")),11) occurs(action(("board","f9","p1")),12) occurs(action(("board","f9","p4")),12) occurs(action(("down","f9","f3")),13) occurs(action(("depart","f3","p1")),14) occurs(action(("board","f3","p7")),14) occurs(action(("up","f3","f13")),15) occurs(action(("depart","f13","p4")),16) occurs(action(("down","f13","f9")),17) occurs(action(("board","f9","p1")),18) occurs(action(("board","f9","p4")),18) occurs(action(("down","f9","f0")),19) occurs(action(("up","f0","f11")),20) occurs(action(("depart","f11","p5")),21) occurs(action(("depart","f11","p6")),21) occurs(action(("up","f11","f12")),22) occurs(action(("depart","f12","p3")),23) occurs(action(("down","f12","f6")),24) occurs(action(("depart","f6","p0")),25) occurs(action(("depart","f6","p7")),25) Solving Time: 0.00s Memory: 55MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 0.948s (Solving: 0.75s 1st Model: 0.00s Unsat: 0.15s) CPU Time : 0.950s Choices : 14819 Conflicts : 10281 (Analyzed: 10278) Restarts : 122 (Average: 84.25 Last: 111) Model-Level : 66.0 Problems : 6 (Average Length: 14.50 Splits: 0) Lemmas : 10278 (Deleted: 5245) Binary : 193 (Ratio: 1.88%) Ternary : 594 (Ratio: 5.78%) Conflict : 10278 (Average Length: 14.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 10278 (Average: 1.38 Max: 38 Sum: 14202) Executed : 10263 (Average: 1.37 Max: 38 Sum: 14079 Ratio: 99.13%) Bounded : 15 (Average: 8.20 Max: 17 Sum: 123 Ratio: 0.87%) Rules : 3358 Atoms : 3358 Bodies : 1 (Original: 0) Tight : Yes Variables : 8449 (Eliminated: 0 Frozen: 6200) Constraints : 39940 (Binary: 96.0% Ternary: 2.7% Other: 1.3%) Memory Peak : 55MB Max. Length : 25 steps Sol. Length : 25 steps