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

325 lines
12 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-42.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-42.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 21 rules.
Computing model... [0.160s CPU, 0.160s wall-clock]
1362 relevant atoms
900 auxiliary atoms
2262 final queue length
3904 total queue pushes
Completing instantiation... [0.240s CPU, 0.239s wall-clock]
Instantiating: [0.420s CPU, 0.424s 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.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.013s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
21 uncovered facts
Choosing groups: [0.020s CPU, 0.017s wall-clock]
Building translation key... [0.010s CPU, 0.006s wall-clock]
Computing fact groups: [0.100s CPU, 0.095s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.009s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.012s wall-clock]
Translating task: [0.280s CPU, 0.280s wall-clock]
1180 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
40 propositions removed
Detecting unreachable propositions: [0.150s CPU, 0.155s wall-clock]
Reordering and filtering variables...
41 of 41 variables necessary.
21 of 41 mutex groups necessary.
800 of 800 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.090s CPU, 0.088s wall-clock]
Translator variables: 41
Translator derived variables: 0
Translator facts: 462
Translator goal facts: 19
Translator mutex groups: 21
Translator total mutex groups size: 441
Translator operators: 800
Translator axioms: 0
Translator task size: 6903
Translator peak memory: 37208 KB
Writing output... [0.110s CPU, 0.116s wall-clock]
Done! [1.190s CPU, 1.207s wall-clock]
planner.py version 0.0.1
Time: 0.24s
Memory: 59MB
Iteration 1
Queue: [0]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 59MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.12s
Memory: 63MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 66MB (+3MB)
UNSAT
Iteration Time: 0.15s
Iteration 3
Queue: [10]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.12s
Memory: 69MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 71MB (+2MB)
UNSAT
Iteration Time: 0.16s
Iteration 4
Queue: [15]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.14s
Memory: 76MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 79MB (+3MB)
UNSAT
Iteration Time: 0.19s
Iteration 5
Queue: [20]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.13s
Memory: 83MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 86MB (+3MB)
UNSAT
Iteration Time: 0.18s
Iteration 6
Queue: [25]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.13s
Memory: 91MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 95MB (+4MB)
UNSAT
Iteration Time: 0.19s
Iteration 7
Queue: [30]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.17s
Memory: 102MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 104MB (+2MB)
UNSAT
Iteration Time: 0.23s
Iteration 8
Queue: [35]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.13s
Memory: 108MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 113MB (+5MB)
UNSAT
Iteration Time: 0.20s
Iteration 9
Queue: [40]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.14s
Memory: 117MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 120MB (+3MB)
UNSAT
Iteration Time: 0.21s
Iteration 10
Queue: [45]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.14s
Memory: 125MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 128MB (+3MB)
UNSAT
Iteration Time: 0.23s
Iteration 11
Queue: [50]
Grounded Until: 45
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 0.14s
Memory: 132MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 135MB (+3MB)
UNSAT
Iteration Time: 0.30s
Iteration 12
Queue: [55]
Grounded Until: 50
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
Grounding Time: 0.14s
Memory: 139MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 147MB (+8MB)
UNSAT
Iteration Time: 0.32s
Iteration 13
Queue: [60]
Grounded Until: 55
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
Grounding Time: 0.14s
Memory: 148MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 152MB (+4MB)
UNSAT
Iteration Time: 0.29s
Iteration 14
Queue: [65]
Grounded Until: 60
Grounding... [('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('check', [65])]
Grounding Time: 0.21s
Memory: 162MB (+10MB)
Unblocking actions...
Solving...
Solving Time: 0.25s
Memory: 166MB (+4MB)
UNSAT
Iteration Time: 0.53s
Iteration 15
Queue: [70]
Grounded Until: 65
Grounding... [('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('check', [70])]
Grounding Time: 0.14s
Memory: 169MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.88s
Memory: 174MB (+5MB)
UNSAT
Iteration Time: 1.10s
Iteration 16
Queue: [75]
Grounded Until: 70
Grounding... [('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('check', [75])]
Grounding Time: 0.14s
Memory: 181MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 4.24s
Memory: 212MB (+31MB)
UNSAT
Iteration Time: 4.48s
Iteration 17
Queue: [80]
Grounded Until: 75
Grounding... [('step', [76]), ('step', [77]), ('step', [78]), ('step', [79]), ('step', [80]), ('check', [80])]
Grounding Time: 0.14s
Memory: 213MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","a","h")),1) occurs(action(("put-down","a")),2) occurs(action(("unstack","h","k")),3) occurs(action(("put-down","h")),4) occurs(action(("unstack","k","q")),5) occurs(action(("put-down","k")),6) occurs(action(("unstack","q","t")),7) occurs(action(("stack","q","a")),8) occurs(action(("unstack","t","e")),9) occurs(action(("put-down","t")),10) occurs(action(("unstack","e","i")),11) occurs(action(("put-down","e")),12) occurs(action(("unstack","i","b")),13) occurs(action(("stack","i","h")),14) occurs(action(("unstack","b","p")),15) occurs(action(("stack","b","i")),16) occurs(action(("unstack","p","l")),17) occurs(action(("put-down","p")),18) occurs(action(("unstack","l","d")),19) occurs(action(("stack","l","p")),20) occurs(action(("unstack","d","o")),21) occurs(action(("put-down","d")),22) occurs(action(("unstack","o","j")),23) occurs(action(("put-down","o")),24) occurs(action(("unstack","j","s")),25) occurs(action(("stack","j","k")),26) occurs(action(("unstack","s","c")),27) occurs(action(("stack","s","q")),28) occurs(action(("unstack","c","f")),29) occurs(action(("stack","c","d")),30) occurs(action(("unstack","f","r")),31) occurs(action(("stack","f","t")),32) occurs(action(("unstack","g","m")),33) occurs(action(("stack","g","j")),34) occurs(action(("unstack","r","n")),35) occurs(action(("stack","r","e")),36) occurs(action(("unstack","b","i")),37) occurs(action(("stack","b","r")),38) occurs(action(("unstack","f","t")),39) occurs(action(("stack","f","b")),40) occurs(action(("pick-up","m")),41) occurs(action(("stack","m","f")),42) occurs(action(("unstack","g","j")),43) occurs(action(("stack","g","m")),44) occurs(action(("pick-up","t")),45) occurs(action(("stack","t","g")),46) occurs(action(("unstack","j","k")),47) occurs(action(("stack","j","t")),48) occurs(action(("unstack","l","p")),49) occurs(action(("stack","l","j")),50) occurs(action(("pick-up","p")),51) occurs(action(("stack","p","l")),52) occurs(action(("pick-up","k")),53) occurs(action(("stack","k","p")),54) occurs(action(("unstack","c","d")),55) occurs(action(("stack","c","k")),56) occurs(action(("pick-up","d")),57) occurs(action(("stack","d","c")),58) occurs(action(("unstack","s","q")),59) occurs(action(("stack","s","d")),60) occurs(action(("pick-up","o")),61) occurs(action(("stack","o","s")),62) occurs(action(("unstack","i","h")),63) occurs(action(("stack","i","o")),64) occurs(action(("unstack","q","a")),65) occurs(action(("stack","q","i")),66) occurs(action(("pick-up","h")),67) occurs(action(("put-down","h")),68) occurs(action(("pick-up","a")),69) occurs(action(("stack","a","q")),70) occurs(action(("pick-up","n")),71) occurs(action(("stack","n","a")),72) occurs(action(("pick-up","h")),73) occurs(action(("put-down","h")),74) occurs(action(("pick-up","h")),75) occurs(action(("put-down","h")),76) occurs(action(("pick-up","h")),77) occurs(action(("put-down","h")),78) occurs(action(("pick-up","h")),79) occurs(action(("stack","h","n")),80)
Solving Time: 0.24s
Memory: 225MB (+12MB)
SAT
SATISFIABLE
Models : 1+
Calls : 17
Time : 9.511s (Solving: 5.79s 1st Model: 0.21s Unsat: 5.58s)
CPU Time : 9.500s
Choices : 156352
Conflicts : 6991 (Analyzed: 6979)
Restarts : 72 (Average: 96.93 Last: 72)
Model-Level : 153.0
Problems : 17 (Average Length: 42.00 Splits: 0)
Lemmas : 6979 (Deleted: 3267)
Binary : 401 (Ratio: 5.75%)
Ternary : 186 (Ratio: 2.67%)
Conflict : 6979 (Average Length: 1688.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 6979 (Average: 22.24 Max: 2659 Sum: 155193)
Executed : 6827 (Average: 21.57 Max: 2659 Sum: 150533 Ratio: 97.00%)
Bounded : 152 (Average: 30.66 Max: 77 Sum: 4660 Ratio: 3.00%)
Rules : 23178
Atoms : 23178
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 113332 (Eliminated: 0 Frozen: 97564)
Constraints : 742924 (Binary: 94.4% Ternary: 3.8% Other: 1.8%)
Memory Peak : 230MB
Max. Length : 80 steps
Sol. Length : 80 steps