225 lines
10 KiB
Plaintext
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-24.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-24.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.010s CPU, 0.011s 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.020s CPU, 0.010s wall-clock]
|
||
|
Preparing model... [0.000s CPU, 0.005s wall-clock]
|
||
|
Generated 21 rules.
|
||
|
Computing model... [0.060s CPU, 0.057s wall-clock]
|
||
|
453 relevant atoms
|
||
|
297 auxiliary atoms
|
||
|
750 final queue length
|
||
|
1258 total queue pushes
|
||
|
Completing instantiation... [0.080s CPU, 0.079s wall-clock]
|
||
|
Instantiating: [0.160s CPU, 0.155s 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.010s CPU, 0.005s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
Choosing groups...
|
||
|
12 uncovered facts
|
||
|
Choosing groups: [0.010s CPU, 0.005s wall-clock]
|
||
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
Computing fact groups: [0.040s CPU, 0.047s 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.082s 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.060s CPU, 0.051s 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.036s wall-clock]
|
||
|
Done! [0.420s CPU, 0.420s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.10s
|
||
|
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.02s
|
||
|
|
||
|
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: 55MB (+2MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 56MB (+1MB)
|
||
|
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: 63MB (+4MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 65MB (+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.10s
|
||
|
Memory: 71MB (+6MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.41s
|
||
|
Memory: 74MB (+3MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.53s
|
||
|
|
||
|
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: 84MB (+10MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.33s
|
||
|
Memory: 88MB (+4MB)
|
||
|
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.23s
|
||
|
Memory: 101MB (+13MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("unstack","b","h")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","h","k")),3) occurs(action(("put-down","h")),4) occurs(action(("unstack","k","f")),5) occurs(action(("put-down","k")),6) occurs(action(("unstack","f","c")),7) occurs(action(("put-down","f")),8) occurs(action(("unstack","c","d")),9) occurs(action(("put-down","c")),10) occurs(action(("unstack","d","j")),11) occurs(action(("put-down","d")),12) occurs(action(("unstack","i","e")),13) occurs(action(("stack","i","j")),14) occurs(action(("unstack","e","g")),15) occurs(action(("stack","e","c")),16) occurs(action(("unstack","i","j")),17) occurs(action(("stack","i","g")),18) occurs(action(("pick-up","b")),19) occurs(action(("stack","b","j")),20) occurs(action(("unstack","b","j")),21) occurs(action(("stack","b","k")),22) occurs(action(("unstack","i","g")),23) occurs(action(("stack","i","h")),24) occurs(action(("pick-up","g")),25) occurs(action(("stack","g","f")),26) occurs(action(("unstack","e","c")),27) occurs(action(("stack","e","c")),28) occurs(action(("unstack","i","h")),29) occurs(action(("put-down","i")),30) occurs(action(("unstack","j","a")),31) occurs(action(("stack","j","i")),32) occurs(action(("pick-up","h")),33) occurs(action(("stack","h","a")),34) occurs(action(("unstack","b","k")),35) occurs(action(("stack","b","e")),36) occurs(action(("unstack","j","i")),37) occurs(action(("stack","j","k")),38) occurs(action(("unstack","g","f")),39) occurs(action(("stack","g","d")),40) occurs(action(("unstack","g","d")),41) occurs(action(("stack","g","f")),42) occurs(action(("unstack","g","f")),43) occurs(action(("stack","g","f")),44) occurs(action(("unstack","j","k")),45) occurs(action(("stack","j","k")),46) occurs(action(("unstack","g","f")),47) occurs(action(("stack","g","b")),48) occurs(action(("unstack","h","a")),49) occurs(action(("stack","h","d")),50) occurs(action(("unstack","g","b")),51) occurs(action(("stack","g","i")),52) occurs(action(("unstack","b","e")),53) occurs(action(("stack","b","e")),54) occurs(action(("unstack","j","k")),55) occurs(action(("stack","j","b")),56) occurs(action(("pick-up","f")),57) occurs(action(("stack","f","k")),58) occurs(action(("pick-up","a")),59) occurs(action(("stack","a","f")),60) occurs(action(("unstack","j","b")),61) occurs(action(("put-down","j")),62) occurs(action(("unstack","h","d")),63) occurs(action(("stack","h","a")),64) occurs(action(("unstack","b","e")),65) occurs(action(("stack","b","h")),66) occurs(action(("pick-up","j")),67) occurs(action(("stack","j","b")),68) occurs(action(("unstack","e","c")),69) occurs(action(("stack","e","j")),70) occurs(action(("pick-up","d")),71) occurs(action(("stack","d","e")),72) occurs(action(("pick-up","c")),73) occurs(action(("stack","c","d")),74) occurs(action(("unstack","g","i")),75) occurs(action(("stack","g","c")),76) occurs(action(("pick-up","i")),77) occurs(action(("stack","i","g")),78)
|
||
|
Solving Time: 0.20s
|
||
|
Memory: 107MB (+6MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 9
|
||
|
Time : 1.995s (Solving: 0.93s 1st Model: 0.19s Unsat: 0.74s)
|
||
|
CPU Time : 1.990s
|
||
|
|
||
|
Choices : 11194
|
||
|
Conflicts : 5271 (Analyzed: 5265)
|
||
|
Restarts : 61 (Average: 86.31 Last: 133)
|
||
|
Model-Level : 126.0
|
||
|
Problems : 9 (Average Length: 30.11 Splits: 0)
|
||
|
Lemmas : 5265 (Deleted: 897)
|
||
|
Binary : 343 (Ratio: 6.51%)
|
||
|
Ternary : 206 (Ratio: 3.91%)
|
||
|
Conflict : 5265 (Average Length: 317.2 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 5265 (Average: 2.49 Max: 174 Sum: 13127)
|
||
|
Executed : 5187 (Average: 2.08 Max: 174 Sum: 10942 Ratio: 83.35%)
|
||
|
Bounded : 78 (Average: 28.01 Max: 80 Sum: 2185 Ratio: 16.65%)
|
||
|
|
||
|
Rules : 0
|
||
|
Atoms : 0
|
||
|
Bodies : 0
|
||
|
Tight : Yes
|
||
|
Variables : 38808 (Eliminated: 0 Frozen: 31109)
|
||
|
Constraints : 260933 (Binary: 92.6% Ternary: 4.2% Other: 3.2%)
|
||
|
|
||
|
Memory Peak : 107MB
|
||
|
Max. Length : 78 steps
|
||
|
Sol. Length : 78 steps
|
||
|
|
||
|
|