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-7.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-7.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.030s CPU, 0.027s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Generated 51 rules.
|
||
|
|
Computing model... [0.380s CPU, 0.380s wall-clock]
|
||
|
|
3222 relevant atoms
|
||
|
|
1982 auxiliary atoms
|
||
|
|
5204 final queue length
|
||
|
|
7283 total queue pushes
|
||
|
|
Completing instantiation... [0.530s CPU, 0.527s wall-clock]
|
||
|
|
Instantiating: [0.970s CPU, 0.974s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
6 initial candidates
|
||
|
|
Finding invariants: [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating groups... [0.040s CPU, 0.036s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
0 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Computing fact groups: [0.100s CPU, 0.094s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.030s CPU, 0.024s wall-clock]
|
||
|
|
Translating task: [0.470s CPU, 0.459s wall-clock]
|
||
|
|
0 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
27 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.240s CPU, 0.239s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
23 of 27 variables necessary.
|
||
|
|
0 of 27 mutex groups necessary.
|
||
|
|
1738 of 2442 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock]
|
||
|
|
Translator variables: 23
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 322
|
||
|
|
Translator goal facts: 6
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 1738
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 6621
|
||
|
|
Translator peak memory: 40280 KB
|
||
|
|
Writing output... [0.120s CPU, 0.142s wall-clock]
|
||
|
|
Done! [2.000s CPU, 2.014s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.26s
|
||
|
|
Memory: 61MB
|
||
|
|
|
||
|
|
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: 61MB (+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.08s
|
||
|
|
Memory: 61MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 65MB (+4MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.13s
|
||
|
|
|
||
|
|
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.08s
|
||
|
|
Memory: 70MB (+5MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package5","truck4","city4-1")),1) occurs(action(("fly-airplane","plane4","city6-2","city5-2")),2) occurs(action(("fly-airplane","plane5","city5-2","city2-2")),2) occurs(action(("load-airplane","package7","plane4","city6-2")),2) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),3) occurs(action(("unload-airplane","package7","plane4","city5-2")),3) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),3) occurs(action(("fly-airplane","plane5","city2-2","city8-2")),3) occurs(action(("fly-airplane","plane4","city5-2","city6-2")),3) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),3) occurs(action(("drive-truck","truck8","city8-1","city8-2","city8")),3) occurs(action(("load-truck","package7","truck5","city5-2")),4) occurs(action(("fly-airplane","plane4","city6-2","city9-2")),4) occurs(action(("fly-airplane","plane1","city1-2","city4-2")),4) occurs(action(("fly-airplane","plane5","city8-2","city5-2")),4) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),4) occurs(action(("load-airplane","package10","plane4","city6-2")),4) occurs(action(("drive-truck","truck5","city5-2","city5-1","city5")),4) occurs(action(("unload-truck","package5","truck4","city4-2")),4) occurs(action(("drive-truck","truck8","city8-2","city8-1","city8")),4) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),4) occurs(action(("unload-truck","package7","truck5","city5-1")),5) occurs(action(("fly-airplane","plane4","city9-2","city1-2")),5) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),5) occurs(action(("load-airplane","package9","plane5","city5-2")),5) occurs(action(("fly-airplane","plane5","city5-2","city9-2")),5) occurs(action(("drive-truck","truck9","city9-1","city9-2","city9")),5) occurs(action(("unload-airplane","package10","plane4","city9-2")),5) occurs(action(("fly-airplane","plane1","city4-2","city7-2")),5) occurs(action(("load-airplane","package5","plane1","city4-2")),5) occurs(action(("unload-airplane","package9","plane5","city9-2")),6) occurs(action(("load-truck","package10","truck9","city9-2")),6) occurs(action(("load-airplane","package6","plane4","city1-2")),6) occurs(action(("unload-airplane","package5","plane1","city7-2")),6) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),6) occurs(action(("fly-airplane","plane1","city7-2","city11-2")),6) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),6) occurs(action(("fly-airplane","plane5","city9-2","city5-2")),6) occurs(action(("fly-airplane","plane4","city1-2","city6-2")),6) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),6) occurs(action(("load-truck","package5","truck7","city7-2")),7) occurs(action(("fly-airplane","plane1","city11-2","city10-2")),7) occurs(action(("fly-airplane","plane4","city6-2","city10-2")),7) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),7) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),7) occurs(action(("drive-truck","truck7","city7-2","city7-1","city7")),7) occurs(action(("unload-airplane","package6","plane4","city10-2")),8) occurs(action(("load-airplane","package8","plane1","city10-2")),8) occurs(action(("fly-airplane","plane1","city10-2","city11-2")),8) occurs(action(("fly-airplane","plane4","city10-2","city6-2")),8) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),8) occurs(action(("drive-truck","truck10","city10-2","city10-1","city10")),8) occurs(action(("unload-truck","package10","truck9","city9-1")),9) occurs(action(("unload-truck","package5","truck7","city7-1")),9) occurs(action(("fly-airplane","plane1","city11-2","city1-2")),9) occurs(action(("unload-airplane","package8","plane1","city1-2")),10) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),10) occurs(action(("fly-airplane","plane6","city2-2","city8-2")),10) occurs(action(("drive-truck","truck11","city11-1","city11-2","city11")),10) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),10)
|
||
|
|
Solving Time: 0.01s
|
||
|
|
Memory: 73MB (+3MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 3
|
||
|
|
Time : 0.540s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.520s
|
||
|
|
|
||
|
|
Choices : 936
|
||
|
|
Conflicts : 4 (Analyzed: 4)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 683.0
|
||
|
|
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||
|
|
Lemmas : 4 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 4 (Average Length: 22.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 4 (Average: 66.25 Max: 231 Sum: 265)
|
||
|
|
Executed : 4 (Average: 66.25 Max: 231 Sum: 265 Ratio: 100.00%)
|
||
|
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
|
|
||
|
|
Rules : 22640
|
||
|
|
Atoms : 22640
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 21275 (Eliminated: 0 Frozen: 2766)
|
||
|
|
Constraints : 82923 (Binary: 94.7% Ternary: 3.3% Other: 2.0%)
|
||
|
|
|
||
|
|
Memory Peak : 74MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
|
||
|
|
|