182 lines
7.2 KiB
Plaintext
182 lines
7.2 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-39.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-39.pddl
|
|
Parsing...
|
|
Parsing: [0.020s CPU, 0.018s 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.000s CPU, 0.010s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.050s CPU, 0.054s wall-clock]
|
|
497 relevant atoms
|
|
328 auxiliary atoms
|
|
825 final queue length
|
|
1050 total queue pushes
|
|
Completing instantiation... [0.050s CPU, 0.044s wall-clock]
|
|
Instantiating: [0.130s CPU, 0.130s 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...
|
|
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.000s CPU, 0.008s 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.040s CPU, 0.040s 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.030s CPU, 0.025s 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.000s CPU, 0.006s 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: 33624 KB
|
|
Writing output... [0.020s CPU, 0.021s wall-clock]
|
|
Done! [0.250s CPU, 0.253s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.05s
|
|
Memory: 47MB
|
|
|
|
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: 47MB (+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: 48MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 48MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.03s
|
|
|
|
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: 49MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 50MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.04s
|
|
|
|
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: 51MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.07s
|
|
Memory: 52MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.09s
|
|
|
|
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.02s
|
|
Memory: 52MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.53s
|
|
Memory: 53MB (+1MB)
|
|
UNKNOWN
|
|
Iteration Time: 0.56s
|
|
|
|
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.02s
|
|
Memory: 54MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("board","f0","p6")),1) occurs(action(("up","f0","f14")),2) occurs(action(("depart","f14","p6")),3) occurs(action(("board","f14","p1")),3) occurs(action(("down","f14","f7")),4) occurs(action(("board","f7","p5")),5) occurs(action(("down","f7","f3")),6) occurs(action(("depart","f3","p1")),7) occurs(action(("board","f3","p2")),7) occurs(action(("board","f3","p4")),7) occurs(action(("down","f3","f1")),8) occurs(action(("board","f1","p0")),9) occurs(action(("up","f1","f6")),10) occurs(action(("depart","f6","p5")),11) occurs(action(("up","f6","f15")),12) occurs(action(("depart","f15","p0")),13) occurs(action(("down","f15","f8")),14) occurs(action(("depart","f8","p4")),15) occurs(action(("up","f8","f10")),16) occurs(action(("board","f10","p7")),17) occurs(action(("down","f10","f5")),18) occurs(action(("board","f5","p3")),19) occurs(action(("up","f5","f11")),20) occurs(action(("depart","f11","p7")),21) occurs(action(("down","f11","f0")),22) occurs(action(("depart","f0","p3")),23) occurs(action(("up","f0","f12")),24) occurs(action(("depart","f12","p2")),25)
|
|
Solving Time: 0.01s
|
|
Memory: 55MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 6
|
|
Time : 0.801s (Solving: 0.61s 1st Model: 0.00s Unsat: 0.07s)
|
|
CPU Time : 0.790s
|
|
|
|
Choices : 13824
|
|
Conflicts : 9601 (Analyzed: 9598)
|
|
Restarts : 114 (Average: 84.19 Last: 103)
|
|
Model-Level : 54.0
|
|
Problems : 6 (Average Length: 14.50 Splits: 0)
|
|
Lemmas : 9598 (Deleted: 4636)
|
|
Binary : 167 (Ratio: 1.74%)
|
|
Ternary : 615 (Ratio: 6.41%)
|
|
Conflict : 9598 (Average Length: 11.0 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 9598 (Average: 1.39 Max: 40 Sum: 13314)
|
|
Executed : 9579 (Average: 1.37 Max: 40 Sum: 13182 Ratio: 99.01%)
|
|
Bounded : 19 (Average: 6.95 Max: 22 Sum: 132 Ratio: 0.99%)
|
|
|
|
Rules : 3358
|
|
Atoms : 3358
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 8451 (Eliminated: 0 Frozen: 6200)
|
|
Constraints : 39962 (Binary: 96.0% Ternary: 2.7% Other: 1.3%)
|
|
|
|
Memory Peak : 55MB
|
|
Max. Length : 25 steps
|
|
Sol. Length : 25 steps
|
|
|
|
|