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

148 lines
23 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-24.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-24.pddl
Parsing...
Parsing: [0.040s CPU, 0.042s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.019s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock]
Preparing model... [0.050s CPU, 0.050s wall-clock]
Generated 51 rules.
Computing model... [2.800s CPU, 2.791s wall-clock]
27542 relevant atoms
10945 auxiliary atoms
38487 final queue length
60234 total queue pushes
Completing instantiation... [6.490s CPU, 6.489s wall-clock]
Instantiating: [9.420s CPU, 9.413s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.060s CPU, 0.062s wall-clock]
Checking invariant weight... [0.010s CPU, 0.006s wall-clock]
Instantiating groups... [0.340s CPU, 0.350s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.016s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.060s CPU, 0.050s wall-clock]
Building translation key... [0.030s CPU, 0.030s wall-clock]
Computing fact groups: [0.690s CPU, 0.696s wall-clock]
Building STRIPS to SAS dictionary... [0.020s CPU, 0.014s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.014s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.017s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.250s CPU, 0.246s wall-clock]
Translating task: [5.000s CPU, 5.000s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
73 propositions removed
Detecting unreachable propositions: [2.760s CPU, 2.755s wall-clock]
Reordering and filtering variables...
66 of 73 variables necessary.
0 of 73 mutex groups necessary.
13464 of 23544 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.490s CPU, 0.489s wall-clock]
Translator variables: 66
Translator derived variables: 0
Translator facts: 1400
Translator goal facts: 4
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 13464
Translator axioms: 0
Translator task size: 47622
Translator peak memory: 102988 KB
Writing output... [1.010s CPU, 1.115s wall-clock]
Done! [19.650s CPU, 19.740s wall-clock]
planner.py version 0.0.1
Time: 1.90s
Memory: 176MB
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: 176MB (+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.69s
Memory: 176MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 193MB (+17MB)
UNSAT
Iteration Time: 1.31s
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.75s
Memory: 230MB (+37MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 262MB (+32MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.49s
Memory: 262MB (+0MB)
Answer: 1
occurs(action(("drive-truck","truck20","city8-6","city8-12","city8")),1) occurs(action(("drive-truck","truck14","city3-3","city3-12","city3")),1) occurs(action(("drive-truck","truck2","city1-5","city1-12","city1")),1) occurs(action(("fly-airplane","plane1","city6-12","city1-12")),1) occurs(action(("fly-airplane","plane2","city7-12","city2-12")),1) occurs(action(("fly-airplane","plane5","city3-12","city5-12")),1) occurs(action(("load-truck","package10","truck37","city2-5")),1) occurs(action(("load-truck","package11","truck45","city5-4")),1) occurs(action(("load-truck","package8","truck2","city1-5")),1) occurs(action(("drive-truck","truck37","city2-5","city2-12","city2")),1) occurs(action(("drive-truck","truck45","city5-4","city5-12","city5")),1) occurs(action(("drive-truck","truck10","city6-7","city6-5","city6")),1) occurs(action(("drive-truck","truck2","city1-12","city1-5","city1")),2) occurs(action(("unload-truck","package10","truck37","city2-12")),2) occurs(action(("unload-truck","package11","truck45","city5-12")),2) occurs(action(("unload-truck","package8","truck2","city1-12")),2) occurs(action(("fly-airplane","plane6","city9-12","city6-12")),2) occurs(action(("fly-airplane","plane7","city6-12","city2-12")),2) occurs(action(("load-truck","package9","truck10","city6-5")),2) occurs(action(("drive-truck","truck10","city6-5","city6-12","city6")),2) occurs(action(("drive-truck","truck54","city9-4","city9-9","city9")),2) occurs(action(("drive-truck","truck45","city5-12","city5-4","city5")),2) occurs(action(("drive-truck","truck37","city2-12","city2-5","city2")),2) occurs(action(("drive-truck","truck46","city1-9","city1-7","city1")),3) occurs(action(("load-airplane","package10","plane2","city2-12")),3) occurs(action(("load-airplane","package11","plane5","city5-12")),3) occurs(action(("fly-airplane","plane5","city5-12","city8-12")),3) occurs(action(("load-airplane","package8","plane1","city1-12")),3) occurs(action(("fly-airplane","plane1","city1-12","city3-12")),3) occurs(action(("fly-airplane","plane2","city2-12","city3-12")),3) occurs(action(("fly-airplane","plane3","city2-12","city9-12")),3) occurs(action(("unload-truck","package9","truck10","city6-12")),3) occurs(action(("drive-truck","truck54","city9-9","city9-4","city9")),3) occurs(action(("drive-truck","truck10","city6-12","city6-7","city6")),3) occurs(action(("unload-airplane","package10","plane2","city3-12")),4) occurs(action(("unload-airplane","package11","plane5","city8-12")),4) occurs(action(("drive-truck","truck53","city8-5","city8-11","city8")),4) occurs(action(("drive-truck","truck28","city3-3","city3-11","city3")),4) occurs(action(("drive-truck","truck31","city3-3","city3-7","city3")),4) occurs(action(("drive-truck","truck42","city3-2","city3-11","city3")),4) occurs(action(("unload-airplane","package8","plane1","city3-12")),4) occurs(action(("drive-truck","truck19","city1-4","city1-2","city1")),4) occurs(action(("drive-truck","truck2","city1-5","city1-2","city1")),4) occurs(action(("drive-truck","truck23","city1-1","city1-7","city1")),4) occurs(action(("drive-truck","truck32","city1-2","city1-3","city1")),4) occurs(action(("drive-truck","truck34","city1-11","city1-5","city1")),4) occurs(action(("drive-truck","truck35","city1-3","city1-1","city1")),4) occurs(action(("drive-truck","truck46","city1-7","city1-1","city1")),4) occurs(action(("drive-truck","truck8","city1-1","city1-7","city1")),4) occurs(action(("fly-airplane","plane4","city9-12","city8-12")),4) occurs(action(("fly-airplane","plane2","city3-12","city1-12")),4) occurs(action(("load-airplane","package9","plane8","city6-12")),4) occurs(action(("fly-airplane","plane8","city6-12","city1-12")),4) occurs(action(("fly-airplane","plane1","city3-12","city9-12")),4) occurs(action(("fly-airplane","plane5","city8-12","city3-12")),4) occurs(action(("drive-truck","truck37","city2-5","city2-12","city2")),4) occurs(action(("drive-truck","truck7","city4-3","city4-12","city4")),4) occurs(action(("drive-truck","truck51","city6-1","city6-12","city6")),4) occurs(action(("drive-truck","truck1","city9-7","city9-12","city9"
SATISFIABLE
Models : 1+
Calls : 3
Time : 4.636s (Solving: 0.04s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 4.576s
Choices : 6522 (Domain: 5864)
Conflicts : 7 (Analyzed: 7)
Restarts : 0
Model-Level : 6521.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 7 (Deleted: 0)
Binary : 1 (Ratio: 14.29%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 7 (Average Length: 58.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 7 (Average: 1.86 Max: 5 Sum: 13)
Executed : 7 (Average: 1.86 Max: 5 Sum: 13 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 165559
Atoms : 165559
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 146175 (Eliminated: 0 Frozen: 13235)
Constraints : 541907 (Binary: 96.1% Ternary: 1.8% Other: 2.1%)
Memory Peak : 337MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 1