156 lines
6.8 KiB
Plaintext
156 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-38.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-38.pddl
|
|
Parsing...
|
|
Parsing: [0.010s 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.010s CPU, 0.010s wall-clock]
|
|
Preparing model... [0.010s CPU, 0.016s wall-clock]
|
|
Generated 18 rules.
|
|
Computing model... [0.060s CPU, 0.055s wall-clock]
|
|
497 relevant atoms
|
|
328 auxiliary atoms
|
|
825 final queue length
|
|
1050 total queue pushes
|
|
Completing instantiation... [0.040s CPU, 0.043s wall-clock]
|
|
Instantiating: [0.130s CPU, 0.131s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
6 initial candidates
|
|
Finding invariants: [0.000s CPU, 0.004s wall-clock]
|
|
Checking invariant weight... [0.010s 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.010s CPU, 0.007s 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.020s CPU, 0.023s 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.010s 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.240s CPU, 0.251s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.30s
|
|
Memory: 62MB
|
|
|
|
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: 62MB (+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: 65MB (+3MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.00s
|
|
Memory: 65MB (+0MB)
|
|
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: 67MB (+2MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.21s
|
|
Memory: 68MB (+1MB)
|
|
UNSAT
|
|
Iteration Time: 0.25s
|
|
|
|
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.03s
|
|
Memory: 69MB (+1MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 1
|
|
occurs(action(("up","f0","f4")),1) occurs(action(("board","f4","p1")),2) occurs(action(("up","f4","f9")),2) occurs(action(("board","f9","p2")),3) occurs(action(("down","f9","f6")),3) occurs(action(("board","f6","p3")),4) occurs(action(("up","f6","f14")),4) occurs(action(("depart","f14","p2")),5) occurs(action(("up","f14","f15")),5) occurs(action(("board","f15","p4")),6) occurs(action(("board","f15","p6")),6) occurs(action(("down","f15","f2")),6) occurs(action(("up","f2","f10")),7) occurs(action(("board","f2","p7")),7) occurs(action(("depart","f10","p1")),8) occurs(action(("board","f10","p5")),8) occurs(action(("up","f10","f11")),8) occurs(action(("depart","f11","p5")),9) occurs(action(("board","f11","p0")),9) occurs(action(("down","f11","f7")),9) occurs(action(("depart","f7","p4")),10) occurs(action(("up","f7","f14")),10) occurs(action(("depart","f14","p3")),11) occurs(action(("depart","f14","p7")),11) occurs(action(("up","f14","f15")),11) occurs(action(("board","f15","p4")),12) occurs(action(("board","f15","p6")),12) occurs(action(("board","f15","p4")),13) occurs(action(("board","f15","p6")),13) occurs(action(("down","f15","f2")),13) occurs(action(("depart","f2","p6")),14) occurs(action(("down","f2","f0")),14) occurs(action(("depart","f0","p0")),15) occurs(action(("up","f0","f14")),15)
|
|
Solving Time: 0.01s
|
|
Memory: 70MB (+1MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 0.645s (Solving: 0.22s 1st Model: 0.01s Unsat: 0.21s)
|
|
CPU Time : 0.640s
|
|
|
|
Choices : 7945
|
|
Conflicts : 6209 (Analyzed: 6207)
|
|
Restarts : 77 (Average: 80.61 Last: 45)
|
|
Model-Level : 61.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 6207 (Deleted: 2413)
|
|
Binary : 46 (Ratio: 0.74%)
|
|
Ternary : 177 (Ratio: 2.85%)
|
|
Conflict : 6207 (Average Length: 13.1 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 6207 (Average: 1.22 Max: 13 Sum: 7563)
|
|
Executed : 6199 (Average: 1.22 Max: 13 Sum: 7555 Ratio: 99.89%)
|
|
Bounded : 8 (Average: 1.00 Max: 1 Sum: 8 Ratio: 0.11%)
|
|
|
|
Rules : 172808
|
|
Atoms : 172808
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 6720 (Eliminated: 0 Frozen: 0)
|
|
Constraints : 20526 (Binary: 95.2% Ternary: 3.6% Other: 1.2%)
|
|
|
|
Memory Peak : 71MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|