1
0
Fork 0
tplp-planning-benchmark/fd-pb-es/ipc-2000_elevator-strips-si...

277 lines
11 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-58.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/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-58.pddl
Parsing...
Parsing: [0.030s CPU, 0.038s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
Preparing model... [0.030s CPU, 0.035s wall-clock]
Generated 18 rules.
Computing model... [0.120s CPU, 0.117s wall-clock]
1033 relevant atoms
684 auxiliary atoms
1717 final queue length
2246 total queue pushes
Completing instantiation... [0.090s CPU, 0.088s wall-clock]
Instantiating: [0.270s CPU, 0.266s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.000s CPU, 0.005s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
24 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.010s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.005s wall-clock]
Translating task: [0.090s CPU, 0.090s wall-clock]
12 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.052s wall-clock]
Reordering and filtering variables...
25 of 25 variables necessary.
0 of 1 mutex groups necessary.
576 of 576 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock]
Translator variables: 25
Translator derived variables: 0
Translator facts: 72
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 576
Translator axioms: 0
Translator task size: 1861
Translator peak memory: 34392 KB
Writing output... [0.040s CPU, 0.043s wall-clock]
Done! [0.510s CPU, 0.521s wall-clock]
planner.py version 0.0.1
Time: 0.09s
Memory: 49MB
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: 49MB (+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.04s
Memory: 50MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+1MB)
UNSAT
Iteration Time: 0.05s
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: 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 54MB (+1MB)
UNSAT
Iteration Time: 0.06s
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.03s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.24s
Memory: 58MB (+2MB)
UNSAT
Iteration Time: 0.28s
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.03s
Memory: 59MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.63s
Memory: 60MB (+1MB)
UNKNOWN
Iteration Time: 0.67s
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.03s
Memory: 62MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.75s
Memory: 64MB (+2MB)
UNKNOWN
Iteration Time: 0.79s
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.03s
Memory: 67MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.82s
Memory: 67MB (+0MB)
UNKNOWN
Iteration Time: 0.87s
Iteration 8
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 0.37s
Memory: 67MB (+0MB)
UNKNOWN
Iteration Time: 0.37s
Iteration 9
Queue: [(5,25,1,True), (6,30,1,True), (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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 0.55s
Memory: 67MB (+0MB)
UNKNOWN
Iteration Time: 0.56s
Iteration 10
Queue: [(6,30,1,True), (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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 0.69s
Memory: 68MB (+1MB)
UNKNOWN
Iteration Time: 0.69s
Iteration 11
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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 30
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
Grounding Time: 0.03s
Memory: 70MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.88s
Memory: 73MB (+3MB)
UNKNOWN
Iteration Time: 0.92s
Iteration 12
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), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 35
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.03s
Memory: 73MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.05s
Memory: 75MB (+2MB)
UNKNOWN
Iteration Time: 1.10s
Iteration 13
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 40
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
Grounding Time: 0.03s
Memory: 76MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.11s
Memory: 77MB (+1MB)
UNKNOWN
Iteration Time: 1.16s
Iteration 14
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
Grounded Until: 45
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
Grounding Time: 0.03s
Memory: 79MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f14")),1) occurs(action(("board","f14","p3")),2) occurs(action(("down","f14","f4")),3) occurs(action(("board","f4","p1")),4) occurs(action(("up","f4","f15")),5) occurs(action(("board","f15","p8")),6) occurs(action(("board","f15","p4")),7) occurs(action(("down","f15","f6")),8) occurs(action(("board","f6","p7")),9) occurs(action(("up","f6","f8")),10) occurs(action(("board","f8","p10")),11) occurs(action(("down","f8","f7")),12) occurs(action(("depart","f7","p3")),13) occurs(action(("down","f7","f0")),14) occurs(action(("board","f0","p9")),15) occurs(action(("board","f0","p11")),16) occurs(action(("up","f0","f1")),17) occurs(action(("depart","f1","p7")),18) occurs(action(("up","f1","f11")),19) occurs(action(("board","f11","p5")),20) occurs(action(("down","f11","f7")),21) occurs(action(("depart","f7","p5")),22) occurs(action(("down","f7","f6")),23) occurs(action(("up","f6","f9")),24) occurs(action(("board","f9","p2")),25) occurs(action(("down","f9","f6")),26) occurs(action(("depart","f6","p2")),27) occurs(action(("up","f6","f17")),28) occurs(action(("depart","f17","p11")),29) occurs(action(("down","f17","f11")),30) occurs(action(("board","f11","p5")),31) occurs(action(("up","f11","f18")),32) occurs(action(("depart","f18","p1")),33) occurs(action(("down","f18","f1")),34) occurs(action(("depart","f1","p9")),35) occurs(action(("up","f1","f2")),36) occurs(action(("depart","f2","p4")),37) occurs(action(("up","f2","f12")),38) occurs(action(("depart","f12","p8")),39) occurs(action(("down","f12","f2")),40) occurs(action(("board","f2","p6")),41) occurs(action(("up","f2","f18")),42) occurs(action(("depart","f18","p6")),43) occurs(action(("up","f18","f19")),44) occurs(action(("board","f19","p0")),45) occurs(action(("down","f19","f0")),46) occurs(action(("depart","f0","p0")),47) occurs(action(("up","f0","f16")),48) occurs(action(("depart","f16","p10")),49) occurs(action(("down","f16","f1")),50)
Solving Time: 0.17s
Memory: 83MB (+4MB)
SAT
SATISFIABLE
Models : 1+
Calls : 14
Time : 7.838s (Solving: 7.24s 1st Model: 0.17s Unsat: 0.25s)
CPU Time : 7.830s
Choices : 168684
Conflicts : 85853 (Analyzed: 85850)
Restarts : 950 (Average: 90.37 Last: 120)
Model-Level : 259.0
Problems : 14 (Average Length: 28.07 Splits: 0)
Lemmas : 85850 (Deleted: 57017)
Binary : 4367 (Ratio: 5.09%)
Ternary : 6006 (Ratio: 7.00%)
Conflict : 85850 (Average Length: 16.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 85850 (Average: 1.74 Max: 554 Sum: 149607)
Executed : 85824 (Average: 1.74 Max: 554 Sum: 149345 Ratio: 99.82%)
Bounded : 26 (Average: 10.08 Max: 42 Sum: 262 Ratio: 0.18%)
Rules : 6774
Atoms : 6774
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 34363 (Eliminated: 0 Frozen: 29449)
Constraints : 148313 (Binary: 97.1% Ternary: 1.9% Other: 0.9%)
Memory Peak : 84MB
Max. Length : 50 steps
Sol. Length : 50 steps