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

143 lines
8.1 KiB
Plaintext

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-2.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-2.pddl
Parsing...
Parsing: [0.020s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.010s CPU, 0.016s wall-clock]
Generated 51 rules.
Computing model... [0.200s CPU, 0.189s wall-clock]
1448 relevant atoms
1112 auxiliary atoms
2560 final queue length
3389 total queue pushes
Completing instantiation... [0.210s CPU, 0.217s wall-clock]
Instantiating: [0.460s CPU, 0.455s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.012s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.021s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.050s CPU, 0.054s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.009s wall-clock]
Translating task: [0.170s CPU, 0.172s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
19 propositions removed
Detecting unreachable propositions: [0.100s CPU, 0.097s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 19 mutex groups necessary.
980 of 980 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.023s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 230
Translator goal facts: 5
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 980
Translator axioms: 0
Translator task size: 3794
Translator peak memory: 35928 KB
Writing output... [0.070s CPU, 0.082s wall-clock]
Done! [0.910s CPU, 0.915s wall-clock]
planner.py version 0.0.1
Time: 0.17s
Memory: 54MB
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: 54MB (+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.07s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+2MB)
UNSAT
Iteration Time: 0.09s
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.06s
Memory: 61MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),1) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),1) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),1) occurs(action(("fly-airplane","plane1","city6-2","city10-2")),1) occurs(action(("fly-airplane","plane3","city7-2","city1-2")),1) occurs(action(("fly-airplane","plane4","city3-2","city2-2")),1) occurs(action(("load-truck","package2","truck10","city10-1")),1) occurs(action(("load-airplane","package3","plane2","city3-2")),1) occurs(action(("drive-truck","truck9","city9-1","city9-2","city9")),2) occurs(action(("load-airplane","package5","plane3","city1-2")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),2) occurs(action(("load-airplane","package1","plane4","city2-2")),2) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),2) occurs(action(("fly-airplane","plane3","city1-2","city4-2")),3) occurs(action(("unload-truck","package2","truck10","city10-2")),3) occurs(action(("unload-airplane","package3","plane2","city1-2")),3) occurs(action(("fly-airplane","plane4","city2-2","city3-2")),3) occurs(action(("unload-airplane","package5","plane3","city4-2")),4) occurs(action(("load-airplane","package2","plane1","city10-2")),4) occurs(action(("load-truck","package3","truck1","city1-2")),4) occurs(action(("unload-airplane","package1","plane4","city3-2")),4) occurs(action(("fly-airplane","plane2","city1-2","city7-2")),4) occurs(action(("load-truck","package1","truck3","city3-2")),5) occurs(action(("fly-airplane","plane1","city10-2","city9-2")),5) occurs(action(("load-airplane","package4","plane2","city7-2")),5) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),5) occurs(action(("unload-airplane","package2","plane1","city9-2")),6) occurs(action(("unload-truck","package3","truck1","city1-1")),6) occurs(action(("fly-airplane","plane2","city7-2","city6-2")),6) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),6) occurs(action(("unload-truck","package1","truck3","city3-1")),7) occurs(action(("unload-airplane","package4","plane2","city6-2")),7) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),7) occurs(action(("drive-truck","truck10","city10-2","city10-1","city10")),7) occurs(action(("load-truck","package4","truck6","city6-2")),8) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),8) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),8) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),8) occurs(action(("drive-truck","truck2","city2-2","city2-1","city2")),8) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),9) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),9) occurs(action(("unload-truck","package4","truck6","city6-1")),10) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),10) occurs(action(("drive-truck","truck2","city2-1","city2-2","city2")),10)
Solving Time: 0.01s
Memory: 64MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.377s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.360s
Choices : 502 (Domain: 474)
Conflicts : 30 (Analyzed: 29)
Restarts : 0
Model-Level : 183.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 29 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 1 (Ratio: 3.45%)
Conflict : 29 (Average Length: 9.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 29 (Average: 18.45 Max: 100 Sum: 535)
Executed : 12 (Average: 11.41 Max: 100 Sum: 331 Ratio: 61.87%)
Bounded : 17 (Average: 12.00 Max: 12 Sum: 204 Ratio: 38.13%)
Rules : 13981
Atoms : 13981
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 13154 (Eliminated: 0 Frozen: 10685)
Constraints : 59207 (Binary: 94.3% Ternary: 3.6% Other: 2.1%)
Memory Peak : 64MB
Max. Length : 10 steps
Sol. Length : 10 steps