INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-15.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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-15.pddl Parsing... Parsing: [0.020s CPU, 0.025s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock] Preparing model... [0.020s CPU, 0.016s wall-clock] Generated 25 rules. Computing model... [0.080s CPU, 0.087s wall-clock] 461 relevant atoms 611 auxiliary atoms 1072 final queue length 1647 total queue pushes Completing instantiation... [0.090s CPU, 0.088s wall-clock] Instantiating: [0.210s CPU, 0.212s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.030s CPU, 0.027s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.000s CPU, 0.001s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.000s CPU, 0.002s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.040s CPU, 0.038s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.004s wall-clock] Translating task: [0.070s CPU, 0.073s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 34 propositions removed Detecting unreachable propositions: [0.040s CPU, 0.042s wall-clock] Reordering and filtering variables... 34 of 34 variables necessary. 0 of 34 mutex groups necessary. 185 of 185 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.030s CPU, 0.023s wall-clock] Translator variables: 34 Translator derived variables: 0 Translator facts: 100 Translator goal facts: 33 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 185 Translator axioms: 0 Translator task size: 1634 Translator peak memory: 37068 KB Writing output... [0.030s CPU, 0.029s wall-clock] Done! [0.440s CPU, 0.451s wall-clock] planner.py version 0.0.1 Time: 0.06s Memory: 52MB 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: 52MB (+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 Expected Memory: 52MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.02s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.03s 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 Expected Memory: 56.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.02s Memory: 55MB (+1MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 56MB (+1MB) UNSAT Iteration Time: 0.05s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 58.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.02s Memory: 57MB (+1MB) Unblocking actions... Solving... Solving Time: 0.86s Memory: 61MB (+4MB) UNKNOWN Iteration Time: 0.89s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Expected Memory: 66.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.02s Memory: 61MB (+0MB) Unblocking actions... Solving... Solving Time: 0.96s Memory: 66MB (+5MB) UNKNOWN Iteration Time: 0.99s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Expected Memory: 71.0MB Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.02s Memory: 68MB (+2MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 69MB (+1MB) SAT Testing... SERIALIZABLE Testing Time: 0.04s Memory: 69MB (+0MB) Answer: 1 occurs(action(("jump-new-move","pos-4-0","pos-3-0","pos-2-0")),1) occurs(action(("end-move","pos-2-0")),2) occurs(action(("jump-new-move","pos-4-6","pos-3-6","pos-2-6")),3) occurs(action(("end-move","pos-2-6")),4) occurs(action(("jump-new-move","pos-6-2","pos-6-3","pos-6-4")),5) occurs(action(("end-move","pos-6-4")),6) occurs(action(("jump-new-move","pos-3-4","pos-4-4","pos-5-4")),7) occurs(action(("end-move","pos-5-4")),8) occurs(action(("jump-new-move","pos-6-4","pos-5-4","pos-4-4")),9) occurs(action(("end-move","pos-4-4")),10) occurs(action(("jump-new-move","pos-2-6","pos-2-5","pos-2-4")),11) occurs(action(("jump-continue-move","pos-2-4","pos-2-3","pos-2-2")),12) occurs(action(("end-move","pos-2-2")),13) occurs(action(("jump-new-move","pos-4-5","pos-4-4","pos-4-3")),14) occurs(action(("jump-continue-move","pos-4-3","pos-3-3","pos-2-3")),15) occurs(action(("jump-continue-move","pos-2-3","pos-2-2","pos-2-1")),16) occurs(action(("end-move","pos-2-1")),17) occurs(action(("jump-new-move","pos-2-0","pos-2-1","pos-2-2")),18) occurs(action(("end-move","pos-2-2")),19) occurs(action(("jump-new-move","pos-2-2","pos-3-2","pos-4-2")),20) occurs(action(("end-move","pos-4-2")),21) occurs(action(("jump-new-move","pos-4-1","pos-4-2","pos-4-3")),22) occurs(action(("end-move","pos-4-3")),23) occurs(action(("jump-new-move","pos-5-3","pos-4-3","pos-3-3")),24) occurs(action(("end-move","pos-3-3")),25) SATISFIABLE Models : 1+ Calls : 6 Time : 2.119s (Solving: 1.88s 1st Model: 0.05s Unsat: 0.02s) CPU Time : 2.116s Choices : 48643 (Domain: 48643) Conflicts : 18373 (Analyzed: 18371) Restarts : 210 (Average: 87.48 Last: 110) Model-Level : 129.0 Problems : 6 (Average Length: 14.50 Splits: 0) Lemmas : 18371 (Deleted: 12875) Binary : 270 (Ratio: 1.47%) Ternary : 211 (Ratio: 1.15%) Conflict : 18371 (Average Length: 293.6 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 18371 (Average: 2.17 Max: 122 Sum: 39798) Executed : 18307 (Average: 2.15 Max: 122 Sum: 39474 Ratio: 99.19%) Bounded : 64 (Average: 5.06 Max: 21 Sum: 324 Ratio: 0.81%) Rules : 4920 Atoms : 4920 Bodies : 1 (Original: 0) Tight : Yes Variables : 9463 (Eliminated: 0 Frozen: 827) Constraints : 55634 (Binary: 92.8% Ternary: 4.6% Other: 2.6%) Memory Peak : 71MB Max. Length : 25 steps Sol. Length : 25 steps Models : 1