156 lines
6.6 KiB
Plaintext
156 lines
6.6 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-35.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-35.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.019s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.050s CPU, 0.050s wall-clock]
|
|
393 relevant atoms
|
|
259 auxiliary atoms
|
|
652 final queue length
|
|
821 total queue pushes
|
|
Completing instantiation... [0.040s CPU, 0.039s wall-clock]
|
|
Instantiating: [0.120s CPU, 0.122s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.010s CPU, 0.006s 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...
|
|
14 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.010s CPU, 0.002s wall-clock]
|
|
Translating task: [0.040s CPU, 0.034s wall-clock]
|
|
7 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
1 propositions removed
|
|
Detecting unreachable propositions: [0.020s CPU, 0.021s wall-clock]
|
|
Reordering and filtering variables...
|
|
15 of 15 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
196 of 196 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.000s CPU, 0.005s wall-clock]
|
|
Translator variables: 15
|
|
Translator derived variables: 0
|
|
Translator facts: 42
|
|
Translator goal facts: 7
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 196
|
|
Translator axioms: 0
|
|
Translator task size: 666
|
|
Translator peak memory: 33368 KB
|
|
Writing output... [0.010s CPU, 0.018s wall-clock]
|
|
Done! [0.230s CPU, 0.232s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.17s
|
|
Memory: 55MB
|
|
|
|
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: 55MB (+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.01s
|
|
Memory: 56MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 57MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.02s
|
|
|
|
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.01s
|
|
Memory: 57MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.09s
|
|
Memory: 58MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.11s
|
|
|
|
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.01s
|
|
Memory: 59MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board","f0","p2")),1) occurs(action(("up","f0","f8")),1) occurs(action(("board","f8","p5")),2) occurs(action(("board","f8","p6")),2) occurs(action(("down","f8","f2")),2) occurs(action(("up","f2","f11")),3) occurs(action(("depart","f11","p5")),4) occurs(action(("down","f11","f7")),4) occurs(action(("board","f7","p3")),5) occurs(action(("down","f7","f1")),5) occurs(action(("depart","f1","p3")),6) occurs(action(("up","f1","f7")),6) occurs(action(("down","f7","f6")),7) occurs(action(("board","f7","p3")),7) occurs(action(("depart","f6","p2")),8) occurs(action(("down","f6","f1")),8) occurs(action(("depart","f1","p3")),9) occurs(action(("depart","f1","p6")),9) occurs(action(("up","f1","f3")),9) occurs(action(("board","f3","p4")),10) occurs(action(("up","f3","f4")),10) occurs(action(("depart","f4","p4")),11) occurs(action(("up","f4","f5")),11) occurs(action(("board","f5","p0")),12) occurs(action(("up","f5","f13")),12) occurs(action(("depart","f13","p0")),13) occurs(action(("down","f13","f12")),13) occurs(action(("board","f12","p1")),14) occurs(action(("down","f12","f10")),14) occurs(action(("depart","f10","p1")),15)
|
|
Solving Time: 0.00s
|
|
Memory: 59MB (+0MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.319s (Solving: 0.09s 1st Model: 0.00s Unsat: 0.09s)
|
|
CPU Time : 0.320s
|
|
|
|
Choices : 6009
|
|
Conflicts : 3966 (Analyzed: 3964)
|
|
Restarts : 50 (Average: 79.28 Last: 60)
|
|
Model-Level : 88.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 3964 (Deleted: 917)
|
|
Binary : 55 (Ratio: 1.39%)
|
|
Ternary : 224 (Ratio: 5.65%)
|
|
Conflict : 3964 (Average Length: 9.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 3964 (Average: 1.42 Max: 14 Sum: 5630)
|
|
Executed : 3958 (Average: 1.42 Max: 14 Sum: 5624 Ratio: 99.89%)
|
|
Bounded : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 0.11%)
|
|
|
|
Rules : 99809
|
|
Atoms : 99809
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 3829 (Eliminated: 0 Frozen: 407)
|
|
Constraints : 14948 (Binary: 95.3% Ternary: 3.1% Other: 1.6%)
|
|
|
|
Memory Peak : 59MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|