156 lines
6.8 KiB
Plaintext
156 lines
6.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-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.017s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.009s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.016s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.050s CPU, 0.058s 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.140s CPU, 0.144s 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.010s 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.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.050s 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.020s CPU, 0.027s wall-clock]
|
|
Done! [0.280s CPU, 0.286s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.47s
|
|
Memory: 74MB
|
|
|
|
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: 74MB (+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: 78MB (+4MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 78MB (+0MB)
|
|
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: 80MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.21s
|
|
Memory: 82MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.26s
|
|
|
|
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.04s
|
|
Memory: 83MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board","f0","p5")),1) occurs(action(("up","f0","f17")),1) occurs(action(("board","f17","p1")),2) occurs(action(("board","f17","p6")),2) occurs(action(("down","f17","f0")),2) occurs(action(("depart","f0","p6")),3) occurs(action(("up","f0","f6")),3) occurs(action(("board","f6","p8")),4) occurs(action(("up","f6","f16")),4) occurs(action(("board","f16","p2")),5) occurs(action(("down","f16","f13")),5) occurs(action(("board","f13","p4")),6) occurs(action(("down","f13","f7")),6) occurs(action(("depart","f7","p4")),7) occurs(action(("down","f7","f2")),7) occurs(action(("board","f7","p7")),7) occurs(action(("depart","f2","p1")),8) occurs(action(("board","f2","p0")),8) occurs(action(("down","f2","f1")),8) occurs(action(("depart","f1","p2")),9) occurs(action(("board","f1","p3")),9) occurs(action(("up","f1","f6")),9) occurs(action(("down","f6","f5")),10) occurs(action(("board","f6","p8")),10) occurs(action(("depart","f5","p0")),11) occurs(action(("up","f5","f6")),11) occurs(action(("up","f6","f10")),12) occurs(action(("board","f6","p8")),12) occurs(action(("depart","f10","p3")),13) occurs(action(("depart","f10","p7")),13) occurs(action(("up","f10","f12")),13) occurs(action(("depart","f12","p8")),14) occurs(action(("down","f12","f4")),14) occurs(action(("depart","f4","p5")),15) occurs(action(("up","f4","f12")),15)
|
|
Solving Time: 0.07s
|
|
Memory: 85MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.897s (Solving: 0.28s 1st Model: 0.06s Unsat: 0.21s)
|
|
CPU Time : 0.890s
|
|
|
|
Choices : 8808
|
|
Conflicts : 6477 (Analyzed: 6475)
|
|
Restarts : 80 (Average: 80.94 Last: 36)
|
|
Model-Level : 55.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 6475 (Deleted: 2399)
|
|
Binary : 69 (Ratio: 1.07%)
|
|
Ternary : 205 (Ratio: 3.17%)
|
|
Conflict : 6475 (Average Length: 12.7 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 6475 (Average: 1.26 Max: 21 Sum: 8129)
|
|
Executed : 6467 (Average: 1.25 Max: 21 Sum: 8121 Ratio: 99.90%)
|
|
Bounded : 8 (Average: 1.00 Max: 1 Sum: 8 Ratio: 0.10%)
|
|
|
|
Rules : 280236
|
|
Atoms : 280236
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 8422 (Eliminated: 0 Frozen: 0)
|
|
Constraints : 25648 (Binary: 95.6% Ternary: 3.3% Other: 1.1%)
|
|
|
|
Memory Peak : 85MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|