1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-1998_logistics-round-1-strips_9.out

148 lines
19 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.040s CPU, 0.037s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.015s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock]
Preparing model... [0.040s CPU, 0.037s wall-clock]
Generated 51 rules.
Computing model... [1.100s CPU, 1.106s wall-clock]
8409 relevant atoms
5767 auxiliary atoms
14176 final queue length
19412 total queue pushes
Completing instantiation... [1.630s CPU, 1.632s wall-clock]
Instantiating: [2.830s CPU, 2.833s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.030s CPU, 0.024s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.140s CPU, 0.137s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.009s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.030s CPU, 0.025s wall-clock]
Building translation key... [0.010s CPU, 0.017s wall-clock]
Computing fact groups: [0.310s CPU, 0.313s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.008s wall-clock]
Building dictionary for full mutex groups... [0.060s CPU, 0.062s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.070s CPU, 0.070s wall-clock]
Translating task: [1.290s CPU, 1.290s 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.780s CPU, 0.784s 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.170s CPU, 0.170s 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: 55244 KB
Writing output... [0.510s CPU, 0.559s wall-clock]
Done! [6.070s CPU, 6.127s wall-clock]
planner.py version 0.0.1
Time: 0.97s
Memory: 113MB
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: 113MB (+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.30s
Memory: 113MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 118MB (+5MB)
UNSAT
Iteration Time: 0.53s
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.34s
Memory: 135MB (+17MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 155MB (+20MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.76s
Memory: 155MB (+0MB)
Answer: 1
occurs(action(("drive-truck","truck6","city2-6","city2-4","city2")),1) occurs(action(("fly-airplane","plane2","city7-6","city9-6")),1) occurs(action(("drive-truck","truck26","city9-1","city9-6","city9")),1) occurs(action(("drive-truck","truck7","city9-1","city9-6","city9")),1) occurs(action(("drive-truck","truck23","city6-1","city6-6","city6")),1) occurs(action(("drive-truck","truck21","city4-2","city4-6","city4")),1) occurs(action(("drive-truck","truck3","city4-1","city4-6","city4")),1) occurs(action(("drive-truck","truck4","city4-1","city4-5","city4")),1) occurs(action(("drive-truck","truck22","city5-2","city5-6","city5")),1) occurs(action(("drive-truck","truck27","city10-2","city10-6","city10")),1) occurs(action(("fly-airplane","plane1","city10-6","city11-6")),1) occurs(action(("fly-airplane","plane3","city6-6","city5-6")),1) occurs(action(("fly-airplane","plane4","city5-6","city2-6")),1) occurs(action(("drive-truck","truck19","city2-1","city2-6","city2")),1) occurs(action(("load-airplane","package1","plane3","city6-6")),1) occurs(action(("drive-truck","truck1","city1-5","city1-2","city1")),1) occurs(action(("drive-truck","truck14","city11-6","city11-5","city11")),1) occurs(action(("load-truck","package11","truck26","city9-1")),1) occurs(action(("load-truck","package6","truck3","city4-1")),1) occurs(action(("unload-airplane","package1","plane3","city5-6")),2) occurs(action(("drive-truck","truck4","city4-5","city4-6","city4")),2) occurs(action(("fly-airplane","plane3","city5-6","city4-6")),2) occurs(action(("drive-truck","truck8","city2-5","city2-1","city2")),2) occurs(action(("drive-truck","truck6","city2-4","city2-6","city2")),2) occurs(action(("drive-truck","truck26","city9-6","city9-1","city9")),2) occurs(action(("drive-truck","truck1","city1-2","city1-6","city1")),2) occurs(action(("load-truck","package7","truck6","city2-4")),2) occurs(action(("drive-truck","truck3","city4-6","city4-1","city4")),2) occurs(action(("unload-truck","package11","truck26","city9-6")),2) occurs(action(("unload-truck","package6","truck3","city4-6")),2) occurs(action(("drive-truck","truck17","city7-3","city7-2","city7")),2) occurs(action(("drive-truck","truck24","city7-5","city7-2","city7")),2) occurs(action(("load-truck","package12","truck1","city1-2")),2) occurs(action(("load-truck","package3","truck4","city4-5")),2) occurs(action(("load-truck","package8","truck14","city11-5")),2) occurs(action(("drive-truck","truck14","city11-5","city11-6","city11")),2) occurs(action(("load-truck","package1","truck22","city5-6")),3) occurs(action(("fly-airplane","plane2","city9-6","city4-6")),3) occurs(action(("unload-truck","package7","truck6","city2-6")),3) occurs(action(("drive-truck","truck13","city9-6","city9-3","city9")),3) occurs(action(("drive-truck","truck26","city9-1","city9-3","city9")),3) occurs(action(("drive-truck","truck6","city2-6","city2-2","city2")),3) occurs(action(("load-airplane","package11","plane2","city9-6")),3) occurs(action(("drive-truck","truck10","city1-1","city1-6","city1")),3) occurs(action(("drive-truck","truck18","city1-1","city1-6","city1")),3) occurs(action(("drive-truck","truck28","city11-2","city11-6","city11")),3) occurs(action(("drive-truck","truck20","city3-3","city3-6","city3")),3) occurs(action(("drive-truck","truck17","city7-2","city7-6","city7")),3) occurs(action(("drive-truck","truck24","city7-2","city7-6","city7")),3) occurs(action(("drive-truck","truck4","city4-6","city4-1","city4")),3) occurs(action(("unload-truck","package12","truck1","city1-6")),3) occurs(action(("unload-truck","package3","truck4","city4-6")),3) occurs(action(("unload-truck","package8","truck14","city11-6")),3) occurs(action(("drive-truck","truck2","city8-2","city8-1","city8")),4) occurs(action(("load-airplane","package7","plane4","city2-6")),4) occurs(action(("fly-airplane","plane4","city2-6","city9-6")),4) occurs(action(("drive-truck","truck16","city6-3","city6-6","city6")),4) occurs(action(("drive-truck","truck3","city4-1","city4-4","city4")),4) occurs(action(("drive-truck","truck4","city4-1","city4-4","city4")),4) occurs(action(("unl
SATISFIABLE
Models : 1+
Calls : 3
Time : 2.127s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 2.092s
Choices : 1655 (Domain: 1475)
Conflicts : 9 (Analyzed: 9)
Restarts : 0
Model-Level : 1613.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 9 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 9 (Average Length: 20.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9 (Average: 6.00 Max: 44 Sum: 54)
Executed : 9 (Average: 6.00 Max: 44 Sum: 54 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 84771
Atoms : 84771
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 69989 (Eliminated: 0 Frozen: 9067)
Constraints : 215264 (Binary: 93.6% Ternary: 3.4% Other: 3.0%)
Memory Peak : 190MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1