143 lines
8.2 KiB
Plaintext
143 lines
8.2 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-1.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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-1.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Preparing model... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.110s CPU, 0.106s wall-clock]
|
||
|
|
643 relevant atoms
|
||
|
|
678 auxiliary atoms
|
||
|
|
1321 final queue length
|
||
|
|
1575 total queue pushes
|
||
|
|
Completing instantiation... [0.080s CPU, 0.081s wall-clock]
|
||
|
|
Instantiating: [0.220s CPU, 0.225s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Instantiating groups... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [0.030s CPU, 0.033s 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.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
||
|
|
Translating task: [0.060s CPU, 0.068s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
14 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.040s CPU, 0.035s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
14 of 14 variables necessary.
|
||
|
|
0 of 14 mutex groups necessary.
|
||
|
|
360 of 360 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
|
||
|
|
Translator variables: 14
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 144
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 360
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 1532
|
||
|
|
Translator peak memory: 34136 KB
|
||
|
|
Writing output... [0.030s CPU, 0.033s wall-clock]
|
||
|
|
Done! [0.420s CPU, 0.426s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.08s
|
||
|
|
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: 49MB (+0MB)
|
||
|
|
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
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 49MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 50MB (+1MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.04s
|
||
|
|
|
||
|
|
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
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.03s
|
||
|
|
Memory: 51MB (+1MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-airplane","package5","plane1","city4-2")),1) occurs(action(("load-truck","package4","truck1","city1-1")),1) occurs(action(("load-truck","package3","truck1","city1-1")),1) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),2) occurs(action(("fly-airplane","plane1","city4-2","city1-2")),2) occurs(action(("fly-airplane","plane2","city4-2","city1-2")),2) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),2) occurs(action(("load-airplane","package2","plane1","city1-2")),3) occurs(action(("unload-truck","package4","truck1","city1-2")),3) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),3) occurs(action(("unload-truck","package3","truck1","city1-2")),3) occurs(action(("load-airplane","package4","plane2","city1-2")),4) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),4) occurs(action(("load-airplane","package3","plane1","city1-2")),4) occurs(action(("load-truck","package6","truck3","city3-1")),4) occurs(action(("fly-airplane","plane2","city1-2","city3-2")),5) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),5) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),5) occurs(action(("fly-airplane","plane1","city1-2","city4-2")),5) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),5) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),5) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),5) occurs(action(("unload-airplane","package4","plane2","city3-2")),6) occurs(action(("fly-airplane","plane1","city4-2","city6-2")),6) occurs(action(("unload-truck","package6","truck3","city3-2")),6) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),6) occurs(action(("drive-truck","truck5","city5-2","city5-1","city5")),6) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),6) occurs(action(("drive-truck","truck2","city2-2","city2-1","city2")),6) occurs(action(("unload-airplane","package2","plane1","city6-2")),7) occurs(action(("unload-airplane","package5","plane1","city6-2")),7) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),7) occurs(action(("load-airplane","package6","plane2","city3-2")),7) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),7) occurs(action(("unload-airplane","package3","plane1","city6-2")),7) occurs(action(("load-truck","package3","truck6","city6-2")),8) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),8) occurs(action(("fly-airplane","plane1","city6-2","city5-2")),8) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),8) occurs(action(("unload-airplane","package6","plane2","city1-2")),9) occurs(action(("fly-airplane","plane1","city5-2","city3-2")),9) occurs(action(("load-truck","package4","truck3","city3-2")),9) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),9) occurs(action(("unload-truck","package3","truck6","city6-1")),10) occurs(action(("unload-truck","package4","truck3","city3-2")),10) occurs(action(("fly-airplane","plane2","city1-2","city6-2")),10) occurs(action(("fly-airplane","plane1","city3-2","city4-2")),10)
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 52MB (+1MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.171s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.160s
|
||
|
|
|
||
|
|
Choices : 286
|
||
|
|
Conflicts : 19 (Analyzed: 19)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 120.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 19 (Deleted: 0)
|
||
|
|
Binary : 1 (Ratio: 5.26%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 19 (Average Length: 7.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 19 (Average: 11.89 Max: 55 Sum: 226)
|
||
|
|
Executed : 15 (Average: 9.37 Max: 55 Sum: 178 Ratio: 78.76%)
|
||
|
|
Bounded : 4 (Average: 12.00 Max: 12 Sum: 48 Ratio: 21.24%)
|
||
|
|
|
||
|
|
Rules : 5414
|
||
|
|
Atoms : 5414
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 5198 (Eliminated: 0 Frozen: 3651)
|
||
|
|
Constraints : 19133 (Binary: 90.7% Ternary: 6.1% Other: 3.1%)
|
||
|
|
|
||
|
|
Memory Peak : 52MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|