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

156 lines
27 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-23.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-23.pddl
Parsing...
Parsing: [0.030s CPU, 0.031s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
Preparing model... [0.030s CPU, 0.029s wall-clock]
Generated 51 rules.
Computing model... [0.610s CPU, 0.608s wall-clock]
5416 relevant atoms
3476 auxiliary atoms
8892 final queue length
11913 total queue pushes
Completing instantiation... [0.890s CPU, 0.893s wall-clock]
Instantiating: [1.590s CPU, 1.578s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.015s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.090s CPU, 0.093s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.006s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.020s CPU, 0.018s wall-clock]
Building translation key... [0.010s CPU, 0.012s wall-clock]
Computing fact groups: [0.210s CPU, 0.209s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.004s 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.040s CPU, 0.040s wall-clock]
Translating task: [0.740s CPU, 0.732s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
53 propositions removed
Detecting unreachable propositions: [0.440s CPU, 0.451s wall-clock]
Reordering and filtering variables...
53 of 53 variables necessary.
0 of 53 mutex groups necessary.
3976 of 3976 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.101s wall-clock]
Translator variables: 53
Translator derived variables: 0
Translator facts: 1096
Translator goal facts: 21
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3976
Translator axioms: 0
Translator task size: 16794
Translator peak memory: 45144 KB
Writing output... [0.300s CPU, 0.332s wall-clock]
Done! [3.460s CPU, 3.490s wall-clock]
planner.py version 0.0.1
Time: 0.68s
Memory: 84MB
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: 84MB (+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.31s
Memory: 87MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 99MB (+12MB)
UNSAT
Iteration Time: 0.48s
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.31s
Memory: 110MB (+11MB)
Unblocking actions...
Solving...
Solving Time: 0.20s
Memory: 121MB (+11MB)
UNSAT
Iteration Time: 0.67s
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.33s
Memory: 133MB (+12MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-airplane","package15","plane3","city7-2")),1) occurs(action(("load-airplane","package2","plane1","city1-2")),1) occurs(action(("drive-truck","truck25","city5-1","city5-2","city5")),1) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),1) occurs(action(("drive-truck","truck21","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck8","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck15","city3-1","city3-2","city3")),1) occurs(action(("drive-truck","truck23","city3-1","city3-2","city3")),1) occurs(action(("drive-truck","truck14","city5-2","city5-1","city5")),1) occurs(action(("fly-airplane","plane4","city5-2","city4-2")),1) occurs(action(("drive-truck","truck27","city7-1","city7-2","city7")),1) occurs(action(("load-truck","package1","truck19","city1-1")),1) occurs(action(("load-airplane","package10","plane1","city1-2")),1) occurs(action(("load-airplane","package17","plane1","city1-2")),1) occurs(action(("load-truck","package18","truck13","city5-1")),1) occurs(action(("load-truck","package7","truck19","city1-1")),1) occurs(action(("load-truck","package13","truck7","city1-1")),1) occurs(action(("load-truck","package16","truck26","city6-1")),1) occurs(action(("load-truck","package8","truck26","city6-1")),1) occurs(action(("load-truck","package9","truck19","city1-1")),1) occurs(action(("drive-truck","truck11","city6-2","city6-1","city6")),2) occurs(action(("drive-truck","truck26","city6-1","city6-2","city6")),2) occurs(action(("drive-truck","truck13","city5-1","city5-2","city5")),2) occurs(action(("drive-truck","truck19","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck7","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck18","city2-1","city2-2","city2")),2) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),2) occurs(action(("drive-truck","truck10","city2-2","city2-1","city2")),2) occurs(action(("drive-truck","truck16","city2-2","city2-1","city2")),2) occurs(action(("drive-truck","truck20","city2-2","city2-1","city2")),2) occurs(action(("drive-truck","truck9","city2-2","city2-1","city2")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("drive-truck","truck1","city5-2","city5-1","city5")),2) occurs(action(("drive-truck","truck12","city5-2","city5-1","city5")),2) occurs(action(("drive-truck","truck15","city3-2","city3-1","city3")),2) occurs(action(("unload-airplane","package15","plane3","city7-2")),2) occurs(action(("load-airplane","package12","plane2","city1-2")),2) occurs(action(("load-airplane","package14","plane4","city4-2")),2) occurs(action(("load-truck","package6","truck17","city7-1")),2) occurs(action(("drive-truck","truck27","city7-2","city7-1","city7")),2) occurs(action(("load-truck","package4","truck23","city3-2")),2) occurs(action(("unload-airplane","package10","plane1","city1-2")),2) occurs(action(("load-truck","package19","truck28","city8-1")),2) occurs(action(("drive-truck","truck5","city6-2","city6-1","city6")),3) occurs(action(("fly-airplane","plane1","city1-2","city6-2")),3) occurs(action(("fly-airplane","plane3","city7-2","city5-2")),3) occurs(action(("fly-airplane","plane4","city4-2","city1-2")),3) occurs(action(("drive-truck","truck28","city8-1","city8-2","city8")),3) occurs(action(("unload-truck","package1","truck19","city1-2")),3) occurs(action(("unload-truck","package18","truck13","city5-2")),3) occurs(action(("fly-airplane","plane2","city1-2","city7-2")),3) occurs(action(("unload-truck","package7","truck19","city1-2")),3) occurs(action(("drive-truck","truck11","city6-1","city6-2","city6")),3) occurs(action(("drive-truck","truck21","city1-2","city1-1","city1")),3) occurs(action(("drive-truck","truck8","city1-2","city1-1","city1")),3) occurs(action(("drive-truck","truck18","city2-2","city2-1","city2")),3) occurs(action(("drive-truck","truck2","city2-2","city2-1","city2")),3) occurs(action(("drive-truck","truck10","city2-1","city2-2","city2")),3) occurs(action(("drive-truck","truck9","city2-1","city2-2","city2")),3) occurs(action(("drive-truck","truck2
Solving Time: 0.48s
Memory: 147MB (+14MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 2.895s (Solving: 0.65s 1st Model: 0.46s Unsat: 0.19s)
CPU Time : 2.830s
Choices : 28003
Conflicts : 1158 (Analyzed: 1157)
Restarts : 14 (Average: 82.64 Last: 60)
Model-Level : 840.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 1157 (Deleted: 0)
Binary : 68 (Ratio: 5.88%)
Ternary : 100 (Ratio: 8.64%)
Conflict : 1157 (Average Length: 21.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1157 (Average: 24.82 Max: 608 Sum: 28720)
Executed : 1043 (Average: 23.49 Max: 608 Sum: 27178 Ratio: 94.63%)
Bounded : 114 (Average: 13.53 Max: 17 Sum: 1542 Ratio: 5.37%)
Rules : 59328
Atoms : 59328
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 84304 (Eliminated: 0 Frozen: 66416)
Constraints : 366307 (Binary: 93.4% Ternary: 5.0% Other: 1.6%)
Memory Peak : 147MB
Max. Length : 15 steps
Sol. Length : 15 steps