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

182 lines
7.5 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-48.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-48.pddl
Parsing...
Parsing: [0.030s CPU, 0.024s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.009s wall-clock]
Preparing model... [0.020s CPU, 0.022s wall-clock]
Generated 18 rules.
Computing model... [0.080s CPU, 0.078s wall-clock]
741 relevant atoms
490 auxiliary atoms
1231 final queue length
1592 total queue pushes
Completing instantiation... [0.070s CPU, 0.067s wall-clock]
Instantiating: [0.180s CPU, 0.184s 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.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
20 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.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.000s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.060s wall-clock]
10 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.037s wall-clock]
Reordering and filtering variables...
21 of 21 variables necessary.
0 of 1 mutex groups necessary.
400 of 400 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
Translator variables: 21
Translator derived variables: 0
Translator facts: 60
Translator goal facts: 10
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 400
Translator axioms: 0
Translator task size: 1311
Translator peak memory: 33880 KB
Writing output... [0.030s CPU, 0.030s wall-clock]
Done! [0.360s CPU, 0.360s wall-clock]
planner.py version 0.0.1
Time: 0.07s
Memory: 48MB
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: 48MB (+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: 49MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 50MB (+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: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 52MB (+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: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.25s
Memory: 55MB (+2MB)
UNSAT
Iteration Time: 0.29s
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: 57MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.90s
Memory: 57MB (+0MB)
UNKNOWN
Iteration Time: 0.94s
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: 59MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("up","f0","f19")),1) occurs(action(("board","f19","p4")),2) occurs(action(("down","f19","f10")),3) occurs(action(("depart","f10","p4")),4) occurs(action(("board","f10","p3")),4) occurs(action(("up","f10","f13")),5) occurs(action(("board","f13","p2")),6) occurs(action(("up","f13","f14")),7) occurs(action(("depart","f14","p2")),8) occurs(action(("depart","f14","p3")),8) occurs(action(("board","f14","p7")),8) occurs(action(("up","f14","f15")),9) occurs(action(("board","f15","p8")),10) occurs(action(("down","f15","f4")),11) occurs(action(("depart","f4","p8")),12) occurs(action(("board","f4","p1")),12) occurs(action(("down","f4","f2")),13) occurs(action(("depart","f2","p1")),14) occurs(action(("board","f2","p6")),14) occurs(action(("up","f2","f3")),15) occurs(action(("board","f3","p0")),16) occurs(action(("board","f3","p5")),16) occurs(action(("down","f3","f0")),17) occurs(action(("depart","f0","p0")),18) occurs(action(("board","f0","p9")),18) occurs(action(("up","f0","f5")),19) occurs(action(("depart","f5","p7")),20) occurs(action(("depart","f5","p9")),20) occurs(action(("up","f5","f6")),21) occurs(action(("depart","f6","p6")),22) occurs(action(("up","f6","f11")),23) occurs(action(("depart","f11","p5")),24) occurs(action(("down","f11","f6")),25)
Solving Time: 0.10s
Memory: 61MB (+2MB)
SAT
SATISFIABLE
Models : 1+
Calls : 6
Time : 1.532s (Solving: 1.25s 1st Model: 0.09s Unsat: 0.26s)
CPU Time : 1.530s
Choices : 41247 (Domain: 41228)
Conflicts : 12185 (Analyzed: 12182)
Restarts : 139 (Average: 87.64 Last: 87)
Model-Level : 165.0
Problems : 6 (Average Length: 14.50 Splits: 0)
Lemmas : 12182 (Deleted: 8802)
Binary : 116 (Ratio: 0.95%)
Ternary : 197 (Ratio: 1.62%)
Conflict : 12182 (Average Length: 44.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 12182 (Average: 3.09 Max: 36 Sum: 37701)
Executed : 12167 (Average: 3.08 Max: 36 Sum: 37561 Ratio: 99.63%)
Bounded : 15 (Average: 9.33 Max: 17 Sum: 140 Ratio: 0.37%)
Rules : 5156
Atoms : 5156
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 12451 (Eliminated: 0 Frozen: 9664)
Constraints : 61423 (Binary: 96.8% Ternary: 2.2% Other: 1.0%)
Memory Peak : 61MB
Max. Length : 25 steps
Sol. Length : 25 steps