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-30.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-30.pddl
Parsing...
Parsing: [0.000s CPU, 0.013s wall-clock]
Normalizing task... [0.010s 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.010s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.090s CPU, 0.087s wall-clock]
702 relevant atoms
462 auxiliary atoms
1164 final queue length
1981 total queue pushes
Completing instantiation... [0.130s CPU, 0.133s wall-clock]
Instantiating: [0.240s CPU, 0.242s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.026s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.011s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
Choosing groups...
15 uncovered facts
Choosing groups: [0.000s CPU, 0.009s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.070s CPU, 0.071s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.007s wall-clock]
Translating task: [0.160s CPU, 0.153s wall-clock]
574 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
28 propositions removed
Detecting unreachable propositions: [0.080s CPU, 0.086s wall-clock]
Reordering and filtering variables...
29 of 29 variables necessary.
15 of 29 mutex groups necessary.
392 of 392 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.049s wall-clock]
Translator variables: 29
Translator derived variables: 0
Translator facts: 240
Translator goal facts: 13
Translator mutex groups: 15
Translator total mutex groups size: 225
Translator operators: 392
Translator axioms: 0
Translator task size: 3405
Translator peak memory: 38092 KB
Writing output... [0.060s CPU, 0.063s wall-clock]
Done! [0.690s CPU, 0.695s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 56MB
Iteration 1
Queue: [(0,40,0,True)]
Grounded Until: 0
Expected Memory: 56MB
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.41s
Memory: 99MB (+43MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 0.790s (Solving: 0.05s 1st Model: 0.05s Unsat: 0.00s)
CPU Time : 0.768s
Choices : 3948 (Domain: 3948)
Conflicts : 58 (Analyzed: 58)
Restarts : 0
Model-Level : 100.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 58 (Deleted: 0)
Binary : 1 (Ratio: 1.72%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 58 (Average Length: 211.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 58 (Average: 67.79 Max: 245 Sum: 3932)
Executed : 56 (Average: 67.07 Max: 245 Sum: 3890 Ratio: 98.93%)
Bounded : 2 (Average: 21.00 Max: 41 Sum: 42 Ratio: 1.07%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 27837 (Eliminated: 0 Frozen: 8911)
Constraints : 184725 (Binary: 93.4% Ternary: 4.8% Other: 1.8%)
Memory Peak : 243MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.07s
Memory: 179MB (+80MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.12s
Memory: 179MB (+0MB)
Answer: 1
occurs(action(("pick-up","n")),1) occurs(action(("put-down","n")),2) occurs(action(("unstack","g","j")),3) occurs(action(("stack","g","j")),4) occurs(action(("unstack","c","e")),5) occurs(action(("put-down","c")),6) occurs(action(("unstack","h","f")),7) occurs(action(("put-down","h")),8) occurs(action(("unstack","f","a")),9) occurs(action(("put-down","f")),10) occurs(action(("pick-up","n")),11) occurs(action(("stack","n","c")),12) occurs(action(("unstack","i","d")),13) occurs(action(("stack","i","h")),14) occurs(action(("unstack","d","l")),15) occurs(action(("put-down","d")),16) occurs(action(("unstack","l","m")),17) occurs(action(("stack","l","n")),18) occurs(action(("pick-up","e")),19) occurs(action(("stack","e","l")),20) occurs(action(("unstack","i","h")),21) occurs(action(("stack","i","e")),22) occurs(action(("unstack","a","k")),23) occurs(action(("stack","a","i")),24) occurs(action(("unstack","g","j")),25) occurs(action(("stack","g","a")),26) occurs(action(("pick-up","f")),27) occurs(action(("stack","f","g")),28) occurs(action(("unstack","k","b")),29) occurs(action(("stack","k","f")),30) occurs(action(("pick-up","m")),31) occurs(action(("stack","m","k")),32) occurs(action(("pick-up","h")),33) occurs(action(("stack","h","m")),34) occurs(action(("pick-up","b")),35) occurs(action(("stack","b","h")),36) occurs(action(("pick-up","d")),37) occurs(action(("stack","d","b")),38) occurs(action(("pick-up","j")),39) occurs(action(("stack","j","d")),40)
SATISFIABLE
Models : 1+
Calls : 1
Time : 0.790s (Solving: 0.05s 1st Model: 0.05s Unsat: 0.00s)
CPU Time : 0.768s
Choices : 3948 (Domain: 3948)
Conflicts : 58 (Analyzed: 58)
Restarts : 0
Model-Level : 100.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 58 (Deleted: 0)
Binary : 1 (Ratio: 1.72%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 58 (Average Length: 211.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 58 (Average: 67.79 Max: 245 Sum: 3932)
Executed : 56 (Average: 67.07 Max: 245 Sum: 3890 Ratio: 98.93%)
Bounded : 2 (Average: 21.00 Max: 41 Sum: 42 Ratio: 1.07%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 27837 (Eliminated: 0 Frozen: 8911)
Constraints : 184725 (Binary: 93.4% Ternary: 4.8% Other: 1.8%)
Memory Peak : 243MB
Max. Length : 40 steps
Sol. Length : 40 steps
Models : 1