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

156 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-52.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-52.pddl
Parsing...
Parsing: [0.020s CPU, 0.025s 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.010s CPU, 0.010s wall-clock]
Preparing model... [0.020s CPU, 0.024s wall-clock]
Generated 18 rules.
Computing model... [0.090s CPU, 0.085s wall-clock]
881 relevant atoms
583 auxiliary atoms
1464 final queue length
1905 total queue pushes
Completing instantiation... [0.080s CPU, 0.077s wall-clock]
Instantiating: [0.210s CPU, 0.206s 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...
22 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.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.074s 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.046s 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.030s CPU, 0.037s wall-clock]
Done! [0.400s CPU, 0.415s wall-clock]
planner.py version 0.0.1
Time: 0.86s
Memory: 100MB
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: 100MB (+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.26s
Memory: 134MB (+34MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 137MB (+3MB)
UNSAT
Iteration Time: 0.36s
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.29s
Memory: 153MB (+16MB)
Unblocking actions...
Solving...
Solving Time: 1.94s
Memory: 156MB (+3MB)
UNKNOWN
Iteration Time: 2.29s
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.44s
Memory: 186MB (+30MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p0")),1) occurs(action(("up","f0","f11")),1) occurs(action(("board","f11","p1")),2) occurs(action(("board","f4","p2")),2) occurs(action(("board","f4","p7")),2) occurs(action(("down","f11","f4")),2) occurs(action(("depart","f17","p2")),3) occurs(action(("board","f17","p4")),3) occurs(action(("board","f4","p7")),3) occurs(action(("up","f4","f17")),3) occurs(action(("down","f17","f13")),4) occurs(action(("board","f17","p4")),4) occurs(action(("board","f13","p3")),5) occurs(action(("board","f15","p6")),5) occurs(action(("up","f13","f15")),5) occurs(action(("depart","f15","p7")),6) occurs(action(("board","f15","p6")),6) occurs(action(("board","f14","p8")),6) occurs(action(("board","f14","p9")),6) occurs(action(("down","f15","f14")),6) occurs(action(("depart","f16","p1")),7) occurs(action(("up","f14","f16")),7) occurs(action(("board","f16","p10")),7) occurs(action(("board","f14","p8")),7) occurs(action(("board","f14","p9")),7) occurs(action(("board","f16","p10")),8) occurs(action(("up","f16","f20")),8) occurs(action(("board","f4","p2")),9) occurs(action(("board","f20","p5")),9) occurs(action(("board","f4","p7")),9) occurs(action(("down","f20","f4")),9) occurs(action(("up","f4","f13")),10) occurs(action(("board","f13","p3")),10) occurs(action(("depart","f13","p10")),11) occurs(action(("depart","f2","p5")),11) occurs(action(("depart","f2","p8")),11) occurs(action(("board","f13","p3")),11) occurs(action(("down","f13","f2")),11) occurs(action(("depart","f18","p3")),12) occurs(action(("up","f2","f18")),12) occurs(action(("depart","f1","p0")),13) occurs(action(("down","f18","f1")),13) occurs(action(("depart","f17","p9")),14) occurs(action(("board","f17","p4")),14) occurs(action(("up","f1","f17")),14) occurs(action(("depart","f7","p4")),15) occurs(action(("depart","f17","p6")),15) occurs(action(("down","f17","f7")),15)
Solving Time: 1.05s
Memory: 191MB (+5MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 5.067s (Solving: 2.99s 1st Model: 1.03s Unsat: 0.04s)
CPU Time : 5.060s
Choices : 15609
Conflicts : 11684 (Analyzed: 11683)
Restarts : 146 (Average: 80.02 Last: 160)
Model-Level : 72.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 11754 (Deleted: 7157)
Binary : 145 (Ratio: 1.23%)
Ternary : 64 (Ratio: 0.54%)
Conflict : 11683 (Average Length: 77.9 Ratio: 99.40%)
Loop : 71 (Average Length: 33.6 Ratio: 0.60%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 11683 (Average: 1.22 Max: 48 Sum: 14206)
Executed : 11662 (Average: 1.20 Max: 48 Sum: 13991 Ratio: 98.49%)
Bounded : 21 (Average: 10.24 Max: 12 Sum: 215 Ratio: 1.51%)
Rules : 432229
Atoms : 432229
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 38361 (Eliminated: 0 Frozen: 36540)
Constraints : 83297 (Binary: 89.1% Ternary: 10.1% Other: 0.8%)
Memory Peak : 191MB
Max. Length : 15 steps
Sol. Length : 15 steps