1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_tpp-propositional_6.out

150 lines
7.9 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-6.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-6.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.029s wall-clock]
Preparing model... [0.020s CPU, 0.013s wall-clock]
Generated 45 rules.
Computing model... [0.080s CPU, 0.082s wall-clock]
325 relevant atoms
750 auxiliary atoms
1075 final queue length
1314 total queue pushes
Completing instantiation... [0.060s CPU, 0.059s wall-clock]
Instantiating: [0.190s CPU, 0.190s wall-clock]
Computing fact groups...
Finding invariants...
18 initial candidates
Finding invariants: [0.040s CPU, 0.038s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.000s CPU, 0.008s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
10 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.057s 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.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.003s wall-clock]
Translating task: [0.040s CPU, 0.047s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
54 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.025s wall-clock]
Reordering and filtering variables...
34 of 34 variables necessary.
0 of 34 mutex groups necessary.
156 of 156 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
Translator variables: 34
Translator derived variables: 0
Translator facts: 99
Translator goal facts: 6
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 156
Translator axioms: 0
Translator task size: 1051
Translator peak memory: 37068 KB
Writing output... [0.020s CPU, 0.022s wall-clock]
Done! [0.370s CPU, 0.378s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 51MB
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: 52MB (+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: 52MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 53MB (+1MB)
UNSAT
Iteration Time: 0.02s
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: 54.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 54MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 54MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.04s
Memory: 55MB (+1MB)
Answer: 1
occurs(action(("drive","truck1","depot1","market2")),1) occurs(action(("drive","truck2","depot1","market2")),1) occurs(action(("buy","truck2","goods3","market2","level0","level1","level0","level1")),2) occurs(action(("drive","truck2","market2","market1")),2) occurs(action(("load","goods3","truck1","market2","level0","level1","level0","level1")),3) occurs(action(("buy","truck2","goods1","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck2","goods2","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods4","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods5","market1","level1","level2","level0","level1")),3) occurs(action(("buy","truck2","goods6","market1","level1","level2","level0","level1")),3) occurs(action(("drive","truck1","market2","depot1")),3) occurs(action(("unload","goods3","truck1","depot1","level0","level1","level0","level1")),4) occurs(action(("load","goods1","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods2","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods4","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods5","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods6","truck2","market1","level0","level1","level0","level1")),4) occurs(action(("drive","truck1","depot1","market2")),4) occurs(action(("drive","truck2","market1","market2")),4) occurs(action(("drive","truck1","market2","market1")),5) occurs(action(("drive","truck2","market2","depot1")),5) occurs(action(("unload","goods1","truck2","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods4","truck2","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods5","truck2","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods6","truck2","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods2","truck2","depot1","level0","level1","level0","level1")),6) occurs(action(("buy","truck1","goods2","market1","level0","level1","level0","level1")),6) occurs(action(("drive","truck2","depot1","market2")),6) occurs(action(("load","goods2","truck1","market1","level0","level1","level0","level1")),7) occurs(action(("drive","truck1","market1","market2")),7) occurs(action(("drive","truck1","market2","depot1")),8) occurs(action(("unload","goods2","truck1","depot1","level0","level1","level1","level2")),9) occurs(action(("drive","truck1","depot1","market2")),9) occurs(action(("drive","truck2","market2","market1")),10) occurs(action(("drive","truck1","market2","depot1")),10)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.099s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.100s
Choices : 394 (Domain: 384)
Conflicts : 37 (Analyzed: 37)
Restarts : 0
Model-Level : 68.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 37 (Deleted: 0)
Binary : 5 (Ratio: 13.51%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 37 (Average Length: 5.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 37 (Average: 12.38 Max: 45 Sum: 458)
Executed : 27 (Average: 9.14 Max: 45 Sum: 338 Ratio: 73.80%)
Bounded : 10 (Average: 12.00 Max: 12 Sum: 120 Ratio: 26.20%)
Rules : 3313
Atoms : 3313
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 3464 (Eliminated: 0 Frozen: 0)
Constraints : 10967 (Binary: 88.3% Ternary: 8.5% Other: 3.2%)
Memory Peak : 55MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1