tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_peg-solitaire-sequential-satisficing_17.out

284 lines
12 KiB
Plaintext
Raw Normal View History

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-17.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-17.pddl
Parsing...
Parsing: [0.030s CPU, 0.030s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 25 rules.
Computing model... [0.100s CPU, 0.098s wall-clock]
461 relevant atoms
611 auxiliary atoms
1072 final queue length
1647 total queue pushes
Completing instantiation... [0.090s CPU, 0.089s wall-clock]
Instantiating: [0.230s CPU, 0.232s wall-clock]
Computing fact groups...
Finding invariants...
7 initial candidates
Finding invariants: [0.030s CPU, 0.026s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s 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.003s wall-clock]
Building translation key... [0.010s 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.000s CPU, 0.004s wall-clock]
Translating task: [0.070s CPU, 0.074s 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.024s 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.030s wall-clock]
Done! [0.470s CPU, 0.476s 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.01s
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.82s
Memory: 61MB (+4MB)
UNKNOWN
Iteration Time: 0.85s
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: 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 64MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.08s
Memory: 66MB (+2MB)
Solving...
Solving Time: 1.27s
Memory: 67MB (+1MB)
UNKNOWN
Iteration Time: 1.41s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Expected Memory: 72.0MB
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.04s
Memory: 68MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.22s
Memory: 69MB (+1MB)
UNKNOWN
Iteration Time: 1.27s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Expected Memory: 74.0MB
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.04s
Memory: 69MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.25s
Memory: 73MB (+4MB)
UNKNOWN
Iteration Time: 1.30s
Iteration 8
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 1.22s
Memory: 73MB (+0MB)
UNKNOWN
Iteration Time: 1.22s
Iteration 9
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 1.23s
Memory: 73MB (+0MB)
UNKNOWN
Iteration Time: 1.23s
Iteration 10
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 1.29s
Memory: 73MB (+0MB)
UNKNOWN
Iteration Time: 1.30s
Iteration 11
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 1.19s
Memory: 76MB (+3MB)
UNKNOWN
Iteration Time: 1.19s
Iteration 12
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 30
Expected Memory: 81.0MB
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.04s
Memory: 76MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.29s
Memory: 78MB (+2MB)
UNKNOWN
Iteration Time: 1.35s
Iteration 13
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
Grounded Until: 35
Expected Memory: 83.0MB
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.04s
Memory: 79MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.94s
Memory: 81MB (+2MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 81MB (+0MB)
Answer: 2
occurs(action(("jump-new-move","pos-2-6","pos-2-5","pos-2-4")),1) occurs(action(("jump-continue-move","pos-2-4","pos-1-4","pos-0-4")),2) occurs(action(("jump-continue-move","pos-0-4","pos-0-3","pos-0-2")),3) occurs(action(("end-move","pos-0-2")),4) occurs(action(("jump-new-move","pos-3-6","pos-3-5","pos-3-4")),5) occurs(action(("end-move","pos-3-4")),6) occurs(action(("jump-new-move","pos-4-2","pos-4-3","pos-4-4")),7) occurs(action(("end-move","pos-4-4")),8) occurs(action(("jump-new-move","pos-6-3","pos-5-3","pos-4-3")),9) occurs(action(("end-move","pos-4-3")),10) occurs(action(("jump-new-move","pos-0-2","pos-1-2","pos-2-2")),11) occurs(action(("end-move","pos-2-2")),12) occurs(action(("jump-new-move","pos-4-0","pos-4-1","pos-4-2")),13) occurs(action(("end-move","pos-4-2")),14) occurs(action(("jump-new-move","pos-3-2","pos-2-2","pos-1-2")),15) occurs(action(("end-move","pos-1-2")),16) occurs(action(("jump-new-move","pos-2-0","pos-2-1","pos-2-2")),17) occurs(action(("end-move","pos-2-2")),18) occurs(action(("jump-new-move","pos-4-4","pos-3-4","pos-2-4")),19) occurs(action(("end-move","pos-2-4")),20) occurs(action(("jump-new-move","pos-4-6","pos-4-5","pos-4-4")),21) occurs(action(("end-move","pos-4-4")),22) occurs(action(("jump-new-move","pos-5-4","pos-4-4","pos-3-4")),23) occurs(action(("end-move","pos-3-4")),24) occurs(action(("jump-new-move","pos-4-3","pos-4-2","pos-4-1")),25) occurs(action(("jump-continue-move","pos-4-1","pos-3-1","pos-2-1")),26) occurs(action(("end-move","pos-2-1")),27) occurs(action(("jump-new-move","pos-1-2","pos-2-2","pos-3-2")),28) occurs(action(("end-move","pos-3-2")),29) occurs(action(("jump-new-move","pos-2-4","pos-2-3","pos-2-2")),30) occurs(action(("end-move","pos-2-2")),31) occurs(action(("jump-new-move","pos-2-1","pos-2-2","pos-2-3")),32) occurs(action(("end-move","pos-2-3")),33) occurs(action(("jump-new-move","pos-3-3","pos-3-2","pos-3-1")),34) occurs(action(("end-move","pos-3-1")),35) occurs(action(("jump-new-move","pos-1-3","pos-2-3","pos-3-3")),36) occurs(action(("end-move","pos-3-3")),37) occurs(action(("jump-new-move","pos-3-4","pos-3-3","pos-3-2")),38) occurs(action(("end-move","pos-3-2")),39) occurs(action(("jump-new-move","pos-3-1","pos-3-2","pos-3-3")),40)
SATISFIABLE
Models : 1+
Calls : 14
Time : 12.228s (Solving: 11.72s 1st Model: 0.96s Unsat: 0.01s)
CPU Time : 12.220s
Choices : 369119 (Domain: 369119)
Conflicts : 85659 (Analyzed: 85657)
Restarts : 962 (Average: 89.04 Last: 160)
Model-Level : 341.0
Problems : 14 (Average Length: 24.86 Splits: 0)
Lemmas : 85657 (Deleted: 77844)
Binary : 657 (Ratio: 0.77%)
Ternary : 425 (Ratio: 0.50%)
Conflict : 85657 (Average Length: 360.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 85657 (Average: 2.70 Max: 509 Sum: 230968)
Executed : 85466 (Average: 2.69 Max: 509 Sum: 230344 Ratio: 99.73%)
Bounded : 191 (Average: 3.27 Max: 36 Sum: 624 Ratio: 0.27%)
Rules : 18806 (Original: 18683)
Atoms : 6951
Bodies : 4848 (Original: 4732)
Count : 622 (Original: 641)
Equivalences : 4110 (Atom=Atom: 38 Body=Body: 0 Other: 4072)
Tight : Yes
Variables : 18071 (Eliminated: 0 Frozen: 9719)
Constraints : 120375 (Binary: 92.2% Ternary: 3.6% Other: 4.2%)
Memory Peak : 81MB
Max. Length : 40 steps
Sol. Length : 40 steps
Models : 2