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-45.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-45.pddl Parsing... Parsing: [0.020s CPU, 0.021s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.020s CPU, 0.018s wall-clock] Generated 18 rules. Computing model... [0.060s CPU, 0.066s wall-clock] 613 relevant atoms 405 auxiliary atoms 1018 final queue length 1307 total queue pushes Completing instantiation... [0.060s CPU, 0.055s wall-clock] Instantiating: [0.160s CPU, 0.157s 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.000s CPU, 0.000s wall-clock] Building translation key... [0.010s 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.050s CPU, 0.051s 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.030s CPU, 0.031s 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.010s CPU, 0.007s 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.025s wall-clock] Done! [0.300s CPU, 0.305s 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.07s Memory: 53MB (+1MB) UNSAT Iteration Time: 0.10s 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.60s Memory: 55MB (+1MB) UNKNOWN Iteration Time: 0.63s 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.03s Memory: 57MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p2")),1) occurs(action(("board","f0","p7")),1) occurs(action(("up","f0","f2")),2) occurs(action(("board","f2","p5")),3) occurs(action(("board","f2","p6")),3) occurs(action(("board","f2","p8")),3) occurs(action(("up","f2","f3")),4) occurs(action(("depart","f3","p6")),5) occurs(action(("board","f3","p4")),5) occurs(action(("up","f3","f13")),6) occurs(action(("depart","f13","p8")),7) occurs(action(("down","f13","f9")),8) occurs(action(("board","f9","p0")),9) occurs(action(("up","f9","f10")),10) occurs(action(("depart","f10","p2")),11) occurs(action(("up","f10","f17")),12) occurs(action(("board","f17","p3")),13) occurs(action(("down","f17","f15")),14) occurs(action(("depart","f15","p0")),15) occurs(action(("depart","f15","p3")),15) occurs(action(("depart","f15","p7")),15) occurs(action(("down","f15","f0")),16) occurs(action(("board","f0","p2")),17) occurs(action(("up","f0","f12")),18) occurs(action(("board","f12","p1")),19) occurs(action(("down","f12","f2")),20) occurs(action(("up","f2","f6")),21) occurs(action(("down","f6","f2")),22) occurs(action(("depart","f2","p1")),23) occurs(action(("depart","f2","p4")),23) occurs(action(("board","f2","p5")),23) occurs(action(("board","f2","p6")),23) occurs(action(("board","f2","p8")),23) occurs(action(("up","f2","f10")),24) occurs(action(("depart","f10","p2")),25) occurs(action(("down","f10","f1")),26) occurs(action(("depart","f1","p5")),27) Solving Time: 0.01s Memory: 59MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 0.929s (Solving: 0.68s 1st Model: 0.01s Unsat: 0.07s) CPU Time : 0.940s Choices : 12350 Conflicts : 9557 (Analyzed: 9553) Restarts : 110 (Average: 86.85 Last: 74) Model-Level : 61.0 Problems : 6 (Average Length: 15.50 Splits: 0) Lemmas : 9553 (Deleted: 6766) Binary : 104 (Ratio: 1.09%) Ternary : 416 (Ratio: 4.35%) Conflict : 9553 (Average Length: 13.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 9553 (Average: 1.25 Max: 39 Sum: 11927) Executed : 9533 (Average: 1.24 Max: 39 Sum: 11821 Ratio: 99.11%) Bounded : 20 (Average: 5.30 Max: 21 Sum: 106 Ratio: 0.89%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 11369 (Eliminated: 0 Frozen: 8396) Constraints : 54830 (Binary: 96.3% Ternary: 2.6% Other: 1.1%) Memory Peak : 59MB Max. Length : 27 steps Sol. Length : 27 steps