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-40.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-40.pddl
|
|
Parsing...
|
|
Parsing: [0.010s CPU, 0.015s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.008s wall-clock]
|
|
Generated 21 rules.
|
|
Computing model... [0.150s CPU, 0.149s wall-clock]
|
|
1237 relevant atoms
|
|
817 auxiliary atoms
|
|
2054 final queue length
|
|
3539 total queue pushes
|
|
Completing instantiation... [0.220s CPU, 0.219s wall-clock]
|
|
Instantiating: [0.400s CPU, 0.392s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
10 initial candidates
|
|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
|
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
|
Choosing groups...
|
|
20 uncovered facts
|
|
Choosing groups: [0.020s CPU, 0.015s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.005s wall-clock]
|
|
Computing fact groups: [0.080s CPU, 0.084s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.010s CPU, 0.008s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.020s CPU, 0.012s wall-clock]
|
|
Translating task: [0.260s CPU, 0.253s wall-clock]
|
|
1064 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
38 propositions removed
|
|
Detecting unreachable propositions: [0.140s CPU, 0.140s wall-clock]
|
|
Reordering and filtering variables...
|
|
39 of 39 variables necessary.
|
|
20 of 39 mutex groups necessary.
|
|
722 of 722 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.080s CPU, 0.079s wall-clock]
|
|
Translator variables: 39
|
|
Translator derived variables: 0
|
|
Translator facts: 420
|
|
Translator goal facts: 18
|
|
Translator mutex groups: 20
|
|
Translator total mutex groups size: 400
|
|
Translator operators: 722
|
|
Translator axioms: 0
|
|
Translator task size: 6235
|
|
Translator peak memory: 36696 KB
|
|
Writing output... [0.100s CPU, 0.105s wall-clock]
|
|
Done! [1.090s CPU, 1.098s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 1.81s
|
|
Memory: 157MB
|
|
|
|
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.01s
|
|
Memory: 157MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.01s
|
|
|
|
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.44s
|
|
Memory: 185MB (+28MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 191MB (+6MB)
|
|
UNSAT
|
|
Iteration Time: 0.54s
|
|
|
|
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.45s
|
|
Memory: 197MB (+6MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 213MB (+16MB)
|
|
UNSAT
|
|
Iteration Time: 0.57s
|
|
|
|
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.46s
|
|
Memory: 213MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 231MB (+18MB)
|
|
UNSAT
|
|
Iteration Time: 0.60s
|
|
|
|
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.47s
|
|
Memory: 239MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 262MB (+23MB)
|
|
UNSAT
|
|
Iteration Time: 0.63s
|
|
|
|
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.48s
|
|
Memory: 270MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 303MB (+33MB)
|
|
UNSAT
|
|
Iteration Time: 0.64s
|
|
|
|
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.46s
|
|
Memory: 303MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 326MB (+23MB)
|
|
UNSAT
|
|
Iteration Time: 0.63s
|
|
|
|
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.47s
|
|
Memory: 326MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.02s
|
|
Memory: 374MB (+48MB)
|
|
UNSAT
|
|
Iteration Time: 0.66s
|
|
|
|
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.47s
|
|
Memory: 374MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 379MB (+5MB)
|
|
UNSAT
|
|
Iteration Time: 0.66s
|
|
|
|
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.48s
|
|
Memory: 379MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 389MB (+10MB)
|
|
UNSAT
|
|
Iteration Time: 0.68s
|
|
|
|
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.49s
|
|
Memory: 397MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.13s
|
|
Memory: 440MB (+43MB)
|
|
UNSAT
|
|
Iteration Time: 0.81s
|
|
|
|
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.48s
|
|
Memory: 445MB (+5MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.16s
|
|
Memory: 453MB (+8MB)
|
|
UNSAT
|
|
Iteration Time: 0.82s
|
|
|
|
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.48s
|
|
Memory: 461MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("unstack","a","h")),1) occurs(action(("put-down","a")),2) occurs(action(("unstack","h","l")),3) occurs(action(("put-down","h")),4) occurs(action(("unstack","l","c")),5) occurs(action(("put-down","l")),6) occurs(action(("unstack","c","s")),7) occurs(action(("put-down","c")),8) occurs(action(("unstack","s","f")),9) occurs(action(("stack","s","l")),10) occurs(action(("unstack","f","p")),11) occurs(action(("stack","f","s")),12) occurs(action(("unstack","p","m")),13) occurs(action(("stack","p","h")),14) occurs(action(("unstack","m","g")),15) occurs(action(("put-down","m")),16) occurs(action(("unstack","g","j")),17) occurs(action(("stack","g","m")),18) occurs(action(("unstack","j","n")),19) occurs(action(("put-down","j")),20) occurs(action(("unstack","f","s")),21) occurs(action(("stack","f","g")),22) occurs(action(("unstack","n","i")),23) occurs(action(("put-down","n")),24) occurs(action(("unstack","i","r")),25) occurs(action(("stack","i","s")),26) occurs(action(("unstack","q","d")),27) occurs(action(("stack","q","f")),28) occurs(action(("unstack","r","e")),29) occurs(action(("stack","r","e")),30) occurs(action(("unstack","r","e")),31) occurs(action(("stack","r","q")),32) occurs(action(("unstack","o","b")),33) occurs(action(("stack","o","r")),34) occurs(action(("pick-up","n")),35) occurs(action(("stack","n","o")),36) occurs(action(("unstack","p","h")),37) occurs(action(("stack","p","n")),38) occurs(action(("pick-up","d")),39) occurs(action(("stack","d","p")),40) occurs(action(("pick-up","a")),41) occurs(action(("stack","a","d")),42) occurs(action(("pick-up","h")),43) occurs(action(("stack","h","a")),44) occurs(action(("unstack","b","k")),45) occurs(action(("stack","b","h")),46) occurs(action(("pick-up","e")),47) occurs(action(("stack","e","b")),48) occurs(action(("pick-up","k")),49) occurs(action(("stack","k","e")),50) occurs(action(("pick-up","j")),51) occurs(action(("stack","j","k")),52) occurs(action(("unstack","i","s")),53) occurs(action(("stack","i","j")),54) occurs(action(("unstack","s","l")),55) occurs(action(("stack","s","i")),56) occurs(action(("pick-up","c")),57) occurs(action(("stack","c","s")),58) occurs(action(("pick-up","l")),59) occurs(action(("stack","l","c")),60)
|
|
Solving Time: 0.41s
|
|
Memory: 474MB (+13MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 13
|
|
Time : 10.139s (Solving: 0.68s 1st Model: 0.38s Unsat: 0.30s)
|
|
CPU Time : 10.130s
|
|
|
|
Choices : 54489
|
|
Conflicts : 1506 (Analyzed: 1497)
|
|
Restarts : 16 (Average: 93.56 Last: 52)
|
|
Model-Level : 226.0
|
|
Problems : 13 (Average Length: 32.00 Splits: 0)
|
|
Lemmas : 1497 (Deleted: 0)
|
|
Binary : 236 (Ratio: 15.76%)
|
|
Ternary : 58 (Ratio: 3.87%)
|
|
Conflict : 1497 (Average Length: 390.6 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 1497 (Average: 38.85 Max: 2415 Sum: 58152)
|
|
Executed : 1377 (Average: 36.23 Max: 2415 Sum: 54241 Ratio: 93.27%)
|
|
Bounded : 120 (Average: 32.59 Max: 62 Sum: 3911 Ratio: 6.73%)
|
|
|
|
Rules : 781318
|
|
Atoms : 781318
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 72877 (Eliminated: 0 Frozen: 63051)
|
|
Constraints : 419262 (Binary: 94.0% Ternary: 4.6% Other: 1.4%)
|
|
|
|
Memory Peak : 520MB
|
|
Max. Length : 60 steps
|
|
Sol. Length : 60 steps
|
|
|
|
|