226 lines
13 KiB
Plaintext
226 lines
13 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-12.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-12.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.024s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.034s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Generated 45 rules.
|
||
|
|
Computing model... [0.290s CPU, 0.291s wall-clock]
|
||
|
|
1185 relevant atoms
|
||
|
|
2586 auxiliary atoms
|
||
|
|
3771 final queue length
|
||
|
|
5356 total queue pushes
|
||
|
|
Completing instantiation... [0.310s CPU, 0.313s wall-clock]
|
||
|
|
Instantiating: [0.660s CPU, 0.668s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
18 initial candidates
|
||
|
|
Finding invariants: [0.050s CPU, 0.048s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
20 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.090s CPU, 0.089s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.002s 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.010s CPU, 0.014s wall-clock]
|
||
|
|
Translating task: [0.260s CPU, 0.260s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
93 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.130s CPU, 0.130s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
53 of 53 variables necessary.
|
||
|
|
0 of 53 mutex groups necessary.
|
||
|
|
879 of 879 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.050s CPU, 0.047s wall-clock]
|
||
|
|
Translator variables: 53
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 202
|
||
|
|
Translator goal facts: 7
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 879
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 5464
|
||
|
|
Translator peak memory: 40396 KB
|
||
|
|
Writing output... [0.100s CPU, 0.115s wall-clock]
|
||
|
|
Done! [1.330s CPU, 1.354s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.25s
|
||
|
|
Memory: 65MB
|
||
|
|
|
||
|
|
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: 65MB (+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: 65MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 65MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 66MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.09s
|
||
|
|
|
||
|
|
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: 67.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.07s
|
||
|
|
Memory: 68MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.14s
|
||
|
|
Memory: 70MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.25s
|
||
|
|
Memory: 81MB (+11MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 80MB (+-1MB)
|
||
|
|
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: 84.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.11s
|
||
|
|
Memory: 80MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.39s
|
||
|
|
Memory: 82MB (+2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.54s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 86.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.13s
|
||
|
|
Memory: 86MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.65s
|
||
|
|
Memory: 89MB (+3MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.82s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 96.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.11s
|
||
|
|
Memory: 92MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.26s
|
||
|
|
Memory: 97MB (+5MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 2.42s
|
||
|
|
|
||
|
|
Iteration 7
|
||
|
|
Queue: [(6,30,0,True)]
|
||
|
|
Grounded Until: 25
|
||
|
|
Expected Memory: 105.0MB
|
||
|
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||
|
|
Grounding Time: 0.11s
|
||
|
|
Memory: 101MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.69s
|
||
|
|
Memory: 104MB (+3MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 2.86s
|
||
|
|
|
||
|
|
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: 0.46s
|
||
|
|
Memory: 104MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 104MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("drive","truck1","depot2","market2")),1) occurs(action(("drive","truck2","depot2","market2")),1) occurs(action(("drive","truck3","depot1","market2")),1) occurs(action(("buy","truck3","goods4","market2","level0","level1","level0","level1")),2) occurs(action(("drive","truck1","market2","market3")),2) occurs(action(("drive","truck2","market2","market3")),2) occurs(action(("load","goods4","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("buy","truck2","goods2","market3","level0","level1","level0","level1")),3) occurs(action(("drive","truck1","market3","market1")),3) occurs(action(("buy","truck2","goods7","market3","level1","level2","level0","level1")),3) occurs(action(("buy","truck1","goods1","market1","level2","level3","level0","level1")),4) occurs(action(("buy","truck1","goods2","market1","level0","level1","level0","level1")),4) occurs(action(("buy","truck1","goods3","market1","level2","level3","level0","level1")),4) occurs(action(("buy","truck1","goods4","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck1","goods5","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck1","goods6","market1","level2","level3","level0","level1")),4) occurs(action(("drive","truck2","market3","market1")),4) occurs(action(("buy","truck1","goods7","market1","level0","level1","level0","level1")),4) occurs(action(("drive","truck3","market2","market3")),4) occurs(action(("load","goods1","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods2","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods2","truck3","market3","level0","level1","level0","level1")),5) occurs(action(("load","goods3","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods4","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods6","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods7","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods7","truck3","market3","level0","level1","level0","level1")),5) occurs(action(("buy","truck2","goods1","market1","level1","level2","level0","level1")),6) occurs(action(("buy","truck2","goods3","market1","level1","level2","level0","level1")),6) occurs(action(("buy","truck2","goods4","market1","level0","level1","level0","level1")),6) occurs(action(("buy","truck2","goods5","market1","level0","level1","level0","level1")),6) occurs(action(("buy","truck2","goods6","market1","level1","level2","level0","level1")),6) occurs(action(("drive","truck1","market1","market3")),6) occurs(action(("drive","truck3","market3","market1")),6) occurs(action(("load","goods1","truck3","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods3","truck3","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods4","truck3","market1","level0","level1","level1","level2")),7) occurs(action(("load","goods5","truck3","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods6","truck3","market1","level0","level1","level0","level1")),7) occurs(action(("drive","truck1","market3","market2")),7) occurs(action(("drive","truck1","market2","depot1")),8) occurs(action(("buy","truck2","goods1","market1","level0","level1","level0","level1")),8) occurs(action(("drive","truck3","market1","market3")),8) occurs(action(("unload","goods6","truck1","depot1","level0","level1","level0","level1")),9) occurs(action(("load","goods1","truck2","market1","level0","level1","level0","level1")),9) occurs(action(("unload","goods2","truck1","depot1","level0","level1","level0","level1")),9) occurs(action(("unload","goods3","truck1","depot1","level0","level1","level0","level1")),9) occurs(action(("unload","goods5","truck1","depot1","level0","level1","level0","level1")),9) occurs(action(("unload","goods7","truck1","depot1","level0","level1","level0","level1")),9) oc
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 9
|
||
|
|
Time : 9.784s (Solving: 8.56s 1st Model: 0.59s Unsat: 0.00s)
|
||
|
|
CPU Time : 9.768s
|
||
|
|
|
||
|
|
Choices : 388234 (Domain: 382378)
|
||
|
|
Conflicts : 39028 (Analyzed: 39027)
|
||
|
|
Restarts : 454 (Average: 85.96 Last: 102)
|
||
|
|
Model-Level : 187.5
|
||
|
|
Problems : 9 (Average Length: 18.11 Splits: 0)
|
||
|
|
Lemmas : 39027 (Deleted: 29577)
|
||
|
|
Binary : 792 (Ratio: 2.03%)
|
||
|
|
Ternary : 552 (Ratio: 1.41%)
|
||
|
|
Conflict : 39027 (Average Length: 38.3 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 39027 (Average: 9.60 Max: 216 Sum: 374478)
|
||
|
|
Executed : 38700 (Average: 9.45 Max: 216 Sum: 368657 Ratio: 98.45%)
|
||
|
|
Bounded : 327 (Average: 17.80 Max: 32 Sum: 5821 Ratio: 1.55%)
|
||
|
|
|
||
|
|
Rules : 31228 (Original: 30889)
|
||
|
|
Atoms : 19552
|
||
|
|
Bodies : 8929 (Original: 8634)
|
||
|
|
Count : 284 (Original: 341)
|
||
|
|
Equivalences : 4342 (Atom=Atom: 34 Body=Body: 0 Other: 4308)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 41064 (Eliminated: 0 Frozen: 22829)
|
||
|
|
Constraints : 265761 (Binary: 95.1% Ternary: 1.9% Other: 3.0%)
|
||
|
|
|
||
|
|
Memory Peak : 107MB
|
||
|
|
Max. Length : 30 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|