tplp-planning-benchmark/fd-pb-e3/ipc-1998_logistics-round-1-strips_4.out

143 lines
12 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-4.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-4.pddl
Parsing...
Parsing: [0.020s CPU, 0.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.030s CPU, 0.026s wall-clock]
Generated 51 rules.
Computing model... [0.560s CPU, 0.554s wall-clock]
4494 relevant atoms
3252 auxiliary atoms
7746 final queue length
10475 total queue pushes
Completing instantiation... [0.750s CPU, 0.754s wall-clock]
Instantiating: [1.370s CPU, 1.375s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.016s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.080s CPU, 0.079s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.012s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.170s CPU, 0.162s 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.040s CPU, 0.033s wall-clock]
Translating task: [0.580s CPU, 0.578s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
35 propositions removed
Detecting unreachable propositions: [0.320s CPU, 0.318s wall-clock]
Reordering and filtering variables...
35 of 35 variables necessary.
0 of 35 mutex groups necessary.
3254 of 3254 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.080s CPU, 0.076s wall-clock]
Translator variables: 35
Translator derived variables: 0
Translator facts: 717
Translator goal facts: 7
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3254
Translator axioms: 0
Translator task size: 12719
Translator peak memory: 42584 KB
Writing output... [0.230s CPU, 0.266s wall-clock]
Done! [2.800s CPU, 2.842s wall-clock]
planner.py version 0.0.1
Time: 5.54s
Memory: 357MB
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.03s
Memory: 357MB (+0MB)
UNSAT
Iteration Time: 0.03s
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.51s
Memory: 393MB (+36MB)
Unblocking actions...
Solving...
Solving Time: 0.03s
Memory: 397MB (+4MB)
UNSAT
Iteration Time: 0.73s
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.56s
Memory: 421MB (+24MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package5","truck20","city10-1")),1) occurs(action(("fly-airplane","plane4","city8-4","city13-4")),2) occurs(action(("fly-airplane","plane1","city2-4","city8-4")),2) occurs(action(("fly-airplane","plane2","city13-4","city8-4")),2) occurs(action(("fly-airplane","plane3","city6-4","city8-4")),2) occurs(action(("fly-airplane","plane5","city12-4","city8-4")),2) occurs(action(("drive-truck","truck4","city7-3","city7-2","city7")),2) occurs(action(("load-truck","package4","truck1","city5-4")),2) occurs(action(("drive-truck","truck21","city11-3","city11-1","city11")),2) occurs(action(("drive-truck","truck13","city3-3","city3-2","city3")),2) occurs(action(("drive-truck","truck14","city4-1","city4-3","city4")),2) occurs(action(("drive-truck","truck16","city6-3","city6-2","city6")),2) occurs(action(("load-truck","package2","truck21","city11-3")),2) occurs(action(("unload-truck","package5","truck20","city10-1")),2) occurs(action(("drive-truck","truck4","city7-2","city7-3","city7")),3) occurs(action(("load-truck","package3","truck21","city11-1")),3) occurs(action(("drive-truck","truck21","city11-1","city11-2","city11")),3) occurs(action(("drive-truck","truck14","city4-3","city4-2","city4")),3) occurs(action(("drive-truck","truck16","city6-2","city6-3","city6")),3) occurs(action(("drive-truck","truck13","city3-2","city3-3","city3")),3) occurs(action(("drive-truck","truck20","city10-1","city10-4","city10")),4) occurs(action(("drive-truck","truck21","city11-2","city11-4","city11")),4) occurs(action(("drive-truck","truck14","city4-2","city4-4","city4")),4) occurs(action(("drive-truck","truck8","city2-2","city2-3","city2")),4) occurs(action(("load-truck","package1","truck14","city4-2")),4) occurs(action(("load-truck","package5","truck20","city10-1")),4) occurs(action(("unload-truck","package3","truck21","city11-4")),5) occurs(action(("fly-airplane","plane1","city8-4","city5-4")),5) occurs(action(("fly-airplane","plane2","city8-4","city1-4")),5) occurs(action(("fly-airplane","plane3","city8-4","city10-4")),5) occurs(action(("fly-airplane","plane4","city13-4","city4-4")),5) occurs(action(("fly-airplane","plane5","city8-4","city11-4")),5) occurs(action(("unload-truck","package4","truck1","city5-4")),5) occurs(action(("drive-truck","truck8","city2-3","city2-4","city2")),5) occurs(action(("unload-truck","package1","truck14","city4-4")),5) occurs(action(("unload-truck","package2","truck21","city11-4")),5) occurs(action(("unload-truck","package5","truck20","city10-4")),5) occurs(action(("drive-truck","truck14","city4-4","city4-1","city4")),5) occurs(action(("drive-truck","truck21","city11-4","city11-3","city11")),5) occurs(action(("drive-truck","truck20","city10-4","city10-1","city10")),5) occurs(action(("load-truck","package6","truck8","city2-3")),5) occurs(action(("drive-truck","truck17","city7-3","city7-1","city7")),6) occurs(action(("fly-airplane","plane4","city4-4","city13-4")),6) occurs(action(("load-airplane","package3","plane5","city11-4")),6) occurs(action(("drive-truck","truck23","city13-2","city13-4","city13")),6) occurs(action(("load-airplane","package4","plane1","city5-4")),6) occurs(action(("fly-airplane","plane2","city1-4","city8-4")),6) occurs(action(("fly-airplane","plane3","city10-4","city8-4")),6) occurs(action(("fly-airplane","plane5","city11-4","city8-4")),6) occurs(action(("drive-truck","truck18","city8-2","city8-4","city8")),6) occurs(action(("fly-airplane","plane1","city5-4","city2-4")),6) occurs(action(("load-airplane","package1","plane4","city4-4")),6) occurs(action(("load-airplane","package2","plane5","city11-4")),6) occurs(action(("load-airplane","package5","plane3","city10-4")),6) occurs(action(("load-airplane","package7","plane2","city1-4")),6) occurs(action(("drive-truck","truck1","city5-4","city5-3","city5")),6) occurs(action(("drive-truck","truck15","city5-2","city5-1","city5")),6) occurs(action(("unload-truck","package6","truck8","city2-4")),6) occurs(action(("drive-truck","truck8","city2-4","city2-2","city2")),6) occurs(action(("unload-airplane","package1","plane4","city13-4")),7) o
Solving Time: 0.04s
Memory: 436MB (+15MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 7.138s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 7.110s
Choices : 1510
Conflicts : 7 (Analyzed: 7)
Restarts : 0
Model-Level : 1138.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 7 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 7 (Average Length: 30.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7 (Average: 54.86 Max: 199 Sum: 384)
Executed : 7 (Average: 54.86 Max: 199 Sum: 384 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 2901437
Atoms : 2901437
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 57567 (Eliminated: 0 Frozen: 0)
Constraints : 159091 (Binary: 92.6% Ternary: 5.2% Other: 2.2%)
Memory Peak : 436MB
Max. Length : 10 steps
Sol. Length : 10 steps