156 lines
7.0 KiB
Plaintext
156 lines
7.0 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-55.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-55.pddl
|
|
Parsing...
|
|
Parsing: [0.030s CPU, 0.032s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
|
|
Preparing model... [0.030s CPU, 0.028s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.090s CPU, 0.096s wall-clock]
|
|
881 relevant atoms
|
|
583 auxiliary atoms
|
|
1464 final queue length
|
|
1905 total queue pushes
|
|
Completing instantiation... [0.080s CPU, 0.077s wall-clock]
|
|
Instantiating: [0.220s CPU, 0.222s 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...
|
|
22 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.001s 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.004s wall-clock]
|
|
Translating task: [0.080s CPU, 0.076s 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.040s CPU, 0.043s 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.010s CPU, 0.011s 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.039s wall-clock]
|
|
Done! [0.440s CPU, 0.440s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.08s
|
|
Memory: 49MB
|
|
|
|
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: 49MB (+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.03s
|
|
Memory: 49MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 50MB (+1MB)
|
|
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.03s
|
|
Memory: 52MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.35s
|
|
Memory: 53MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.39s
|
|
|
|
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: 54MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f19")),1) occurs(action(("board","f19","p10")),2) occurs(action(("board","f19","p8")),2) occurs(action(("down","f19","f16")),2) occurs(action(("depart","f16","p10")),3) occurs(action(("depart","f16","p8")),3) occurs(action(("board","f16","p3")),3) occurs(action(("down","f16","f14")),3) occurs(action(("board","f14","p1")),4) occurs(action(("down","f14","f5")),4) occurs(action(("board","f5","p9")),5) occurs(action(("up","f5","f21")),5) occurs(action(("depart","f21","p3")),6) occurs(action(("depart","f21","p9")),6) occurs(action(("board","f21","p4")),6) occurs(action(("down","f21","f15")),6) occurs(action(("board","f21","p7")),6) occurs(action(("depart","f15","p4")),7) occurs(action(("board","f15","p0")),7) occurs(action(("up","f15","f17")),7) occurs(action(("board","f17","p6")),8) occurs(action(("down","f17","f8")),8) occurs(action(("board","f8","p5")),9) occurs(action(("up","f8","f18")),9) occurs(action(("board","f18","p2")),10) occurs(action(("down","f18","f10")),10) occurs(action(("depart","f10","p5")),11) occurs(action(("down","f10","f8")),11) occurs(action(("depart","f8","p6")),12) occurs(action(("board","f8","p5")),12) occurs(action(("down","f8","f4")),12) occurs(action(("depart","f4","p2")),13) occurs(action(("depart","f4","p7")),13) occurs(action(("up","f4","f9")),13) occurs(action(("depart","f9","p0")),14) occurs(action(("down","f9","f0")),14) occurs(action(("depart","f0","p1")),15) occurs(action(("up","f0","f19")),15)
|
|
Solving Time: 0.05s
|
|
Memory: 56MB (+2MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.602s (Solving: 0.40s 1st Model: 0.04s Unsat: 0.35s)
|
|
CPU Time : 0.600s
|
|
|
|
Choices : 11881
|
|
Conflicts : 8214 (Analyzed: 8212)
|
|
Restarts : 100 (Average: 82.12 Last: 8)
|
|
Model-Level : 76.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 8212 (Deleted: 4135)
|
|
Binary : 83 (Ratio: 1.01%)
|
|
Ternary : 258 (Ratio: 3.14%)
|
|
Conflict : 8212 (Average Length: 13.2 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 8212 (Average: 1.36 Max: 31 Sum: 11177)
|
|
Executed : 8202 (Average: 1.36 Max: 31 Sum: 11167 Ratio: 99.91%)
|
|
Bounded : 10 (Average: 1.00 Max: 1 Sum: 10 Ratio: 0.09%)
|
|
|
|
Rules : 5726
|
|
Atoms : 5726
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 8451 (Eliminated: 0 Frozen: 330)
|
|
Constraints : 35751 (Binary: 97.0% Ternary: 2.0% Other: 1.0%)
|
|
|
|
Memory Peak : 56MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|