156 lines
6.7 KiB
Plaintext
156 lines
6.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-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.022s 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.010s CPU, 0.011s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.019s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.070s CPU, 0.067s wall-clock]
|
|
613 relevant atoms
|
|
405 auxiliary atoms
|
|
1018 final queue length
|
|
1307 total queue pushes
|
|
Completing instantiation... [0.050s CPU, 0.056s wall-clock]
|
|
Instantiating: [0.160s CPU, 0.161s 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...
|
|
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.050s 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.010s 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.030s CPU, 0.025s wall-clock]
|
|
Done! [0.310s CPU, 0.310s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.06s
|
|
Memory: 47MB
|
|
|
|
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: 47MB (+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.02s
|
|
Memory: 48MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 49MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.03s
|
|
|
|
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.02s
|
|
Memory: 50MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.20s
|
|
Memory: 51MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.23s
|
|
|
|
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.02s
|
|
Memory: 52MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board","f0","p5")),1) occurs(action(("up","f0","f4")),1) occurs(action(("depart","f4","p5")),2) occurs(action(("down","f4","f2")),2) occurs(action(("board","f2","p0")),3) occurs(action(("up","f2","f17")),3) occurs(action(("board","f17","p1")),4) occurs(action(("board","f17","p6")),4) occurs(action(("down","f17","f6")),4) occurs(action(("board","f6","p8")),5) occurs(action(("up","f6","f16")),5) occurs(action(("board","f16","p2")),6) occurs(action(("down","f16","f7")),6) occurs(action(("board","f7","p7")),7) occurs(action(("up","f7","f13")),7) occurs(action(("down","f13","f1")),8) occurs(action(("board","f13","p4")),8) occurs(action(("depart","f1","p2")),9) occurs(action(("up","f1","f5")),9) occurs(action(("board","f1","p3")),9) occurs(action(("depart","f5","p0")),10) occurs(action(("down","f5","f0")),10) occurs(action(("depart","f0","p6")),11) occurs(action(("up","f0","f10")),11) occurs(action(("depart","f10","p3")),12) occurs(action(("depart","f10","p7")),12) occurs(action(("down","f10","f2")),12) occurs(action(("depart","f2","p1")),13) occurs(action(("up","f2","f12")),13) occurs(action(("depart","f12","p8")),14) occurs(action(("down","f12","f7")),14) occurs(action(("depart","f7","p4")),15)
|
|
Solving Time: 0.01s
|
|
Memory: 53MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.356s (Solving: 0.20s 1st Model: 0.00s Unsat: 0.20s)
|
|
CPU Time : 0.340s
|
|
|
|
Choices : 8254
|
|
Conflicts : 5710 (Analyzed: 5708)
|
|
Restarts : 71 (Average: 80.39 Last: 22)
|
|
Model-Level : 76.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 5708 (Deleted: 2296)
|
|
Binary : 92 (Ratio: 1.61%)
|
|
Ternary : 367 (Ratio: 6.43%)
|
|
Conflict : 5708 (Average Length: 11.6 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 5708 (Average: 1.38 Max: 45 Sum: 7873)
|
|
Executed : 5699 (Average: 1.38 Max: 45 Sum: 7864 Ratio: 99.89%)
|
|
Bounded : 9 (Average: 1.00 Max: 1 Sum: 9 Ratio: 0.11%)
|
|
|
|
Rules : 3894
|
|
Atoms : 3894
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 5917 (Eliminated: 0 Frozen: 270)
|
|
Constraints : 24238 (Binary: 96.3% Ternary: 2.5% Other: 1.2%)
|
|
|
|
Memory Peak : 53MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|