tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_tpp-propositional_9.out

174 lines
11 KiB
Plaintext
Raw Permalink Normal View History

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-9.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-9.pddl
Parsing...
Parsing: [0.020s CPU, 0.025s 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.020s wall-clock]
Generated 45 rules.
Computing model... [0.190s CPU, 0.188s wall-clock]
662 relevant atoms
1777 auxiliary atoms
2439 final queue length
3032 total queue pushes
Completing instantiation... [0.140s CPU, 0.134s wall-clock]
Instantiating: [0.390s CPU, 0.386s 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.020s CPU, 0.023s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
30 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.090s CPU, 0.090s 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.000s CPU, 0.006s wall-clock]
Translating task: [0.100s CPU, 0.108s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
123 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.061s wall-clock]
Reordering and filtering variables...
63 of 63 variables necessary.
0 of 63 mutex groups necessary.
366 of 366 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.025s wall-clock]
Translator variables: 63
Translator derived variables: 0
Translator facts: 184
Translator goal facts: 9
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 366
Translator axioms: 0
Translator task size: 2398
Translator peak memory: 38092 KB
Writing output... [0.040s CPU, 0.047s wall-clock]
Done! [0.750s CPU, 0.753s wall-clock]
planner.py version 0.0.1
Time: 0.13s
Memory: 55MB
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: 56MB (+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: 56MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 56MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
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: 58.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.04s
Memory: 59MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 60MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.11s
Memory: 64MB (+4MB)
Solving...
Solving Time: 0.18s
Memory: 63MB (+-1MB)
UNSAT
Iteration Time: 0.41s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 66.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.05s
Memory: 65MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 1.01s
Memory: 67MB (+2MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 67MB (+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","truck2","goods1","market2","level0","level1","level0","level1")),2) occurs(action(("buy","truck2","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","truck2","goods6","market2","level0","level1","level0","level1")),2) occurs(action(("buy","truck3","goods8","market2","level1","level2","level0","level1")),2) occurs(action(("buy","truck2","goods9","market2","level0","level1","level0","level1")),2) occurs(action(("drive","truck1","market2","market3")),2) occurs(action(("load","goods1","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods2","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods3","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods4","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods6","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods8","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("load","goods9","truck2","market2","level0","level1","level0","level1")),3) occurs(action(("drive","truck1","market3","market1")),3) occurs(action(("buy","truck3","goods2","market2","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(("buy","truck3","goods8","market2","level0","level1","level0","level1")),4) occurs(action(("drive","truck2","market2","depot1")),4) occurs(action(("unload","goods1","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("unload","goods6","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("unload","goods9","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods2","truck3","market2","level0","level1","level0","level1")),5) occurs(action(("unload","goods2","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods3","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("unload","goods3","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods4","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("unload","goods4","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods7","truck1","market1","level0","level1","level0","level1")),5) occurs(action(("load","goods8","truck3","market2","level0","level1","level0","level1")),5) occurs(action(("unload","goods8","truck2","depot1","level0","level1","level0","level1")),5) occurs(action(("drive","truck2","depot1","market2")),6) occurs(action(("drive","truck1","market1","market3")),6) occurs(action(("drive","truck3","market2","depot1")),6) occurs(action(("unload","goods2","truck3","depot1","level0","level1","level1","level2")),7) occurs(action(("unload","goods8","truck3","depot1","level0","level1","level1","level2")),7) occurs(action(("drive","truck1","market3","market2")),7) occurs(action(("drive","truck2","market2","market3")),7) occurs(action(("drive","truck2","market3","market1")),8) occurs(action(("drive","truck3","depot1","market2")),8) occurs(action(("drive","truck1","market2","depot1")),8) occurs(action(("unload","goods3","truck1","depot1","level0","level1","level1","level2")),9) occurs(action(("unload","goods4"
SATISFIABLE
Models : 1+
Calls : 5
Time : 1.588s (Solving: 1.24s 1st Model: 1.07s Unsat: 0.17s)
CPU Time : 1.584s
Choices : 66252 (Domain: 65503)
Conflicts : 8145 (Analyzed: 8144)
Restarts : 95 (Average: 85.73 Last: 60)
Model-Level : 142.5
Problems : 5 (Average Length: 10.00 Splits: 0)
Lemmas : 8144 (Deleted: 3071)
Binary : 302 (Ratio: 3.71%)
Ternary : 211 (Ratio: 2.59%)
Conflict : 8144 (Average Length: 14.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 8144 (Average: 8.00 Max: 108 Sum: 65155)
Executed : 8043 (Average: 7.84 Max: 108 Sum: 63813 Ratio: 97.94%)
Bounded : 101 (Average: 13.29 Max: 17 Sum: 1342 Ratio: 2.06%)
Rules : 17620 (Original: 16087)
Atoms : 9500
Bodies : 7148 (Original: 5654)
Count : 294 (Original: 452)
Equivalences : 2743 (Atom=Atom: 40 Body=Body: 0 Other: 2703)
Tight : Yes
Variables : 15048 (Eliminated: 0 Frozen: 4430)
Constraints : 65940 (Binary: 88.0% Ternary: 7.8% Other: 4.2%)
Memory Peak : 67MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2