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-22.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-22.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock]
Preparing model... [0.010s CPU, 0.004s wall-clock]
Generated 21 rules.
Computing model... [0.040s CPU, 0.051s wall-clock]
453 relevant atoms
297 auxiliary atoms
750 final queue length
1259 total queue pushes
Completing instantiation... [0.080s CPU, 0.077s wall-clock]
Instantiating: [0.140s CPU, 0.144s wall-clock]
Computing fact groups...
Finding invariants...
10 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.004s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.000s CPU, 0.005s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.046s wall-clock]
Building STRIPS to SAS dictionary... [0.000s 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.010s CPU, 0.003s 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.080s CPU, 0.084s wall-clock]
352 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
22 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.048s wall-clock]
Reordering and filtering variables...
23 of 23 variables necessary.
12 of 23 mutex groups necessary.
242 of 242 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.026s wall-clock]
Translator variables: 23
Translator derived variables: 0
Translator facts: 156
Translator goal facts: 10
Translator mutex groups: 12
Translator total mutex groups size: 144
Translator operators: 242
Translator axioms: 0
Translator task size: 2115
Translator peak memory: 34136 KB
Writing output... [0.030s CPU, 0.038s wall-clock]
Done! [0.400s CPU, 0.409s wall-clock]
planner.py version 0.0.1
Time: 0.09s
Memory: 49MB
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: 51MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.02s
Memory: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+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: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 53MB (+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.04s
Memory: 56MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+0MB)
UNSAT
Iteration Time: 0.05s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.04s
Memory: 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 59MB (+1MB)
UNSAT
Iteration Time: 0.05s
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: 64MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 65MB (+1MB)
UNSAT
Iteration Time: 0.11s
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.10s
Memory: 71MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.78s
Memory: 76MB (+5MB)
UNSAT
Iteration Time: 0.91s
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: 87MB (+11MB)
Unblocking actions...
Solving...
Solving Time: 0.40s
Memory: 91MB (+4MB)
UNSAT
Iteration Time: 0.62s
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.22s
Memory: 102MB (+11MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","b","g")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","g","h")),3) occurs(action(("stack","g","b")),4) occurs(action(("unstack","h","k")),5) occurs(action(("put-down","h")),6) occurs(action(("unstack","k","a")),7) occurs(action(("stack","k","c")),8) occurs(action(("unstack","k","c")),9) occurs(action(("stack","k","g")),10) occurs(action(("unstack","c","e")),11) occurs(action(("put-down","c")),12) occurs(action(("unstack","a","f")),13) occurs(action(("stack","a","k")),14) occurs(action(("unstack","a","k")),15) occurs(action(("put-down","a")),16) occurs(action(("pick-up","a")),17) occurs(action(("stack","a","j")),18) occurs(action(("unstack","f","i")),19) occurs(action(("stack","f","k")),20) occurs(action(("unstack","f","k")),21) occurs(action(("stack","f","k")),22) occurs(action(("unstack","f","k")),23) occurs(action(("stack","f","c")),24) occurs(action(("unstack","k","g")),25) occurs(action(("stack","k","g")),26) occurs(action(("unstack","k","g")),27) occurs(action(("put-down","k")),28) occurs(action(("unstack","a","j")),29) occurs(action(("put-down","a")),30) occurs(action(("pick-up","h")),31) occurs(action(("put-down","h")),32) occurs(action(("unstack","g","b")),33) occurs(action(("stack","g","h")),34) occurs(action(("unstack","j","d")),35) occurs(action(("stack","j","g")),36) occurs(action(("pick-up","d")),37) occurs(action(("stack","d","j")),38) occurs(action(("pick-up","e")),39) occurs(action(("put-down","e")),40) occurs(action(("pick-up","e")),41) occurs(action(("stack","e","a")),42) occurs(action(("unstack","f","c")),43) occurs(action(("put-down","f")),44) occurs(action(("unstack","d","j")),45) occurs(action(("stack","d","j")),46) occurs(action(("unstack","d","j")),47) occurs(action(("stack","d","e")),48) occurs(action(("unstack","j","g")),49) occurs(action(("stack","j","k")),50) occurs(action(("unstack","d","e")),51) occurs(action(("stack","d","b")),52) occurs(action(("unstack","g","h")),53) occurs(action(("stack","g","j")),54) occurs(action(("unstack","d","b")),55) occurs(action(("put-down","d")),56) occurs(action(("unstack","g","j")),57) occurs(action(("stack","g","c")),58) occurs(action(("unstack","e","a")),59) occurs(action(("stack","e","g")),60) occurs(action(("pick-up","f")),61) occurs(action(("stack","f","e")),62) occurs(action(("unstack","j","k")),63) occurs(action(("put-down","j")),64) occurs(action(("pick-up","i")),65) occurs(action(("stack","i","f")),66) occurs(action(("pick-up","k")),67) occurs(action(("stack","k","i")),68) occurs(action(("pick-up","h")),69) occurs(action(("stack","h","k")),70) occurs(action(("pick-up","b")),71) occurs(action(("stack","b","h")),72) occurs(action(("pick-up","d")),73) occurs(action(("stack","d","b")),74) occurs(action(("pick-up","j")),75) occurs(action(("stack","j","d")),76) occurs(action(("pick-up","a")),77) occurs(action(("stack","a","j")),78)
Solving Time: 0.24s
Memory: 108MB (+6MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 2.471s (Solving: 1.42s 1st Model: 0.23s Unsat: 1.19s)
CPU Time : 2.480s
Choices : 14992
Conflicts : 7826 (Analyzed: 7820)
Restarts : 86 (Average: 90.93 Last: 73)
Model-Level : 119.0
Problems : 9 (Average Length: 30.11 Splits: 0)
Lemmas : 7820 (Deleted: 3149)
Binary : 432 (Ratio: 5.52%)
Ternary : 309 (Ratio: 3.95%)
Conflict : 7820 (Average Length: 365.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7820 (Average: 2.22 Max: 142 Sum: 17326)
Executed : 7728 (Average: 1.87 Max: 142 Sum: 14615 Ratio: 84.35%)
Bounded : 92 (Average: 29.47 Max: 80 Sum: 2711 Ratio: 15.65%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 38892 (Eliminated: 0 Frozen: 31298)
Constraints : 267249 (Binary: 92.6% Ternary: 4.2% Other: 3.2%)
Memory Peak : 108MB
Max. Length : 78 steps
Sol. Length : 78 steps