1
0
tplp-planning-benchmark/fd-pa-e1-sh/ipc-1998_logistics-round-1-strips_3.out

143 lines
13 KiB
Plaintext
Raw Normal View History

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-3.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-3.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.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 51 rules.
Computing model... [0.460s CPU, 0.467s wall-clock]
3618 relevant atoms
2836 auxiliary atoms
6454 final queue length
8517 total queue pushes
Completing instantiation... [0.560s CPU, 0.564s wall-clock]
Instantiating: [1.080s CPU, 1.087s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.013s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.050s CPU, 0.051s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.010s wall-clock]
Building translation key... [0.010s CPU, 0.007s wall-clock]
Computing fact groups: [0.130s CPU, 0.124s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s 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.480s CPU, 0.476s 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.250s CPU, 0.251s wall-clock]
Reordering and filtering variables...
25 of 27 variables necessary.
0 of 27 mutex groups necessary.
2184 of 2576 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.057s wall-clock]
Translator variables: 25
Translator derived variables: 0
Translator facts: 518
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2184
Translator axioms: 0
Translator task size: 8474
Translator peak memory: 40792 KB
Writing output... [0.160s CPU, 0.176s wall-clock]
Done! [2.200s CPU, 2.222s wall-clock]
planner.py version 0.0.1
Time: 0.31s
Memory: 65MB
Iteration 1
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 65MB (+0MB)
UNSAT
Iteration Time: 0.00s
Iteration 2
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.14s
Memory: 68MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 74MB (+6MB)
UNSAT
Iteration Time: 0.22s
Iteration 3
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.16s
Memory: 82MB (+8MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),1) occurs(action(("fly-airplane","plane1","city11-3","city12-3")),1) occurs(action(("fly-airplane","plane2","city11-3","city12-3")),1) occurs(action(("fly-airplane","plane3","city1-3","city8-3")),1) occurs(action(("fly-airplane","plane4","city10-3","city4-3")),1) occurs(action(("drive-truck","truck12","city12-1","city12-2","city12")),1) occurs(action(("drive-truck","truck8","city8-2","city8-1","city8")),1) occurs(action(("load-truck","package9","truck4","city4-2")),1) occurs(action(("drive-truck","truck10","city10-1","city10-3","city10")),2) occurs(action(("drive-truck","truck11","city11-1","city11-2","city11")),2) occurs(action(("drive-truck","truck13","city13-1","city13-2","city13")),2) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),2) occurs(action(("load-truck","package7","truck1","city1-2")),2) occurs(action(("drive-truck","truck3","city3-2","city3-3","city3")),2) occurs(action(("drive-truck","truck4","city4-2","city4-3","city4")),2) occurs(action(("drive-truck","truck7","city7-1","city7-3","city7")),2) occurs(action(("load-truck","package4","truck8","city8-1")),2) occurs(action(("load-truck","package5","truck12","city12-2")),2) occurs(action(("load-airplane","package3","plane2","city12-3")),3) occurs(action(("drive-truck","truck1","city1-2","city1-3","city1")),3) occurs(action(("drive-truck","truck11","city11-2","city11-3","city11")),3) occurs(action(("drive-truck","truck10","city10-3","city10-1","city10")),3) occurs(action(("drive-truck","truck12","city12-2","city12-3","city12")),3) occurs(action(("drive-truck","truck8","city8-1","city8-3","city8")),3) occurs(action(("drive-truck","truck13","city13-2","city13-1","city13")),3) occurs(action(("unload-truck","package9","truck4","city4-3")),3) occurs(action(("drive-truck","truck7","city7-3","city7-1","city7")),3) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),4) occurs(action(("unload-truck","package7","truck1","city1-3")),4) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),4) occurs(action(("fly-airplane","plane2","city12-3","city13-3")),4) occurs(action(("drive-truck","truck11","city11-3","city11-1","city11")),4) occurs(action(("drive-truck","truck5","city5-2","city5-1","city5")),4) occurs(action(("load-airplane","package9","plane4","city4-3")),4) occurs(action(("unload-truck","package4","truck8","city8-3")),4) occurs(action(("unload-truck","package5","truck12","city12-3")),4) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),4) occurs(action(("drive-truck","truck4","city4-3","city4-2","city4")),4) occurs(action(("drive-truck","truck3","city3-3","city3-2","city3")),4) occurs(action(("load-truck","package6","truck9","city9-1")),5) occurs(action(("fly-airplane","plane2","city13-3","city5-3")),5) occurs(action(("fly-airplane","plane4","city4-3","city11-3")),5) occurs(action(("drive-truck","truck10","city10-2","city10-1","city10")),5) occurs(action(("load-airplane","package4","plane3","city8-3")),5) occurs(action(("load-airplane","package5","plane1","city12-3")),5) occurs(action(("load-truck","package7","truck1","city1-3")),5) occurs(action(("load-truck","package8","truck9","city9-1")),5) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),5) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),5) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),5) occurs(action(("drive-truck","truck8","city8-3","city8-2","city8")),5) occurs(action(("drive-truck","truck2","city2-2","city2-1","city2")),5) occurs(action(("drive-truck","truck12","city12-3","city12-1","city12")),5) occurs(action(("fly-airplane","plane2","city5-3","city1-3")),6) occurs(action(("drive-truck","truck9","city9-1","city9-3","city9")),6) occurs(action(("fly-airplane","plane1","city12-3","city10-3")),6) occurs(action(("unload-truck","package7","truck1","city1-3")),6) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),6) occurs(action(("fly-airplane","plane3","city8-3","city13-3")),6) occurs(actio
Solving Time: 0.03s
Memory: 88MB (+6MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.823s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 0.790s
Choices : 1240
Conflicts : 86 (Analyzed: 86)
Restarts : 1 (Average: 86.00 Last: 26)
Model-Level : 313.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 86 (Deleted: 0)
Binary : 14 (Ratio: 16.28%)
Ternary : 5 (Ratio: 5.81%)
Conflict : 86 (Average Length: 12.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 86 (Average: 13.86 Max: 66 Sum: 1192)
Executed : 64 (Average: 10.92 Max: 66 Sum: 939 Ratio: 78.78%)
Bounded : 22 (Average: 11.50 Max: 12 Sum: 253 Ratio: 21.22%)
Rules : 31157
Atoms : 31157
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 30028 (Eliminated: 0 Frozen: 22914)
Constraints : 116687 (Binary: 93.5% Ternary: 4.5% Other: 2.0%)
Memory Peak : 88MB
Max. Length : 10 steps
Sol. Length : 10 steps