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

143 lines
8.2 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-32.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-32.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.037s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 51 rules.
Computing model... [0.080s CPU, 0.079s wall-clock]
336 relevant atoms
369 auxiliary atoms
705 final queue length
820 total queue pushes
Completing instantiation... [0.040s CPU, 0.050s wall-clock]
Instantiating: [0.180s CPU, 0.188s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.010s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.006s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.002s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.024s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.030s CPU, 0.033s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock]
Reordering and filtering variables...
10 of 12 variables necessary.
0 of 12 mutex groups necessary.
108 of 168 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.004s wall-clock]
Translator variables: 10
Translator derived variables: 0
Translator facts: 54
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 108
Translator axioms: 0
Translator task size: 481
Translator peak memory: 33368 KB
Writing output... [0.010s CPU, 0.012s wall-clock]
Done! [0.300s CPU, 0.308s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 47MB
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: 47MB (+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.03s
Memory: 49MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+2MB)
UNSAT
Iteration Time: 0.04s
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.03s
Memory: 52MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),1) occurs(action(("drive-truck","truck6","city3-1","city3-2","city3")),1) occurs(action(("drive-truck","truck5","city2-1","city2-2","city2")),1) occurs(action(("fly-airplane","plane1","city3-2","city1-2")),1) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),1) occurs(action(("load-airplane","package4","plane1","city1-2")),1) occurs(action(("drive-truck","truck4","city1-1","city1-2","city1")),1) occurs(action(("load-truck","package5","truck1","city2-1")),1) occurs(action(("drive-truck","truck2","city1-2","city1-1","city1")),1) occurs(action(("unload-airplane","package4","plane1","city2-2")),2) occurs(action(("unload-truck","package5","truck1","city2-2")),2) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),2) occurs(action(("drive-truck","truck1","city2-1","city2-2","city2")),2) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),2) occurs(action(("drive-truck","truck4","city1-2","city1-1","city1")),2) occurs(action(("load-truck","package3","truck4","city1-1")),2) occurs(action(("drive-truck","truck2","city1-1","city1-2","city1")),2) occurs(action(("load-airplane","package5","plane1","city2-2")),3) occurs(action(("drive-truck","truck4","city1-1","city1-2","city1")),3) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),3) occurs(action(("unload-truck","package3","truck4","city1-2")),3) occurs(action(("fly-airplane","plane1","city3-2","city1-2")),4) occurs(action(("load-airplane","package3","plane1","city1-2")),4) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),5) occurs(action(("load-airplane","package4","plane1","city2-2")),5) occurs(action(("unload-airplane","package3","plane1","city2-2")),6) occurs(action(("unload-airplane","package4","plane1","city2-2")),6) occurs(action(("unload-airplane","package5","plane1","city1-2")),6) occurs(action(("fly-airplane","plane1","city2-2","city1-2")),6) occurs(action(("drive-truck","truck5","city2-2","city2-1","city2")),6) occurs(action(("load-truck","package3","truck5","city2-2")),7) occurs(action(("load-truck","package4","truck1","city2-2")),7) occurs(action(("load-airplane","package5","plane1","city1-2")),7) occurs(action(("drive-truck","truck5","city2-1","city2-2","city2")),7) occurs(action(("fly-airplane","plane1","city1-2","city3-2")),7) occurs(action(("unload-truck","package4","truck1","city2-1")),8) occurs(action(("unload-airplane","package5","plane1","city3-2")),8) occurs(action(("drive-truck","truck1","city2-2","city2-1","city2")),8) occurs(action(("drive-truck","truck5","city2-2","city2-1","city2")),8) occurs(action(("load-truck","package4","truck1","city2-1")),9) occurs(action(("load-truck","package5","truck3","city3-2")),9) occurs(action(("fly-airplane","plane1","city3-2","city1-2")),9) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),9) occurs(action(("unload-truck","package3","truck5","city2-1")),10) occurs(action(("unload-truck","package4","truck1","city2-1")),10) occurs(action(("unload-truck","package5","truck3","city3-2")),10) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),10)
Solving Time: 0.01s
Memory: 53MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.140s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.130s
Choices : 1027
Conflicts : 178 (Analyzed: 177)
Restarts : 1 (Average: 177.00 Last: 73)
Model-Level : 144.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 286 (Deleted: 0)
Binary : 66 (Ratio: 23.08%)
Ternary : 54 (Ratio: 18.88%)
Conflict : 177 (Average Length: 3.9 Ratio: 61.89%)
Loop : 109 (Average Length: 7.5 Ratio: 38.11%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 177 (Average: 6.36 Max: 64 Sum: 1125)
Executed : 144 (Average: 5.06 Max: 64 Sum: 895 Ratio: 79.56%)
Bounded : 33 (Average: 6.97 Max: 12 Sum: 230 Ratio: 20.44%)
Rules : 7008
Atoms : 7008
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 7920 (Eliminated: 0 Frozen: 6446)
Constraints : 16052 (Binary: 79.9% Ternary: 17.3% Other: 2.9%)
Memory Peak : 54MB
Max. Length : 10 steps
Sol. Length : 10 steps