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

169 lines
7.7 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-59.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-59.pddl
Parsing...
Parsing: [0.040s CPU, 0.041s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.030s CPU, 0.036s wall-clock]
Generated 18 rules.
Computing model... [0.120s CPU, 0.118s wall-clock]
1033 relevant atoms
684 auxiliary atoms
1717 final queue length
2246 total queue pushes
Completing instantiation... [0.090s CPU, 0.090s wall-clock]
Instantiating: [0.270s CPU, 0.270s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s 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.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.010s CPU, 0.005s wall-clock]
Translating task: [0.100s CPU, 0.091s 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.051s 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.045s wall-clock]
Done! [0.520s CPU, 0.530s wall-clock]
planner.py version 0.0.1
Time: 1.50s
Memory: 136MB
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.01s
Memory: 136MB (+0MB)
UNSAT
Iteration Time: 0.01s
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.06s
Memory: 142MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 143MB (+1MB)
UNSAT
Iteration Time: 0.09s
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.06s
Memory: 146MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.47s
Memory: 148MB (+2MB)
UNSAT
Iteration Time: 0.56s
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.06s
Memory: 151MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.52s
Memory: 154MB (+3MB)
UNKNOWN
Iteration Time: 0.62s
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.07s
Memory: 156MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board","f0","p11")),1) occurs(action(("up","f0","f10")),1) occurs(action(("board","f10","p7")),2) occurs(action(("down","f10","f3")),2) occurs(action(("up","f3","f5")),3) occurs(action(("board","f3","p2")),3) occurs(action(("board","f3","p4")),3) occurs(action(("board","f5","p3")),4) occurs(action(("up","f5","f8")),4) occurs(action(("depart","f8","p4")),5) occurs(action(("down","f8","f7")),5) occurs(action(("board","f7","p5")),6) occurs(action(("up","f7","f14")),6) occurs(action(("board","f14","p9")),7) occurs(action(("up","f14","f17")),7) occurs(action(("board","f17","p0")),8) occurs(action(("down","f17","f6")),8) occurs(action(("board","f6","p1")),9) occurs(action(("up","f6","f12")),9) occurs(action(("depart","f12","p2")),10) occurs(action(("depart","f12","p9")),10) occurs(action(("up","f12","f23")),10) occurs(action(("depart","f23","p0")),11) occurs(action(("down","f23","f19")),11) occurs(action(("depart","f19","p1")),12) occurs(action(("depart","f19","p7")),12) occurs(action(("down","f19","f10")),12) occurs(action(("up","f10","f11")),13) occurs(action(("board","f10","p7")),13) occurs(action(("depart","f11","p11")),14) occurs(action(("down","f11","f0")),14) occurs(action(("depart","f0","p3")),15) occurs(action(("board","f0","p11")),15) occurs(action(("up","f0","f20")),15) occurs(action(("board","f20","p8")),16) occurs(action(("down","f20","f7")),16) occurs(action(("depart","f7","p8")),17) occurs(action(("up","f7","f16")),17) occurs(action(("board","f16","p10")),18) occurs(action(("board","f16","p6")),18) occurs(action(("down","f16","f6")),18) occurs(action(("depart","f6","p5")),19) occurs(action(("depart","f6","p6")),19) occurs(action(("down","f6","f5")),19) occurs(action(("depart","f5","p10")),20) occurs(action(("board","f5","p3")),20) occurs(action(("up","f5","f12")),20)
Solving Time: 0.05s
Memory: 159MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 5
Time : 2.937s (Solving: 1.03s 1st Model: 0.05s Unsat: 0.47s)
CPU Time : 2.930s
Choices : 23776
Conflicts : 16584 (Analyzed: 16582)
Restarts : 195 (Average: 85.04 Last: 60)
Model-Level : 99.0
Problems : 5 (Average Length: 12.00 Splits: 0)
Lemmas : 16582 (Deleted: 10167)
Binary : 86 (Ratio: 0.52%)
Ternary : 426 (Ratio: 2.57%)
Conflict : 16582 (Average Length: 16.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 16582 (Average: 1.29 Max: 30 Sum: 21410)
Executed : 16571 (Average: 1.29 Max: 30 Sum: 21399 Ratio: 99.95%)
Bounded : 11 (Average: 1.00 Max: 1 Sum: 11 Ratio: 0.05%)
Rules : 909322
Atoms : 909322
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 19420 (Eliminated: 0 Frozen: 0)
Constraints : 60113 (Binary: 96.6% Ternary: 2.6% Other: 0.8%)
Memory Peak : 160MB
Max. Length : 20 steps
Sol. Length : 20 steps