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-31.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-31.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s 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.009s wall-clock]
Preparing model... [0.010s CPU, 0.006s wall-clock]
Generated 21 rules.
Computing model... [0.090s CPU, 0.094s wall-clock]
797 relevant atoms
525 auxiliary atoms
1322 final queue length
2257 total queue pushes
Completing instantiation... [0.160s CPU, 0.153s wall-clock]
Instantiating: [0.270s CPU, 0.268s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.024s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
Choosing groups...
16 uncovered facts
Choosing groups: [0.010s CPU, 0.010s wall-clock]
Building translation key... [0.010s CPU, 0.004s wall-clock]
Computing fact groups: [0.070s CPU, 0.071s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s 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.000s CPU, 0.008s wall-clock]
Translating task: [0.180s CPU, 0.177s wall-clock]
660 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.096s wall-clock]
Reordering and filtering variables...
31 of 31 variables necessary.
16 of 31 mutex groups necessary.
450 of 450 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.055s wall-clock]
Translator variables: 31
Translator derived variables: 0
Translator facts: 272
Translator goal facts: 14
Translator mutex groups: 16
Translator total mutex groups size: 256
Translator operators: 450
Translator axioms: 0
Translator task size: 3903
Translator peak memory: 38604 KB
Writing output... [0.060s CPU, 0.074s wall-clock]
Done! [0.760s CPU, 0.775s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 57MB
Iteration 1
Queue: [(0,40,0,True)]
Grounded Until: 0
Expected Memory: 57MB
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.46s
Memory: 104MB (+47MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 0.838s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.816s
Choices : 393 (Domain: 393)
Conflicts : 16 (Analyzed: 16)
Restarts : 0
Model-Level : 248.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 16 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 16 (Average Length: 5.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 16 (Average: 37.94 Max: 61 Sum: 607)
Executed : 6 (Average: 11.69 Max: 61 Sum: 187 Ratio: 30.81%)
Bounded : 10 (Average: 42.00 Max: 42 Sum: 420 Ratio: 69.19%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 31575 (Eliminated: 0 Frozen: 10145)
Constraints : 210581 (Binary: 93.6% Ternary: 4.7% Other: 1.7%)
Memory Peak : 250MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.03s
Memory: 186MB (+82MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.11s
Memory: 186MB (+0MB)
Answer: 1
occurs(action(("unstack","e","j")),1) occurs(action(("stack","e","f")),2) occurs(action(("unstack","j","d")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","d","l")),5) occurs(action(("put-down","d")),6) occurs(action(("unstack","l","c")),7) occurs(action(("stack","l","b")),8) occurs(action(("unstack","c","g")),9) occurs(action(("put-down","c")),10) occurs(action(("unstack","i","h")),11) occurs(action(("stack","i","c")),12) occurs(action(("unstack","m","n")),13) occurs(action(("stack","m","h")),14) occurs(action(("pick-up","n")),15) occurs(action(("stack","n","i")),16) occurs(action(("pick-up","d")),17) occurs(action(("stack","d","n")),18) occurs(action(("pick-up","j")),19) occurs(action(("stack","j","d")),20) occurs(action(("unstack","l","b")),21) occurs(action(("stack","l","j")),22) occurs(action(("unstack","b","a")),23) occurs(action(("stack","b","l")),24) occurs(action(("unstack","a","o")),25) occurs(action(("stack","a","b")),26) occurs(action(("unstack","e","f")),27) occurs(action(("stack","e","a")),28) occurs(action(("unstack","f","k")),29) occurs(action(("stack","f","e")),30) occurs(action(("unstack","m","h")),31) occurs(action(("stack","m","f")),32) occurs(action(("pick-up","k")),33) occurs(action(("stack","k","m")),34) occurs(action(("pick-up","h")),35) occurs(action(("stack","h","k")),36) occurs(action(("pick-up","o")),37) occurs(action(("stack","o","h")),38) occurs(action(("pick-up","g")),39) occurs(action(("stack","g","o")),40)
SATISFIABLE
Models : 1+
Calls : 1
Time : 0.838s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.816s
Choices : 393 (Domain: 393)
Conflicts : 16 (Analyzed: 16)
Restarts : 0
Model-Level : 248.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 16 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 16 (Average Length: 5.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 16 (Average: 37.94 Max: 61 Sum: 607)
Executed : 6 (Average: 11.69 Max: 61 Sum: 187 Ratio: 30.81%)
Bounded : 10 (Average: 42.00 Max: 42 Sum: 420 Ratio: 69.19%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 31575 (Eliminated: 0 Frozen: 10145)
Constraints : 210581 (Binary: 93.6% Ternary: 4.7% Other: 1.7%)
Memory Peak : 250MB
Max. Length : 40 steps
Sol. Length : 40 steps
Models : 1