246 lines
15 KiB
Plaintext
246 lines
15 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-13.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-13.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.040s CPU, 0.038s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.023s wall-clock]
|
||
|
|
Generated 45 rules.
|
||
|
|
Computing model... [0.490s CPU, 0.491s wall-clock]
|
||
|
|
1905 relevant atoms
|
||
|
|
4483 auxiliary atoms
|
||
|
|
6388 final queue length
|
||
|
|
9089 total queue pushes
|
||
|
|
Completing instantiation... [0.520s CPU, 0.529s wall-clock]
|
||
|
|
Instantiating: [1.090s CPU, 1.097s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
18 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.053s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating groups... [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
32 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.006s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Computing fact groups: [0.120s CPU, 0.119s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Translating task: [0.460s CPU, 0.463s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
140 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.220s CPU, 0.217s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
76 of 76 variables necessary.
|
||
|
|
0 of 76 mutex groups necessary.
|
||
|
|
1484 of 1484 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.070s CPU, 0.078s wall-clock]
|
||
|
|
Translator variables: 76
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 287
|
||
|
|
Translator goal facts: 8
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1484
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 9107
|
||
|
|
Translator peak memory: 42444 KB
|
||
|
|
Writing output... [0.160s CPU, 0.181s wall-clock]
|
||
|
|
Done! [2.190s CPU, 2.212s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.40s
|
||
|
|
Memory: 76MB
|
||
|
|
|
||
|
|
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: 76MB (+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: 76MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.10s
|
||
|
|
Memory: 76MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 78MB (+2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.16s
|
||
|
|
|
||
|
|
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: 80.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.11s
|
||
|
|
Memory: 79MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.02s
|
||
|
|
Memory: 84MB (+5MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.44s
|
||
|
|
Memory: 101MB (+17MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.80s
|
||
|
|
Memory: 99MB (+-2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 2.43s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 105.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.19s
|
||
|
|
Memory: 99MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.73s
|
||
|
|
Memory: 107MB (+8MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 3.00s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 115.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.19s
|
||
|
|
Memory: 109MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.91s
|
||
|
|
Memory: 114MB (+5MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 3.19s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 122.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.20s
|
||
|
|
Memory: 120MB (+6MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 3.26s
|
||
|
|
Memory: 128MB (+8MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 3.55s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Expected Memory: 142.0MB
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.22s
|
||
|
|
Memory: 135MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 3.46s
|
||
|
|
Memory: 141MB (+6MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 3.78s
|
||
|
|
|
||
|
|
Iteration 8
|
||
|
|
Queue: [(2,10,1,True), (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)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Blocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.83s
|
||
|
|
Memory: 142MB (+1MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.84s
|
||
|
|
|
||
|
|
Iteration 9
|
||
|
|
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)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.43s
|
||
|
|
Memory: 142MB (+0MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 2.44s
|
||
|
|
|
||
|
|
Iteration 10
|
||
|
|
Queue: [(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)]
|
||
|
|
Grounded Until: 30
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.17s
|
||
|
|
Memory: 142MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 142MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("drive","truck1","depot1","market1")),1) occurs(action(("drive","truck2","depot1","market1")),1) occurs(action(("drive","truck3","depot2","market2")),1) occurs(action(("drive","truck4","depot2","market2")),1) occurs(action(("buy","truck3","goods1","market2","level1","level2","level0","level1")),2) occurs(action(("buy","truck1","goods2","market1","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods2","market2","level1","level2","level0","level1")),2) occurs(action(("buy","truck3","goods3","market2","level0","level1","level0","level1")),2) occurs(action(("buy","truck1","goods5","market1","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods5","market2","level1","level2","level0","level1")),2) occurs(action(("buy","truck3","goods6","market2","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods7","market2","level1","level2","level0","level1")),2) occurs(action(("drive","truck2","market1","market4")),2) occurs(action(("drive","truck4","market2","market3")),2) occurs(action(("load","goods1","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods2","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods3","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),3) occurs(action(("load","goods5","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods6","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods7","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("buy","truck2","goods1","market4","level0","level1","level0","level1")),3) occurs(action(("buy","truck4","goods3","market3","level0","level1","level0","level1")),3) occurs(action(("buy","truck2","goods4","market4","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods6","market4","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods7","market4","level0","level1","level0","level1")),3) occurs(action(("buy","truck4","goods8","market3","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods8","market4","level0","level1","level0","level1")),3) occurs(action(("load","goods1","truck2","market4","level0","level1","level0","level1")),4) occurs(action(("load","goods4","truck2","market4","level0","level1","level0","level1")),4) occurs(action(("load","goods8","truck2","market4","level0","level1","level0","level1")),4) occurs(action(("load","goods8","truck4","market3","level0","level1","level0","level1")),4) occurs(action(("buy","truck2","goods6","market4","level0","level1","level1","level2")),4) occurs(action(("drive","truck1","market1","market4")),4) occurs(action(("drive","truck3","market2","depot2")),4) occurs(action(("unload","goods2","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("unload","goods3","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("unload","goods6","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("unload","goods7","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("unload","goods1","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("buy","truck1","goods4","market4","level0","level1","level0","level1")),5) occurs(action(("drive","truck2","market4","market1")),5) occurs(action(("unload","goods5","truck3","depot2","level0","level1","level0","level1")),5) occurs(action(("drive","truck4","market3","market4")),5) occurs(action(("load","goods4","truck1","market4","level0","level1","level0","level1")),6) occurs(action(("load","goods6","truck1","market4","level1","level2","level0","level1")),6) occurs(action(("load","goods7","truck1","market4","level0","level1","level0","level1")),6) occurs(action(("drive","truck3","depot2","market2")),6) occurs(action(("drive","truck4","market4","market2")),6) occurs(action(("drive","truck2","market1","depot1")),6) occur
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 11
|
||
|
|
Time : 20.630s (Solving: 18.49s 1st Model: 0.17s Unsat: 0.00s)
|
||
|
|
CPU Time : 20.612s
|
||
|
|
|
||
|
|
Choices : 297125 (Domain: 253760)
|
||
|
|
Conflicts : 61238 (Analyzed: 61238)
|
||
|
|
Restarts : 705 (Average: 86.86 Last: 131)
|
||
|
|
Model-Level : 503.0
|
||
|
|
Problems : 11 (Average Length: 20.64 Splits: 0)
|
||
|
|
Lemmas : 61238 (Deleted: 54779)
|
||
|
|
Binary : 755 (Ratio: 1.23%)
|
||
|
|
Ternary : 436 (Ratio: 0.71%)
|
||
|
|
Conflict : 61238 (Average Length: 51.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 61238 (Average: 3.65 Max: 352 Sum: 223615)
|
||
|
|
Executed : 60951 (Average: 3.57 Max: 352 Sum: 218701 Ratio: 97.80%)
|
||
|
|
Bounded : 287 (Average: 17.12 Max: 32 Sum: 4914 Ratio: 2.20%)
|
||
|
|
|
||
|
|
Rules : 58404 (Original: 58297)
|
||
|
|
Atoms : 32312
|
||
|
|
Bodies : 19019 (Original: 18941)
|
||
|
|
Count : 537 (Original: 556)
|
||
|
|
Equivalences : 9681 (Atom=Atom: 41 Body=Body: 0 Other: 9640)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 65550 (Eliminated: 0 Frozen: 40698)
|
||
|
|
Constraints : 477130 (Binary: 95.9% Ternary: 1.6% Other: 2.6%)
|
||
|
|
|
||
|
|
Memory Peak : 147MB
|
||
|
|
Max. Length : 30 steps
|
||
|
|
Sol. Length : 20 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|