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

156 lines
13 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-15.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-15.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.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 51 rules.
Computing model... [0.460s CPU, 0.455s wall-clock]
3520 relevant atoms
2762 auxiliary atoms
6282 final queue length
8165 total queue pushes
Completing instantiation... [0.570s CPU, 0.569s wall-clock]
Instantiating: [1.080s CPU, 1.080s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.014s wall-clock]
Checking invariant weight... [0.010s CPU, 0.002s wall-clock]
Instantiating groups... [0.040s CPU, 0.045s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.013s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.120s CPU, 0.120s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.025s wall-clock]
Translating task: [0.490s CPU, 0.487s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
35 propositions removed
Detecting unreachable propositions: [0.250s CPU, 0.257s wall-clock]
Reordering and filtering variables...
26 of 35 variables necessary.
0 of 35 mutex groups necessary.
1620 of 2538 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.054s wall-clock]
Translator variables: 26
Translator derived variables: 0
Translator facts: 471
Translator goal facts: 14
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1620
Translator axioms: 0
Translator task size: 6799
Translator peak memory: 40792 KB
Writing output... [0.120s CPU, 0.137s wall-clock]
Done! [2.170s CPU, 2.190s wall-clock]
planner.py version 0.0.1
Time: 0.26s
Memory: 61MB
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: 61MB (+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.11s
Memory: 63MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 68MB (+5MB)
UNSAT
Iteration Time: 0.16s
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.11s
Memory: 72MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 76MB (+4MB)
UNSAT
Iteration Time: 0.18s
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.12s
Memory: 80MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("fly-airplane","plane2","city1-6","city2-6")),1) occurs(action(("fly-airplane","plane7","city1-6","city2-6")),1) occurs(action(("drive-truck","truck1","city1-6","city1-5","city1")),1) occurs(action(("fly-airplane","plane1","city2-6","city1-6")),1) occurs(action(("drive-truck","truck2","city1-3","city1-6","city1")),1) occurs(action(("drive-truck","truck3","city1-5","city1-6","city1")),1) occurs(action(("fly-airplane","plane6","city2-6","city3-6")),1) occurs(action(("load-airplane","package12","plane4","city1-6")),1) occurs(action(("load-truck","package13","truck5","city3-4")),1) occurs(action(("load-truck","package17","truck4","city2-3")),1) occurs(action(("load-truck","package20","truck4","city2-3")),1) occurs(action(("drive-truck","truck5","city3-4","city3-3","city3")),2) occurs(action(("fly-airplane","plane4","city1-6","city3-6")),2) occurs(action(("drive-truck","truck4","city2-3","city2-4","city2")),2) occurs(action(("load-truck","package23","truck1","city1-5")),2) occurs(action(("unload-airplane","package12","plane4","city3-6")),3) occurs(action(("drive-truck","truck1","city1-5","city1-6","city1")),3) occurs(action(("load-truck","package10","truck5","city3-3")),3) occurs(action(("load-truck","package21","truck4","city2-4")),3) occurs(action(("load-truck","package18","truck5","city3-3")),3) occurs(action(("fly-airplane","plane4","city3-6","city2-6")),4) occurs(action(("drive-truck","truck5","city3-3","city3-6","city3")),4) occurs(action(("drive-truck","truck4","city2-4","city2-1","city2")),4) occurs(action(("unload-truck","package23","truck1","city1-6")),4) occurs(action(("load-truck","package12","truck5","city3-6")),5) occurs(action(("unload-truck","package10","truck5","city3-6")),5) occurs(action(("drive-truck","truck1","city1-6","city1-4","city1")),5) occurs(action(("load-airplane","package23","plane5","city1-6")),5) occurs(action(("unload-truck","package13","truck5","city3-6")),5) occurs(action(("unload-truck","package18","truck5","city3-6")),5) occurs(action(("load-truck","package14","truck4","city2-1")),5) occurs(action(("load-airplane","package10","plane6","city3-6")),6) occurs(action(("fly-airplane","plane5","city1-6","city2-6")),6) occurs(action(("drive-truck","truck5","city3-6","city3-5","city3")),6) occurs(action(("drive-truck","truck4","city2-1","city2-2","city2")),6) occurs(action(("load-truck","package11","truck1","city1-4")),6) occurs(action(("load-airplane","package13","plane3","city3-6")),6) occurs(action(("load-airplane","package18","plane6","city3-6")),6) occurs(action(("fly-airplane","plane3","city3-6","city2-6")),7) occurs(action(("fly-airplane","plane6","city3-6","city1-6")),7) occurs(action(("unload-airplane","package23","plane5","city2-6")),7) occurs(action(("drive-truck","truck1","city1-4","city1-6","city1")),7) occurs(action(("load-truck","package15","truck4","city2-2")),7) occurs(action(("load-truck","package16","truck5","city3-5")),7) occurs(action(("unload-airplane","package10","plane6","city1-6")),8) occurs(action(("drive-truck","truck4","city2-2","city2-6","city2")),8) occurs(action(("unload-truck","package11","truck1","city1-6")),8) occurs(action(("unload-airplane","package13","plane3","city2-6")),8) occurs(action(("drive-truck","truck5","city3-5","city3-6","city3")),8) occurs(action(("unload-airplane","package18","plane6","city1-6")),8) occurs(action(("load-airplane","package11","plane1","city1-6")),9) occurs(action(("load-truck","package13","truck4","city2-6")),9) occurs(action(("load-truck","package18","truck2","city1-6")),9) occurs(action(("load-truck","package23","truck4","city2-6")),9) occurs(action(("fly-airplane","plane6","city1-6","city3-6")),9) occurs(action(("unload-truck","package21","truck4","city2-6")),9) occurs(action(("unload-truck","package14","truck4","city2-6")),9) occurs(action(("unload-truck","package15","truck4","city2-6")),9) occurs(action(("unload-truck","package16","truck5","city3-6")),9) occurs(action(("unload-truck","package17","truck4","city2-6")),9) occurs(action(("unload-truck","package20","truck4","city2-6")),9) occurs(action(("drive-truck"
Solving Time: 0.15s
Memory: 86MB (+6MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.941s (Solving: 0.14s 1st Model: 0.14s Unsat: 0.00s)
CPU Time : 0.920s
Choices : 11573 (Domain: 11557)
Conflicts : 612 (Analyzed: 611)
Restarts : 6 (Average: 101.83 Last: 24)
Model-Level : 373.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 611 (Deleted: 0)
Binary : 19 (Ratio: 3.11%)
Ternary : 13 (Ratio: 2.13%)
Conflict : 611 (Average Length: 68.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 611 (Average: 19.32 Max: 261 Sum: 11807)
Executed : 564 (Average: 18.33 Max: 261 Sum: 11199 Ratio: 94.85%)
Bounded : 47 (Average: 12.94 Max: 17 Sum: 608 Ratio: 5.15%)
Rules : 24062
Atoms : 24062
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 34490 (Eliminated: 0 Frozen: 25924)
Constraints : 144959 (Binary: 92.5% Ternary: 4.6% Other: 2.9%)
Memory Peak : 86MB
Max. Length : 15 steps
Sol. Length : 15 steps