1
0
Fork 0
tplp-planning-benchmark/gc-ta1-tt1-single-shot/ipc-2000_blocks-strips-type...

161 lines
7.7 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.020s 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.000s CPU, 0.009s wall-clock]
Preparing model... [0.010s 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.086s wall-clock]
Instantiating: [0.150s CPU, 0.160s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.022s 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...
12 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.047s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.090s CPU, 0.095s 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.053s 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.031s 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: 37324 KB
Writing output... [0.040s CPU, 0.040s wall-clock]
Done! [0.450s CPU, 0.451s wall-clock]
planner.py version 0.0.1
Time: 0.08s
Memory: 53MB
Iteration 1
Queue: [(0,40,0,True)]
Grounded Until: 0
Expected Memory: 53MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.24s
Memory: 81MB (+28MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 0.462s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 0.448s
Choices : 2615 (Domain: 2615)
Conflicts : 63 (Analyzed: 63)
Restarts : 0
Model-Level : 99.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 63 (Deleted: 0)
Binary : 1 (Ratio: 1.59%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 63 (Average Length: 99.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 63 (Average: 43.27 Max: 202 Sum: 2726)
Executed : 58 (Average: 40.60 Max: 202 Sum: 2558 Ratio: 93.84%)
Bounded : 5 (Average: 33.60 Max: 42 Sum: 168 Ratio: 6.16%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 18031 (Eliminated: 0 Frozen: 5665)
Constraints : 108468 (Binary: 92.6% Ternary: 5.0% Other: 2.4%)
Memory Peak : 221MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.04s
Memory: 157MB (+76MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.06s
Memory: 158MB (+1MB)
Answer: 1
occurs(action(("unstack","i","e")),1) occurs(action(("stack","i","e")),2) occurs(action(("unstack","b","h")),3) occurs(action(("put-down","b")),4) occurs(action(("unstack","i","e")),5) occurs(action(("put-down","i")),6) occurs(action(("unstack","e","g")),7) occurs(action(("stack","e","g")),8) occurs(action(("unstack","e","g")),9) occurs(action(("stack","e","g")),10) occurs(action(("unstack","h","k")),11) occurs(action(("stack","h","i")),12) occurs(action(("unstack","k","f")),13) occurs(action(("put-down","k")),14) occurs(action(("unstack","f","c")),15) occurs(action(("stack","f","k")),16) occurs(action(("unstack","c","d")),17) occurs(action(("put-down","c")),18) occurs(action(("unstack","d","j")),19) occurs(action(("put-down","d")),20) occurs(action(("unstack","j","a")),21) occurs(action(("stack","j","c")),22) occurs(action(("pick-up","a")),23) occurs(action(("stack","a","f")),24) occurs(action(("unstack","h","i")),25) occurs(action(("stack","h","a")),26) occurs(action(("pick-up","b")),27) occurs(action(("stack","b","h")),28) occurs(action(("unstack","j","c")),29) occurs(action(("stack","j","b")),30) occurs(action(("unstack","e","g")),31) occurs(action(("stack","e","j")),32) occurs(action(("pick-up","d")),33) occurs(action(("stack","d","e")),34) occurs(action(("pick-up","c")),35) occurs(action(("stack","c","d")),36) occurs(action(("pick-up","g")),37) occurs(action(("stack","g","c")),38) occurs(action(("pick-up","i")),39) occurs(action(("stack","i","g")),40)
SATISFIABLE
Models : 1+
Calls : 1
Time : 0.462s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 0.448s
Choices : 2615 (Domain: 2615)
Conflicts : 63 (Analyzed: 63)
Restarts : 0
Model-Level : 99.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 63 (Deleted: 0)
Binary : 1 (Ratio: 1.59%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 63 (Average Length: 99.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 63 (Average: 43.27 Max: 202 Sum: 2726)
Executed : 58 (Average: 40.60 Max: 202 Sum: 2558 Ratio: 93.84%)
Bounded : 5 (Average: 33.60 Max: 42 Sum: 168 Ratio: 6.16%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 18031 (Eliminated: 0 Frozen: 5665)
Constraints : 108468 (Binary: 92.6% Ternary: 5.0% Other: 2.4%)
Memory Peak : 221MB
Max. Length : 40 steps
Sol. Length : 40 steps
Models : 1