1
0
Fork 0
tplp-planning-benchmark/fd-ps-e1-sh/ipc-2000_blocks-strips-type...

221 lines
8.1 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.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.090s CPU, 0.088s wall-clock]
702 relevant atoms
462 auxiliary atoms
1164 final queue length
1981 total queue pushes
Completing instantiation... [0.120s CPU, 0.120s wall-clock]
Instantiating: [0.230s CPU, 0.229s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.010s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
15 uncovered facts
Choosing groups: [0.010s CPU, 0.008s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.060s CPU, 0.060s wall-clock]
Building STRIPS to SAS dictionary... [0.000s 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.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.006s wall-clock]
Translating task: [0.130s CPU, 0.136s 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.079s 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.043s 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: 34904 KB
Writing output... [0.050s CPU, 0.057s wall-clock]
Done! [0.620s CPU, 0.632s wall-clock]
planner.py version 0.0.1
Time: 0.14s
Memory: 52MB
Iteration 1
Queue: [0]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 52MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.07s
Memory: 54MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+1MB)
UNSAT
Iteration Time: 0.08s
Iteration 3
Queue: [10]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.06s
Memory: 58MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 59MB (+1MB)
UNSAT
Iteration Time: 0.08s
Iteration 4
Queue: [15]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.07s
Memory: 62MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 64MB (+2MB)
UNSAT
Iteration Time: 0.09s
Iteration 5
Queue: [20]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.06s
Memory: 66MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 68MB (+2MB)
UNSAT
Iteration Time: 0.09s
Iteration 6
Queue: [25]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.06s
Memory: 70MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 73MB (+3MB)
UNSAT
Iteration Time: 0.10s
Iteration 7
Queue: [30]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.08s
Memory: 76MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 77MB (+1MB)
UNSAT
Iteration Time: 0.15s
Iteration 8
Queue: [35]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.06s
Memory: 80MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.27s
Memory: 83MB (+3MB)
UNSAT
Iteration Time: 0.35s
Iteration 9
Queue: [40]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.07s
Memory: 87MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","i","d")),1) occurs(action(("stack","i","g")),2) occurs(action(("unstack","d","l")),3) occurs(action(("put-down","d")),4) occurs(action(("unstack","l","m")),5) occurs(action(("stack","l","d")),6) occurs(action(("unstack","l","d")),7) occurs(action(("stack","l","d")),8) occurs(action(("unstack","c","e")),9) occurs(action(("put-down","c")),10) occurs(action(("pick-up","n")),11) occurs(action(("stack","n","c")),12) occurs(action(("unstack","l","d")),13) occurs(action(("stack","l","n")),14) occurs(action(("pick-up","e")),15) occurs(action(("stack","e","l")),16) occurs(action(("unstack","h","f")),17) occurs(action(("stack","h","d")),18) occurs(action(("unstack","f","a")),19) occurs(action(("stack","f","m")),20) occurs(action(("unstack","i","g")),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(("unstack","f","m")),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(("unstack","h","d")),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)
Solving Time: 0.13s
Memory: 88MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 1.306s (Solving: 0.44s 1st Model: 0.12s Unsat: 0.32s)
CPU Time : 1.310s
Choices : 3075
Conflicts : 1516 (Analyzed: 1510)
Restarts : 15 (Average: 100.67 Last: 158)
Model-Level : 53.0
Problems : 9 (Average Length: 22.00 Splits: 0)
Lemmas : 1510 (Deleted: 0)
Binary : 182 (Ratio: 12.05%)
Ternary : 65 (Ratio: 4.30%)
Conflict : 1510 (Average Length: 347.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1510 (Average: 2.64 Max: 68 Sum: 3981)
Executed : 1449 (Average: 2.03 Max: 68 Sum: 3060 Ratio: 76.87%)
Bounded : 61 (Average: 15.10 Max: 42 Sum: 921 Ratio: 23.13%)
Rules : 11445
Atoms : 11445
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 30104 (Eliminated: 0 Frozen: 25083)
Constraints : 220956 (Binary: 93.5% Ternary: 4.0% Other: 2.5%)
Memory Peak : 91MB
Max. Length : 40 steps
Sol. Length : 40 steps