1
0
tplp-planning-benchmark/fd-pb-e2/ipc-1998_logistics-round-1-strips_7.out

143 lines
11 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-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.010s CPU, 0.017s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 51 rules.
Computing model... [0.350s CPU, 0.356s wall-clock]
3222 relevant atoms
1982 auxiliary atoms
5204 final queue length
7283 total queue pushes
Completing instantiation... [0.530s CPU, 0.526s wall-clock]
Instantiating: [0.930s CPU, 0.932s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.012s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.037s 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.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.100s CPU, 0.092s 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.020s CPU, 0.023s wall-clock]
Translating task: [0.460s CPU, 0.457s 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.040s 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.130s CPU, 0.139s wall-clock]
Done! [1.930s CPU, 1.956s wall-clock]
planner.py version 0.0.1
Time: 1.31s
Memory: 123MB
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: 123MB (+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.47s
Memory: 301MB (+178MB)
Unblocking actions...
Solving...
Solving Time: 0.12s
Memory: 317MB (+16MB)
UNSAT
Iteration Time: 1.91s
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: 1.70s
Memory: 410MB (+93MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),1) occurs(action(("fly-airplane","plane3","city9-2","city1-2")),1) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),1) occurs(action(("fly-airplane","plane1","city1-2","city9-2")),1) occurs(action(("fly-airplane","plane2","city8-2","city9-2")),1) occurs(action(("drive-truck","truck9","city9-1","city9-2","city9")),1) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),1) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),1) occurs(action(("fly-airplane","plane6","city2-2","city6-2")),1) occurs(action(("drive-truck","truck11","city11-1","city11-2","city11")),1) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),1) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),1) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),1) occurs(action(("drive-truck","truck8","city8-1","city8-2","city8")),1) occurs(action(("load-truck","package9","truck5","city5-2")),1) occurs(action(("load-truck","package8","truck10","city10-2")),1) occurs(action(("load-truck","package5","truck4","city4-1")),1) occurs(action(("load-truck","package7","truck6","city6-2")),1) occurs(action(("fly-airplane","plane1","city9-2","city4-2")),2) occurs(action(("fly-airplane","plane2","city9-2","city4-2")),2) occurs(action(("fly-airplane","plane3","city1-2","city4-2")),2) occurs(action(("fly-airplane","plane4","city6-2","city4-2")),2) occurs(action(("fly-airplane","plane5","city5-2","city4-2")),2) occurs(action(("fly-airplane","plane6","city6-2","city4-2")),2) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),2) occurs(action(("load-airplane","package10","plane6","city6-2")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("load-truck","package6","truck1","city1-2")),2) occurs(action(("unload-truck","package5","truck4","city4-2")),2) occurs(action(("fly-airplane","plane3","city4-2","city1-2")),3) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),3) occurs(action(("fly-airplane","plane1","city4-2","city9-2")),3) occurs(action(("fly-airplane","plane2","city4-2","city9-2")),3) occurs(action(("fly-airplane","plane6","city4-2","city8-2")),3) occurs(action(("unload-truck","package9","truck5","city5-2")),3) occurs(action(("fly-airplane","plane5","city4-2","city5-2")),3) occurs(action(("fly-airplane","plane4","city4-2","city6-2")),3) occurs(action(("unload-truck","package8","truck10","city10-2")),3) occurs(action(("load-airplane","package5","plane5","city4-2")),3) occurs(action(("unload-truck","package7","truck6","city6-2")),3) occurs(action(("fly-airplane","plane2","city9-2","city1-2")),4) occurs(action(("fly-airplane","plane6","city8-2","city1-2")),4) occurs(action(("load-airplane","package9","plane5","city5-2")),4) occurs(action(("fly-airplane","plane5","city5-2","city9-2")),4) occurs(action(("fly-airplane","plane4","city6-2","city11-2")),4) occurs(action(("unload-truck","package6","truck1","city1-2")),4) occurs(action(("load-airplane","package7","plane4","city6-2")),4) occurs(action(("drive-truck","truck7","city7-2","city7-1","city7")),4) occurs(action(("unload-airplane","package10","plane6","city8-2")),4) occurs(action(("unload-airplane","package5","plane5","city9-2")),4) occurs(action(("load-airplane","package6","plane3","city1-2")),5) occurs(action(("fly-airplane","plane3","city1-2","city10-2")),5) occurs(action(("fly-airplane","plane6","city1-2","city10-2")),5) occurs(action(("load-airplane","package8","plane6","city10-2")),5) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),5) occurs(action(("unload-airplane","package7","plane4","city5-2")),5) occurs(action(("fly-airplane","plane4","city11-2","city5-2")),5) occurs(action(("fly-airplane","plane5","city9-2","city8-2")),5) occurs(action(("fly-airplane","plane1","city9-2","city1-2")),5) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),5) occurs(action(("fly-airplane","plane2","city1-2","city8-2")),5) occurs(action(("load-airplane","pack
Solving Time: 0.23s
Memory: 427MB (+17MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 5.563s (Solving: 0.18s 1st Model: 0.14s Unsat: 0.04s)
CPU Time : 5.540s
Choices : 11437
Conflicts : 241 (Analyzed: 240)
Restarts : 1 (Average: 240.00 Last: 138)
Model-Level : 1312.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 774 (Deleted: 0)
Binary : 51 (Ratio: 6.59%)
Ternary : 15 (Ratio: 1.94%)
Conflict : 240 (Average Length: 28.0 Ratio: 31.01%)
Loop : 534 (Average Length: 13.4 Ratio: 68.99%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 240 (Average: 42.42 Max: 568 Sum: 10181)
Executed : 232 (Average: 42.24 Max: 568 Sum: 10137 Ratio: 99.57%)
Bounded : 8 (Average: 5.50 Max: 7 Sum: 44 Ratio: 0.43%)
Rules : 603146
Atoms : 603146
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 108724 (Eliminated: 0 Frozen: 99959)
Constraints : 246550 (Binary: 84.3% Ternary: 14.0% Other: 1.6%)
Memory Peak : 428MB
Max. Length : 10 steps
Sol. Length : 10 steps