236 lines
7.8 KiB
Plaintext
236 lines
7.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-45.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-45.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.020s CPU, 0.019s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
|
||
|
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
||
|
Generated 18 rules.
|
||
|
Computing model... [0.060s CPU, 0.061s wall-clock]
|
||
|
613 relevant atoms
|
||
|
405 auxiliary atoms
|
||
|
1018 final queue length
|
||
|
1307 total queue pushes
|
||
|
Completing instantiation... [0.060s CPU, 0.052s wall-clock]
|
||
|
Instantiating: [0.150s CPU, 0.147s 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...
|
||
|
18 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.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.003s wall-clock]
|
||
|
Translating task: [0.050s CPU, 0.050s wall-clock]
|
||
|
9 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.030s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
19 of 19 variables necessary.
|
||
|
0 of 1 mutex groups necessary.
|
||
|
324 of 324 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
|
||
|
Translator variables: 19
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 54
|
||
|
Translator goal facts: 9
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 324
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 1072
|
||
|
Translator peak memory: 33624 KB
|
||
|
Writing output... [0.020s CPU, 0.025s wall-clock]
|
||
|
Done! [0.290s CPU, 0.292s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.05s
|
||
|
Memory: 47MB
|
||
|
|
||
|
Iteration 1
|
||
|
Queue: [0]
|
||
|
Grounded Until: 0
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 47MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.00s
|
||
|
|
||
|
Iteration 2
|
||
|
Queue: [5]
|
||
|
Grounded Until: 0
|
||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 48MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 49MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.04s
|
||
|
|
||
|
Iteration 3
|
||
|
Queue: [10]
|
||
|
Grounded Until: 5
|
||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
Grounding Time: 0.03s
|
||
|
Memory: 51MB (+2MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 51MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.04s
|
||
|
|
||
|
Iteration 4
|
||
|
Queue: [15]
|
||
|
Grounded Until: 10
|
||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 52MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.14s
|
||
|
Memory: 53MB (+1MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.17s
|
||
|
|
||
|
Iteration 5
|
||
|
Queue: [20]
|
||
|
Grounded Until: 15
|
||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 54MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.79s
|
||
|
Memory: 55MB (+1MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.82s
|
||
|
|
||
|
Iteration 6
|
||
|
Queue: [20]
|
||
|
Grounded Until: 20
|
||
|
Solving...
|
||
|
Solving Time: 0.79s
|
||
|
Memory: 55MB (+0MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.79s
|
||
|
|
||
|
Iteration 7
|
||
|
Queue: [20]
|
||
|
Grounded Until: 20
|
||
|
Solving...
|
||
|
Solving Time: 0.69s
|
||
|
Memory: 55MB (+0MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.69s
|
||
|
|
||
|
Iteration 8
|
||
|
Queue: [20]
|
||
|
Grounded Until: 20
|
||
|
Solving...
|
||
|
Solving Time: 0.64s
|
||
|
Memory: 55MB (+0MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.64s
|
||
|
|
||
|
Iteration 9
|
||
|
Queue: [20]
|
||
|
Grounded Until: 20
|
||
|
Solving...
|
||
|
Solving Time: 0.65s
|
||
|
Memory: 55MB (+0MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.65s
|
||
|
|
||
|
Iteration 10
|
||
|
Queue: [20]
|
||
|
Grounded Until: 20
|
||
|
Solving...
|
||
|
Solving Time: 0.64s
|
||
|
Memory: 55MB (+0MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 0.64s
|
||
|
|
||
|
Iteration 11
|
||
|
Queue: [20]
|
||
|
Grounded Until: 20
|
||
|
Solving...
|
||
|
Solving Time: 0.08s
|
||
|
Memory: 55MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.08s
|
||
|
|
||
|
Iteration 12
|
||
|
Queue: [25]
|
||
|
Grounded Until: 20
|
||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
Grounding Time: 0.02s
|
||
|
Memory: 57MB (+2MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("board","f0","p2")),1) occurs(action(("board","f0","p7")),1) occurs(action(("up","f0","f2")),2) occurs(action(("board","f2","p5")),3) occurs(action(("down","f2","f1")),4) occurs(action(("depart","f1","p5")),5) occurs(action(("up","f1","f12")),6) occurs(action(("board","f12","p1")),7) occurs(action(("down","f12","f2")),8) occurs(action(("down","f2","f1")),9) occurs(action(("up","f1","f9")),10) occurs(action(("board","f9","p0")),11) occurs(action(("down","f9","f2")),12) occurs(action(("board","f2","p6")),13) occurs(action(("board","f2","p8")),13) occurs(action(("up","f2","f3")),14) occurs(action(("depart","f3","p6")),15) occurs(action(("board","f3","p4")),15) occurs(action(("up","f3","f17")),16) occurs(action(("board","f17","p3")),17) occurs(action(("down","f17","f10")),18) occurs(action(("depart","f10","p2")),19) occurs(action(("up","f10","f13")),20) occurs(action(("depart","f13","p8")),21) occurs(action(("down","f13","f2")),22) occurs(action(("depart","f2","p1")),23) occurs(action(("depart","f2","p4")),23) occurs(action(("up","f2","f15")),24) occurs(action(("depart","f15","p0")),25) occurs(action(("depart","f15","p3")),25) occurs(action(("depart","f15","p7")),25)
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 58MB (+1MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 12
|
||
|
Time : 4.640s (Solving: 4.41s 1st Model: 0.00s Unsat: 0.22s)
|
||
|
CPU Time : 4.640s
|
||
|
|
||
|
Choices : 66652
|
||
|
Conflicts : 51965 (Analyzed: 51961)
|
||
|
Restarts : 631 (Average: 82.35 Last: 149)
|
||
|
Model-Level : 53.0
|
||
|
Problems : 12 (Average Length: 18.25 Splits: 0)
|
||
|
Lemmas : 51961 (Deleted: 40819)
|
||
|
Binary : 148 (Ratio: 0.28%)
|
||
|
Ternary : 926 (Ratio: 1.78%)
|
||
|
Conflict : 51961 (Average Length: 14.7 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 51961 (Average: 1.21 Max: 37 Sum: 62995)
|
||
|
Executed : 51940 (Average: 1.21 Max: 37 Sum: 62857 Ratio: 99.78%)
|
||
|
Bounded : 21 (Average: 6.57 Max: 22 Sum: 138 Ratio: 0.22%)
|
||
|
|
||
|
Rules : 4209
|
||
|
Atoms : 4209
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 10357 (Eliminated: 0 Frozen: 7836)
|
||
|
Constraints : 50172 (Binary: 96.4% Ternary: 2.5% Other: 1.1%)
|
||
|
|
||
|
Memory Peak : 59MB
|
||
|
Max. Length : 25 steps
|
||
|
Sol. Length : 25 steps
|
||
|
|
||
|
|