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-59.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-59.pddl Parsing... Parsing: [0.040s CPU, 0.032s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.010s wall-clock] Preparing model... [0.020s CPU, 0.030s wall-clock] Generated 18 rules. Computing model... [0.110s CPU, 0.107s wall-clock] 1033 relevant atoms 684 auxiliary atoms 1717 final queue length 2246 total queue pushes Completing instantiation... [0.090s CPU, 0.091s wall-clock] Instantiating: [0.240s CPU, 0.250s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.004s 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... 24 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.010s 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.004s wall-clock] Translating task: [0.080s CPU, 0.090s wall-clock] 12 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 1 propositions removed Detecting unreachable propositions: [0.060s CPU, 0.052s wall-clock] Reordering and filtering variables... 25 of 25 variables necessary. 0 of 1 mutex groups necessary. 576 of 576 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock] Translator variables: 25 Translator derived variables: 0 Translator facts: 72 Translator goal facts: 12 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 576 Translator axioms: 0 Translator task size: 1861 Translator peak memory: 34392 KB Writing output... [0.040s CPU, 0.045s wall-clock] Done! [0.500s CPU, 0.498s wall-clock] planner.py version 0.0.1 Time: 0.09s Memory: 49MB Iteration 1 Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 49MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.04s Memory: 51MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) UNSAT Iteration Time: 0.06s Iteration 3 Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.04s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 55MB (+2MB) UNSAT Iteration Time: 0.06s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.04s Memory: 57MB (+2MB) Unblocking actions... Solving... Solving Time: 0.19s Memory: 59MB (+2MB) UNSAT Iteration Time: 0.24s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.03s Memory: 60MB (+1MB) Unblocking actions... Solving... Solving Time: 1.13s Memory: 62MB (+2MB) UNKNOWN Iteration Time: 1.18s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.03s Memory: 64MB (+2MB) Unblocking actions... Solving... Solving Time: 1.20s Memory: 66MB (+2MB) UNKNOWN Iteration Time: 1.25s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.04s Memory: 69MB (+3MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f20")),1) occurs(action(("board","f20","p8")),2) occurs(action(("down","f20","f7")),3) occurs(action(("depart","f7","p8")),4) occurs(action(("board","f7","p5")),4) occurs(action(("up","f7","f16")),5) occurs(action(("board","f16","p10")),6) occurs(action(("board","f16","p6")),6) occurs(action(("down","f16","f5")),7) occurs(action(("depart","f5","p10")),8) occurs(action(("board","f5","p3")),8) occurs(action(("down","f5","f0")),9) occurs(action(("depart","f0","p3")),10) occurs(action(("board","f0","p11")),10) occurs(action(("up","f0","f11")),11) occurs(action(("depart","f11","p11")),12) occurs(action(("down","f11","f6")),13) occurs(action(("depart","f6","p5")),14) occurs(action(("depart","f6","p6")),14) occurs(action(("board","f6","p1")),14) occurs(action(("down","f6","f3")),15) occurs(action(("board","f3","p2")),16) occurs(action(("board","f3","p4")),16) occurs(action(("up","f3","f8")),17) occurs(action(("depart","f8","p4")),18) occurs(action(("up","f8","f14")),19) occurs(action(("board","f14","p9")),20) occurs(action(("down","f14","f12")),21) occurs(action(("depart","f12","p2")),22) occurs(action(("depart","f12","p9")),22) occurs(action(("up","f12","f17")),23) occurs(action(("board","f17","p0")),24) occurs(action(("up","f17","f23")),25) occurs(action(("depart","f23","p0")),26) occurs(action(("down","f23","f10")),27) occurs(action(("board","f10","p7")),28) occurs(action(("up","f10","f19")),29) occurs(action(("depart","f19","p1")),30) occurs(action(("depart","f19","p7")),30) Solving Time: 0.16s Memory: 70MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 3.096s (Solving: 2.68s 1st Model: 0.16s Unsat: 0.19s) CPU Time : 3.100s Choices : 62155 (Domain: 62155) Conflicts : 18893 (Analyzed: 18890) Restarts : 229 (Average: 82.49 Last: 94) Model-Level : 166.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 18890 (Deleted: 13314) Binary : 149 (Ratio: 0.79%) Ternary : 299 (Ratio: 1.58%) Conflict : 18890 (Average Length: 62.2 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 18890 (Average: 2.79 Max: 39 Sum: 52681) Executed : 18865 (Average: 2.78 Max: 39 Sum: 52484 Ratio: 99.63%) Bounded : 25 (Average: 7.88 Max: 22 Sum: 197 Ratio: 0.37%) Rules : 7338 Atoms : 7338 Bodies : 1 (Original: 0) Tight : Yes Variables : 20785 (Eliminated: 0 Frozen: 16781) Constraints : 105768 (Binary: 97.3% Ternary: 1.9% Other: 0.8%) Memory Peak : 72MB Max. Length : 30 steps Sol. Length : 30 steps