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

247 lines
9.9 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-27.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-27.pddl
Parsing...
Parsing: [0.020s CPU, 0.013s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.080s CPU, 0.087s wall-clock]
613 relevant atoms
403 auxiliary atoms
1016 final queue length
1721 total queue pushes
Completing instantiation... [0.110s CPU, 0.109s wall-clock]
Instantiating: [0.210s CPU, 0.218s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.018s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s 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.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.051s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s 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.066s 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.040s 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.050s CPU, 0.051s wall-clock]
Done! [0.570s CPU, 0.571s wall-clock]
planner.py version 0.0.1
Time: 0.47s
Memory: 73MB
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: 73MB (+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.39s
Memory: 121MB (+48MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 121MB (+0MB)
UNSAT
Iteration Time: 0.47s
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.34s
Memory: 138MB (+17MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 138MB (+0MB)
UNSAT
Iteration Time: 0.42s
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.37s
Memory: 156MB (+18MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 158MB (+2MB)
UNSAT
Iteration Time: 0.47s
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.51s
Memory: 186MB (+28MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 189MB (+3MB)
UNSAT
Iteration Time: 0.62s
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.35s
Memory: 204MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 208MB (+4MB)
UNSAT
Iteration Time: 0.49s
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.37s
Memory: 223MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 227MB (+4MB)
UNSAT
Iteration Time: 0.51s
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.38s
Memory: 240MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 245MB (+5MB)
UNSAT
Iteration Time: 0.54s
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.70s
Memory: 283MB (+38MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 289MB (+6MB)
UNSAT
Iteration Time: 0.88s
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.36s
Memory: 301MB (+12MB)
Unblocking actions...
Solving...
Solving Time: 0.31s
Memory: 307MB (+6MB)
UNSAT
Iteration Time: 0.76s
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.36s
Memory: 323MB (+16MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","b","f")),1) occurs(action(("stack","b","m")),2) occurs(action(("unstack","f","d")),3) occurs(action(("put-down","f")),4) occurs(action(("unstack","d","c")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","i","g")),7) occurs(action(("put-down","i")),8) occurs(action(("unstack","c","j")),9) occurs(action(("stack","c","g")),10) occurs(action(("unstack","j","a")),11) occurs(action(("stack","j","c")),12) occurs(action(("unstack","a","e")),13) occurs(action(("stack","a","d")),14) occurs(action(("unstack","e","h")),15) occurs(action(("stack","e","a")),16) occurs(action(("unstack","h","l")),17) occurs(action(("stack","h","i")),18) occurs(action(("unstack","l","k")),19) occurs(action(("stack","l","h")),20) occurs(action(("unstack","b","m")),21) occurs(action(("stack","b","k")),22) occurs(action(("unstack","j","c")),23) occurs(action(("stack","j","b")),24) occurs(action(("unstack","l","h")),25) occurs(action(("stack","l","j")),26) occurs(action(("unstack","e","a")),27) occurs(action(("stack","e","l")),28) occurs(action(("unstack","h","i")),29) occurs(action(("stack","h","i")),30) occurs(action(("pick-up","m")),31) occurs(action(("stack","m","c")),32) occurs(action(("unstack","e","l")),33) occurs(action(("stack","e","l")),34) occurs(action(("unstack","h","i")),35) occurs(action(("stack","h","e")),36) occurs(action(("unstack","m","c")),37) occurs(action(("stack","m","h")),38) occurs(action(("unstack","a","d")),39) occurs(action(("stack","a","m")),40) occurs(action(("pick-up","f")),41) occurs(action(("stack","f","a")),42) occurs(action(("pick-up","d")),43) occurs(action(("stack","d","f")),44) occurs(action(("unstack","c","g")),45) occurs(action(("stack","c","d")),46) occurs(action(("pick-up","i")),47) occurs(action(("stack","i","c")),48) occurs(action(("pick-up","g")),49) occurs(action(("stack","g","i")),50)
Solving Time: 0.10s
Memory: 330MB (+7MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 6.202s (Solving: 0.43s 1st Model: 0.05s Unsat: 0.38s)
CPU Time : 6.200s
Choices : 3942
Conflicts : 1864 (Analyzed: 1856)
Restarts : 19 (Average: 97.68 Last: 69)
Model-Level : 69.0
Problems : 11 (Average Length: 27.00 Splits: 0)
Lemmas : 1856 (Deleted: 0)
Binary : 131 (Ratio: 7.06%)
Ternary : 83 (Ratio: 4.47%)
Conflict : 1856 (Average Length: 527.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1856 (Average: 3.11 Max: 148 Sum: 5771)
Executed : 1777 (Average: 2.10 Max: 148 Sum: 3906 Ratio: 67.68%)
Bounded : 79 (Average: 23.61 Max: 47 Sum: 1865 Ratio: 32.32%)
Rules : 186400
Atoms : 186400
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 61761 (Eliminated: 0 Frozen: 56777)
Constraints : 171459 (Binary: 93.0% Ternary: 4.9% Other: 2.1%)
Memory Peak : 331MB
Max. Length : 50 steps
Sol. Length : 50 steps