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

299 lines
12 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-39.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-39.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.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.140s CPU, 0.139s wall-clock]
1237 relevant atoms
817 auxiliary atoms
2054 final queue length
3539 total queue pushes
Completing instantiation... [0.220s CPU, 0.215s wall-clock]
Instantiating: [0.380s CPU, 0.376s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.019s 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.010s CPU, 0.003s wall-clock]
Choosing groups...
20 uncovered facts
Choosing groups: [0.010s CPU, 0.015s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.080s CPU, 0.085s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.010s CPU, 0.011s wall-clock]
Translating task: [0.250s CPU, 0.255s 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.080s 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.090s CPU, 0.104s wall-clock]
Done! [1.070s CPU, 1.080s wall-clock]
planner.py version 0.0.1
Time: 0.23s
Memory: 57MB
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: 57MB (+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.11s
Memory: 62MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 64MB (+2MB)
UNSAT
Iteration Time: 0.14s
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.11s
Memory: 68MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 70MB (+2MB)
UNSAT
Iteration Time: 0.15s
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.13s
Memory: 75MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 78MB (+3MB)
UNSAT
Iteration Time: 0.18s
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.12s
Memory: 81MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 84MB (+3MB)
UNSAT
Iteration Time: 0.17s
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.12s
Memory: 89MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 93MB (+4MB)
UNSAT
Iteration Time: 0.18s
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.13s
Memory: 96MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 99MB (+3MB)
UNSAT
Iteration Time: 0.18s
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.16s
Memory: 106MB (+7MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 111MB (+5MB)
UNSAT
Iteration Time: 0.23s
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.13s
Memory: 114MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 117MB (+3MB)
UNSAT
Iteration Time: 0.22s
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.13s
Memory: 121MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 124MB (+3MB)
UNSAT
Iteration Time: 0.26s
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.13s
Memory: 128MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 130MB (+2MB)
UNSAT
Iteration Time: 0.28s
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.13s
Memory: 134MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 140MB (+6MB)
UNSAT
Iteration Time: 0.29s
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.13s
Memory: 142MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.14s
Memory: 147MB (+5MB)
UNSAT
Iteration Time: 0.34s
Iteration 14
Queue: [(13,65,0,True)]
Grounded Until: 60
Grounding... [('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('check', [65])]
Grounding Time: 0.13s
Memory: 150MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.55s
Memory: 154MB (+4MB)
UNSAT
Iteration Time: 0.75s
Iteration 15
Queue: [(14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True), (19,95,0,True), (20,100,0,True)]
Grounded Until: 65
Grounding... [('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('check', [70])]
Grounding Time: 0.21s
Memory: 164MB (+10MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","n","j")),1) occurs(action(("put-down","n")),2) occurs(action(("pick-up","s")),3) occurs(action(("put-down","s")),4) occurs(action(("pick-up","n")),5) occurs(action(("put-down","n")),6) occurs(action(("unstack","j","k")),7) occurs(action(("put-down","j")),8) occurs(action(("unstack","k","g")),9) occurs(action(("put-down","k")),10) occurs(action(("unstack","g","a")),11) occurs(action(("put-down","g")),12) occurs(action(("pick-up","k")),13) occurs(action(("stack","k","g")),14) occurs(action(("unstack","a","r")),15) occurs(action(("put-down","a")),16) occurs(action(("unstack","r","i")),17) occurs(action(("put-down","r")),18) occurs(action(("pick-up","s")),19) occurs(action(("stack","s","n")),20) occurs(action(("unstack","i","p")),21) occurs(action(("stack","i","r")),22) occurs(action(("unstack","p","m")),23) occurs(action(("put-down","p")),24) occurs(action(("unstack","m","q")),25) occurs(action(("stack","m","j")),26) occurs(action(("unstack","q","c")),27) occurs(action(("put-down","q")),28) occurs(action(("unstack","c","d")),29) occurs(action(("stack","c","k")),30) occurs(action(("pick-up","l")),31) occurs(action(("stack","l","p")),32) occurs(action(("unstack","d","h")),33) occurs(action(("stack","d","q")),34) occurs(action(("unstack","h","o")),35) occurs(action(("put-down","h")),36) occurs(action(("unstack","o","e")),37) occurs(action(("stack","o","l")),38) occurs(action(("unstack","e","f")),39) occurs(action(("stack","e","c")),40) occurs(action(("unstack","o","l")),41) occurs(action(("stack","o","e")),42) occurs(action(("unstack","m","j")),43) occurs(action(("stack","m","o")),44) occurs(action(("unstack","s","n")),45) occurs(action(("stack","s","m")),46) occurs(action(("unstack","f","b")),47) occurs(action(("stack","f","s")),48) occurs(action(("pick-up","n")),49) occurs(action(("stack","n","f")),50) occurs(action(("pick-up","b")),51) occurs(action(("stack","b","n")),52) occurs(action(("pick-up","j")),53) occurs(action(("stack","j","b")),54) occurs(action(("unstack","d","q")),55) occurs(action(("stack","d","j")),56) occurs(action(("unstack","i","r")),57) occurs(action(("stack","i","d")),58) occurs(action(("pick-up","r")),59) occurs(action(("stack","r","i")),60) occurs(action(("unstack","l","p")),61) occurs(action(("stack","l","r")),62) occurs(action(("pick-up","a")),63) occurs(action(("stack","a","l")),64) occurs(action(("pick-up","p")),65) occurs(action(("stack","p","a")),66) occurs(action(("pick-up","q")),67) occurs(action(("stack","q","p")),68) occurs(action(("pick-up","h")),69) occurs(action(("stack","h","q")),70)
Solving Time: 0.24s
Memory: 168MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 15
Time : 4.125s (Solving: 1.15s 1st Model: 0.21s Unsat: 0.93s)
CPU Time : 4.110s
Choices : 33672 (Domain: 33672)
Conflicts : 956 (Analyzed: 946)
Restarts : 9 (Average: 105.11 Last: 60)
Model-Level : 1193.0
Problems : 15 (Average Length: 37.00 Splits: 0)
Lemmas : 946 (Deleted: 0)
Binary : 65 (Ratio: 6.87%)
Ternary : 8 (Ratio: 0.85%)
Conflict : 946 (Average Length: 344.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 946 (Average: 35.07 Max: 1240 Sum: 33172)
Executed : 917 (Average: 34.34 Max: 1240 Sum: 32485 Ratio: 97.93%)
Bounded : 29 (Average: 23.69 Max: 67 Sum: 687 Ratio: 2.07%)
Rules : 20938
Atoms : 20938
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 90163 (Eliminated: 0 Frozen: 77026)
Constraints : 563208 (Binary: 94.2% Ternary: 3.8% Other: 2.0%)
Memory Peak : 177MB
Max. Length : 70 steps
Sol. Length : 70 steps