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

195 lines
7.8 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-44.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-44.pddl
Parsing...
Parsing: [0.030s CPU, 0.024s 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.012s wall-clock]
Preparing model... [0.030s CPU, 0.021s wall-clock]
Generated 18 rules.
Computing model... [0.070s CPU, 0.072s wall-clock]
613 relevant atoms
405 auxiliary atoms
1018 final queue length
1307 total queue pushes
Completing instantiation... [0.050s CPU, 0.058s wall-clock]
Instantiating: [0.160s CPU, 0.171s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.004s 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.010s CPU, 0.008s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.003s wall-clock]
Translating task: [0.040s CPU, 0.049s 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.030s CPU, 0.029s 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.030s CPU, 0.027s wall-clock]
Done! [0.320s CPU, 0.322s 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.13s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.16s
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: 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.83s
Memory: 55MB (+0MB)
UNKNOWN
Iteration Time: 0.86s
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...
Solving Time: 0.91s
Memory: 58MB (+1MB)
UNKNOWN
Iteration Time: 0.94s
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.02s
Memory: 59MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f1")),1) occurs(action(("board","f1","p7")),2) occurs(action(("board","f1","p8")),2) occurs(action(("up","f1","f8")),3) occurs(action(("depart","f8","p7")),4) occurs(action(("depart","f8","p8")),4) occurs(action(("down","f8","f6")),5) occurs(action(("board","f6","p2")),6) occurs(action(("board","f6","p3")),6) occurs(action(("board","f6","p5")),6) occurs(action(("up","f6","f16")),7) occurs(action(("depart","f16","p5")),8) occurs(action(("down","f16","f12")),9) occurs(action(("board","f12","p6")),10) occurs(action(("down","f12","f4")),11) occurs(action(("depart","f4","p6")),12) occurs(action(("up","f4","f14")),13) occurs(action(("board","f14","p4")),14) occurs(action(("down","f14","f7")),15) occurs(action(("depart","f7","p4")),16) occurs(action(("down","f7","f5")),17) occurs(action(("depart","f5","p2")),18) occurs(action(("up","f5","f15")),19) occurs(action(("depart","f15","p3")),20) occurs(action(("down","f15","f13")),21) occurs(action(("board","f13","p1")),22) occurs(action(("down","f13","f3")),23) occurs(action(("depart","f3","p1")),24) occurs(action(("up","f3","f11")),25) occurs(action(("board","f11","p0")),26) occurs(action(("down","f11","f0")),27) occurs(action(("depart","f0","p0")),28) occurs(action(("up","f0","f5")),29) occurs(action(("up","f5","f16")),30)
Solving Time: 0.01s
Memory: 60MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 7
Time : 2.142s (Solving: 1.87s 1st Model: 0.00s Unsat: 0.13s)
CPU Time : 2.140s
Choices : 65390 (Domain: 65356)
Conflicts : 17873 (Analyzed: 17870)
Restarts : 217 (Average: 82.35 Last: 111)
Model-Level : 215.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 17870 (Deleted: 13113)
Binary : 88 (Ratio: 0.49%)
Ternary : 263 (Ratio: 1.47%)
Conflict : 17870 (Average Length: 38.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 17870 (Average: 3.18 Max: 40 Sum: 56739)
Executed : 17852 (Average: 3.17 Max: 40 Sum: 56607 Ratio: 99.77%)
Bounded : 18 (Average: 7.33 Max: 17 Sum: 132 Ratio: 0.23%)
Rules : 4209
Atoms : 4209
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 12494 (Eliminated: 0 Frozen: 9461)
Constraints : 60568 (Binary: 96.4% Ternary: 2.5% Other: 1.1%)
Memory Peak : 62MB
Max. Length : 30 steps
Sol. Length : 30 steps