164 lines
7.4 KiB
Plaintext
164 lines
7.4 KiB
Plaintext
INFO Running translator.
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-14.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-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-14.pddl
|
|
Parsing...
|
|
Parsing: [0.880s CPU, 0.884s wall-clock]
|
|
Normalizing task... [0.020s CPU, 0.019s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.240s CPU, 0.239s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
|
|
Preparing model... [1.610s CPU, 1.614s wall-clock]
|
|
Generated 23 rules.
|
|
Computing model... [3.720s CPU, 3.714s wall-clock]
|
|
21039 relevant atoms
|
|
38215 auxiliary atoms
|
|
59254 final queue length
|
|
67201 total queue pushes
|
|
Completing instantiation... [1.820s CPU, 1.823s wall-clock]
|
|
Instantiating: [7.470s CPU, 7.473s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
9 initial candidates
|
|
Finding invariants: [0.050s CPU, 0.047s wall-clock]
|
|
Checking invariant weight... [0.050s CPU, 0.055s wall-clock]
|
|
Instantiating groups... [0.050s CPU, 0.051s wall-clock]
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
|
Choosing groups...
|
|
0 uncovered facts
|
|
Choosing groups: [0.000s CPU, 0.006s wall-clock]
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
|
Computing fact groups: [0.180s CPU, 0.177s wall-clock]
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
|
Building mutex information...
|
|
Building mutex information: [0.000s CPU, 0.002s wall-clock]
|
|
Translating task...
|
|
Processing axioms...
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
|
Processing axioms: [0.060s CPU, 0.060s wall-clock]
|
|
Translating task: [1.220s CPU, 1.218s wall-clock]
|
|
0 effect conditions simplified
|
|
0 implied preconditions added
|
|
Detecting unreachable propositions...
|
|
0 operators removed
|
|
0 axioms removed
|
|
11 propositions removed
|
|
Detecting unreachable propositions: [0.560s CPU, 0.559s wall-clock]
|
|
Reordering and filtering variables...
|
|
11 of 11 variables necessary.
|
|
0 of 11 mutex groups necessary.
|
|
4184 of 4184 operators necessary.
|
|
0 of 0 axiom rules necessary.
|
|
Reordering and filtering variables: [0.170s CPU, 0.169s wall-clock]
|
|
Translator variables: 11
|
|
Translator derived variables: 0
|
|
Translator facts: 270
|
|
Translator goal facts: 9
|
|
Translator mutex groups: 0
|
|
Translator total mutex groups size: 0
|
|
Translator operators: 4184
|
|
Translator axioms: 0
|
|
Translator task size: 21048
|
|
Translator peak memory: 64352 KB
|
|
Writing output... [0.390s CPU, 0.420s wall-clock]
|
|
Done! [10.940s CPU, 10.976s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.89s
|
|
Memory: 111MB
|
|
|
|
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: 111MB (+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
|
|
Expected Memory: 111MB
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
|
Grounding Time: 0.26s
|
|
Memory: 111MB (+0MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 115MB (+4MB)
|
|
UNSAT
|
|
Iteration Time: 0.44s
|
|
|
|
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
|
|
Expected Memory: 119.0MB
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
|
Grounding Time: 0.30s
|
|
Memory: 121MB (+6MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.06s
|
|
Memory: 132MB (+11MB)
|
|
UNSAT
|
|
Iteration Time: 0.51s
|
|
|
|
Iteration 4
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
|
Grounded Until: 10
|
|
Expected Memory: 149.0MB
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
|
Grounding Time: 0.29s
|
|
Memory: 140MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.42s
|
|
Memory: 156MB (+16MB)
|
|
SAT
|
|
Testing...
|
|
SERIALIZABLE
|
|
Testing Time: 0.72s
|
|
Memory: 156MB (+0MB)
|
|
Answer: 1
|
|
occurs(action(("drive","t0","l7","l5","level163","level14","level177")),1) occurs(action(("drive","t0","l5","l0","level142","level21","level163")),2) occurs(action(("load","p4","t0","l5")),2) occurs(action(("load","p5","t0","l5")),2) occurs(action(("load","p7","t0","l5")),2) occurs(action(("load","p2","t0","l0")),3) occurs(action(("drive","t0","l0","l6","level132","level10","level142")),3) occurs(action(("unload","p4","t0","l6")),4) occurs(action(("load","p3","t0","l6")),4) occurs(action(("load","p6","t0","l6")),4) occurs(action(("drive","t0","l6","l3","level108","level24","level132")),4) occurs(action(("load","p8","t0","l6")),4) occurs(action(("unload","p7","t0","l3")),5) occurs(action(("load","p0","t0","l3")),5) occurs(action(("drive","t0","l3","l2","level94","level14","level108")),5) occurs(action(("unload","p2","t0","l2")),6) occurs(action(("unload","p3","t0","l2")),6) occurs(action(("unload","p8","t0","l2")),6) occurs(action(("load","p1","t0","l2")),6) occurs(action(("drive","t0","l2","l0","level84","level10","level94")),6) occurs(action(("unload","p1","t0","l0")),7) occurs(action(("drive","t0","l0","l5","level63","level21","level84")),7) occurs(action(("drive","t0","l5","l4","level38","level25","level63")),8) occurs(action(("unload","p0","t0","l4")),9) occurs(action(("drive","t0","l4","l8","level20","level18","level38")),9) occurs(action(("unload","p6","t0","l8")),10) occurs(action(("drive","t0","l8","l7","level1","level19","level20")),10) occurs(action(("unload","p5","t0","l7")),11) occurs(action(("load","p5","t0","l7")),12) occurs(action(("unload","p5","t0","l7")),13) occurs(action(("load","p5","t0","l7")),14) occurs(action(("unload","p5","t0","l7")),15)
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 2.739s (Solving: 0.45s 1st Model: 0.40s Unsat: 0.05s)
|
|
CPU Time : 2.700s
|
|
|
|
Choices : 1476 (Domain: 1476)
|
|
Conflicts : 700 (Analyzed: 698)
|
|
Restarts : 8 (Average: 87.25 Last: 33)
|
|
Model-Level : 102.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 698 (Deleted: 0)
|
|
Binary : 3 (Ratio: 0.43%)
|
|
Ternary : 3 (Ratio: 0.43%)
|
|
Conflict : 698 (Average Length: 3429.7 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 698 (Average: 1.76 Max: 30 Sum: 1231)
|
|
Executed : 693 (Average: 1.69 Max: 30 Sum: 1183 Ratio: 96.10%)
|
|
Bounded : 5 (Average: 9.60 Max: 12 Sum: 48 Ratio: 3.90%)
|
|
|
|
Rules : 67601
|
|
Atoms : 67601
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 64332 (Eliminated: 0 Frozen: 3753)
|
|
Constraints : 357284 (Binary: 98.5% Ternary: 0.8% Other: 0.7%)
|
|
|
|
Memory Peak : 203MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
Models : 1
|
|
|
|
|