150 lines
7.1 KiB
Plaintext
150 lines
7.1 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-5.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-5.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.035s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Generated 45 rules.
|
||
|
|
Computing model... [0.050s CPU, 0.042s wall-clock]
|
||
|
|
156 relevant atoms
|
||
|
|
339 auxiliary atoms
|
||
|
|
495 final queue length
|
||
|
|
534 total queue pushes
|
||
|
|
Completing instantiation... [0.010s CPU, 0.016s wall-clock]
|
||
|
|
Instantiating: [0.110s CPU, 0.112s 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.002s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.006s 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.000s CPU, 0.001s wall-clock]
|
||
|
|
Computing fact groups: [0.060s CPU, 0.056s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.001s wall-clock]
|
||
|
|
Translating task: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
47 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
27 of 27 variables necessary.
|
||
|
|
0 of 27 mutex groups necessary.
|
||
|
|
38 of 38 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Translator variables: 27
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 56
|
||
|
|
Translator goal facts: 5
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 38
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 292
|
||
|
|
Translator peak memory: 36300 KB
|
||
|
|
Writing output... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Done! [0.220s CPU, 0.226s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.03s
|
||
|
|
Memory: 49MB
|
||
|
|
|
||
|
|
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: 50MB (+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: 50MB
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 50MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+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: 52.0MB
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.01s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.01s
|
||
|
|
Memory: 51MB (+0MB)
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("drive","truck1","depot1","market2")),1) occurs(action(("drive","truck1","market2","market1")),2) occurs(action(("buy","truck1","goods1","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck1","goods2","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck1","goods3","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck1","goods4","market1","level0","level1","level0","level1")),3) occurs(action(("buy","truck1","goods5","market1","level0","level1","level0","level1")),3) occurs(action(("load","goods1","truck1","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods2","truck1","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods3","truck1","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods4","truck1","market1","level0","level1","level0","level1")),4) occurs(action(("load","goods5","truck1","market1","level0","level1","level0","level1")),4) occurs(action(("drive","truck1","market1","market2")),4) occurs(action(("drive","truck2","depot1","market2")),5) occurs(action(("drive","truck1","market2","depot1")),5) occurs(action(("unload","goods1","truck1","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods2","truck1","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods3","truck1","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods4","truck1","depot1","level0","level1","level0","level1")),6) occurs(action(("unload","goods5","truck1","depot1","level0","level1","level0","level1")),6) occurs(action(("drive","truck1","depot1","market2")),6) occurs(action(("drive","truck2","market2","depot1")),7) occurs(action(("drive","truck2","depot1","market2")),8) occurs(action(("drive","truck2","market2","depot1")),9) occurs(action(("drive","truck1","market2","depot1")),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.063s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.060s
|
||
|
|
|
||
|
|
Choices : 232 (Domain: 229)
|
||
|
|
Conflicts : 16 (Analyzed: 15)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 54.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 15 (Deleted: 0)
|
||
|
|
Binary : 2 (Ratio: 13.33%)
|
||
|
|
Ternary : 2 (Ratio: 13.33%)
|
||
|
|
Conflict : 15 (Average Length: 1.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 15 (Average: 20.33 Max: 37 Sum: 305)
|
||
|
|
Executed : 5 (Average: 12.67 Max: 37 Sum: 190 Ratio: 62.30%)
|
||
|
|
Bounded : 10 (Average: 11.50 Max: 12 Sum: 115 Ratio: 37.70%)
|
||
|
|
|
||
|
|
Rules : 988
|
||
|
|
Atoms : 988
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1324 (Eliminated: 0 Frozen: 0)
|
||
|
|
Constraints : 2928 (Binary: 84.7% Ternary: 15.0% Other: 0.3%)
|
||
|
|
|
||
|
|
Memory Peak : 51MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 1
|
||
|
|
|
||
|
|
|