202 lines
13 KiB
Plaintext
202 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-11.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-11.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.021s 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.020s CPU, 0.032s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Generated 45 rules.
|
||
|
|
Computing model... [0.250s CPU, 0.245s wall-clock]
|
||
|
|
1015 relevant atoms
|
||
|
|
2192 auxiliary atoms
|
||
|
|
3207 final queue length
|
||
|
|
4543 total queue pushes
|
||
|
|
Completing instantiation... [0.260s CPU, 0.265s wall-clock]
|
||
|
|
Instantiating: [0.570s CPU, 0.569s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
18 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.044s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.020s CPU, 0.016s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
18 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Computing fact groups: [0.080s CPU, 0.081s 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.010s CPU, 0.012s wall-clock]
|
||
|
|
Translating task: [0.220s CPU, 0.219s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
81 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.110s CPU, 0.110s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
45 of 45 variables necessary.
|
||
|
|
0 of 45 mutex groups necessary.
|
||
|
|
744 of 744 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.040s CPU, 0.042s wall-clock]
|
||
|
|
Translator variables: 45
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 173
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 744
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 4616
|
||
|
|
Translator peak memory: 39628 KB
|
||
|
|
Writing output... [0.080s CPU, 0.086s wall-clock]
|
||
|
|
Done! [1.130s CPU, 1.143s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.22s
|
||
|
|
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: 63MB (+1MB)
|
||
|
|
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: 63MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.05s
|
||
|
|
Memory: 63MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 63MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.08s
|
||
|
|
|
||
|
|
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: 63MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.05s
|
||
|
|
Memory: 65MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.08s
|
||
|
|
Memory: 66MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.22s
|
||
|
|
Memory: 76MB (+10MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 74MB (+-2MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.38s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 77.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.09s
|
||
|
|
Memory: 74MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.25s
|
||
|
|
Memory: 76MB (+2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.37s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 15
|
||
|
|
Expected Memory: 79.0MB
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.09s
|
||
|
|
Memory: 80MB (+4MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.64s
|
||
|
|
Memory: 82MB (+2MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 1.78s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 20
|
||
|
|
Expected Memory: 88.0MB
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.11s
|
||
|
|
Memory: 87MB (+5MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 1.76s
|
||
|
|
Memory: 90MB (+3MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 90MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("drive","truck1","depot2","market2")),1) occurs(action(("drive","truck2","depot1","market2")),1) occurs(action(("drive","truck3","depot1","market2")),1) occurs(action(("drive","truck2","market2","market3")),2) occurs(action(("buy","truck1","goods2","market2","level0","level1","level0","level1")),2) occurs(action(("drive","truck3","market2","market3")),2) occurs(action(("buy","truck1","goods4","market2","level0","level1","level0","level1")),2) occurs(action(("load","goods2","truck1","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods4","truck1","market2","level0","level1","level0","level1")),3) occurs(action(("buy","truck3","goods2","market3","level0","level1","level0","level1")),3) occurs(action(("drive","truck2","market3","market1")),3) occurs(action(("buy","truck2","goods1","market1","level2","level3","level0","level1")),4) occurs(action(("drive","truck1","market2","market3")),4) occurs(action(("buy","truck2","goods2","market1","level0","level1","level0","level1")),4) occurs(action(("buy","truck2","goods3","market1","level2","level3","level0","level1")),4) occurs(action(("buy","truck2","goods4","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck2","goods5","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck2","goods6","market1","level2","level3","level0","level1")),4) occurs(action(("drive","truck3","market3","market1")),4) occurs(action(("load","goods1","truck3","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods2","truck1","market3","level0","level1","level1","level2")),5) occurs(action(("load","goods2","truck3","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods3","truck3","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods4","truck3","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods5","truck3","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods6","truck3","market1","level0","level1","level0","level1")),5) occurs(action(("buy","truck2","goods1","market1","level1","level2","level0","level1")),6) occurs(action(("drive","truck3","market1","market3")),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(("drive","truck1","market3","market1")),6) occurs(action(("buy","truck2","goods6","market1","level1","level2","level0","level1")),6) occurs(action(("load","goods1","truck1","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods3","truck1","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods4","truck1","market1","level0","level1","level1","level2")),7) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods6","truck2","market1","level0","level1","level0","level1")),7) occurs(action(("drive","truck3","market3","market2")),7) occurs(action(("buy","truck2","goods1","market1","level0","level1","level0","level1")),8) occurs(action(("drive","truck1","market1","market3")),8) occurs(action(("buy","truck2","goods3","market1","level0","level1","level0","level1")),8) occurs(action(("drive","truck3","market2","depot1")),8) occurs(action(("unload","goods6","truck3","depot1","level0","level1","level0","level1")),9) occurs(action(("load","goods1","truck2","market1","level0","level1","level0","level1")),9) occurs(action(("load","goods3","truck2","market1","level0","level1","level0","level1")),9) occurs(action(("unload","goods5","truck3","depot1","level0","level1","level0","level1")),9) occurs(action(("unload","goods1","truck3","depot1","level0","level1","level0","level1")),9) occurs(action(("unload","goods2","truck3","depot1","level0","level1","level0","level1")),9) occurs(action(("unload","goods3","truck3","depot1","level0","level1","level0","level1")),9) oc
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 7
|
||
|
|
Time : 5.589s (Solving: 4.71s 1st Model: 1.82s Unsat: 0.00s)
|
||
|
|
CPU Time : 5.580s
|
||
|
|
|
||
|
|
Choices : 219915 (Domain: 215878)
|
||
|
|
Conflicts : 27666 (Analyzed: 27665)
|
||
|
|
Restarts : 301 (Average: 91.91 Last: 181)
|
||
|
|
Model-Level : 192.5
|
||
|
|
Problems : 7 (Average Length: 14.14 Splits: 0)
|
||
|
|
Lemmas : 27665 (Deleted: 21452)
|
||
|
|
Binary : 732 (Ratio: 2.65%)
|
||
|
|
Ternary : 479 (Ratio: 1.73%)
|
||
|
|
Conflict : 27665 (Average Length: 36.5 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 27665 (Average: 7.78 Max: 155 Sum: 215246)
|
||
|
|
Executed : 27383 (Average: 7.61 Max: 155 Sum: 210539 Ratio: 97.81%)
|
||
|
|
Bounded : 282 (Average: 16.69 Max: 27 Sum: 4707 Ratio: 2.19%)
|
||
|
|
|
||
|
|
Rules : 26067 (Original: 25826)
|
||
|
|
Atoms : 16532
|
||
|
|
Bodies : 7327 (Original: 7121)
|
||
|
|
Count : 242 (Original: 288)
|
||
|
|
Equivalences : 3604 (Atom=Atom: 31 Body=Body: 0 Other: 3573)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 28791 (Eliminated: 0 Frozen: 15304)
|
||
|
|
Constraints : 175324 (Binary: 94.9% Ternary: 2.0% Other: 3.1%)
|
||
|
|
|
||
|
|
Memory Peak : 92MB
|
||
|
|
Max. Length : 25 steps
|
||
|
|
Sol. Length : 25 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|