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-22.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-22.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.080s CPU, 0.076s wall-clock]
453 relevant atoms
297 auxiliary atoms
750 final queue length
1259 total queue pushes
Completing instantiation... [0.090s CPU, 0.098s wall-clock]
Instantiating: [0.200s CPU, 0.198s 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.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.040s CPU, 0.050s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.000s 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.094s 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.055s 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.030s CPU, 0.029s 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.490s CPU, 0.496s wall-clock]
planner.py version 0.0.1
Time: 0.09s
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.481s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 0.468s
Choices : 3287 (Domain: 3287)
Conflicts : 70 (Analyzed: 70)
Restarts : 0
Model-Level : 100.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 70 (Deleted: 0)
Binary : 1 (Ratio: 1.43%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 70 (Average Length: 113.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 70 (Average: 46.73 Max: 279 Sum: 3271)
Executed : 68 (Average: 46.13 Max: 279 Sum: 3229 Ratio: 98.72%)
Bounded : 2 (Average: 21.00 Max: 41 Sum: 42 Ratio: 1.28%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 18035 (Eliminated: 0 Frozen: 5689)
Constraints : 111172 (Binary: 92.6% Ternary: 5.0% Other: 2.4%)
Memory Peak : 222MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.04s
Memory: 158MB (+77MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.06s
Memory: 158MB (+0MB)
Answer: 1
occurs(action(("unstack","c","e")),1) occurs(action(("put-down","c")),2) occurs(action(("pick-up","e")),3) occurs(action(("stack","e","c")),4) occurs(action(("unstack","e","c")),5) occurs(action(("put-down","e")),6) occurs(action(("pick-up","c")),7) occurs(action(("put-down","c")),8) occurs(action(("unstack","j","d")),9) occurs(action(("put-down","j")),10) occurs(action(("unstack","b","g")),11) occurs(action(("put-down","b")),12) occurs(action(("unstack","g","h")),13) occurs(action(("stack","g","c")),14) occurs(action(("pick-up","d")),15) occurs(action(("put-down","d")),16) occurs(action(("pick-up","e")),17) occurs(action(("stack","e","g")),18) occurs(action(("unstack","h","k")),19) occurs(action(("put-down","h")),20) occurs(action(("unstack","k","a")),21) occurs(action(("stack","k","j")),22) occurs(action(("unstack","a","f")),23) occurs(action(("put-down","a")),24) occurs(action(("unstack","f","i")),25) occurs(action(("stack","f","e")),26) occurs(action(("pick-up","i")),27) occurs(action(("stack","i","f")),28) occurs(action(("unstack","k","j")),29) occurs(action(("stack","k","i")),30) occurs(action(("pick-up","h")),31) occurs(action(("stack","h","k")),32) occurs(action(("pick-up","b")),33) occurs(action(("stack","b","h")),34) occurs(action(("pick-up","d")),35) occurs(action(("stack","d","b")),36) occurs(action(("pick-up","j")),37) occurs(action(("stack","j","d")),38) occurs(action(("pick-up","a")),39) occurs(action(("stack","a","j")),40)
SATISFIABLE
Models : 1+
Calls : 1
Time : 0.481s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 0.468s
Choices : 3287 (Domain: 3287)
Conflicts : 70 (Analyzed: 70)
Restarts : 0
Model-Level : 100.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 70 (Deleted: 0)
Binary : 1 (Ratio: 1.43%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 70 (Average Length: 113.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 70 (Average: 46.73 Max: 279 Sum: 3271)
Executed : 68 (Average: 46.13 Max: 279 Sum: 3229 Ratio: 98.72%)
Bounded : 2 (Average: 21.00 Max: 41 Sum: 42 Ratio: 1.28%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 18035 (Eliminated: 0 Frozen: 5689)
Constraints : 111172 (Binary: 92.6% Ternary: 5.0% Other: 2.4%)
Memory Peak : 222MB
Max. Length : 40 steps
Sol. Length : 40 steps
Models : 1