1
0
Fork 0
tplp-planning-benchmark/fd-pb-e3/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-38.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-38.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s 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.010s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 21 rules.
Computing model... [0.120s CPU, 0.122s wall-clock]
1118 relevant atoms
738 auxiliary atoms
1856 final queue length
3191 total queue pushes
Completing instantiation... [0.200s CPU, 0.199s wall-clock]
Instantiating: [0.340s CPU, 0.343s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.011s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
19 uncovered facts
Choosing groups: [0.010s CPU, 0.013s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.080s CPU, 0.080s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.010s wall-clock]
Translating task: [0.230s CPU, 0.226s wall-clock]
954 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
36 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.126s wall-clock]
Reordering and filtering variables...
37 of 37 variables necessary.
19 of 37 mutex groups necessary.
648 of 648 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.080s CPU, 0.070s wall-clock]
Translator variables: 37
Translator derived variables: 0
Translator facts: 380
Translator goal facts: 17
Translator mutex groups: 19
Translator total mutex groups size: 361
Translator operators: 648
Translator axioms: 0
Translator task size: 5601
Translator peak memory: 36440 KB
Writing output... [0.090s CPU, 0.095s wall-clock]
Done! [0.970s CPU, 0.979s wall-clock]
planner.py version 0.0.1
Time: 1.31s
Memory: 125MB
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: 125MB (+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: 1.34s
Memory: 287MB (+162MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 287MB (+0MB)
UNSAT
Iteration Time: 1.71s
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: 1.60s
Memory: 368MB (+81MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 368MB (+0MB)
UNSAT
Iteration Time: 2.00s
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: 1.32s
Memory: 424MB (+56MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 424MB (+0MB)
UNSAT
Iteration Time: 1.77s
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: 2.05s
Memory: 532MB (+108MB)
Unblocking actions...
Solving...
Solving Time: 0.09s
Memory: 532MB (+0MB)
UNSAT
Iteration Time: 2.55s
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: 1.32s
Memory: 593MB (+61MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 593MB (+0MB)
UNSAT
Iteration Time: 1.89s
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: 1.37s
Memory: 653MB (+60MB)
Unblocking actions...
Solving...
Solving Time: 0.16s
Memory: 661MB (+8MB)
UNSAT
Iteration Time: 1.97s
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: 1.43s
Memory: 710MB (+49MB)
Unblocking actions...
Solving...
Solving Time: 0.21s
Memory: 720MB (+10MB)
UNSAT
Iteration Time: 2.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: 1.47s
Memory: 770MB (+50MB)
Unblocking actions...
Solving...
Solving Time: 0.23s
Memory: 781MB (+11MB)
UNSAT
Iteration Time: 2.13s
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: 2.85s
Memory: 927MB (+146MB)
Unblocking actions...
Solving...
Solving Time: 0.26s
Memory: 940MB (+13MB)
UNSAT
Iteration Time: 3.56s
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: 1.35s
Memory: 986MB (+46MB)
Unblocking actions...
Solving...
Solving Time: 0.27s
Memory: 1001MB (+15MB)
UNSAT
Iteration Time: 2.08s
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: 1.38s
Memory: 1047MB (+46MB)
Unblocking actions...
Solving...
Solving Time: 0.29s
Memory: 1063MB (+16MB)
UNSAT
Iteration Time: 2.14s
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: 1.40s
Memory: 1105MB (+42MB)
Unblocking actions...
Solving...
Solving Time: 0.33s
Memory: 1122MB (+17MB)
UNSAT
Iteration Time: 2.19s
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: 1.42s
Memory: 1162MB (+40MB)
Unblocking actions...
Solving...
Solving Time: 4.54s
Memory: 1207MB (+45MB)
UNSAT
Iteration Time: 6.45s
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: 1.45s
Memory: 1283MB (+76MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("unstack","g","p")),1) occurs(action(("put-down","g")),2) occurs(action(("unstack","p","n")),3) occurs(action(("put-down","p")),4) occurs(action(("unstack","n","e")),5) occurs(action(("put-down","n")),6) occurs(action(("unstack","e","r")),7) occurs(action(("put-down","e")),8) occurs(action(("unstack","r","i")),9) occurs(action(("put-down","r")),10) occurs(action(("unstack","i","f")),11) occurs(action(("stack","i","k")),12) occurs(action(("unstack","f","o")),13) occurs(action(("stack","f","n")),14) occurs(action(("unstack","o","l")),15) occurs(action(("stack","o","r")),16) occurs(action(("unstack","l","b")),17) occurs(action(("put-down","l")),18) occurs(action(("unstack","b","d")),19) occurs(action(("put-down","b")),20) occurs(action(("unstack","d","q")),21) occurs(action(("put-down","d")),22) occurs(action(("unstack","j","h")),23) occurs(action(("stack","j","f")),24) occurs(action(("unstack","q","m")),25) occurs(action(("stack","q","b")),26) occurs(action(("unstack","m","c")),27) occurs(action(("put-down","m")),28) occurs(action(("unstack","h","a")),29) occurs(action(("put-down","h")),30) occurs(action(("pick-up","c")),31) occurs(action(("stack","c","a")),32) occurs(action(("pick-up","l")),33) occurs(action(("stack","l","c")),34) occurs(action(("pick-up","p")),35) occurs(action(("stack","p","l")),36) occurs(action(("unstack","i","k")),37) occurs(action(("stack","i","p")),38) occurs(action(("unstack","j","f")),39) occurs(action(("stack","j","i")),40) occurs(action(("pick-up","k")),41) occurs(action(("stack","k","j")),42) occurs(action(("unstack","o","r")),43) occurs(action(("stack","o","k")),44) occurs(action(("unstack","q","b")),45) occurs(action(("stack","q","o")),46) occurs(action(("pick-up","r")),47) occurs(action(("stack","r","q")),48) occurs(action(("unstack","f","n")),49) occurs(action(("stack","f","r")),50) occurs(action(("pick-up","e")),51) occurs(action(("stack","e","f")),52) occurs(action(("pick-up","n")),53) occurs(action(("stack","n","e")),54) occurs(action(("pick-up","b")),55) occurs(action(("stack","b","n")),56) occurs(action(("pick-up","m")),57) occurs(action(("stack","m","g")),58) occurs(action(("pick-up","d")),59) occurs(action(("stack","d","b")),60) occurs(action(("unstack","m","g")),61) occurs(action(("stack","m","h")),62) occurs(action(("unstack","m","h")),63) occurs(action(("stack","m","h")),64) occurs(action(("unstack","m","h")),65) occurs(action(("stack","m","d")),66) occurs(action(("pick-up","g")),67) occurs(action(("stack","g","m")),68) occurs(action(("pick-up","h")),69) occurs(action(("stack","h","g")),70)
Solving Time: 0.35s
Memory: 1303MB (+20MB)
SAT
SATISFIABLE
Models : 1+
Calls : 15
Time : 36.175s (Solving: 5.09s 1st Model: 0.12s Unsat: 4.96s)
CPU Time : 36.140s
Choices : 129173
Conflicts : 8967 (Analyzed: 8956)
Restarts : 87 (Average: 102.94 Last: 78)
Model-Level : 387.0
Problems : 15 (Average Length: 37.00 Splits: 0)
Lemmas : 8956 (Deleted: 4350)
Binary : 307 (Ratio: 3.43%)
Ternary : 212 (Ratio: 2.37%)
Conflict : 8956 (Average Length: 2301.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 8956 (Average: 14.16 Max: 1760 Sum: 126778)
Executed : 8800 (Average: 13.58 Max: 1760 Sum: 121641 Ratio: 95.95%)
Bounded : 156 (Average: 32.93 Max: 67 Sum: 5137 Ratio: 4.05%)
Rules : 635815
Atoms : 635815
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 162734 (Eliminated: 0 Frozen: 153086)
Constraints : 448788 (Binary: 93.9% Ternary: 4.7% Other: 1.5%)
Memory Peak : 1303MB
Max. Length : 70 steps
Sol. Length : 70 steps