1
0
Fork 0
tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-2000_blocks-strips-type...

247 lines
9.8 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-28.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/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-28.pddl
Parsing...
Parsing: [0.010s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.090s CPU, 0.090s wall-clock]
613 relevant atoms
403 auxiliary atoms
1016 final queue length
1720 total queue pushes
Completing instantiation... [0.110s CPU, 0.114s wall-clock]
Instantiating: [0.230s CPU, 0.228s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
Choosing groups...
14 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.050s CPU, 0.052s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.006s wall-clock]
Translating task: [0.120s CPU, 0.119s wall-clock]
494 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
26 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.067s wall-clock]
Reordering and filtering variables...
27 of 27 variables necessary.
14 of 27 mutex groups necessary.
338 of 338 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.037s wall-clock]
Translator variables: 27
Translator derived variables: 0
Translator facts: 210
Translator goal facts: 12
Translator mutex groups: 14
Translator total mutex groups size: 196
Translator operators: 338
Translator axioms: 0
Translator task size: 2941
Translator peak memory: 34648 KB
Writing output... [0.040s CPU, 0.050s wall-clock]
Done! [0.570s CPU, 0.585s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 51MB
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: 51MB (+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.06s
Memory: 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 54MB (+1MB)
UNSAT
Iteration Time: 0.08s
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.05s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.07s
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.06s
Memory: 60MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+1MB)
UNSAT
Iteration Time: 0.08s
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.05s
Memory: 64MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 65MB (+1MB)
UNSAT
Iteration Time: 0.08s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.06s
Memory: 67MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 69MB (+2MB)
UNSAT
Iteration Time: 0.08s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.06s
Memory: 71MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 72MB (+1MB)
UNSAT
Iteration Time: 0.09s
Iteration 8
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)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.07s
Memory: 76MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 78MB (+2MB)
UNSAT
Iteration Time: 0.13s
Iteration 9
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)]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.06s
Memory: 79MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 81MB (+2MB)
UNSAT
Iteration Time: 0.10s
Iteration 10
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.06s
Memory: 83MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 85MB (+2MB)
UNSAT
Iteration Time: 0.23s
Iteration 11
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
Grounded Until: 45
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 0.06s
Memory: 88MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","j","e")),1) occurs(action(("put-down","j")),2) occurs(action(("unstack","b","k")),3) occurs(action(("put-down","b")),4) occurs(action(("unstack","e","d")),5) occurs(action(("put-down","e")),6) occurs(action(("unstack","d","c")),7) occurs(action(("put-down","d")),8) occurs(action(("pick-up","j")),9) occurs(action(("put-down","j")),10) occurs(action(("pick-up","e")),11) occurs(action(("stack","e","j")),12) occurs(action(("unstack","e","j")),13) occurs(action(("put-down","e")),14) occurs(action(("unstack","c","a")),15) occurs(action(("stack","c","d")),16) occurs(action(("unstack","a","l")),17) occurs(action(("put-down","a")),18) occurs(action(("unstack","l","h")),19) occurs(action(("put-down","l")),20) occurs(action(("unstack","h","g")),21) occurs(action(("stack","h","c")),22) occurs(action(("unstack","g","m")),23) occurs(action(("stack","g","e")),24) occurs(action(("unstack","m","i")),25) occurs(action(("put-down","m")),26) occurs(action(("unstack","i","f")),27) occurs(action(("stack","i","b")),28) occurs(action(("unstack","h","c")),29) occurs(action(("stack","h","i")),30) occurs(action(("unstack","g","e")),31) occurs(action(("stack","g","h")),32) occurs(action(("pick-up","k")),33) occurs(action(("stack","k","g")),34) occurs(action(("pick-up","f")),35) occurs(action(("stack","f","k")),36) occurs(action(("pick-up","j")),37) occurs(action(("stack","j","f")),38) occurs(action(("unstack","c","d")),39) occurs(action(("stack","c","j")),40) occurs(action(("pick-up","m")),41) occurs(action(("stack","m","c")),42) occurs(action(("pick-up","l")),43) occurs(action(("stack","l","m")),44) occurs(action(("pick-up","e")),45) occurs(action(("stack","e","l")),46) occurs(action(("pick-up","a")),47) occurs(action(("stack","a","e")),48) occurs(action(("pick-up","d")),49) occurs(action(("stack","d","a")),50)
Solving Time: 0.10s
Memory: 90MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 1.268s (Solving: 0.29s 1st Model: 0.09s Unsat: 0.19s)
CPU Time : 1.260s
Choices : 14819 (Domain: 14819)
Conflicts : 433 (Analyzed: 426)
Restarts : 3 (Average: 142.00 Last: 77)
Model-Level : 253.0
Problems : 11 (Average Length: 27.00 Splits: 0)
Lemmas : 426 (Deleted: 0)
Binary : 40 (Ratio: 9.39%)
Ternary : 2 (Ratio: 0.47%)
Conflict : 426 (Average Length: 1050.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 426 (Average: 34.91 Max: 873 Sum: 14870)
Executed : 412 (Average: 34.31 Max: 873 Sum: 14617 Ratio: 98.30%)
Bounded : 14 (Average: 18.07 Max: 45 Sum: 253 Ratio: 1.70%)
Rules : 9885
Atoms : 9885
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 32822 (Eliminated: 0 Frozen: 26691)
Constraints : 196026 (Binary: 93.0% Ternary: 4.1% Other: 2.9%)
Memory Peak : 93MB
Max. Length : 50 steps
Sol. Length : 50 steps