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

156 lines
27 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-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.030s CPU, 0.032s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.012s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
Preparing model... [0.030s CPU, 0.034s wall-clock]
Generated 51 rules.
Computing model... [1.010s CPU, 1.002s wall-clock]
8409 relevant atoms
5767 auxiliary atoms
14176 final queue length
19412 total queue pushes
Completing instantiation... [1.490s CPU, 1.489s wall-clock]
Instantiating: [2.580s CPU, 2.575s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.120s CPU, 0.121s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.024s wall-clock]
Building translation key... [0.010s CPU, 0.014s wall-clock]
Computing fact groups: [0.280s CPU, 0.279s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.007s wall-clock]
Building dictionary for full mutex groups... [0.050s CPU, 0.055s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.070s CPU, 0.061s wall-clock]
Translating task: [1.150s CPU, 1.145s 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.720s CPU, 0.723s 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.160s CPU, 0.155s 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.480s CPU, 0.535s wall-clock]
Done! [5.530s CPU, 5.574s wall-clock]
planner.py version 0.0.1
Time: 0.85s
Memory: 106MB
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: 106MB (+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.43s
Memory: 107MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 123MB (+16MB)
UNSAT
Iteration Time: 0.68s
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.41s
Memory: 135MB (+12MB)
Unblocking actions...
Solving...
Solving Time: 0.21s
Memory: 151MB (+16MB)
UNSAT
Iteration Time: 0.85s
Iteration 4
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.43s
Memory: 165MB (+14MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck19","city2-1","city2-4","city2")),1) occurs(action(("fly-airplane","plane1","city10-6","city2-6")),1) occurs(action(("fly-airplane","plane2","city7-6","city2-6")),1) occurs(action(("fly-airplane","plane4","city5-6","city4-6")),1) occurs(action(("drive-truck","truck13","city9-6","city9-1","city9")),1) occurs(action(("drive-truck","truck26","city9-1","city9-5","city9")),1) occurs(action(("drive-truck","truck7","city9-1","city9-5","city9")),1) occurs(action(("load-airplane","package1","plane3","city6-6")),1) occurs(action(("load-truck","package6","truck3","city4-1")),1) occurs(action(("fly-airplane","plane3","city6-6","city1-6")),2) occurs(action(("drive-truck","truck26","city9-5","city9-4","city9")),2) occurs(action(("drive-truck","truck6","city2-6","city2-1","city2")),2) occurs(action(("load-airplane","package10","plane4","city4-6")),2) occurs(action(("load-airplane","package5","plane1","city2-6")),2) occurs(action(("load-truck","package7","truck19","city2-4")),2) occurs(action(("drive-truck","truck10","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck14","city11-6","city11-4","city11")),2) occurs(action(("drive-truck","truck28","city11-2","city11-4","city11")),2) occurs(action(("drive-truck","truck20","city3-3","city3-4","city3")),2) occurs(action(("drive-truck","truck12","city7-1","city7-2","city7")),2) occurs(action(("drive-truck","truck17","city7-3","city7-1","city7")),2) occurs(action(("load-truck","package11","truck13","city9-1")),2) occurs(action(("drive-truck","truck4","city4-1","city4-6","city4")),3) occurs(action(("drive-truck","truck9","city4-1","city4-5","city4")),3) occurs(action(("drive-truck","truck22","city5-2","city5-3","city5")),3) occurs(action(("drive-truck","truck11","city8-6","city8-3","city8")),3) occurs(action(("drive-truck","truck15","city8-5","city8-4","city8")),3) occurs(action(("fly-airplane","plane4","city4-6","city6-6")),3) occurs(action(("drive-truck","truck6","city2-1","city2-5","city2")),3) occurs(action(("drive-truck","truck19","city2-4","city2-1","city2")),3) occurs(action(("drive-truck","truck7","city9-5","city9-1","city9")),3) occurs(action(("drive-truck","truck26","city9-4","city9-1","city9")),3) occurs(action(("fly-airplane","plane1","city2-6","city10-6")),3) occurs(action(("load-airplane","package2","plane2","city2-6")),3) occurs(action(("drive-truck","truck20","city3-4","city3-6","city3")),3) occurs(action(("unload-airplane","package1","plane3","city1-6")),3) occurs(action(("drive-truck","truck1","city1-5","city1-4","city1")),3) occurs(action(("drive-truck","truck18","city1-1","city1-4","city1")),3) occurs(action(("drive-truck","truck14","city11-4","city11-5","city11")),3) occurs(action(("drive-truck","truck17","city7-1","city7-4","city7")),3) occurs(action(("drive-truck","truck12","city7-2","city7-1","city7")),3) occurs(action(("drive-truck","truck28","city11-4","city11-2","city11")),3) occurs(action(("load-truck","package12","truck10","city1-2")),3) occurs(action(("unload-truck","package11","truck13","city9-1")),3) occurs(action(("drive-truck","truck7","city9-1","city9-2","city9")),4) occurs(action(("fly-airplane","plane2","city2-6","city9-6")),4) occurs(action(("drive-truck","truck8","city2-5","city2-3","city2")),4) occurs(action(("unload-airplane","package10","plane4","city6-6")),4) occurs(action(("drive-truck","truck23","city6-1","city6-6","city6")),4) occurs(action(("drive-truck","truck3","city4-1","city4-6","city4")),4) occurs(action(("unload-airplane","package5","plane1","city10-6")),4) occurs(action(("fly-airplane","plane3","city1-6","city10-6")),4) occurs(action(("drive-truck","truck13","city9-1","city9-3","city9")),4) occurs(action(("drive-truck","truck19","city2-1","city2-6","city2")),4) occurs(action(("drive-truck","truck6","city2-5","city2-6","city2")),4) occurs(action(("drive-truck","truck15","city8-4","city8-5","city8")),4) occurs(action(("drive-truck","truck11","city8-3","city8-6","city8")),4) occurs(action(("drive-truck","truck22","city5-3","city5-2","city5")),4) occurs(action(("drive-truck","truck10","city1-2"
Solving Time: 0.23s
Memory: 184MB (+19MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 3.341s (Solving: 0.40s 1st Model: 0.20s Unsat: 0.19s)
CPU Time : 3.280s
Choices : 10863
Conflicts : 669 (Analyzed: 668)
Restarts : 9 (Average: 74.22 Last: 40)
Model-Level : 2062.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 668 (Deleted: 0)
Binary : 50 (Ratio: 7.49%)
Ternary : 10 (Ratio: 1.50%)
Conflict : 668 (Average Length: 34.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 668 (Average: 14.49 Max: 542 Sum: 9678)
Executed : 598 (Average: 13.20 Max: 542 Sum: 8818 Ratio: 91.11%)
Bounded : 70 (Average: 12.29 Max: 17 Sum: 860 Ratio: 8.89%)
Rules : 90291
Atoms : 90291
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 110517 (Eliminated: 0 Frozen: 90754)
Constraints : 492183 (Binary: 94.6% Ternary: 2.8% Other: 2.5%)
Memory Peak : 186MB
Max. Length : 15 steps
Sol. Length : 15 steps