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-46.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-46.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.033s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.027s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.090s CPU, 0.089s wall-clock]
|
|
741 relevant atoms
|
|
490 auxiliary atoms
|
|
1231 final queue length
|
|
1592 total queue pushes
|
|
Completing instantiation... [0.070s CPU, 0.070s wall-clock]
|
|
Instantiating: [0.210s CPU, 0.210s 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...
|
|
20 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.010s 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.060s CPU, 0.060s wall-clock]
|
|
10 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.036s wall-clock]
|
|
Reordering and filtering variables...
|
|
21 of 21 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
400 of 400 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.009s wall-clock]
|
|
Translator variables: 21
|
|
Translator derived variables: 0
|
|
Translator facts: 60
|
|
Translator goal facts: 10
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 400
|
|
Translator axioms: 0
|
|
Translator task size: 1311
|
|
Translator peak memory: 33880 KB
|
|
Writing output... [0.020s CPU, 0.032s wall-clock]
|
|
Done! [0.390s CPU, 0.395s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.07s
|
|
Memory: 48MB
|
|
|
|
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: 48MB (+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: 49MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 49MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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: 51MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.19s
|
|
Memory: 52MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.22s
|
|
|
|
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: 53MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board","f0","p8")),1) occurs(action(("up","f0","f9")),1) occurs(action(("board","f9","p4")),2) occurs(action(("down","f9","f3")),2) occurs(action(("board","f3","p0")),3) occurs(action(("down","f3","f1")),3) occurs(action(("board","f3","p7")),3) occurs(action(("depart","f1","p4")),4) occurs(action(("up","f1","f10")),4) occurs(action(("board","f10","p6")),5) occurs(action(("down","f10","f2")),5) occurs(action(("board","f2","p5")),6) occurs(action(("up","f2","f6")),6) occurs(action(("depart","f6","p7")),7) occurs(action(("depart","f6","p8")),7) occurs(action(("board","f6","p3")),7) occurs(action(("up","f6","f19")),7) occurs(action(("depart","f19","p6")),8) occurs(action(("down","f19","f12")),8) occurs(action(("depart","f12","p3")),9) occurs(action(("down","f12","f6")),9) occurs(action(("board","f12","p9")),9) occurs(action(("depart","f6","p0")),10) occurs(action(("board","f6","p3")),10) occurs(action(("up","f6","f16")),10) occurs(action(("depart","f16","p9")),11) occurs(action(("down","f16","f7")),11) occurs(action(("depart","f7","p5")),12) occurs(action(("up","f7","f13")),12) occurs(action(("board","f13","p2")),13) occurs(action(("up","f13","f17")),13) occurs(action(("board","f17","p1")),14) occurs(action(("down","f17","f15")),14) occurs(action(("depart","f15","p1")),15) occurs(action(("depart","f15","p2")),15)
|
|
Solving Time: 0.09s
|
|
Memory: 54MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.445s (Solving: 0.28s 1st Model: 0.09s Unsat: 0.19s)
|
|
CPU Time : 0.440s
|
|
|
|
Choices : 10939
|
|
Conflicts : 6986 (Analyzed: 6984)
|
|
Restarts : 82 (Average: 85.17 Last: 24)
|
|
Model-Level : 69.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 6984 (Deleted: 4395)
|
|
Binary : 94 (Ratio: 1.35%)
|
|
Ternary : 290 (Ratio: 4.15%)
|
|
Conflict : 6984 (Average Length: 11.5 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 6984 (Average: 1.46 Max: 28 Sum: 10214)
|
|
Executed : 6979 (Average: 1.46 Max: 28 Sum: 10209 Ratio: 99.95%)
|
|
Bounded : 5 (Average: 1.00 Max: 1 Sum: 5 Ratio: 0.05%)
|
|
|
|
Rules : 4766
|
|
Atoms : 4766
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 7129 (Eliminated: 0 Frozen: 300)
|
|
Constraints : 29723 (Binary: 96.7% Ternary: 2.2% Other: 1.1%)
|
|
|
|
Memory Peak : 55MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|