tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-1998_logistics-round-1-strips_9.out

156 lines
19 KiB
Plaintext
Raw Permalink 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-9.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-9.pddl
Parsing...
Parsing: [0.020s CPU, 0.026s 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.029s wall-clock]
Generated 51 rules.
Computing model... [0.990s CPU, 0.986s wall-clock]
8409 relevant atoms
5767 auxiliary atoms
14176 final queue length
19412 total queue pushes
Completing instantiation... [1.450s CPU, 1.457s wall-clock]
Instantiating: [2.520s CPU, 2.518s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.120s CPU, 0.119s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.008s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.022s wall-clock]
Building translation key... [0.020s CPU, 0.015s wall-clock]
Computing fact groups: [0.280s CPU, 0.279s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.007s wall-clock]
Building dictionary for full mutex groups... [0.050s CPU, 0.054s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.061s wall-clock]
Translating task: [1.150s CPU, 1.146s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
44 propositions removed
Detecting unreachable propositions: [0.700s CPU, 0.706s wall-clock]
Reordering and filtering variables...
44 of 44 variables necessary.
0 of 44 mutex groups necessary.
6368 of 6368 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.150s CPU, 0.151s wall-clock]
Translator variables: 44
Translator derived variables: 0
Translator facts: 1388
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 6368
Translator axioms: 0
Translator task size: 25636
Translator peak memory: 52056 KB
Writing output... [0.470s CPU, 0.524s wall-clock]
Done! [5.420s CPU, 5.477s wall-clock]
planner.py version 0.0.1
Time: 0.87s
Memory: 106MB
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: 106MB (+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.44s
Memory: 107MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 123MB (+16MB)
UNSAT
Iteration Time: 0.70s
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.43s
Memory: 136MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.23s
Memory: 152MB (+16MB)
UNSAT
Iteration Time: 0.89s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.45s
Memory: 167MB (+15MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck6","city2-6","city2-4","city2")),1) occurs(action(("drive-truck","truck7","city9-1","city9-6","city9")),1) occurs(action(("drive-truck","truck8","city2-5","city2-3","city2")),1) occurs(action(("drive-truck","truck16","city6-3","city6-6","city6")),1) occurs(action(("drive-truck","truck21","city4-2","city4-5","city4")),1) occurs(action(("drive-truck","truck3","city4-1","city4-6","city4")),1) occurs(action(("drive-truck","truck4","city4-1","city4-3","city4")),1) occurs(action(("drive-truck","truck22","city5-2","city5-6","city5")),1) occurs(action(("drive-truck","truck15","city8-5","city8-4","city8")),1) occurs(action(("drive-truck","truck2","city8-2","city8-6","city8")),1) occurs(action(("drive-truck","truck25","city8-2","city8-4","city8")),1) occurs(action(("drive-truck","truck5","city8-6","city8-4","city8")),1) occurs(action(("drive-truck","truck27","city10-2","city10-6","city10")),1) occurs(action(("fly-airplane","plane1","city10-6","city4-6")),1) occurs(action(("fly-airplane","plane2","city7-6","city2-6")),1) occurs(action(("fly-airplane","plane3","city6-6","city2-6")),1) occurs(action(("fly-airplane","plane4","city5-6","city1-6")),1) occurs(action(("drive-truck","truck19","city2-1","city2-6","city2")),1) occurs(action(("drive-truck","truck1","city1-5","city1-2","city1")),1) occurs(action(("drive-truck","truck10","city1-1","city1-5","city1")),1) occurs(action(("drive-truck","truck18","city1-1","city1-3","city1")),1) occurs(action(("drive-truck","truck14","city11-6","city11-5","city11")),1) occurs(action(("drive-truck","truck20","city3-3","city3-4","city3")),1) occurs(action(("drive-truck","truck12","city7-1","city7-2","city7")),1) occurs(action(("load-truck","package11","truck26","city9-1")),1) occurs(action(("load-truck","package6","truck9","city4-1")),1) occurs(action(("drive-truck","truck26","city9-1","city9-6","city9")),2) occurs(action(("drive-truck","truck9","city4-1","city4-6","city4")),2) occurs(action(("load-airplane","package2","plane3","city2-6")),2) occurs(action(("load-airplane","package5","plane2","city2-6")),2) occurs(action(("load-truck","package7","truck6","city2-4")),2) occurs(action(("load-truck","package12","truck1","city1-2")),2) occurs(action(("load-truck","package3","truck21","city4-5")),2) occurs(action(("load-truck","package8","truck14","city11-5")),2) occurs(action(("drive-truck","truck8","city2-3","city2-4","city2")),3) occurs(action(("fly-airplane","plane3","city2-6","city9-6")),3) occurs(action(("drive-truck","truck21","city4-5","city4-6","city4")),3) occurs(action(("drive-truck","truck4","city4-3","city4-2","city4")),3) occurs(action(("drive-truck","truck25","city8-4","city8-3","city8")),3) occurs(action(("drive-truck","truck6","city2-4","city2-6","city2")),3) occurs(action(("drive-truck","truck1","city1-2","city1-6","city1")),3) occurs(action(("unload-truck","package11","truck26","city9-6")),3) occurs(action(("unload-truck","package6","truck9","city4-6")),3) occurs(action(("drive-truck","truck20","city3-4","city3-1","city3")),3) occurs(action(("drive-truck","truck12","city7-2","city7-3","city7")),3) occurs(action(("drive-truck","truck17","city7-3","city7-1","city7")),3) occurs(action(("drive-truck","truck24","city7-5","city7-1","city7")),3) occurs(action(("drive-truck","truck10","city1-5","city1-1","city1")),3) occurs(action(("drive-truck","truck14","city11-5","city11-6","city11")),3) occurs(action(("unload-airplane","package2","plane3","city9-6")),4) occurs(action(("unload-truck","package7","truck6","city2-6")),4) occurs(action(("drive-truck","truck26","city9-6","city9-4","city9")),4) occurs(action(("drive-truck","truck8","city2-4","city2-5","city2")),4) occurs(action(("drive-truck","truck25","city8-3","city8-2","city8")),4) occurs(action(("load-airplane","package11","plane3","city9-6")),4) occurs(action(("load-airplane","package6","plane1","city4-6")),4) occurs(action(("drive-truck","truck20","city3-1","city3-6","city3")),4) occurs(action(("unload-truck","package12","truck1","city1-6")),4) occurs(action(("unload-truck","package3","truck21","city4-6")),
Solving Time: 0.11s
Memory: 187MB (+20MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 3.384s (Solving: 0.30s 1st Model: 0.08s Unsat: 0.21s)
CPU Time : 3.280s
Choices : 11656 (Domain: 11501)
Conflicts : 594 (Analyzed: 593)
Restarts : 7 (Average: 84.71 Last: 87)
Model-Level : 1782.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 593 (Deleted: 0)
Binary : 23 (Ratio: 3.88%)
Ternary : 9 (Ratio: 1.52%)
Conflict : 593 (Average Length: 70.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 593 (Average: 19.29 Max: 331 Sum: 11441)
Executed : 472 (Average: 16.68 Max: 331 Sum: 9891 Ratio: 86.45%)
Bounded : 121 (Average: 12.81 Max: 17 Sum: 1550 Ratio: 13.55%)
Rules : 90291
Atoms : 90291
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 110517 (Eliminated: 0 Frozen: 90754)
Constraints : 481829 (Binary: 94.6% Ternary: 2.8% Other: 2.6%)
Memory Peak : 188MB
Max. Length : 15 steps
Sol. Length : 15 steps