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-6.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-6.pddl Parsing... Parsing: [0.040s CPU, 0.031s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock] Preparing model... [0.020s CPU, 0.020s wall-clock] Generated 25 rules. Computing model... [0.100s CPU, 0.102s wall-clock] 461 relevant atoms 611 auxiliary atoms 1072 final queue length 1647 total queue pushes Completing instantiation... [0.090s CPU, 0.091s wall-clock] Instantiating: [0.230s CPU, 0.240s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.030s CPU, 0.023s 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.034s 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.075s 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.039s 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.050s CPU, 0.044s wall-clock] Done! [0.500s CPU, 0.495s wall-clock] planner.py version 0.0.1 Time: 0.08s 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.03s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 54MB (+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 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.00s Memory: 56MB (+1MB) UNSAT Iteration Time: 0.04s 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.00s Memory: 58MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.07s Memory: 60MB (+2MB) Solving... Solving Time: 0.61s Memory: 61MB (+1MB) UNSAT Iteration Time: 0.72s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Expected Memory: 63.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.04s Memory: 63MB (+2MB) Unblocking actions... Solving... Solving Time: 1.27s Memory: 68MB (+5MB) UNKNOWN Iteration Time: 1.32s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Expected Memory: 75.0MB Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.04s Memory: 68MB (+0MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 68MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 68MB (+0MB) Answer: 2 occurs(action(("jump-new-move","pos-4-3","pos-4-2","pos-4-1")),1) occurs(action(("end-move","pos-4-1")),2) occurs(action(("jump-new-move","pos-2-2","pos-3-2","pos-4-2")),3) occurs(action(("end-move","pos-4-2")),4) occurs(action(("jump-new-move","pos-0-2","pos-1-2","pos-2-2")),5) occurs(action(("end-move","pos-2-2")),6) occurs(action(("jump-new-move","pos-3-4","pos-2-4","pos-1-4")),7) occurs(action(("end-move","pos-1-4")),8) occurs(action(("jump-new-move","pos-0-4","pos-1-4","pos-2-4")),9) occurs(action(("end-move","pos-2-4")),10) occurs(action(("jump-new-move","pos-4-1","pos-4-2","pos-4-3")),11) occurs(action(("jump-continue-move","pos-4-3","pos-4-4","pos-4-5")),12) occurs(action(("jump-continue-move","pos-4-5","pos-3-5","pos-2-5")),13) occurs(action(("end-move","pos-2-5")),14) occurs(action(("jump-new-move","pos-0-3","pos-1-3","pos-2-3")),15) occurs(action(("jump-continue-move","pos-2-3","pos-3-3","pos-4-3")),16) occurs(action(("end-move","pos-4-3")),17) occurs(action(("jump-new-move","pos-2-5","pos-2-4","pos-2-3")),18) occurs(action(("end-move","pos-2-3")),19) occurs(action(("jump-new-move","pos-5-3","pos-4-3","pos-3-3")),20) occurs(action(("jump-continue-move","pos-3-3","pos-2-3","pos-1-3")),21) occurs(action(("end-move","pos-1-3")),22) occurs(action(("jump-new-move","pos-2-1","pos-2-2","pos-2-3")),23) occurs(action(("end-move","pos-2-3")),24) occurs(action(("jump-new-move","pos-1-3","pos-2-3","pos-3-3")),25) SATISFIABLE Models : 1+ Calls : 7 Time : 2.270s (Solving: 1.94s 1st Model: 0.06s Unsat: 0.61s) CPU Time : 2.256s Choices : 40810 (Domain: 40810) Conflicts : 14634 (Analyzed: 14631) Restarts : 159 (Average: 92.02 Last: 63) Model-Level : 175.0 Problems : 7 (Average Length: 14.86 Splits: 0) Lemmas : 14631 (Deleted: 10997) Binary : 220 (Ratio: 1.50%) Ternary : 156 (Ratio: 1.07%) Conflict : 14631 (Average Length: 324.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 14631 (Average: 2.34 Max: 237 Sum: 34302) Executed : 14561 (Average: 2.32 Max: 237 Sum: 33972 Ratio: 99.04%) Bounded : 70 (Average: 4.71 Max: 17 Sum: 330 Ratio: 0.96%) Rules : 15309 (Original: 15180) Atoms : 6602 Bodies : 3602 (Original: 3480) Count : 452 (Original: 470) Equivalences : 3024 (Atom=Atom: 36 Body=Body: 0 Other: 2988) Tight : Yes Variables : 11241 (Eliminated: 0 Frozen: 5947) Constraints : 73479 (Binary: 92.2% Ternary: 3.6% Other: 4.2%) Memory Peak : 69MB Max. Length : 25 steps Sol. Length : 25 steps Models : 2