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

238 lines
9.6 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-53.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-53.pddl
Parsing...
Parsing: [0.030s CPU, 0.027s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock]
Preparing model... [0.030s CPU, 0.025s wall-clock]
Generated 18 rules.
Computing model... [0.090s CPU, 0.090s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.076s wall-clock]
Instantiating: [0.210s CPU, 0.210s 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.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
22 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s 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.004s wall-clock]
Translating task: [0.070s CPU, 0.077s wall-clock]
11 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.044s wall-clock]
Reordering and filtering variables...
23 of 23 variables necessary.
0 of 1 mutex groups necessary.
484 of 484 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
Translator variables: 23
Translator derived variables: 0
Translator facts: 66
Translator goal facts: 11
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 484
Translator axioms: 0
Translator task size: 1574
Translator peak memory: 34136 KB
Writing output... [0.040s CPU, 0.038s wall-clock]
Done! [0.420s CPU, 0.423s wall-clock]
planner.py version 0.0.1
Time: 0.07s
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.03s
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: 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.05s
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: 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 57MB (+2MB)
UNSAT
Iteration Time: 0.17s
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: 58MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.96s
Memory: 59MB (+1MB)
UNKNOWN
Iteration Time: 1.00s
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: 60MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.93s
Memory: 62MB (+2MB)
UNKNOWN
Iteration Time: 0.97s
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: 63MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 1.20s
Memory: 64MB (+1MB)
UNKNOWN
Iteration Time: 1.25s
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.59s
Memory: 65MB (+1MB)
UNSAT
Iteration Time: 0.59s
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.89s
Memory: 65MB (+0MB)
UNKNOWN
Iteration Time: 0.90s
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: 1.13s
Memory: 65MB (+0MB)
UNKNOWN
Iteration Time: 1.13s
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: 67MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f21")),1) occurs(action(("board","f21","p0")),2) occurs(action(("board","f21","p2")),2) occurs(action(("down","f21","f12")),3) occurs(action(("depart","f12","p0")),4) occurs(action(("board","f12","p3")),4) occurs(action(("up","f12","f20")),5) occurs(action(("depart","f20","p3")),6) occurs(action(("down","f20","f16")),7) occurs(action(("board","f16","p5")),8) occurs(action(("board","f16","p9")),8) occurs(action(("down","f16","f8")),9) occurs(action(("depart","f8","p2")),10) occurs(action(("up","f8","f9")),11) occurs(action(("board","f9","p8")),12) occurs(action(("up","f9","f17")),13) occurs(action(("depart","f17","p9")),14) occurs(action(("down","f17","f3")),15) occurs(action(("board","f3","p4")),16) occurs(action(("down","f3","f1")),17) occurs(action(("depart","f1","p5")),18) occurs(action(("depart","f1","p8")),18) occurs(action(("up","f1","f18")),19) occurs(action(("board","f18","p7")),20) occurs(action(("down","f18","f2")),21) occurs(action(("board","f2","p1")),22) occurs(action(("down","f2","f0")),23) occurs(action(("depart","f0","p1")),24) occurs(action(("up","f0","f2")),25) occurs(action(("board","f2","p1")),26) occurs(action(("up","f2","f4")),27) occurs(action(("board","f4","p10")),28) occurs(action(("up","f4","f7")),29) occurs(action(("depart","f7","p4")),30) occurs(action(("board","f7","p6")),30) occurs(action(("up","f7","f10")),31) occurs(action(("depart","f10","p6")),32) occurs(action(("depart","f10","p7")),32) occurs(action(("up","f10","f20")),33) occurs(action(("down","f20","f14")),34) occurs(action(("depart","f14","p10")),35)
Solving Time: 0.63s
Memory: 69MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 6.864s (Solving: 6.46s 1st Model: 0.63s Unsat: 0.73s)
CPU Time : 6.880s
Choices : 81776
Conflicts : 57245 (Analyzed: 57241)
Restarts : 657 (Average: 87.12 Last: 133)
Model-Level : 71.0
Problems : 11 (Average Length: 22.91 Splits: 0)
Lemmas : 57241 (Deleted: 44385)
Binary : 299 (Ratio: 0.52%)
Ternary : 2210 (Ratio: 3.86%)
Conflict : 57241 (Average Length: 16.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 57241 (Average: 1.32 Max: 50 Sum: 75535)
Executed : 57216 (Average: 1.32 Max: 50 Sum: 75330 Ratio: 99.73%)
Bounded : 25 (Average: 8.20 Max: 32 Sum: 205 Ratio: 0.27%)
Rules : 6199
Atoms : 6199
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 20839 (Eliminated: 0 Frozen: 16534)
Constraints : 104744 (Binary: 97.1% Ternary: 2.1% Other: 0.9%)
Memory Peak : 70MB
Max. Length : 35 steps
Sol. Length : 35 steps