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-41.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-41.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.025s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.021s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.080s CPU, 0.074s wall-clock]
|
|
613 relevant atoms
|
|
405 auxiliary atoms
|
|
1018 final queue length
|
|
1307 total queue pushes
|
|
Completing instantiation... [0.060s CPU, 0.060s wall-clock]
|
|
Instantiating: [0.180s CPU, 0.176s 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.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.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.030s 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.000s CPU, 0.008s 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.026s wall-clock]
|
|
Done! [0.320s CPU, 0.329s 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: 81MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.25s
|
|
|
|
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: 84MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f5")),1) occurs(action(("board","f5","p2")),2) occurs(action(("board","f5","p7")),2) occurs(action(("up","f5","f9")),2) occurs(action(("board","f9","p1")),3) occurs(action(("down","f9","f6")),3) occurs(action(("down","f6","f4")),4) occurs(action(("board","f6","p8")),4) occurs(action(("depart","f4","p7")),5) occurs(action(("up","f4","f7")),5) occurs(action(("depart","f7","p1")),6) occurs(action(("up","f7","f14")),6) occurs(action(("board","f14","p5")),7) occurs(action(("board","f14","p6")),7) occurs(action(("down","f14","f0")),7) occurs(action(("depart","f0","p8")),8) occurs(action(("up","f0","f13")),8) occurs(action(("depart","f13","p5")),9) occurs(action(("down","f13","f7")),9) occurs(action(("depart","f7","p2")),10) occurs(action(("depart","f7","p6")),10) occurs(action(("up","f7","f15")),10) occurs(action(("board","f15","p4")),11) occurs(action(("down","f15","f1")),11) occurs(action(("depart","f1","p4")),12) occurs(action(("board","f1","p0")),12) occurs(action(("up","f1","f16")),12) occurs(action(("depart","f16","p0")),13) occurs(action(("down","f16","f10")),13) occurs(action(("board","f10","p3")),14) occurs(action(("up","f10","f12")),14) occurs(action(("depart","f12","p3")),15) occurs(action(("down","f12","f4")),15)
|
|
Solving Time: 0.02s
|
|
Memory: 85MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.847s (Solving: 0.23s 1st Model: 0.02s Unsat: 0.21s)
|
|
CPU Time : 0.840s
|
|
|
|
Choices : 7001
|
|
Conflicts : 5420 (Analyzed: 5418)
|
|
Restarts : 65 (Average: 83.35 Last: 54)
|
|
Model-Level : 65.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 5418 (Deleted: 2328)
|
|
Binary : 77 (Ratio: 1.42%)
|
|
Ternary : 250 (Ratio: 4.61%)
|
|
Conflict : 5418 (Average Length: 14.0 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 5418 (Average: 1.23 Max: 10 Sum: 6657)
|
|
Executed : 5408 (Average: 1.23 Max: 10 Sum: 6647 Ratio: 99.85%)
|
|
Bounded : 10 (Average: 1.00 Max: 1 Sum: 10 Ratio: 0.15%)
|
|
|
|
Rules : 280236
|
|
Atoms : 280236
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 8590 (Eliminated: 0 Frozen: 0)
|
|
Constraints : 25631 (Binary: 95.6% Ternary: 3.3% Other: 1.1%)
|
|
|
|
Memory Peak : 85MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|