tplp-planning-benchmark/fd-pb-e3/ipc-1998_logistics-round-1-strips_17.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-17.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-17.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 51 rules.
Computing model... [0.620s CPU, 0.620s wall-clock]
6480 relevant atoms
3325 auxiliary atoms
9805 final queue length
13920 total queue pushes
Completing instantiation... [1.130s CPU, 1.130s wall-clock]
Instantiating: [1.810s CPU, 1.813s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.020s CPU, 0.019s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.120s CPU, 0.118s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.007s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.018s wall-clock]
Building translation key... [0.010s CPU, 0.011s wall-clock]
Computing fact groups: [0.240s CPU, 0.242s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.006s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.050s CPU, 0.051s wall-clock]
Translating task: [0.970s CPU, 0.967s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
65 propositions removed
Detecting unreachable propositions: [0.500s CPU, 0.500s wall-clock]
Reordering and filtering variables...
58 of 65 variables necessary.
0 of 65 mutex groups necessary.
2810 of 4980 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.110s CPU, 0.105s wall-clock]
Translator variables: 58
Translator derived variables: 0
Translator facts: 651
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 2810
Translator axioms: 0
Translator task size: 11627
Translator peak memory: 47960 KB
Writing output... [0.220s CPU, 0.233s wall-clock]
Done! [3.920s CPU, 3.939s wall-clock]
planner.py version 0.0.1
Time: 3.30s
Memory: 245MB
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.02s
Memory: 245MB (+0MB)
UNSAT
Iteration Time: 0.02s
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.28s
Memory: 261MB (+16MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 265MB (+4MB)
UNSAT
Iteration Time: 0.39s
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.64s
Memory: 303MB (+38MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-airplane","package11","plane2","city3-3")),1) occurs(action(("load-truck","package13","truck8","city1-1")),1) occurs(action(("load-truck","package12","truck8","city1-1")),1) occurs(action(("load-truck","package14","truck5","city3-1")),1) occurs(action(("load-truck","package15","truck9","city1-2")),1) occurs(action(("load-truck","package9","truck44","city3-2")),1) occurs(action(("drive-truck","truck38","city2-3","city2-1","city2")),2) occurs(action(("fly-airplane","plane5","city1-3","city4-3")),2) occurs(action(("fly-airplane","plane1","city4-3","city3-3")),2) occurs(action(("fly-airplane","plane4","city4-3","city3-3")),3) occurs(action(("fly-airplane","plane5","city4-3","city1-3")),3) occurs(action(("drive-truck","truck38","city2-1","city2-3","city2")),3) occurs(action(("drive-truck","truck18","city1-2","city1-1","city1")),3) occurs(action(("drive-truck","truck22","city1-1","city1-2","city1")),3) occurs(action(("fly-airplane","plane5","city1-3","city4-3")),4) occurs(action(("fly-airplane","plane2","city3-3","city2-3")),4) occurs(action(("fly-airplane","plane3","city4-3","city1-3")),4) occurs(action(("drive-truck","truck8","city1-1","city1-3","city1")),4) occurs(action(("drive-truck","truck9","city1-2","city1-3","city1")),4) occurs(action(("drive-truck","truck44","city3-2","city3-3","city3")),4) occurs(action(("drive-truck","truck5","city3-1","city3-3","city3")),4) occurs(action(("fly-airplane","plane4","city3-3","city4-3")),4) occurs(action(("drive-truck","truck22","city1-2","city1-1","city1")),4) occurs(action(("drive-truck","truck18","city1-1","city1-2","city1")),4) occurs(action(("unload-airplane","package11","plane2","city2-3")),5) occurs(action(("drive-truck","truck43","city2-2","city2-3","city2")),5) occurs(action(("fly-airplane","plane2","city2-3","city1-3")),5) occurs(action(("fly-airplane","plane4","city4-3","city3-3")),5) occurs(action(("unload-truck","package13","truck8","city1-3")),5) occurs(action(("fly-airplane","plane5","city4-3","city1-3")),5) occurs(action(("fly-airplane","plane1","city3-3","city4-3")),5) occurs(action(("unload-truck","package12","truck8","city1-3")),5) occurs(action(("unload-truck","package14","truck5","city3-3")),5) occurs(action(("unload-truck","package15","truck9","city1-3")),5) occurs(action(("unload-truck","package9","truck44","city3-3")),5) occurs(action(("drive-truck","truck5","city3-3","city3-1","city3")),5) occurs(action(("drive-truck","truck44","city3-3","city3-2","city3")),5) occurs(action(("drive-truck","truck9","city1-3","city1-2","city1")),5) occurs(action(("drive-truck","truck8","city1-3","city1-1","city1")),5) occurs(action(("drive-truck","truck13","city2-2","city2-1","city2")),6) occurs(action(("load-truck","package11","truck43","city2-3")),6) occurs(action(("fly-airplane","plane2","city1-3","city4-3")),6) occurs(action(("load-airplane","package13","plane3","city1-3")),6) occurs(action(("fly-airplane","plane5","city1-3","city4-3")),6) occurs(action(("fly-airplane","plane1","city4-3","city3-3")),6) occurs(action(("fly-airplane","plane3","city1-3","city2-3")),6) occurs(action(("drive-truck","truck1","city4-2","city4-1","city4")),6) occurs(action(("drive-truck","truck17","city4-2","city4-1","city4")),6) occurs(action(("drive-truck","truck43","city2-3","city2-2","city2")),6) occurs(action(("load-airplane","package12","plane2","city1-3")),6) occurs(action(("load-airplane","package14","plane4","city3-3")),6) occurs(action(("load-airplane","package15","plane5","city1-3")),6) occurs(action(("load-airplane","package9","plane4","city3-3")),6) occurs(action(("fly-airplane","plane4","city3-3","city4-3")),6) occurs(action(("drive-truck","truck37","city4-2","city4-3","city4")),7) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),7) occurs(action(("fly-airplane","plane1","city3-3","city1-3")),7) occurs(action(("fly-airplane","plane2","city4-3","city2-3")),7) occurs(action(("fly-airplane","plane3","city2-3","city1-3")),7) occurs(action(("unload-airplane","package15","plane5","city4-3")),7) occurs(action(("drive-truck","truck13","city2-1","city2-2
Solving Time: 0.02s
Memory: 311MB (+8MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 4.522s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 4.480s
Choices : 1604
Conflicts : 7 (Analyzed: 7)
Restarts : 0
Model-Level : 1207.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: 45.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7 (Average: 58.43 Max: 194 Sum: 409)
Executed : 7 (Average: 58.43 Max: 194 Sum: 409 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 1788731
Atoms : 1788731
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 39862 (Eliminated: 0 Frozen: 0)
Constraints : 113406 (Binary: 90.8% Ternary: 7.0% Other: 2.1%)
Memory Peak : 317MB
Max. Length : 10 steps
Sol. Length : 10 steps