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-57.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-57.pddl Parsing... Parsing: [0.030s CPU, 0.030s wall-clock] Normalizing task... [0.010s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock] Preparing model... [0.030s CPU, 0.029s wall-clock] Generated 18 rules. Computing model... [0.110s CPU, 0.109s wall-clock] 1033 relevant atoms 684 auxiliary atoms 1717 final queue length 2246 total queue pushes Completing instantiation... [0.100s CPU, 0.101s wall-clock] Instantiating: [0.250s CPU, 0.260s wall-clock] Computing fact groups... Finding invariants... 6 initial candidates Finding invariants: [0.010s CPU, 0.006s 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.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.010s CPU, 0.012s 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.005s wall-clock] Translating task: [0.110s CPU, 0.100s 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.059s 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.014s 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: 37580 KB Writing output... [0.050s CPU, 0.048s wall-clock] Done! [0.530s CPU, 0.529s wall-clock] planner.py version 0.0.1 Time: 0.09s Memory: 53MB 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: 53MB (+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.03s Memory: 54MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 55MB (+1MB) UNSAT Iteration Time: 0.04s 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.03s Memory: 57MB (+2MB) Unblocking actions... Solving... Solving Time: 0.44s Memory: 58MB (+1MB) UNSAT Iteration Time: 0.48s 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.03s Memory: 61MB (+3MB) Unblocking actions... Solving... Solving Time: 0.56s Memory: 63MB (+2MB) UNKNOWN Iteration Time: 0.60s 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.02s Memory: 64MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("up","f0","f6")),1) occurs(action(("board","f6","p9")),2) occurs(action(("up","f6","f15")),2) occurs(action(("depart","f15","p9")),3) occurs(action(("down","f15","f4")),3) occurs(action(("board","f4","p11")),4) occurs(action(("board","f4","p8")),4) occurs(action(("up","f4","f18")),4) occurs(action(("depart","f18","p8")),5) occurs(action(("down","f18","f5")),5) occurs(action(("board","f18","p7")),5) occurs(action(("board","f5","p6")),6) occurs(action(("up","f5","f11")),6) occurs(action(("depart","f11","p6")),7) occurs(action(("up","f11","f13")),7) occurs(action(("depart","f13","p7")),8) occurs(action(("board","f13","p4")),8) occurs(action(("down","f13","f12")),8) occurs(action(("board","f12","p5")),9) occurs(action(("down","f12","f4")),9) occurs(action(("depart","f4","p5")),10) occurs(action(("board","f4","p11")),10) occurs(action(("up","f4","f19")),10) occurs(action(("board","f4","p8")),10) occurs(action(("depart","f19","p4")),11) occurs(action(("down","f19","f16")),11) occurs(action(("board","f16","p2")),12) occurs(action(("down","f16","f7")),12) occurs(action(("depart","f7","p2")),13) occurs(action(("up","f7","f23")),13) occurs(action(("depart","f23","p11")),14) occurs(action(("board","f23","p1")),14) occurs(action(("down","f23","f20")),14) occurs(action(("depart","f20","p1")),15) occurs(action(("down","f20","f8")),15) occurs(action(("board","f8","p0")),16) occurs(action(("down","f8","f5")),16) occurs(action(("depart","f5","p0")),17) occurs(action(("down","f5","f1")),17) occurs(action(("board","f1","p3")),18) occurs(action(("up","f1","f22")),18) occurs(action(("depart","f22","p3")),19) occurs(action(("board","f22","p10")),19) occurs(action(("down","f22","f5")),19) occurs(action(("depart","f5","p10")),20) occurs(action(("board","f5","p6")),20) occurs(action(("up","f5","f6")),20) Solving Time: 0.00s Memory: 65MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 5 Time : 1.261s (Solving: 1.00s 1st Model: 0.00s Unsat: 0.44s) CPU Time : 1.256s Choices : 34387 (Domain: 34362) Conflicts : 16610 (Analyzed: 16608) Restarts : 198 (Average: 83.88 Last: 63) Model-Level : 148.0 Problems : 5 (Average Length: 12.00 Splits: 0) Lemmas : 16608 (Deleted: 12595) Binary : 0 (Ratio: 0.00%) Ternary : 12 (Ratio: 0.07%) Conflict : 16608 (Average Length: 26.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 16608 (Average: 1.80 Max: 24 Sum: 29918) Executed : 16593 (Average: 1.80 Max: 24 Sum: 29903 Ratio: 99.95%) Bounded : 15 (Average: 1.00 Max: 1 Sum: 15 Ratio: 0.05%) Rules : 6774 Atoms : 6774 Bodies : 1 (Original: 0) Tight : Yes Variables : 13383 (Eliminated: 0 Frozen: 480) Constraints : 57496 (Binary: 97.2% Ternary: 1.9% Other: 0.9%) Memory Peak : 66MB Max. Length : 20 steps Sol. Length : 20 steps