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

195 lines
7.6 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-23.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-23.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s 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.010s CPU, 0.007s wall-clock]
Preparing model... [0.000s CPU, 0.004s wall-clock]
Generated 21 rules.
Computing model... [0.050s CPU, 0.048s wall-clock]
453 relevant atoms
297 auxiliary atoms
750 final queue length
1260 total queue pushes
Completing instantiation... [0.070s CPU, 0.075s wall-clock]
Instantiating: [0.130s CPU, 0.137s 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.004s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.000s CPU, 0.005s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.045s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.080s CPU, 0.082s 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.050s CPU, 0.050s 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.026s 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: 34136 KB
Writing output... [0.030s CPU, 0.037s wall-clock]
Done! [0.390s CPU, 0.398s wall-clock]
planner.py version 0.0.1
Time: 0.09s
Memory: 49MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 49MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.05s
Memory: 51MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.04s
Memory: 54MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 54MB (+0MB)
UNSAT
Iteration Time: 0.06s
Iteration 4
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.04s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.05s
Iteration 5
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.04s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 60MB (+1MB)
UNSAT
Iteration Time: 0.06s
Iteration 6
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.05s
Memory: 62MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 63MB (+1MB)
UNSAT
Iteration Time: 0.07s
Iteration 7
Queue: [30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.04s
Memory: 65MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","j","i")),1) occurs(action(("put-down","j")),2) occurs(action(("unstack","f","e")),3) occurs(action(("put-down","f")),4) occurs(action(("unstack","e","k")),5) occurs(action(("put-down","e")),6) occurs(action(("pick-up","i")),7) occurs(action(("stack","i","e")),8) occurs(action(("unstack","d","c")),9) occurs(action(("put-down","d")),10) occurs(action(("unstack","g","b")),11) occurs(action(("stack","g","i")),12) occurs(action(("unstack","b","a")),13) occurs(action(("put-down","b")),14) occurs(action(("pick-up","f")),15) occurs(action(("stack","f","g")),16) occurs(action(("unstack","c","h")),17) occurs(action(("stack","c","f")),18) occurs(action(("pick-up","a")),19) occurs(action(("stack","a","c")),20) occurs(action(("pick-up","h")),21) occurs(action(("stack","h","a")),22) occurs(action(("pick-up","k")),23) occurs(action(("stack","k","h")),24) occurs(action(("pick-up","j")),25) occurs(action(("stack","j","k")),26) occurs(action(("pick-up","d")),27) occurs(action(("stack","d","j")),28) occurs(action(("pick-up","b")),29) occurs(action(("stack","b","d")),30)
Solving Time: 0.15s
Memory: 65MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 7
Time : 0.584s (Solving: 0.15s 1st Model: 0.14s Unsat: 0.01s)
CPU Time : 0.580s
Choices : 1718
Conflicts : 811 (Analyzed: 806)
Restarts : 9 (Average: 89.56 Last: 63)
Model-Level : 37.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 806 (Deleted: 0)
Binary : 69 (Ratio: 8.56%)
Ternary : 44 (Ratio: 5.46%)
Conflict : 806 (Average Length: 172.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 806 (Average: 2.98 Max: 98 Sum: 2401)
Executed : 767 (Average: 2.12 Max: 98 Sum: 1710 Ratio: 71.22%)
Bounded : 39 (Average: 17.72 Max: 32 Sum: 691 Ratio: 28.78%)
Rules : 7115
Atoms : 7115
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 14806 (Eliminated: 0 Frozen: 11843)
Constraints : 103036 (Binary: 92.7% Ternary: 4.1% Other: 3.2%)
Memory Peak : 67MB
Max. Length : 30 steps
Sol. Length : 30 steps