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

182 lines
7.4 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-42.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-42.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.068s wall-clock]
613 relevant atoms
405 auxiliary atoms
1018 final queue length
1307 total queue pushes
Completing instantiation... [0.060s CPU, 0.054s wall-clock]
Instantiating: [0.160s CPU, 0.160s 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...
18 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.000s CPU, 0.009s 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.010s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.050s wall-clock]
9 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.030s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 1 mutex groups necessary.
324 of 324 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 54
Translator goal facts: 9
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 324
Translator axioms: 0
Translator task size: 1072
Translator peak memory: 33624 KB
Writing output... [0.020s CPU, 0.025s wall-clock]
Done! [0.300s CPU, 0.309s wall-clock]
planner.py version 0.0.1
Time: 0.06s
Memory: 47MB
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: 47MB (+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: 48MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 49MB (+1MB)
UNSAT
Iteration Time: 0.04s
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: 51MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 51MB (+0MB)
UNSAT
Iteration Time: 0.04s
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.02s
Memory: 52MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.16s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.19s
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.02s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.77s
Memory: 55MB (+1MB)
UNKNOWN
Iteration Time: 0.80s
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.02s
Memory: 57MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f17")),1) occurs(action(("board","f17","p1")),2) occurs(action(("board","f17","p6")),2) occurs(action(("down","f17","f2")),3) occurs(action(("depart","f2","p1")),4) occurs(action(("board","f2","p0")),4) occurs(action(("up","f2","f5")),5) occurs(action(("depart","f5","p0")),6) occurs(action(("down","f5","f0")),7) occurs(action(("depart","f0","p6")),8) occurs(action(("board","f0","p5")),8) occurs(action(("up","f0","f4")),9) occurs(action(("depart","f4","p5")),10) occurs(action(("up","f4","f16")),11) occurs(action(("board","f16","p2")),12) occurs(action(("down","f16","f1")),13) occurs(action(("depart","f1","p2")),14) occurs(action(("board","f1","p3")),14) occurs(action(("up","f1","f13")),15) occurs(action(("board","f13","p4")),16) occurs(action(("down","f13","f7")),17) occurs(action(("depart","f7","p4")),18) occurs(action(("board","f7","p7")),18) occurs(action(("up","f7","f10")),19) occurs(action(("depart","f10","p3")),20) occurs(action(("depart","f10","p7")),20) occurs(action(("down","f10","f6")),21) occurs(action(("board","f6","p8")),22) occurs(action(("up","f6","f12")),23) occurs(action(("depart","f12","p8")),24) occurs(action(("down","f12","f4")),25)
Solving Time: 0.02s
Memory: 58MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 1.176s (Solving: 0.94s 1st Model: 0.01s Unsat: 0.16s)
CPU Time : 1.170s
Choices : 30852 (Domain: 30835)
Conflicts : 10206 (Analyzed: 10203)
Restarts : 124 (Average: 82.28 Last: 64)
Model-Level : 127.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 10203 (Deleted: 5880)
Binary : 100 (Ratio: 0.98%)
Ternary : 157 (Ratio: 1.54%)
Conflict : 10203 (Average Length: 42.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 10203 (Average: 2.78 Max: 37 Sum: 28331)
Executed : 10180 (Average: 2.76 Max: 37 Sum: 28194 Ratio: 99.52%)
Bounded : 23 (Average: 5.96 Max: 17 Sum: 137 Ratio: 0.48%)
Rules : 4209
Atoms : 4209
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 10355 (Eliminated: 0 Frozen: 7836)
Constraints : 50116 (Binary: 96.4% Ternary: 2.5% Other: 1.1%)
Memory Peak : 59MB
Max. Length : 25 steps
Sol. Length : 25 steps