143 lines
26 KiB
Plaintext
143 lines
26 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-19.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-19.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.050s CPU, 0.044s wall-clock]
|
||
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.010s CPU, 0.016s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.030s CPU, 0.030s wall-clock]
|
||
|
Preparing model... [0.040s CPU, 0.041s wall-clock]
|
||
|
Generated 51 rules.
|
||
|
Computing model... [1.790s CPU, 1.788s wall-clock]
|
||
|
17880 relevant atoms
|
||
|
8861 auxiliary atoms
|
||
|
26741 final queue length
|
||
|
39566 total queue pushes
|
||
|
Completing instantiation... [3.410s CPU, 3.406s wall-clock]
|
||
|
Instantiating: [5.300s CPU, 5.305s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
6 initial candidates
|
||
|
Finding invariants: [0.040s CPU, 0.036s wall-clock]
|
||
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||
|
Instantiating groups... [0.190s CPU, 0.184s wall-clock]
|
||
|
Collecting mutex groups... [0.020s CPU, 0.013s wall-clock]
|
||
|
Choosing groups...
|
||
|
0 uncovered facts
|
||
|
Choosing groups: [0.030s CPU, 0.036s wall-clock]
|
||
|
Building translation key... [0.030s CPU, 0.024s wall-clock]
|
||
|
Computing fact groups: [0.430s CPU, 0.424s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.011s wall-clock]
|
||
|
Building dictionary for full mutex groups... [0.110s CPU, 0.109s wall-clock]
|
||
|
Building mutex information...
|
||
|
Building mutex information: [0.010s CPU, 0.012s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [0.150s CPU, 0.145s wall-clock]
|
||
|
Translating task: [2.790s CPU, 2.790s wall-clock]
|
||
|
0 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
60 propositions removed
|
||
|
Detecting unreachable propositions: [1.600s CPU, 1.601s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
60 of 60 variables necessary.
|
||
|
0 of 60 mutex groups necessary.
|
||
|
14760 of 14760 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [0.340s CPU, 0.343s wall-clock]
|
||
|
Translator variables: 60
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 2323
|
||
|
Translator goal facts: 19
|
||
|
Translator mutex groups: 0
|
||
|
Translator total mutex groups size: 0
|
||
|
Translator operators: 14760
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 59146
|
||
|
Translator peak memory: 76520 KB
|
||
|
Writing output... [1.080s CPU, 1.199s wall-clock]
|
||
|
Done! [11.850s CPU, 11.968s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 60.67s
|
||
|
Memory: 2708MB
|
||
|
|
||
|
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.31s
|
||
|
Memory: 2708MB (+0MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.31s
|
||
|
|
||
|
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: 3.38s
|
||
|
Memory: 2962MB (+254MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.28s
|
||
|
Memory: 2980MB (+18MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 4.95s
|
||
|
|
||
|
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: 3.57s
|
||
|
Memory: 3099MB (+119MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Answer: 1
|
||
|
occurs(action(("load-airplane","package7","plane8","city4-8")),1) occurs(action(("drive-truck","truck1","city5-6","city5-2","city5")),2) occurs(action(("drive-truck","truck12","city5-7","city5-2","city5")),2) occurs(action(("drive-truck","truck27","city5-6","city5-2","city5")),2) occurs(action(("drive-truck","truck14","city8-8","city8-2","city8")),2) occurs(action(("drive-truck","truck30","city8-5","city8-2","city8")),2) occurs(action(("drive-truck","truck8","city8-5","city8-2","city8")),2) occurs(action(("drive-truck","truck21","city3-8","city3-6","city3")),2) occurs(action(("drive-truck","truck5","city3-8","city3-6","city3")),2) occurs(action(("fly-airplane","plane11","city3-8","city1-8")),2) occurs(action(("fly-airplane","plane3","city3-8","city1-8")),2) occurs(action(("fly-airplane","plane9","city3-8","city1-8")),2) occurs(action(("drive-truck","truck23","city1-7","city1-8","city1")),2) occurs(action(("drive-truck","truck9","city2-7","city2-1","city2")),2) occurs(action(("drive-truck","truck16","city7-3","city7-5","city7")),2) occurs(action(("drive-truck","truck18","city7-6","city7-5","city7")),2) occurs(action(("drive-truck","truck29","city7-3","city7-5","city7")),2) occurs(action(("fly-airplane","plane1","city7-8","city3-8")),2) occurs(action(("fly-airplane","plane10","city7-8","city3-8")),2) occurs(action(("fly-airplane","plane2","city2-8","city3-8")),2) occurs(action(("fly-airplane","plane4","city2-8","city3-8")),2) occurs(action(("fly-airplane","plane5","city1-8","city3-8")),2) occurs(action(("fly-airplane","plane6","city1-8","city3-8")),2) occurs(action(("fly-airplane","plane7","city2-8","city3-8")),2) occurs(action(("fly-airplane","plane8","city4-8","city3-8")),2) occurs(action(("drive-truck","truck25","city3-5","city3-8","city3")),2) occurs(action(("drive-truck","truck3","city3-1","city3-8","city3")),2) occurs(action(("drive-truck","truck6","city3-5","city3-8","city3")),2) occurs(action(("drive-truck","truck11","city2-6","city2-7","city2")),2) occurs(action(("drive-truck","truck22","city2-4","city2-7","city2")),2) occurs(action(("drive-truck","truck24","city2-1","city2-7","city2")),2) occurs(action(("drive-truck","truck4","city2-1","city2-7","city2")),2) occurs(action(("drive-truck","truck20","city4-7","city4-5","city4")),2) occurs(action(("drive-truck","truck26","city4-3","city4-5","city4")),2) occurs(action(("drive-truck","truck7","city4-1","city4-5","city4")),2) occurs(action(("drive-truck","truck17","city6-6","city6-4","city6")),2) occurs(action(("drive-truck","truck19","city6-7","city6-4","city6")),2) occurs(action(("drive-truck","truck28","city6-2","city6-4","city6")),2) occurs(action(("drive-truck","truck10","city1-5","city1-7","city1")),2) occurs(action(("drive-truck","truck13","city1-8","city1-7","city1")),2) occurs(action(("drive-truck","truck15","city1-8","city1-7","city1")),2) occurs(action(("drive-truck","truck2","city1-8","city1-7","city1")),2) occurs(action(("unload-airplane","package7","plane8","city4-8")),2) occurs(action(("load-truck","package5","truck26","city4-3")),2) occurs(action(("load-truck","package1","truck16","city7-3")),2) occurs(action(("load-truck","package11","truck11","city2-6")),2) occurs(action(("load-truck","package16","truck10","city1-5")),2) occurs(action(("load-truck","package4","truck10","city1-5")),2) occurs(action(("unload-truck","package5","truck26","city4-5")),3) occurs(action(("unload-truck","package1","truck16","city7-5")),3) occurs(action(("unload-truck","package11","truck11","city2-7")),3) occurs(action(("unload-truck","package16","truck10","city1-7")),3) occurs(action(("unload-truck","package4","truck10","city1-7")),3) occurs(action(("drive-truck","truck30","city8-2","city8-1","city8")),4) occurs(action(("drive-truck","truck8","city8-2","city8-3","city8")),4) occurs(action(("drive-truck","truck16","city7-5","city7-8","city7")),4) occurs(action(("drive-truck","truck18","city7-5","city7-7","city7")),4) occurs(action(("drive-truck","truck29","city7-5","city7-2","city7")),4) occurs(action(("drive-truck","truck7","city4-5","city4-8","city4")),4) occurs(action(("driv
|
||
|
Solving Time: 0.22s
|
||
|
Memory: 3137MB (+38MB)
|
||
|
SAT
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 3
|
||
|
Time : 70.957s (Solving: 0.07s 1st Model: 0.06s Unsat: 0.00s)
|
||
|
CPU Time : 70.870s
|
||
|
|
||
|
Choices : 7429
|
||
|
Conflicts : 29 (Analyzed: 29)
|
||
|
Restarts : 0
|
||
|
Model-Level : 2607.0
|
||
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
Lemmas : 29 (Deleted: 0)
|
||
|
Binary : 0 (Ratio: 0.00%)
|
||
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
Conflict : 29 (Average Length: 52.6 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 29 (Average: 166.69 Max: 460 Sum: 4834)
|
||
|
Executed : 29 (Average: 166.69 Max: 460 Sum: 4834 Ratio: 100.00%)
|
||
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
||
|
Rules : 29259752
|
||
|
Atoms : 29259752
|
||
|
Bodies : 1 (Original: 0)
|
||
|
Tight : Yes
|
||
|
Variables : 209436 (Eliminated: 0 Frozen: 6746)
|
||
|
Constraints : 575031 (Binary: 94.0% Ternary: 3.6% Other: 2.3%)
|
||
|
|
||
|
Memory Peak : 3137MB
|
||
|
Max. Length : 10 steps
|
||
|
Sol. Length : 10 steps
|
||
|
|
||
|
|