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

143 lines
26 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.021s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 51 rules.
Computing model... [0.620s CPU, 0.618s wall-clock]
6480 relevant atoms
3325 auxiliary atoms
9805 final queue length
13920 total queue pushes
Completing instantiation... [1.130s CPU, 1.127s wall-clock]
Instantiating: [1.810s CPU, 1.805s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.018s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.120s CPU, 0.118s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.007s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.019s wall-clock]
Building translation key... [0.010s CPU, 0.012s wall-clock]
Computing fact groups: [0.230s CPU, 0.239s 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.049s wall-clock]
Translating task: [0.970s CPU, 0.964s 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.490s CPU, 0.495s 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.104s 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.210s CPU, 0.233s wall-clock]
Done! [3.890s CPU, 3.919s wall-clock]
planner.py version 0.0.1
Time: 2.54s
Memory: 202MB
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: 202MB (+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: 0.96s
Memory: 293MB (+91MB)
Unblocking actions...
Solving...
Solving Time: 0.07s
Memory: 320MB (+27MB)
UNSAT
Iteration Time: 1.24s
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.59s
Memory: 352MB (+32MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("fly-airplane","plane1","city4-3","city1-3")),1) occurs(action(("fly-airplane","plane5","city1-3","city3-3")),1) occurs(action(("load-airplane","package11","plane5","city3-3")),1) occurs(action(("load-truck","package13","truck11","city1-1")),1) occurs(action(("drive-truck","truck11","city1-1","city1-3","city1")),1) occurs(action(("drive-truck","truck2","city1-3","city1-1","city1")),1) occurs(action(("drive-truck","truck22","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck3","city1-3","city1-2","city1")),1) occurs(action(("drive-truck","truck7","city1-2","city1-1","city1")),1) occurs(action(("load-truck","package12","truck2","city1-1")),1) occurs(action(("load-truck","package15","truck3","city1-2")),1) occurs(action(("drive-truck","truck27","city4-1","city4-3","city4")),2) occurs(action(("drive-truck","truck37","city4-2","city4-3","city4")),2) occurs(action(("drive-truck","truck20","city4-3","city4-2","city4")),2) occurs(action(("drive-truck","truck23","city4-1","city4-2","city4")),2) occurs(action(("drive-truck","truck12","city2-1","city2-3","city2")),2) occurs(action(("drive-truck","truck13","city2-2","city2-3","city2")),2) occurs(action(("drive-truck","truck24","city2-1","city2-3","city2")),2) occurs(action(("drive-truck","truck29","city2-2","city2-3","city2")),2) occurs(action(("drive-truck","truck6","city2-2","city2-3","city2")),2) occurs(action(("fly-airplane","plane1","city1-3","city3-3")),2) occurs(action(("fly-airplane","plane2","city3-3","city1-3")),2) occurs(action(("fly-airplane","plane3","city4-3","city1-3")),2) occurs(action(("fly-airplane","plane4","city4-3","city1-3")),2) occurs(action(("unload-truck","package13","truck11","city1-3")),2) occurs(action(("drive-truck","truck17","city4-2","city4-1","city4")),2) occurs(action(("drive-truck","truck25","city4-3","city4-1","city4")),2) occurs(action(("fly-airplane","plane5","city3-3","city1-3")),2) occurs(action(("drive-truck","truck18","city1-2","city1-3","city1")),2) occurs(action(("drive-truck","truck22","city1-2","city1-3","city1")),2) occurs(action(("drive-truck","truck35","city1-1","city1-3","city1")),2) occurs(action(("drive-truck","truck42","city1-1","city1-3","city1")),2) occurs(action(("drive-truck","truck7","city1-1","city1-3","city1")),2) occurs(action(("drive-truck","truck8","city1-1","city1-3","city1")),2) occurs(action(("drive-truck","truck9","city1-2","city1-3","city1")),2) occurs(action(("drive-truck","truck16","city3-1","city3-3","city3")),2) occurs(action(("drive-truck","truck21","city3-2","city3-3","city3")),2) occurs(action(("drive-truck","truck30","city3-2","city3-3","city3")),2) occurs(action(("drive-truck","truck31","city3-1","city3-3","city3")),2) occurs(action(("drive-truck","truck40","city3-2","city3-3","city3")),2) occurs(action(("unload-airplane","package11","plane5","city1-3")),2) occurs(action(("unload-truck","package12","truck2","city1-3")),2) occurs(action(("drive-truck","truck28","city1-3","city1-1","city1")),2) occurs(action(("drive-truck","truck15","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck19","city3-3","city3-2","city3")),2) occurs(action(("drive-truck","truck26","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck36","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck44","city3-2","city3-1","city3")),2) occurs(action(("drive-truck","truck5","city3-1","city3-2","city3")),2) occurs(action(("unload-truck","package15","truck3","city1-3")),2) occurs(action(("load-truck","package14","truck44","city3-1")),2) occurs(action(("load-truck","package9","truck30","city3-2")),2) occurs(action(("drive-truck","truck2","city1-1","city1-3","city1")),2) occurs(action(("drive-truck","truck3","city1-2","city1-3","city1")),2) occurs(action(("drive-truck","truck38","city2-3","city2-2","city2")),3) occurs(action(("load-airplane","package13","plane1","city1-3")),3) occurs(action(("fly-airplane","plane1","city3-3","city1-3")),3) occurs(action(("fly-airplane","plane3","city1-3","city3-3")),3) occurs(action(("fly-airplane","plane4","city1-3","city3-3")),3) occur
Solving Time: 0.47s
Memory: 383MB (+31MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 5.161s (Solving: 0.43s 1st Model: 0.40s Unsat: 0.02s)
CPU Time : 5.110s
Choices : 26115
Conflicts : 564 (Analyzed: 563)
Restarts : 6 (Average: 93.83 Last: 41)
Model-Level : 1764.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 728 (Deleted: 0)
Binary : 84 (Ratio: 11.54%)
Ternary : 70 (Ratio: 9.62%)
Conflict : 563 (Average Length: 13.3 Ratio: 77.34%)
Loop : 165 (Average Length: 45.8 Ratio: 22.66%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 563 (Average: 46.01 Max: 1091 Sum: 25904)
Executed : 407 (Average: 43.13 Max: 1091 Sum: 24283 Ratio: 93.74%)
Bounded : 156 (Average: 10.39 Max: 12 Sum: 1621 Ratio: 6.26%)
Rules : 1186492
Atoms : 1186492
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 150564 (Eliminated: 0 Frozen: 137081)
Constraints : 320550 (Binary: 82.6% Ternary: 14.7% Other: 2.7%)
Memory Peak : 383MB
Max. Length : 10 steps
Sol. Length : 10 steps