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-35.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-35.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.120s CPU, 0.125s wall-clock]
1005 relevant atoms
663 auxiliary atoms
1668 final queue length
2863 total queue pushes
Completing instantiation... [0.180s CPU, 0.176s wall-clock]
Instantiating: [0.320s CPU, 0.326s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.022s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
18 uncovered facts
Choosing groups: [0.010s CPU, 0.011s wall-clock]
Building translation key... [0.010s CPU, 0.004s wall-clock]
Computing fact groups: [0.080s CPU, 0.073s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.006s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.009s wall-clock]
Translating task: [0.200s CPU, 0.200s wall-clock]
850 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
34 propositions removed
Detecting unreachable propositions: [0.110s CPU, 0.112s wall-clock]
Reordering and filtering variables...
35 of 35 variables necessary.
18 of 35 mutex groups necessary.
578 of 578 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.070s CPU, 0.065s wall-clock]
Translator variables: 35
Translator derived variables: 0
Translator facts: 342
Translator goal facts: 16
Translator mutex groups: 18
Translator total mutex groups size: 324
Translator operators: 578
Translator axioms: 0
Translator task size: 5001
Translator peak memory: 35928 KB
Writing output... [0.080s CPU, 0.085s wall-clock]
Done! [0.890s CPU, 0.902s wall-clock]
planner.py version 0.0.1
Time: 0.18s
Memory: 55MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.09s
Memory: 59MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+4MB)
UNSAT
Iteration Time: 0.12s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.05s
Memory: 64MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 65MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.04s
Memory: 65MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 66MB (+1MB)
UNSAT
Iteration Time: 0.05s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.09s
Memory: 69MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 71MB (+2MB)
UNSAT
Iteration Time: 0.12s
Iteration 5
Queue: [19]
Grounded Until: 14
Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])]
Grounding Time: 0.11s
Memory: 76MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 79MB (+3MB)
UNSAT
Iteration Time: 0.15s
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.15s
Memory: 88MB (+9MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 92MB (+4MB)
UNSAT
Iteration Time: 0.22s
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.24s
Memory: 106MB (+14MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 110MB (+4MB)
UNSAT
Iteration Time: 0.42s
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.35s
Memory: 130MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 1.84s
Memory: 143MB (+13MB)
UNSAT
Iteration Time: 2.29s
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.57s
Memory: 175MB (+32MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","q","a")),1) occurs(action(("put-down","q")),2) occurs(action(("unstack","l","f")),3) occurs(action(("put-down","l")),4) occurs(action(("unstack","f","e")),5) occurs(action(("stack","f","h")),6) occurs(action(("unstack","e","k")),7) occurs(action(("put-down","e")),8) occurs(action(("unstack","a","j")),9) occurs(action(("stack","a","e")),10) occurs(action(("unstack","g","d")),11) occurs(action(("stack","g","a")),12) occurs(action(("unstack","d","c")),13) occurs(action(("put-down","d")),14) occurs(action(("unstack","f","h")),15) occurs(action(("stack","f","d")),16) occurs(action(("unstack","h","n")),17) occurs(action(("put-down","h")),18) occurs(action(("unstack","c","o")),19) occurs(action(("stack","c","h")),20) occurs(action(("pick-up","p")),21) occurs(action(("stack","p","c")),22) occurs(action(("pick-up","n")),23) occurs(action(("stack","n","p")),24) occurs(action(("pick-up","k")),25) occurs(action(("stack","k","f")),26) occurs(action(("unstack","j","i")),27) occurs(action(("put-down","j")),28) occurs(action(("unstack","i","b")),29) occurs(action(("stack","i","k")),30) occurs(action(("unstack","b","m")),31) occurs(action(("stack","b","i")),32) occurs(action(("unstack","g","a")),33) occurs(action(("stack","g","b")),34) occurs(action(("unstack","a","e")),35) occurs(action(("stack","a","g")),36) occurs(action(("pick-up","q")),37) occurs(action(("stack","q","l")),38) occurs(action(("pick-up","m")),39) occurs(action(("stack","m","e")),40) occurs(action(("unstack","q","l")),41) occurs(action(("stack","q","o")),42) occurs(action(("pick-up","j")),43) occurs(action(("stack","j","l")),44) occurs(action(("unstack","q","o")),45) occurs(action(("stack","q","a")),46) occurs(action(("pick-up","o")),47) occurs(action(("stack","o","j")),48) occurs(action(("unstack","n","p")),49) occurs(action(("put-down","n")),50) occurs(action(("pick-up","n")),51) occurs(action(("put-down","n")),52) occurs(action(("unstack","q","a")),53) occurs(action(("put-down","q")),54) occurs(action(("unstack","p","c")),55) occurs(action(("stack","p","a")),56) occurs(action(("unstack","m","e")),57) occurs(action(("stack","m","p")),58) occurs(action(("pick-up","e")),59) occurs(action(("stack","e","m")),60) occurs(action(("unstack","o","j")),61) occurs(action(("stack","o","q")),62) occurs(action(("unstack","c","h")),63) occurs(action(("stack","c","e")),64) occurs(action(("pick-up","h")),65) occurs(action(("stack","h","c")),66) occurs(action(("unstack","j","l")),67) occurs(action(("stack","j","h")),68) occurs(action(("unstack","o","q")),69) occurs(action(("stack","o","j")),70) occurs(action(("pick-up","l")),71) occurs(action(("stack","l","o")),72) occurs(action(("unstack","l","o")),73) occurs(action(("stack","l","o")),74) occurs(action(("pick-up","n")),75) occurs(action(("stack","n","l")),76) occurs(action(("pick-up","q")),77) occurs(action(("stack","q","n")),78)
Solving Time: 0.26s
Memory: 188MB (+13MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 4.631s (Solving: 2.17s 1st Model: 0.23s Unsat: 1.94s)
CPU Time : 4.620s
Choices : 116200
Conflicts : 5054 (Analyzed: 5047)
Restarts : 52 (Average: 97.06 Last: 88)
Model-Level : 515.0
Problems : 9 (Average Length: 30.11 Splits: 0)
Lemmas : 5047 (Deleted: 2438)
Binary : 283 (Ratio: 5.61%)
Ternary : 146 (Ratio: 2.89%)
Conflict : 5047 (Average Length: 853.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 5047 (Average: 22.11 Max: 1561 Sum: 111578)
Executed : 4971 (Average: 21.55 Max: 1561 Sum: 108754 Ratio: 97.47%)
Bounded : 76 (Average: 37.16 Max: 77 Sum: 2824 Ratio: 2.53%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 88022 (Eliminated: 0 Frozen: 70787)
Constraints : 649509 (Binary: 94.1% Ternary: 3.9% Other: 2.0%)
Memory Peak : 189MB
Max. Length : 78 steps
Sol. Length : 78 steps