226 lines
17 KiB
Plaintext
226 lines
17 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-17.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-2006/domains/tpp-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/tpp-propositional/instances/instance-17.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.044s wall-clock]
|
||
|
|
Preparing model... [0.040s CPU, 0.034s wall-clock]
|
||
|
|
Generated 45 rules.
|
||
|
|
Computing model... [1.500s CPU, 1.501s wall-clock]
|
||
|
|
6037 relevant atoms
|
||
|
|
13636 auxiliary atoms
|
||
|
|
19673 final queue length
|
||
|
|
29583 total queue pushes
|
||
|
|
Completing instantiation... [1.960s CPU, 1.964s wall-clock]
|
||
|
|
Instantiating: [3.570s CPU, 3.573s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
18 initial candidates
|
||
|
|
Finding invariants: [0.090s CPU, 0.092s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Instantiating groups... [0.070s CPU, 0.074s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
62 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Computing fact groups: [0.230s CPU, 0.236s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.090s CPU, 0.085s wall-clock]
|
||
|
|
Translating task: [1.560s CPU, 1.549s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
259 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.840s CPU, 0.842s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
135 of 135 variables necessary.
|
||
|
|
0 of 135 mutex groups necessary.
|
||
|
|
5230 of 5230 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.260s CPU, 0.263s wall-clock]
|
||
|
|
Translator variables: 135
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 615
|
||
|
|
Translator goal facts: 12
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 5230
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 31932
|
||
|
|
Translator peak memory: 57548 KB
|
||
|
|
Writing output... [0.540s CPU, 0.588s wall-clock]
|
||
|
|
Done! [7.110s CPU, 7.169s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.41s
|
||
|
|
Memory: 147MB
|
||
|
|
|
||
|
|
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: 147MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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: 147MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.40s
|
||
|
|
Memory: 147MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.04s
|
||
|
|
Memory: 153MB (+6MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.69s
|
||
|
|
|
||
|
|
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: 159.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.39s
|
||
|
|
Memory: 153MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.38s
|
||
|
|
Memory: 166MB (+13MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 1.51s
|
||
|
|
Memory: 228MB (+62MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.10s
|
||
|
|
Memory: 227MB (+-1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 2.64s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 240.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.75s
|
||
|
|
Memory: 227MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 4.93s
|
||
|
|
Memory: 237MB (+10MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 5.99s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 250.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.71s
|
||
|
|
Memory: 240MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 6.72s
|
||
|
|
Memory: 265MB (+25MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 7.77s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 293.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.73s
|
||
|
|
Memory: 272MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 7.18s
|
||
|
|
Memory: 296MB (+24MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 8.26s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Expected Memory: 327.0MB
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.75s
|
||
|
|
Memory: 313MB (+17MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 8.22s
|
||
|
|
Memory: 331MB (+18MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 9.34s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 6.65s
|
||
|
|
Memory: 333MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 333MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("drive","truck1","depot1","market4")),1) occurs(action(("drive","truck2","depot1","market4")),1) occurs(action(("drive","truck3","depot2","market4")),1) occurs(action(("drive","truck4","depot1","market4")),1) occurs(action(("drive","truck5","depot2","market4")),1) occurs(action(("buy","truck3","goods1","market4","level0","level1","level0","level1")),2) occurs(action(("buy","truck5","goods11","market4","level1","level2","level0","level1")),2) occurs(action(("buy","truck5","goods12","market4","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods2","market4","level1","level2","level0","level1")),2) occurs(action(("buy","truck5","goods3","market4","level1","level2","level0","level1")),2) occurs(action(("buy","truck5","goods4","market4","level0","level1","level0","level1")),2) occurs(action(("buy","truck5","goods6","market4","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods7","market4","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods8","market4","level1","level2","level0","level1")),2) occurs(action(("drive","truck1","market4","market3")),2) occurs(action(("drive","truck2","market4","market3")),2) occurs(action(("drive","truck4","market4","market3")),2) occurs(action(("buy","truck5","goods9","market4","level1","level2","level0","level1")),2) occurs(action(("load","goods1","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods11","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods12","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods2","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods3","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods4","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods6","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods7","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods8","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods9","truck3","market4","level0","level1","level0","level1")),3) occurs(action(("drive","truck4","market3","market2")),3) occurs(action(("drive","truck1","market3","market1")),3) occurs(action(("drive","truck2","market3","market1")),3) occurs(action(("buy","truck1","goods1","market1","level0","level1","level0","level1")),4) occurs(action(("buy","truck4","goods1","market2","level1","level2","level0","level1")),4) occurs(action(("buy","truck1","goods10","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck1","goods11","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck1","goods12","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck4","goods2","market2","level1","level2","level0","level1")),4) occurs(action(("buy","truck4","goods3","market2","level0","level1","level0","level1")),4) occurs(action(("buy","truck5","goods3","market4","level0","level1","level0","level1")),4) occurs(action(("buy","truck1","goods4","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck2","goods5","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck4","goods5","market2","level1","level2","level0","level1")),4) occurs(action(("buy","truck4","goods6","market2","level0","level1","level0","level1")),4) occurs(action(("buy","truck2","goods7","market1","level0","level1","level0","level1")),4) occurs(action(("buy","truck4","goods8","market2","level1","level2","level0","level1")),4) occurs(action(("buy","truck5","goods8","market4","level0","level1","level0","level1")),4) occurs(action(("buy","truck5","goods9","market4","level0","level1","level0","level1")),4) occurs(action(("drive","truck3","market4","depot2")),4) occurs(action(("unload","goods1","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("unload","goods11","truck3","depot2","level0","level1
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 9
|
||
|
|
Time : 41.658s (Solving: 33.89s 1st Model: 6.95s Unsat: 0.03s)
|
||
|
|
CPU Time : 41.604s
|
||
|
|
|
||
|
|
Choices : 458592 (Domain: 391133)
|
||
|
|
Conflicts : 45934 (Analyzed: 45933)
|
||
|
|
Restarts : 529 (Average: 86.83 Last: 143)
|
||
|
|
Model-Level : 753.0
|
||
|
|
Problems : 9 (Average Length: 18.11 Splits: 0)
|
||
|
|
Lemmas : 45933 (Deleted: 39300)
|
||
|
|
Binary : 850 (Ratio: 1.85%)
|
||
|
|
Ternary : 469 (Ratio: 1.02%)
|
||
|
|
Conflict : 45933 (Average Length: 178.8 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 45933 (Average: 7.44 Max: 843 Sum: 341901)
|
||
|
|
Executed : 45479 (Average: 7.25 Max: 843 Sum: 333138 Ratio: 97.44%)
|
||
|
|
Bounded : 454 (Average: 19.30 Max: 32 Sum: 8763 Ratio: 2.56%)
|
||
|
|
|
||
|
|
Rules : 187683 (Original: 186639)
|
||
|
|
Atoms : 109882
|
||
|
|
Bodies : 54702 (Original: 53947)
|
||
|
|
Count : 879 (Original: 982)
|
||
|
|
Equivalences : 27114 (Atom=Atom: 70 Body=Body: 0 Other: 27044)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 196673 (Eliminated: 0 Frozen: 135104)
|
||
|
|
Constraints : 1583449 (Binary: 97.5% Ternary: 1.0% Other: 1.5%)
|
||
|
|
|
||
|
|
Memory Peak : 348MB
|
||
|
|
Max. Length : 30 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|