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

225 lines
10 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-25.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-25.pddl
Parsing...
Parsing: [0.010s CPU, 0.017s 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.013s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 21 rules.
Computing model... [0.080s CPU, 0.085s wall-clock]
530 relevant atoms
348 auxiliary atoms
878 final queue length
1481 total queue pushes
Completing instantiation... [0.100s CPU, 0.105s wall-clock]
Instantiating: [0.220s CPU, 0.216s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.023s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.000s CPU, 0.005s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
13 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.040s CPU, 0.051s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.005s wall-clock]
Translating task: [0.110s CPU, 0.102s wall-clock]
420 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
24 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.054s wall-clock]
Reordering and filtering variables...
25 of 25 variables necessary.
13 of 25 mutex groups necessary.
288 of 288 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.031s wall-clock]
Translator variables: 25
Translator derived variables: 0
Translator facts: 182
Translator goal facts: 11
Translator mutex groups: 13
Translator total mutex groups size: 169
Translator operators: 288
Translator axioms: 0
Translator task size: 2511
Translator peak memory: 34392 KB
Writing output... [0.050s CPU, 0.046s wall-clock]
Done! [0.520s CPU, 0.530s wall-clock]
planner.py version 0.0.1
Time: 0.11s
Memory: 50MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.05s
Memory: 53MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 54MB (+1MB)
UNSAT
Iteration Time: 0.07s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.02s
Memory: 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.02s
Memory: 55MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.05s
Memory: 57MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.05s
Memory: 61MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+2MB)
UNSAT
Iteration Time: 0.07s
Iteration 6
Queue: [27]
Grounded Until: 19
Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])]
Grounding Time: 0.07s
Memory: 67MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 69MB (+2MB)
UNSAT
Iteration Time: 0.10s
Iteration 7
Queue: [39]
Grounded Until: 27
Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])]
Grounding Time: 0.12s
Memory: 76MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 1.13s
Memory: 85MB (+9MB)
UNSAT
Iteration Time: 1.28s
Iteration 8
Queue: [55]
Grounded Until: 39
Grounding... [('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 0.17s
Memory: 97MB (+12MB)
Unblocking actions...
Solving...
Solving Time: 0.33s
Memory: 100MB (+3MB)
UNSAT
Iteration Time: 0.55s
Iteration 9
Queue: [78]
Grounded Until: 55
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('check', [78])]
Grounding Time: 0.27s
Memory: 115MB (+15MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","h","a")),1) occurs(action(("put-down","h")),2) occurs(action(("unstack","a","g")),3) occurs(action(("put-down","a")),4) occurs(action(("unstack","g","k")),5) occurs(action(("put-down","g")),6) occurs(action(("unstack","k","e")),7) occurs(action(("stack","k","h")),8) occurs(action(("unstack","e","b")),9) occurs(action(("put-down","e")),10) occurs(action(("unstack","b","d")),11) occurs(action(("stack","b","e")),12) occurs(action(("unstack","d","i")),13) occurs(action(("put-down","d")),14) occurs(action(("unstack","i","c")),15) occurs(action(("put-down","i")),16) occurs(action(("unstack","k","h")),17) occurs(action(("stack","k","d")),18) occurs(action(("unstack","l","f")),19) occurs(action(("put-down","l")),20) occurs(action(("unstack","k","d")),21) occurs(action(("put-down","k")),22) occurs(action(("pick-up","f")),23) occurs(action(("stack","f","j")),24) occurs(action(("unstack","b","e")),25) occurs(action(("stack","b","d")),26) occurs(action(("pick-up","h")),27) occurs(action(("stack","h","g")),28) occurs(action(("pick-up","a")),29) occurs(action(("stack","a","h")),30) occurs(action(("unstack","f","j")),31) occurs(action(("stack","f","a")),32) occurs(action(("pick-up","c")),33) occurs(action(("put-down","c")),34) occurs(action(("pick-up","l")),35) occurs(action(("stack","l","b")),36) occurs(action(("pick-up","k")),37) occurs(action(("put-down","k")),38) occurs(action(("unstack","l","b")),39) occurs(action(("put-down","l")),40) occurs(action(("pick-up","j")),41) occurs(action(("stack","j","c")),42) occurs(action(("unstack","b","d")),43) occurs(action(("put-down","b")),44) occurs(action(("unstack","j","c")),45) occurs(action(("stack","j","l")),46) occurs(action(("pick-up","c")),47) occurs(action(("put-down","c")),48) occurs(action(("pick-up","k")),49) occurs(action(("stack","k","b")),50) occurs(action(("unstack","f","a")),51) occurs(action(("stack","f","c")),52) occurs(action(("unstack","a","h")),53) occurs(action(("stack","a","d")),54) occurs(action(("unstack","h","g")),55) occurs(action(("stack","h","g")),56) occurs(action(("unstack","k","b")),57) occurs(action(("stack","k","i")),58) occurs(action(("unstack","a","d")),59) occurs(action(("stack","a","h")),60) occurs(action(("unstack","f","c")),61) occurs(action(("stack","f","a")),62) occurs(action(("unstack","k","i")),63) occurs(action(("stack","k","f")),64) occurs(action(("pick-up","e")),65) occurs(action(("stack","e","k")),66) occurs(action(("unstack","j","l")),67) occurs(action(("stack","j","e")),68) occurs(action(("pick-up","d")),69) occurs(action(("stack","d","j")),70) occurs(action(("pick-up","l")),71) occurs(action(("stack","l","d")),72) occurs(action(("pick-up","b")),73) occurs(action(("stack","b","l")),74) occurs(action(("pick-up","c")),75) occurs(action(("stack","c","b")),76) occurs(action(("pick-up","i")),77) occurs(action(("stack","i","c")),78)
Solving Time: 0.17s
Memory: 121MB (+6MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 2.835s (Solving: 1.61s 1st Model: 0.15s Unsat: 1.46s)
CPU Time : 2.820s
Choices : 31682
Conflicts : 7283 (Analyzed: 7278)
Restarts : 80 (Average: 90.97 Last: 91)
Model-Level : 1178.0
Problems : 9 (Average Length: 30.11 Splits: 0)
Lemmas : 7278 (Deleted: 2329)
Binary : 388 (Ratio: 5.33%)
Ternary : 270 (Ratio: 3.71%)
Conflict : 7278 (Average Length: 565.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7278 (Average: 4.16 Max: 581 Sum: 30272)
Executed : 7237 (Average: 4.05 Max: 581 Sum: 29449 Ratio: 97.28%)
Bounded : 41 (Average: 20.07 Max: 55 Sum: 823 Ratio: 2.72%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 47134 (Eliminated: 0 Frozen: 36052)
Constraints : 326525 (Binary: 93.0% Ternary: 4.1% Other: 2.9%)
Memory Peak : 122MB
Max. Length : 78 steps
Sol. Length : 78 steps