195 lines
7.6 KiB
Plaintext
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-16.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-16.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.013s 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.010s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.005s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.040s CPU, 0.046s wall-clock]
|
|
317 relevant atoms
|
|
207 auxiliary atoms
|
|
524 final queue length
|
|
868 total queue pushes
|
|
Completing instantiation... [0.060s CPU, 0.060s wall-clock]
|
|
Instantiating: [0.120s CPU, 0.125s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.025s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.000s CPU, 0.003s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Choosing groups...
|
|
10 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.004s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
|
Computing fact groups: [0.040s CPU, 0.041s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.002s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.010s CPU, 0.003s wall-clock]
|
|
Translating task: [0.060s CPU, 0.055s wall-clock]
|
|
234 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
18 propositions removed
|
|
Detecting unreachable propositions: [0.030s CPU, 0.033s wall-clock]
|
|
Reordering and filtering variables...
|
|
19 of 19 variables necessary.
|
|
10 of 19 mutex groups necessary.
|
|
162 of 162 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.018s wall-clock]
|
|
Translator variables: 19
|
|
Translator derived variables: 0
|
|
Translator facts: 110
|
|
Translator goal facts: 8
|
|
Translator mutex groups: 10
|
|
Translator total mutex groups size: 100
|
|
Translator operators: 162
|
|
Translator axioms: 0
|
|
Translator task size: 1425
|
|
Translator peak memory: 33624 KB
|
|
Writing output... [0.020s CPU, 0.025s wall-clock]
|
|
Done! [0.310s CPU, 0.321s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.07s
|
|
Memory: 48MB
|
|
|
|
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: 48MB (+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.04s
|
|
Memory: 49MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.05s
|
|
|
|
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.03s
|
|
Memory: 51MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 52MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 53MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 53MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 55MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 56MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 56MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 58MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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.03s
|
|
Memory: 58MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","f","g")),1) occurs(action(("stack","f","c")),2) occurs(action(("unstack","g","e")),3) occurs(action(("put-down","g")),4) occurs(action(("unstack","e","a")),5) occurs(action(("stack","e","f")),6) occurs(action(("unstack","a","i")),7) occurs(action(("stack","a","g")),8) occurs(action(("unstack","i","d")),9) occurs(action(("put-down","i")),10) occurs(action(("unstack","d","h")),11) occurs(action(("put-down","d")),12) occurs(action(("unstack","h","b")),13) occurs(action(("put-down","h")),14) occurs(action(("unstack","e","f")),15) occurs(action(("stack","e","h")),16) occurs(action(("unstack","f","c")),17) occurs(action(("stack","f","e")),18) occurs(action(("pick-up","i")),19) occurs(action(("stack","i","f")),20) occurs(action(("unstack","a","g")),21) occurs(action(("stack","a","i")),22) occurs(action(("pick-up","c")),23) occurs(action(("stack","c","a")),24) occurs(action(("pick-up","b")),25) occurs(action(("stack","b","c")),26) occurs(action(("pick-up","d")),27) occurs(action(("stack","d","b")),28) occurs(action(("pick-up","g")),29) occurs(action(("stack","g","d")),30)
|
|
Solving Time: 0.01s
|
|
Memory: 59MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 7
|
|
Time : 0.343s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
|
|
CPU Time : 0.330s
|
|
|
|
Choices : 605
|
|
Conflicts : 106 (Analyzed: 102)
|
|
Restarts : 1 (Average: 102.00 Last: 21)
|
|
Model-Level : 37.0
|
|
Problems : 7 (Average Length: 17.00 Splits: 0)
|
|
Lemmas : 102 (Deleted: 0)
|
|
Binary : 25 (Ratio: 24.51%)
|
|
Ternary : 12 (Ratio: 11.76%)
|
|
Conflict : 102 (Average Length: 35.4 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 102 (Average: 10.62 Max: 66 Sum: 1083)
|
|
Executed : 79 (Average: 5.88 Max: 66 Sum: 600 Ratio: 55.40%)
|
|
Bounded : 23 (Average: 21.00 Max: 32 Sum: 483 Ratio: 44.60%)
|
|
|
|
Rules : 4797
|
|
Atoms : 4797
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 10459 (Eliminated: 0 Frozen: 7890)
|
|
Constraints : 61444 (Binary: 91.6% Ternary: 4.4% Other: 4.1%)
|
|
|
|
Memory Peak : 60MB
|
|
Max. Length : 30 steps
|
|
Sol. Length : 30 steps
|
|
|
|
|