143 lines
9.1 KiB
Plaintext
143 lines
9.1 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-24.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-24.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.040s CPU, 0.039s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Preparing model... [0.040s CPU, 0.045s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [2.450s CPU, 2.446s wall-clock]
|
||
|
|
27542 relevant atoms
|
||
|
|
10945 auxiliary atoms
|
||
|
|
38487 final queue length
|
||
|
|
60234 total queue pushes
|
||
|
|
Completing instantiation... [5.790s CPU, 5.781s wall-clock]
|
||
|
|
Instantiating: [8.350s CPU, 8.348s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.060s CPU, 0.059s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating groups... [0.310s CPU, 0.305s wall-clock]
|
||
|
|
Collecting mutex groups... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.040s CPU, 0.046s wall-clock]
|
||
|
|
Building translation key... [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Computing fact groups: [0.620s CPU, 0.622s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.014s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.220s CPU, 0.218s wall-clock]
|
||
|
|
Translating task: [4.410s CPU, 4.414s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
73 propositions removed
|
||
|
|
Detecting unreachable propositions: [2.470s CPU, 2.458s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
66 of 73 variables necessary.
|
||
|
|
0 of 73 mutex groups necessary.
|
||
|
|
13464 of 23544 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.440s CPU, 0.435s wall-clock]
|
||
|
|
Translator variables: 66
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 1400
|
||
|
|
Translator goal facts: 4
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 13464
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 47622
|
||
|
|
Translator peak memory: 99796 KB
|
||
|
|
Writing output... [0.930s CPU, 1.035s wall-clock]
|
||
|
|
Done! [17.460s CPU, 17.560s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 1.67s
|
||
|
|
Memory: 170MB
|
||
|
|
|
||
|
|
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.01s
|
||
|
|
Memory: 170MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.01s
|
||
|
|
|
||
|
|
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: 1.01s
|
||
|
|
Memory: 183MB (+13MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.12s
|
||
|
|
Memory: 207MB (+24MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.67s
|
||
|
|
|
||
|
|
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.96s
|
||
|
|
Memory: 236MB (+29MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("drive-truck","truck43","city8-5","city8-12","city8")),1) occurs(action(("drive-truck","truck14","city3-3","city3-12","city3")),1) occurs(action(("drive-truck","truck26","city3-3","city3-12","city3")),1) occurs(action(("drive-truck","truck42","city3-2","city3-12","city3")),1) occurs(action(("drive-truck","truck48","city3-2","city3-12","city3")),1) occurs(action(("drive-truck","truck16","city1-11","city1-3","city1")),1) occurs(action(("drive-truck","truck23","city1-1","city1-12","city1")),1) occurs(action(("drive-truck","truck34","city1-11","city1-2","city1")),1) occurs(action(("fly-airplane","plane8","city6-12","city1-12")),1) occurs(action(("fly-airplane","plane1","city6-12","city5-12")),1) occurs(action(("fly-airplane","plane2","city7-12","city6-12")),1) occurs(action(("fly-airplane","plane5","city3-12","city9-12")),1) occurs(action(("fly-airplane","plane7","city6-12","city9-12")),1) occurs(action(("load-truck","package10","truck37","city2-5")),1) occurs(action(("load-truck","package11","truck45","city5-4")),1) occurs(action(("load-truck","package8","truck2","city1-5")),1) occurs(action(("drive-truck","truck30","city5-12","city5-9","city5")),1) occurs(action(("drive-truck","truck50","city5-4","city5-3","city5")),1) occurs(action(("drive-truck","truck10","city6-7","city6-5","city6")),1) occurs(action(("drive-truck","truck41","city6-8","city6-5","city6")),1) occurs(action(("drive-truck","truck2","city1-5","city1-12","city1")),2) occurs(action(("drive-truck","truck37","city2-5","city2-12","city2")),2) occurs(action(("drive-truck","truck45","city5-4","city5-12","city5")),2) occurs(action(("load-truck","package9","truck41","city6-5")),2) occurs(action(("unload-truck","package10","truck37","city2-12")),3) occurs(action(("unload-truck","package11","truck45","city5-12")),3) occurs(action(("unload-truck","package8","truck2","city1-12")),3) occurs(action(("drive-truck","truck10","city6-5","city6-12","city6")),3) occurs(action(("drive-truck","truck41","city6-5","city6-12","city6")),3) occurs(action(("drive-truck","truck2","city1-12","city1-5","city1")),4) occurs(action(("load-airplane","package10","plane3","city2-12")),4) occurs(action(("load-airplane","package11","plane1","city5-12")),4) occurs(action(("load-airplane","package8","plane8","city1-12")),4) occurs(action(("unload-truck","package9","truck41","city6-12")),4) occurs(action(("fly-airplane","plane1","city5-12","city8-12")),5) occurs(action(("fly-airplane","plane3","city2-12","city3-12")),5) occurs(action(("fly-airplane","plane8","city1-12","city3-12")),5) occurs(action(("load-airplane","package9","plane2","city6-12")),5) occurs(action(("unload-airplane","package10","plane3","city3-12")),6) occurs(action(("unload-airplane","package11","plane1","city8-12")),6) occurs(action(("unload-airplane","package8","plane8","city3-12")),6) occurs(action(("fly-airplane","plane2","city6-12","city1-12")),6) occurs(action(("load-truck","package10","truck48","city3-12")),7) occurs(action(("load-truck","package11","truck43","city8-12")),7) occurs(action(("load-truck","package8","truck26","city3-12")),7) occurs(action(("unload-airplane","package9","plane2","city1-12")),7) occurs(action(("drive-truck","truck14","city3-12","city3-2","city3")),8) occurs(action(("drive-truck","truck43","city8-12","city8-8","city8")),8) occurs(action(("drive-truck","truck26","city3-12","city3-4","city3")),8) occurs(action(("load-truck","package9","truck23","city1-12")),8) occurs(action(("drive-truck","truck42","city3-12","city3-2","city3")),8) occurs(action(("drive-truck","truck48","city3-12","city3-2","city3")),8) occurs(action(("unload-truck","package10","truck48","city3-2")),9) occurs(action(("unload-truck","package11","truck43","city8-8")),9) occurs(action(("unload-truck","package8","truck26","city3-4")),9) occurs(action(("drive-truck","truck23","city1-12","city1-11","city1")),9) occurs(action(("drive-truck","truck24","city1-12","city1-11","city1")),9) occurs(action(("unload-truck","package9","truck23","city1-11")),10)
|
||
|
|
Solving Time: 0.14s
|
||
|
|
Memory: 270MB (+34MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 5.112s (Solving: 0.10s 1st Model: 0.09s Unsat: 0.00s)
|
||
|
|
CPU Time : 5.020s
|
||
|
|
|
||
|
|
Choices : 5052 (Domain: 4474)
|
||
|
|
Conflicts : 184 (Analyzed: 184)
|
||
|
|
Restarts : 2 (Average: 92.00 Last: 55)
|
||
|
|
Model-Level : 1536.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 184 (Deleted: 0)
|
||
|
|
Binary : 7 (Ratio: 3.80%)
|
||
|
|
Ternary : 12 (Ratio: 6.52%)
|
||
|
|
Conflict : 184 (Average Length: 24.4 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 184 (Average: 23.42 Max: 204 Sum: 4309)
|
||
|
|
Executed : 118 (Average: 19.17 Max: 204 Sum: 3528 Ratio: 81.88%)
|
||
|
|
Bounded : 66 (Average: 11.83 Max: 12 Sum: 781 Ratio: 18.12%)
|
||
|
|
|
||
|
|
Rules : 179023
|
||
|
|
Atoms : 179023
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 147489 (Eliminated: 0 Frozen: 133058)
|
||
|
|
Constraints : 670844 (Binary: 96.7% Ternary: 1.4% Other: 1.9%)
|
||
|
|
|
||
|
|
Memory Peak : 270MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|