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-40.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-40.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.021s 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.010s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.016s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.060s CPU, 0.059s wall-clock]
|
|
497 relevant atoms
|
|
328 auxiliary atoms
|
|
825 final queue length
|
|
1050 total queue pushes
|
|
Completing instantiation... [0.050s CPU, 0.047s wall-clock]
|
|
Instantiating: [0.140s CPU, 0.140s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.000s 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...
|
|
16 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.002s wall-clock]
|
|
Translating task: [0.050s CPU, 0.046s wall-clock]
|
|
8 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.026s wall-clock]
|
|
Reordering and filtering variables...
|
|
17 of 17 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
256 of 256 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
|
|
Translator variables: 17
|
|
Translator derived variables: 0
|
|
Translator facts: 48
|
|
Translator goal facts: 8
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 256
|
|
Translator axioms: 0
|
|
Translator task size: 857
|
|
Translator peak memory: 36812 KB
|
|
Writing output... [0.020s CPU, 0.023s wall-clock]
|
|
Done! [0.270s CPU, 0.278s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.04s
|
|
Memory: 50MB
|
|
|
|
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: 51MB (+1MB)
|
|
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: 52MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 52MB (+0MB)
|
|
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.02s
|
|
Memory: 53MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.21s
|
|
Memory: 53MB (+0MB)
|
|
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.01s
|
|
Memory: 55MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f14")),1) occurs(action(("board","f14","p2")),2) occurs(action(("board","f14","p7")),2) occurs(action(("down","f14","f13")),2) occurs(action(("depart","f13","p7")),3) occurs(action(("down","f13","f6")),3) occurs(action(("depart","f6","p2")),4) occurs(action(("board","f6","p5")),4) occurs(action(("board","f6","p6")),4) occurs(action(("up","f6","f13")),4) occurs(action(("depart","f13","p5")),5) occurs(action(("down","f13","f3")),5) occurs(action(("depart","f3","p6")),6) occurs(action(("down","f3","f2")),6) occurs(action(("board","f2","p1")),7) occurs(action(("up","f2","f4")),7) occurs(action(("depart","f4","p1")),8) occurs(action(("up","f4","f11")),8) occurs(action(("board","f11","p3")),9) occurs(action(("up","f11","f13")),9) occurs(action(("depart","f13","p3")),10) occurs(action(("down","f13","f1")),10) occurs(action(("board","f1","p4")),11) occurs(action(("down","f1","f0")),11) occurs(action(("depart","f0","p4")),12) occurs(action(("up","f0","f15")),12) occurs(action(("board","f15","p0")),13) occurs(action(("down","f15","f7")),13) occurs(action(("depart","f7","p0")),14) occurs(action(("down","f7","f6")),14) occurs(action(("board","f6","p5")),15) occurs(action(("board","f6","p6")),15) occurs(action(("down","f6","f0")),15)
|
|
Solving Time: 0.00s
|
|
Memory: 56MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.327s (Solving: 0.21s 1st Model: 0.00s Unsat: 0.21s)
|
|
CPU Time : 0.324s
|
|
|
|
Choices : 10008 (Domain: 9991)
|
|
Conflicts : 5481 (Analyzed: 5479)
|
|
Restarts : 63 (Average: 86.97 Last: 35)
|
|
Model-Level : 82.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 5479 (Deleted: 2540)
|
|
Binary : 1 (Ratio: 0.02%)
|
|
Ternary : 7 (Ratio: 0.13%)
|
|
Conflict : 5479 (Average Length: 21.4 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 5479 (Average: 1.73 Max: 18 Sum: 9484)
|
|
Executed : 5459 (Average: 1.73 Max: 18 Sum: 9464 Ratio: 99.79%)
|
|
Bounded : 20 (Average: 1.00 Max: 1 Sum: 20 Ratio: 0.21%)
|
|
|
|
Rules : 3110
|
|
Atoms : 3110
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 4815 (Eliminated: 0 Frozen: 240)
|
|
Constraints : 19296 (Binary: 95.9% Ternary: 2.7% Other: 1.4%)
|
|
|
|
Memory Peak : 56MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|