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-44.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-44.pddl Parsing... Parsing: [0.020s CPU, 0.024s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock] Preparing model... [0.020s CPU, 0.020s wall-clock] Generated 18 rules. Computing model... [0.070s CPU, 0.070s wall-clock] 613 relevant atoms 405 auxiliary atoms 1018 final queue length 1307 total queue pushes Completing instantiation... [0.060s CPU, 0.056s wall-clock] Instantiating: [0.170s CPU, 0.167s 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... 18 uncovered facts Choosing groups: [0.010s 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.040s CPU, 0.048s wall-clock] 9 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.030s wall-clock] Reordering and filtering variables... 19 of 19 variables necessary. 0 of 1 mutex groups necessary. 324 of 324 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.008s wall-clock] Translator variables: 19 Translator derived variables: 0 Translator facts: 54 Translator goal facts: 9 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 324 Translator axioms: 0 Translator task size: 1072 Translator peak memory: 33624 KB Writing output... [0.020s CPU, 0.027s wall-clock] Done! [0.310s CPU, 0.318s wall-clock] planner.py version 0.0.1 Time: 0.06s Memory: 47MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.03s Memory: 49MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 49MB (+0MB) UNSAT Iteration Time: 0.04s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.01s Memory: 49MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+1MB) UNSAT Iteration Time: 0.02s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.01s Memory: 50MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+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.02s Memory: 52MB (+2MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.09s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.02s Memory: 54MB (+1MB) Unblocking actions... Solving... Solving Time: 0.40s Memory: 55MB (+1MB) UNSAT Iteration Time: 0.43s Iteration 6 Queue: [27] 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.03s Memory: 57MB (+2MB) Unblocking actions... Solving... Solving Time: 0.64s Memory: 59MB (+2MB) UNKNOWN Iteration Time: 0.68s Iteration 7 Queue: [39, 27] Grounded Until: 27 Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])] Grounding Time: 0.05s Memory: 62MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f6")),1) occurs(action(("board","f6","p2")),2) occurs(action(("board","f6","p5")),2) occurs(action(("up","f6","f11")),3) occurs(action(("board","f11","p0")),4) occurs(action(("down","f11","f0")),5) occurs(action(("depart","f0","p0")),6) occurs(action(("up","f0","f13")),7) occurs(action(("board","f13","p1")),8) occurs(action(("down","f13","f3")),9) occurs(action(("depart","f3","p1")),10) occurs(action(("up","f3","f16")),11) occurs(action(("depart","f16","p5")),12) occurs(action(("down","f16","f12")),13) occurs(action(("board","f12","p6")),14) occurs(action(("up","f12","f13")),15) occurs(action(("board","f13","p1")),16) occurs(action(("up","f13","f14")),17) occurs(action(("board","f14","p4")),18) occurs(action(("down","f14","f6")),19) occurs(action(("board","f6","p2")),20) occurs(action(("board","f6","p3")),20) occurs(action(("board","f6","p2")),21) occurs(action(("board","f6","p3")),21) occurs(action(("down","f6","f1")),22) occurs(action(("board","f1","p7")),23) occurs(action(("board","f1","p8")),23) occurs(action(("up","f1","f12")),24) occurs(action(("board","f12","p6")),25) occurs(action(("board","f12","p6")),26) occurs(action(("board","f12","p6")),27) occurs(action(("down","f12","f1")),28) occurs(action(("board","f1","p7")),29) occurs(action(("board","f1","p8")),29) occurs(action(("up","f1","f8")),30) occurs(action(("depart","f8","p7")),31) occurs(action(("depart","f8","p8")),31) occurs(action(("down","f8","f4")),32) occurs(action(("depart","f4","p6")),33) occurs(action(("up","f4","f5")),34) occurs(action(("depart","f5","p2")),35) occurs(action(("up","f5","f7")),36) occurs(action(("depart","f7","p4")),37) occurs(action(("up","f7","f15")),38) occurs(action(("depart","f15","p3")),39) Solving Time: 0.03s Memory: 65MB (+3MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 1.433s (Solving: 1.12s 1st Model: 0.02s Unsat: 0.46s) CPU Time : 1.430s Choices : 22164 Conflicts : 14651 (Analyzed: 14646) Restarts : 170 (Average: 86.15 Last: 69) Model-Level : 87.0 Problems : 7 (Average Length: 19.14 Splits: 0) Lemmas : 14646 (Deleted: 7607) Binary : 133 (Ratio: 0.91%) Ternary : 1066 (Ratio: 7.28%) Conflict : 14646 (Average Length: 13.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 14646 (Average: 1.41 Max: 69 Sum: 20600) Executed : 14614 (Average: 1.40 Max: 69 Sum: 20435 Ratio: 99.20%) Bounded : 32 (Average: 5.16 Max: 29 Sum: 165 Ratio: 0.80%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 16502 (Eliminated: 0 Frozen: 12296) Constraints : 79908 (Binary: 96.3% Ternary: 2.6% Other: 1.1%) Memory Peak : 65MB Max. Length : 39 steps Sol. Length : 39 steps