169 lines
6.8 KiB
Plaintext
169 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-34.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-34.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.010s CPU, 0.020s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
|
||
|
Preparing model... [0.020s CPU, 0.013s wall-clock]
|
||
|
Generated 18 rules.
|
||
|
Computing model... [0.040s CPU, 0.048s wall-clock]
|
||
|
393 relevant atoms
|
||
|
259 auxiliary atoms
|
||
|
652 final queue length
|
||
|
821 total queue pushes
|
||
|
Completing instantiation... [0.040s CPU, 0.037s wall-clock]
|
||
|
Instantiating: [0.110s CPU, 0.115s 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.000s wall-clock]
|
||
|
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
Choosing groups...
|
||
|
14 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.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.002s wall-clock]
|
||
|
Translating task: [0.030s CPU, 0.032s wall-clock]
|
||
|
7 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
1 propositions removed
|
||
|
Detecting unreachable propositions: [0.020s CPU, 0.020s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
15 of 15 variables necessary.
|
||
|
0 of 1 mutex groups necessary.
|
||
|
196 of 196 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
|
||
|
Translator variables: 15
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 42
|
||
|
Translator goal facts: 7
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 196
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 666
|
||
|
Translator peak memory: 33368 KB
|
||
|
Writing output... [0.010s CPU, 0.016s wall-clock]
|
||
|
Done! [0.210s CPU, 0.220s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.04s
|
||
|
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: 47MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.00s
|
||
|
Memory: 48MB (+1MB)
|
||
|
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.00s
|
||
|
Memory: 49MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.03s
|
||
|
|
||
|
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: 50MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.14s
|
||
|
Memory: 50MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.16s
|
||
|
|
||
|
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.01s
|
||
|
Memory: 51MB (+1MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("up","f0","f7")),1) occurs(action(("board","f7","p0")),2) occurs(action(("board","f7","p3")),2) occurs(action(("down","f7","f5")),3) occurs(action(("depart","f5","p0")),4) occurs(action(("board","f5","p5")),4) occurs(action(("down","f5","f2")),5) occurs(action(("depart","f2","p3")),6) occurs(action(("down","f2","f0")),7) occurs(action(("board","f0","p1")),8) occurs(action(("board","f0","p6")),8) occurs(action(("up","f0","f8")),9) occurs(action(("depart","f8","p6")),10) occurs(action(("up","f8","f12")),11) occurs(action(("depart","f12","p5")),12) occurs(action(("up","f12","f13")),13) occurs(action(("depart","f13","p1")),14) occurs(action(("board","f13","p4")),14) occurs(action(("down","f13","f12")),15) occurs(action(("depart","f12","p4")),16) occurs(action(("down","f12","f9")),17) occurs(action(("board","f9","p2")),18) occurs(action(("down","f9","f6")),19) occurs(action(("depart","f6","p2")),20)
|
||
|
Solving Time: 0.01s
|
||
|
Memory: 52MB (+1MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 5
|
||
|
Time : 0.290s (Solving: 0.15s 1st Model: 0.01s Unsat: 0.14s)
|
||
|
CPU Time : 0.280s
|
||
|
|
||
|
Choices : 6356 (Domain: 6356)
|
||
|
Conflicts : 2163 (Analyzed: 2160)
|
||
|
Restarts : 26 (Average: 83.08 Last: 44)
|
||
|
Model-Level : 74.0
|
||
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||
|
Lemmas : 2160 (Deleted: 0)
|
||
|
Binary : 57 (Ratio: 2.64%)
|
||
|
Ternary : 103 (Ratio: 4.77%)
|
||
|
Conflict : 2160 (Average Length: 21.0 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 2160 (Average: 2.88 Max: 31 Sum: 6212)
|
||
|
Executed : 2139 (Average: 2.83 Max: 31 Sum: 6109 Ratio: 98.34%)
|
||
|
Bounded : 21 (Average: 4.90 Max: 17 Sum: 103 Ratio: 1.66%)
|
||
|
|
||
|
Rules : 2603
|
||
|
Atoms : 2603
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 5350 (Eliminated: 0 Frozen: 3771)
|
||
|
Constraints : 24506 (Binary: 95.4% Ternary: 3.1% Other: 1.5%)
|
||
|
|
||
|
Memory Peak : 52MB
|
||
|
Max. Length : 20 steps
|
||
|
Sol. Length : 20 steps
|
||
|
|
||
|
|