Add benchmark result [gc-ta1-tt1 | ipc-1998 | logistics-round-1-strips | 5]
This commit is contained in:
147
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_5.out
Normal file
147
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_5.out
Normal file
@@ -0,0 +1,147 @@
|
||||
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-5.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-5.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.006s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||||
Generated 51 rules.
|
||||
Computing model... [0.140s CPU, 0.143s wall-clock]
|
||||
681 relevant atoms
|
||||
780 auxiliary atoms
|
||||
1461 final queue length
|
||||
1699 total queue pushes
|
||||
Completing instantiation... [0.090s CPU, 0.090s wall-clock]
|
||||
Instantiating: [0.290s CPU, 0.291s 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.020s CPU, 0.018s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.050s CPU, 0.044s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.000s CPU, 0.004s wall-clock]
|
||||
Translating task: [0.070s CPU, 0.072s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
16 propositions removed
|
||||
Detecting unreachable propositions: [0.030s CPU, 0.038s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
16 of 16 variables necessary.
|
||||
0 of 16 mutex groups necessary.
|
||||
342 of 342 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.020s CPU, 0.011s wall-clock]
|
||||
Translator variables: 16
|
||||
Translator derived variables: 0
|
||||
Translator facts: 151
|
||||
Translator goal facts: 4
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 342
|
||||
Translator axioms: 0
|
||||
Translator task size: 1445
|
||||
Translator peak memory: 37324 KB
|
||||
Writing output... [0.030s CPU, 0.033s wall-clock]
|
||||
Done! [0.510s CPU, 0.521s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.07s
|
||||
Memory: 52MB
|
||||
|
||||
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: 52MB (+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.02s
|
||||
Memory: 53MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 54MB (+1MB)
|
||||
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.02s
|
||||
Memory: 56MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 56MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.04s
|
||||
Memory: 56MB (+0MB)
|
||||
Answer: 1
|
||||
occurs(action(("drive-truck","truck11","city9-1","city9-2","city9")),1) occurs(action(("drive-truck","truck5","city3-1","city3-2","city3")),1) occurs(action(("load-airplane","package2","plane1","city8-2")),1) occurs(action(("load-truck","package3","truck11","city9-1")),1) occurs(action(("load-truck","package4","truck10","city8-1")),1) occurs(action(("drive-truck","truck10","city8-1","city8-2","city8")),1) occurs(action(("drive-truck","truck4","city2-1","city2-2","city2")),2) occurs(action(("unload-truck","package3","truck11","city9-2")),2) occurs(action(("unload-truck","package4","truck10","city8-2")),2) occurs(action(("drive-truck","truck11","city9-2","city9-1","city9")),2) occurs(action(("drive-truck","truck3","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck6","city4-1","city4-2","city4")),2) occurs(action(("drive-truck","truck7","city5-1","city5-2","city5")),2) occurs(action(("drive-truck","truck8","city6-1","city6-2","city6")),2) occurs(action(("drive-truck","truck2","city8-1","city8-2","city8")),2) occurs(action(("drive-truck","truck1","city3-2","city3-1","city3")),3) occurs(action(("load-airplane","package4","plane1","city8-2")),3) occurs(action(("fly-airplane","plane1","city8-2","city2-2")),3) occurs(action(("drive-truck","truck4","city2-2","city2-1","city2")),3) occurs(action(("unload-airplane","package4","plane1","city2-2")),4) occurs(action(("fly-airplane","plane1","city2-2","city9-2")),4) occurs(action(("load-airplane","package3","plane1","city9-2")),5) occurs(action(("fly-airplane","plane1","city9-2","city7-2")),5) occurs(action(("drive-truck","truck2","city8-2","city8-1","city8")),5) occurs(action(("drive-truck","truck10","city8-2","city8-1","city8")),5) occurs(action(("unload-airplane","package3","plane1","city7-2")),6) occurs(action(("fly-airplane","plane1","city7-2","city3-2")),6) occurs(action(("unload-airplane","package2","plane1","city3-2")),7) occurs(action(("fly-airplane","plane1","city3-2","city6-2")),7) occurs(action(("drive-truck","truck8","city6-2","city6-1","city6")),7) occurs(action(("drive-truck","truck7","city5-2","city5-1","city5")),7) occurs(action(("drive-truck","truck6","city4-2","city4-1","city4")),7) occurs(action(("drive-truck","truck3","city1-2","city1-1","city1")),7) occurs(action(("load-airplane","package1","plane1","city6-2")),8) occurs(action(("fly-airplane","plane1","city6-2","city9-2")),8) occurs(action(("load-truck","package2","truck5","city3-2")),8) occurs(action(("drive-truck","truck1","city3-1","city3-2","city3")),8) occurs(action(("drive-truck","truck5","city3-2","city3-1","city3")),8) occurs(action(("unload-airplane","package1","plane1","city9-2")),9) occurs(action(("unload-truck","package2","truck5","city3-1")),9) occurs(action(("drive-truck","truck11","city9-1","city9-2","city9")),9) occurs(action(("drive-truck","truck1","city3-2","city3-1","city3")),9) occurs(action(("drive-truck","truck9","city7-1","city7-2","city7")),9) occurs(action(("drive-truck","truck4","city2-1","city2-2","city2")),9) occurs(action(("fly-airplane","plane1","city9-2","city8-2")),9) occurs(action(("drive-truck","truck4","city2-2","city2-1","city2")),10) occurs(action(("drive-truck","truck9","city7-2","city7-1","city7")),10) occurs(action(("drive-truck","truck1","city3-1","city3-2","city3")),10) occurs(action(("drive-truck","truck11","city9-2","city9-1","city9")),10)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.150s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.148s
|
||||
|
||||
Choices : 175 (Domain: 156)
|
||||
Conflicts : 7 (Analyzed: 6)
|
||||
Restarts : 0
|
||||
Model-Level : 174.0
|
||||
Problems : 3 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 6 (Deleted: 0)
|
||||
Binary : 1 (Ratio: 16.67%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 6 (Average Length: 8.3 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 6 (Average: 2.33 Max: 7 Sum: 14)
|
||||
Executed : 5 (Average: 2.17 Max: 7 Sum: 13 Ratio: 92.86%)
|
||||
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 7.14%)
|
||||
|
||||
Rules : 4947
|
||||
Atoms : 4947
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 5663 (Eliminated: 0 Frozen: 1173)
|
||||
Constraints : 15754 (Binary: 89.1% Ternary: 9.3% Other: 1.6%)
|
||||
|
||||
Memory Peak : 58MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
Models : 1
|
||||
|
||||
|
||||
Reference in New Issue
Block a user