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-47.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-47.pddl Parsing... Parsing: [0.010s CPU, 0.018s wall-clock] Normalizing task... [0.010s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock] Preparing model... [0.020s CPU, 0.017s wall-clock] Generated 18 rules. Computing model... [0.060s CPU, 0.068s wall-clock] 741 relevant atoms 490 auxiliary atoms 1231 final queue length 1592 total queue pushes Completing instantiation... [0.070s CPU, 0.064s wall-clock] Instantiating: [0.160s CPU, 0.164s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.000s CPU, 0.004s wall-clock] Checking invariant weight... [0.010s 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... 20 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.003s wall-clock] Translating task: [0.060s CPU, 0.062s wall-clock] 10 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.036s wall-clock] Reordering and filtering variables... 21 of 21 variables necessary. 0 of 1 mutex groups necessary. 400 of 400 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 60 Translator goal facts: 10 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 400 Translator axioms: 0 Translator task size: 1311 Translator peak memory: 33880 KB Writing output... [0.030s CPU, 0.032s wall-clock] Done! [0.320s CPU, 0.335s wall-clock] planner.py version 0.0.1 Time: 0.07s Memory: 48MB 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 (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 50MB (+1MB) UNSAT Iteration Time: 0.04s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.01s Memory: 50MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+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: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+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.03s Memory: 53MB (+2MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 54MB (+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: 55MB (+1MB) Unblocking actions... Solving... Solving Time: 0.57s Memory: 57MB (+2MB) UNSAT Iteration Time: 0.60s 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: 59MB (+2MB) Unblocking actions... Solving... Answer: 1 occurs(action(("board","f0","p0")),1) occurs(action(("board","f0","p5")),1) occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f17")),2) occurs(action(("board","f17","p6")),3) occurs(action(("down","f17","f7")),4) occurs(action(("depart","f7","p6")),5) occurs(action(("down","f7","f5")),6) occurs(action(("board","f5","p3")),7) occurs(action(("up","f5","f10")),8) occurs(action(("depart","f10","p3")),9) occurs(action(("board","f10","p7")),9) occurs(action(("board","f10","p9")),9) occurs(action(("down","f10","f1")),10) occurs(action(("depart","f1","p0")),11) occurs(action(("depart","f1","p7")),11) occurs(action(("board","f1","p4")),11) occurs(action(("up","f1","f11")),12) occurs(action(("depart","f11","p4")),13) occurs(action(("up","f11","f16")),14) occurs(action(("board","f16","p2")),15) occurs(action(("down","f16","f3")),16) occurs(action(("depart","f3","p2")),17) occurs(action(("depart","f3","p9")),17) occurs(action(("up","f3","f19")),18) occurs(action(("board","f19","p1")),19) occurs(action(("down","f19","f4")),20) occurs(action(("depart","f4","p1")),21) occurs(action(("up","f4","f18")),22) occurs(action(("down","f18","f8")),23) occurs(action(("depart","f8","p5")),24) occurs(action(("down","f8","f3")),25) occurs(action(("up","f3","f18")),26) occurs(action(("depart","f18","p8")),27) Solving Time: 0.04s Memory: 61MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 6 Time : 0.940s (Solving: 0.67s 1st Model: 0.04s Unsat: 0.63s) CPU Time : 0.930s Choices : 10486 Conflicts : 7471 (Analyzed: 7466) Restarts : 88 (Average: 84.84 Last: 58) Model-Level : 68.0 Problems : 6 (Average Length: 15.50 Splits: 0) Lemmas : 7466 (Deleted: 4442) Binary : 130 (Ratio: 1.74%) Ternary : 525 (Ratio: 7.03%) Conflict : 7466 (Average Length: 13.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 7466 (Average: 1.35 Max: 54 Sum: 10072) Executed : 7444 (Average: 1.33 Max: 54 Sum: 9959 Ratio: 98.88%) Bounded : 22 (Average: 5.14 Max: 21 Sum: 113 Ratio: 1.12%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 13661 (Eliminated: 0 Frozen: 10366) Constraints : 67178 (Binary: 96.7% Ternary: 2.4% Other: 1.0%) Memory Peak : 61MB Max. Length : 27 steps Sol. Length : 27 steps