182 lines
8.7 KiB
Plaintext
182 lines
8.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-51.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-51.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.025s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.000s CPU, 0.009s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.024s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.090s CPU, 0.088s wall-clock]
|
|
881 relevant atoms
|
|
583 auxiliary atoms
|
|
1464 final queue length
|
|
1905 total queue pushes
|
|
Completing instantiation... [0.070s CPU, 0.076s wall-clock]
|
|
Instantiating: [0.210s CPU, 0.207s 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...
|
|
22 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.000s 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.004s wall-clock]
|
|
Translating task: [0.080s CPU, 0.085s wall-clock]
|
|
11 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
1 propositions removed
|
|
Detecting unreachable propositions: [0.050s CPU, 0.052s wall-clock]
|
|
Reordering and filtering variables...
|
|
23 of 23 variables necessary.
|
|
0 of 1 mutex groups necessary.
|
|
484 of 484 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.020s CPU, 0.013s wall-clock]
|
|
Translator variables: 23
|
|
Translator derived variables: 0
|
|
Translator facts: 66
|
|
Translator goal facts: 11
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 484
|
|
Translator axioms: 0
|
|
Translator task size: 1574
|
|
Translator peak memory: 34136 KB
|
|
Writing output... [0.040s CPU, 0.042s wall-clock]
|
|
Done! [0.440s CPU, 0.441s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.86s
|
|
Memory: 100MB
|
|
|
|
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: 100MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.01s
|
|
|
|
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.26s
|
|
Memory: 134MB (+34MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.04s
|
|
Memory: 137MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.35s
|
|
|
|
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.29s
|
|
Memory: 153MB (+16MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.01s
|
|
Memory: 156MB (+3MB)
|
|
UNKNOWN
|
|
Iteration Time: 2.36s
|
|
|
|
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.43s
|
|
Memory: 186MB (+30MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 2.50s
|
|
Memory: 191MB (+5MB)
|
|
UNKNOWN
|
|
Iteration Time: 2.99s
|
|
|
|
Iteration 5
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 15
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
|
Grounding Time: 0.28s
|
|
Memory: 205MB (+14MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 3.06s
|
|
Memory: 211MB (+6MB)
|
|
UNKNOWN
|
|
Iteration Time: 3.41s
|
|
|
|
Iteration 6
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 20
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
|
Grounding Time: 0.29s
|
|
Memory: 224MB (+13MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f1")),1) occurs(action(("up","f1","f8")),2) occurs(action(("board","f1","p2")),2) occurs(action(("board","f8","p5")),2) occurs(action(("up","f8","f15")),3) occurs(action(("board","f8","p5")),3) occurs(action(("depart","f15","p2")),4) occurs(action(("down","f15","f8")),4) occurs(action(("board","f8","p5")),4) occurs(action(("board","f8","p5")),5) occurs(action(("down","f8","f7")),5) occurs(action(("board","f7","p7")),5) occurs(action(("up","f7","f8")),6) occurs(action(("board","f8","p5")),6) occurs(action(("board","f7","p7")),6) occurs(action(("depart","f4","p7")),7) occurs(action(("board","f8","p5")),7) occurs(action(("down","f8","f4")),7) occurs(action(("up","f4","f13")),8) occurs(action(("board","f0","p3")),9) occurs(action(("down","f13","f0")),9) occurs(action(("board","f0","p3")),10) occurs(action(("up","f0","f7")),10) occurs(action(("board","f7","p7")),10) occurs(action(("depart","f7","p5")),11) occurs(action(("board","f7","p7")),11) occurs(action(("board","f20","p8")),11) occurs(action(("up","f7","f20")),11) occurs(action(("board","f20","p8")),12) occurs(action(("up","f20","f21")),12) occurs(action(("board","f21","p10")),13) occurs(action(("board","f2","p9")),13) occurs(action(("down","f21","f2")),13) occurs(action(("board","f21","p10")),14) occurs(action(("board","f2","p9")),14) occurs(action(("up","f2","f21")),14) occurs(action(("board","f17","p0")),15) occurs(action(("board","f17","p1")),15) occurs(action(("board","f21","p10")),15) occurs(action(("down","f21","f17")),15) occurs(action(("board","f17","p0")),16) occurs(action(("board","f17","p1")),16) occurs(action(("down","f17","f13")),16) occurs(action(("depart","f13","p1")),17) occurs(action(("board","f16","p6")),17) occurs(action(("up","f13","f16")),17) occurs(action(("board","f16","p6")),18) occurs(action(("down","f16","f0")),18) occurs(action(("depart","f0","p9")),19) occurs(action(("board","f0","p3")),19) occurs(action(("up","f0","f3")),19) occurs(action(("depart","f3","p6")),20) occurs(action(("board","f3","p4")),20) occurs(action(("up","f3","f16")),20) occurs(action(("depart","f10","p0")),21) occurs(action(("depart","f10","p8")),21) occurs(action(("down","f16","f10")),21) occurs(action(("depart","f1","p4")),22) occurs(action(("board","f1","p2")),22) occurs(action(("down","f10","f1")),22) occurs(action(("board","f1","p2")),23) occurs(action(("up","f1","f6")),23) occurs(action(("depart","f6","p3")),24) occurs(action(("board","f1","p2")),24) occurs(action(("down","f6","f1")),24) occurs(action(("depart","f8","p10")),25) occurs(action(("up","f1","f8")),25)
|
|
Solving Time: 1.22s
|
|
Memory: 232MB (+8MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 6
|
|
Time : 11.560s (Solving: 8.71s 1st Model: 1.19s Unsat: 0.02s)
|
|
CPU Time : 11.560s
|
|
|
|
Choices : 40358
|
|
Conflicts : 28427 (Analyzed: 28426)
|
|
Restarts : 335 (Average: 84.85 Last: 121)
|
|
Model-Level : 94.0
|
|
Problems : 6 (Average Length: 14.50 Splits: 0)
|
|
Lemmas : 28549 (Deleted: 24596)
|
|
Binary : 338 (Ratio: 1.18%)
|
|
Ternary : 165 (Ratio: 0.58%)
|
|
Conflict : 28426 (Average Length: 112.2 Ratio: 99.57%)
|
|
Loop : 123 (Average Length: 30.4 Ratio: 0.43%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 28426 (Average: 1.30 Max: 90 Sum: 37007)
|
|
Executed : 28367 (Average: 1.27 Max: 90 Sum: 36065 Ratio: 97.45%)
|
|
Bounded : 59 (Average: 15.97 Max: 27 Sum: 942 Ratio: 2.55%)
|
|
|
|
Rules : 432229
|
|
Atoms : 432229
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 63972 (Eliminated: 0 Frozen: 60959)
|
|
Constraints : 138960 (Binary: 89.0% Ternary: 10.1% Other: 0.8%)
|
|
|
|
Memory Peak : 232MB
|
|
Max. Length : 25 steps
|
|
Sol. Length : 25 steps
|
|
|
|
|