169 lines
6.5 KiB
Plaintext
169 lines
6.5 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-12.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-12.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.010s CPU, 0.011s 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.000s CPU, 0.004s wall-clock]
|
||
|
Generated 21 rules.
|
||
|
Computing model... [0.030s CPU, 0.027s wall-clock]
|
||
|
205 relevant atoms
|
||
|
133 auxiliary atoms
|
||
|
338 final queue length
|
||
|
550 total queue pushes
|
||
|
Completing instantiation... [0.030s CPU, 0.037s wall-clock]
|
||
|
Instantiating: [0.070s CPU, 0.080s 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.001s wall-clock]
|
||
|
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
Choosing groups...
|
||
|
8 uncovered facts
|
||
|
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||
|
Computing fact groups: [0.040s CPU, 0.033s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
Building mutex information...
|
||
|
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||
|
Translating task: [0.040s CPU, 0.036s wall-clock]
|
||
|
140 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
14 propositions removed
|
||
|
Detecting unreachable propositions: [0.020s CPU, 0.022s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
15 of 15 variables necessary.
|
||
|
8 of 15 mutex groups necessary.
|
||
|
98 of 98 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
||
|
Translator variables: 15
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 72
|
||
|
Translator goal facts: 6
|
||
|
Translator mutex groups: 8
|
||
|
Translator total mutex groups size: 64
|
||
|
Translator operators: 98
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 871
|
||
|
Translator peak memory: 33368 KB
|
||
|
Writing output... [0.020s CPU, 0.016s wall-clock]
|
||
|
Done! [0.210s CPU, 0.216s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.05s
|
||
|
Memory: 47MB
|
||
|
|
||
|
Iteration 1
|
||
|
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 0
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 47MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.00s
|
||
|
|
||
|
Iteration 2
|
||
|
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 0
|
||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 48MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 48MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
Iteration 3
|
||
|
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 5
|
||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 49MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 49MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
Iteration 4
|
||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 10
|
||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 50MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 51MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
Iteration 5
|
||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
Grounded Until: 15
|
||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 51MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("unstack","b","c")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","c","g")),3) occurs(action(("stack","c","b")),4) occurs(action(("unstack","g","e")),5) occurs(action(("put-down","g")),6) occurs(action(("unstack","c","b")),7) occurs(action(("stack","c","g")),8) occurs(action(("unstack","a","d")),9) occurs(action(("stack","a","c")),10) occurs(action(("pick-up","d")),11) occurs(action(("stack","d","a")),12) occurs(action(("unstack","e","f")),13) occurs(action(("put-down","e")),14) occurs(action(("pick-up","f")),15) occurs(action(("stack","f","d")),16) occurs(action(("pick-up","b")),17) occurs(action(("stack","b","f")),18) occurs(action(("pick-up","e")),19) occurs(action(("stack","e","b")),20)
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 52MB (+1MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 5
|
||
|
Time : 0.173s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
CPU Time : 0.170s
|
||
|
|
||
|
Choices : 44 (Domain: 44)
|
||
|
Conflicts : 9 (Analyzed: 7)
|
||
|
Restarts : 0
|
||
|
Model-Level : 49.0
|
||
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||
|
Lemmas : 7 (Deleted: 0)
|
||
|
Binary : 2 (Ratio: 28.57%)
|
||
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
Conflict : 7 (Average Length: 2.6 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 7 (Average: 9.86 Max: 21 Sum: 69)
|
||
|
Executed : 3 (Average: 2.43 Max: 21 Sum: 17 Ratio: 24.64%)
|
||
|
Bounded : 4 (Average: 13.00 Max: 17 Sum: 52 Ratio: 75.36%)
|
||
|
|
||
|
Rules : 2937
|
||
|
Atoms : 2937
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 4643 (Eliminated: 0 Frozen: 3322)
|
||
|
Constraints : 24138 (Binary: 89.9% Ternary: 4.7% Other: 5.4%)
|
||
|
|
||
|
Memory Peak : 52MB
|
||
|
Max. Length : 20 steps
|
||
|
Sol. Length : 20 steps
|
||
|
|
||
|
|