273 lines
11 KiB
Plaintext
273 lines
11 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-32.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-32.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.005s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.080s CPU, 0.080s wall-clock]
|
|
797 relevant atoms
|
|
525 auxiliary atoms
|
|
1322 final queue length
|
|
2254 total queue pushes
|
|
Completing instantiation... [0.140s CPU, 0.137s wall-clock]
|
|
Instantiating: [0.230s CPU, 0.233s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.030s CPU, 0.026s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
16 uncovered facts
|
|
Choosing groups: [0.010s CPU, 0.009s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.070s CPU, 0.069s 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.005s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.010s CPU, 0.007s wall-clock]
|
|
Translating task: [0.160s CPU, 0.157s wall-clock]
|
|
660 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
30 propositions removed
|
|
Detecting unreachable propositions: [0.080s CPU, 0.086s wall-clock]
|
|
Reordering and filtering variables...
|
|
31 of 31 variables necessary.
|
|
16 of 31 mutex groups necessary.
|
|
450 of 450 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock]
|
|
Translator variables: 31
|
|
Translator derived variables: 0
|
|
Translator facts: 272
|
|
Translator goal facts: 14
|
|
Translator mutex groups: 16
|
|
Translator total mutex groups size: 256
|
|
Translator operators: 450
|
|
Translator axioms: 0
|
|
Translator task size: 3903
|
|
Translator peak memory: 35416 KB
|
|
Writing output... [0.060s CPU, 0.067s wall-clock]
|
|
Done! [0.680s CPU, 0.690s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.14s
|
|
Memory: 53MB
|
|
|
|
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: 53MB (+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.05s
|
|
Memory: 55MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 56MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.07s
|
|
|
|
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.06s
|
|
Memory: 58MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 59MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.07s
|
|
|
|
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.06s
|
|
Memory: 62MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 63MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.08s
|
|
|
|
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.06s
|
|
Memory: 66MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 67MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.08s
|
|
|
|
Iteration 6
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 20
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 0.06s
|
|
Memory: 69MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 72MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
Iteration 7
|
|
Queue: [(6,30,0,True)]
|
|
Grounded Until: 25
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
|
Grounding Time: 0.07s
|
|
Memory: 75MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 77MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.10s
|
|
|
|
Iteration 8
|
|
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
|
Grounded Until: 30
|
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
|
Grounding Time: 0.06s
|
|
Memory: 79MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 82MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
Iteration 9
|
|
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
|
Grounded Until: 35
|
|
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
|
Grounding Time: 0.06s
|
|
Memory: 84MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 85MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.11s
|
|
|
|
Iteration 10
|
|
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
|
Grounded Until: 40
|
|
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
|
|
Grounding Time: 0.06s
|
|
Memory: 87MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 89MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.11s
|
|
|
|
Iteration 11
|
|
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
|
Grounded Until: 45
|
|
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
|
|
Grounding Time: 0.06s
|
|
Memory: 91MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 92MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.12s
|
|
|
|
Iteration 12
|
|
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True)]
|
|
Grounded Until: 50
|
|
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
|
|
Grounding Time: 0.10s
|
|
Memory: 97MB (+5MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.74s
|
|
Memory: 110MB (+13MB)
|
|
UNSAT
|
|
Iteration Time: 0.88s
|
|
|
|
Iteration 13
|
|
Queue: [(12,60,0,True), (13,65,0,True)]
|
|
Grounded Until: 55
|
|
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
|
|
Grounding Time: 0.06s
|
|
Memory: 115MB (+5MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","g","l")),1) occurs(action(("put-down","g")),2) occurs(action(("unstack","l","f")),3) occurs(action(("stack","l","o")),4) occurs(action(("unstack","f","c")),5) occurs(action(("put-down","f")),6) occurs(action(("unstack","c","n")),7) occurs(action(("put-down","c")),8) occurs(action(("unstack","n","e")),9) occurs(action(("stack","n","c")),10) occurs(action(("unstack","e","h")),11) occurs(action(("stack","e","f")),12) occurs(action(("unstack","h","d")),13) occurs(action(("stack","h","e")),14) occurs(action(("unstack","d","a")),15) occurs(action(("put-down","d")),16) occurs(action(("unstack","a","k")),17) occurs(action(("stack","a","g")),18) occurs(action(("unstack","k","b")),19) occurs(action(("stack","k","l")),20) occurs(action(("unstack","h","e")),21) occurs(action(("stack","h","b")),22) occurs(action(("unstack","h","b")),23) occurs(action(("put-down","h")),24) occurs(action(("unstack","b","j")),25) occurs(action(("stack","b","a")),26) occurs(action(("unstack","j","i")),27) occurs(action(("stack","j","d")),28) occurs(action(("unstack","k","l")),29) occurs(action(("put-down","k")),30) occurs(action(("unstack","l","o")),31) occurs(action(("stack","l","h")),32) occurs(action(("pick-up","i")),33) occurs(action(("stack","i","l")),34) occurs(action(("unstack","o","m")),35) occurs(action(("stack","o","i")),36) occurs(action(("unstack","n","c")),37) occurs(action(("stack","n","o")),38) occurs(action(("pick-up","c")),39) occurs(action(("stack","c","n")),40) occurs(action(("unstack","c","n")),41) occurs(action(("stack","c","n")),42) occurs(action(("unstack","b","a")),43) occurs(action(("stack","b","c")),44) occurs(action(("unstack","a","g")),45) occurs(action(("stack","a","b")),46) occurs(action(("pick-up","m")),47) occurs(action(("stack","m","a")),48) occurs(action(("unstack","e","f")),49) occurs(action(("stack","e","m")),50) occurs(action(("unstack","j","d")),51) occurs(action(("stack","j","e")),52) occurs(action(("pick-up","k")),53) occurs(action(("stack","k","j")),54) occurs(action(("pick-up","f")),55) occurs(action(("stack","f","k")),56) occurs(action(("pick-up","g")),57) occurs(action(("stack","g","f")),58) occurs(action(("pick-up","d")),59) occurs(action(("stack","d","g")),60)
|
|
Solving Time: 0.05s
|
|
Memory: 116MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 13
|
|
Time : 2.092s (Solving: 0.82s 1st Model: 0.04s Unsat: 0.78s)
|
|
CPU Time : 2.090s
|
|
|
|
Choices : 8522
|
|
Conflicts : 3382 (Analyzed: 3373)
|
|
Restarts : 38 (Average: 88.76 Last: 82)
|
|
Model-Level : 79.0
|
|
Problems : 13 (Average Length: 32.00 Splits: 0)
|
|
Lemmas : 3373 (Deleted: 892)
|
|
Binary : 269 (Ratio: 7.98%)
|
|
Ternary : 161 (Ratio: 4.77%)
|
|
Conflict : 3373 (Average Length: 1089.9 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 3373 (Average: 4.11 Max: 191 Sum: 13850)
|
|
Executed : 3234 (Average: 2.50 Max: 191 Sum: 8431 Ratio: 60.87%)
|
|
Bounded : 139 (Average: 38.99 Max: 62 Sum: 5419 Ratio: 39.13%)
|
|
|
|
Rules : 12003
|
|
Atoms : 12003
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 47055 (Eliminated: 0 Frozen: 41094)
|
|
Constraints : 254698 (Binary: 93.3% Ternary: 4.8% Other: 1.9%)
|
|
|
|
Memory Peak : 122MB
|
|
Max. Length : 60 steps
|
|
Sol. Length : 60 steps
|
|
|
|
|