174 lines
12 KiB
Plaintext
174 lines
12 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-10.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-10.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.032s 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.031s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Generated 45 rules.
|
||
|
|
Computing model... [0.210s CPU, 0.209s wall-clock]
|
||
|
|
738 relevant atoms
|
||
|
|
2001 auxiliary atoms
|
||
|
|
2739 final queue length
|
||
|
|
3414 total queue pushes
|
||
|
|
Completing instantiation... [0.150s CPU, 0.151s wall-clock]
|
||
|
|
Instantiating: [0.420s CPU, 0.421s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
18 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.041s wall-clock]
|
||
|
|
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Instantiating groups... [0.030s CPU, 0.028s 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.004s wall-clock]
|
||
|
|
Computing fact groups: [0.100s CPU, 0.098s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s 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.007s wall-clock]
|
||
|
|
Translating task: [0.130s CPU, 0.123s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
135 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.060s CPU, 0.064s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
71 of 71 variables necessary.
|
||
|
|
0 of 71 mutex groups necessary.
|
||
|
|
414 of 414 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.030s CPU, 0.028s wall-clock]
|
||
|
|
Translator variables: 71
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 206
|
||
|
|
Translator goal facts: 10
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 414
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 2717
|
||
|
|
Translator peak memory: 38348 KB
|
||
|
|
Writing output... [0.050s CPU, 0.054s wall-clock]
|
||
|
|
Done! [0.820s CPU, 0.835s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.14s
|
||
|
|
Memory: 56MB
|
||
|
|
|
||
|
|
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: 57MB (+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: 57MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 57MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 57MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.05s
|
||
|
|
|
||
|
|
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: 57MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.04s
|
||
|
|
Memory: 60MB (+3MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.07s
|
||
|
|
Memory: 61MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.12s
|
||
|
|
Memory: 66MB (+5MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.20s
|
||
|
|
Memory: 65MB (+-1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.45s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||
|
|
Grounded Until: 10
|
||
|
|
Expected Memory: 69.0MB
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.06s
|
||
|
|
Memory: 67MB (+2MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.35s
|
||
|
|
Memory: 69MB (+2MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 69MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action(("drive","truck1","depot1","market2")),1) occurs(action(("drive","truck2","depot1","market2")),1) occurs(action(("drive","truck3","depot1","market2")),1) occurs(action(("buy","truck3","goods1","market2","level0","level1","level0","level1")),2) occurs(action(("drive","truck1","market2","market3")),2) occurs(action(("drive","truck2","market2","market3")),2) occurs(action(("buy","truck3","goods10","market2","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","truck3","goods4","market2","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods6","market2","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods8","market2","level1","level2","level0","level1")),2) occurs(action(("buy","truck3","goods9","market2","level0","level1","level0","level1")),2) occurs(action(("load","goods1","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods10","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","goods4","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods6","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods8","truck3","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods9","truck3","market2","level0","level1","level0","level1")),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","truck1","goods3","market1","level0","level1","level0","level1")),4) occurs(action(("buy","truck1","goods4","market1","level0","level1","level0","level1")),4) occurs(action(("buy","truck1","goods5","market1","level1","level2","level0","level1")),4) occurs(action(("buy","truck1","goods7","market1","level1","level2","level0","level1")),4) occurs(action(("drive","truck3","market2","depot1")),4) occurs(action(("unload","goods10","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("unload","goods2","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("unload","goods6","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("unload","goods9","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods1","truck2","market1","level0","level1","level0","level1")),5) occurs(action(("unload","goods1","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods3","truck2","market1","level0","level1","level0","level1")),5) occurs(action(("unload","goods3","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods4","truck2","market1","level0","level1","level0","level1")),5) occurs(action(("unload","goods4","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods5","truck2","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods7","truck2","market1","level0","level1","level0","level1")),5) occurs(action(("unload","goods8","truck3","depot1","level0","level1","level0","level1")),5) occurs(action(("drive","truck2","market1","market3")),6) occurs(action(("buy","truck1","goods5","market1","level0","level1","level0","level1")),6) occurs(action(("buy","truck1","goods7","market1","level0","level1","level0","level1")),6) occurs(action(("drive","truck3","depot1","market2")),6) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),7) occurs(action(("load","goods7","truck1","market1","level0","level1","level0","level1")),7) occurs(action(("buy","truck3","goods8","market2","level0","level1","level0",
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 5
|
||
|
|
Time : 0.994s (Solving: 0.61s 1st Model: 0.42s Unsat: 0.19s)
|
||
|
|
CPU Time : 0.984s
|
||
|
|
|
||
|
|
Choices : 35433 (Domain: 34543)
|
||
|
|
Conflicts : 4658 (Analyzed: 4657)
|
||
|
|
Restarts : 50 (Average: 93.14 Last: 107)
|
||
|
|
Model-Level : 137.5
|
||
|
|
Problems : 5 (Average Length: 10.00 Splits: 0)
|
||
|
|
Lemmas : 4657 (Deleted: 0)
|
||
|
|
Binary : 267 (Ratio: 5.73%)
|
||
|
|
Ternary : 252 (Ratio: 5.41%)
|
||
|
|
Conflict : 4657 (Average Length: 14.2 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 4657 (Average: 7.65 Max: 113 Sum: 35611)
|
||
|
|
Executed : 4556 (Average: 7.37 Max: 113 Sum: 34304 Ratio: 96.33%)
|
||
|
|
Bounded : 101 (Average: 12.94 Max: 17 Sum: 1307 Ratio: 3.67%)
|
||
|
|
|
||
|
|
Rules : 20064 (Original: 18291)
|
||
|
|
Atoms : 10747
|
||
|
|
Bodies : 8170 (Original: 6446)
|
||
|
|
Count : 334 (Original: 515)
|
||
|
|
Equivalences : 3113 (Atom=Atom: 43 Body=Body: 0 Other: 3070)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 17045 (Eliminated: 0 Frozen: 5052)
|
||
|
|
Constraints : 75110 (Binary: 88.0% Ternary: 7.7% Other: 4.2%)
|
||
|
|
|
||
|
|
Memory Peak : 69MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|