patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [gc-ta1-tt1 | ipc-1998 | gripper-round-1-strips | 6]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-28 00:41:08 +01:00
parent 4a18e30443
commit 4551d26ea0
3 changed files with 229 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

160
gc-ta1-tt1/ipc-1998_gripper-round-1-strips_6.out Normal file
View File

@@ -0,0 +1,160 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-6.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/gripper-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/gripper-round-1-strips/instances/instance-6.pddl
Parsing...
Parsing: [0.010s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.015s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 24 rules.
Computing model... [0.040s CPU, 0.038s wall-clock]
231 relevant atoms
160 auxiliary atoms
391 final queue length
520 total queue pushes
Completing instantiation... [0.040s CPU, 0.042s wall-clock]
Instantiating: [0.110s CPU, 0.110s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.010s CPU, 0.010s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.002s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.030s CPU, 0.026s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s 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.002s wall-clock]
Translating task: [0.030s CPU, 0.034s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
3 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock]
Reordering and filtering variables...
17 of 17 variables necessary.
14 of 17 mutex groups necessary.
114 of 114 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.008s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 74
Translator goal facts: 14
Translator mutex groups: 14
Translator total mutex groups size: 56
Translator operators: 114
Translator axioms: 0
Translator task size: 783
Translator peak memory: 36556 KB
Writing output... [0.010s CPU, 0.017s wall-clock]
Done! [0.220s CPU, 0.233s wall-clock]
planner.py version 0.0.1
Time: 0.03s
Memory: 50MB
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: 51MB (+1MB)
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.01s
Memory: 51MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.03s
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.01s
Memory: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.37s
Memory: 54MB (+1MB)
UNKNOWN
Iteration Time: 0.39s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.01s
Memory: 56MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 56MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.02s
Memory: 57MB (+1MB)
Answer: 1
occurs(action(("pick","ball13","rooma","right")),1) occurs(action(("pick","ball1","rooma","left")),1) occurs(action(("move","rooma","roomb")),1) occurs(action(("drop","ball13","roomb","right")),2) occurs(action(("drop","ball1","roomb","left")),2) occurs(action(("move","roomb","rooma")),2) occurs(action(("pick","ball11","rooma","right")),3) occurs(action(("pick","ball10","rooma","left")),3) occurs(action(("move","rooma","roomb")),3) occurs(action(("drop","ball11","roomb","right")),4) occurs(action(("drop","ball10","roomb","left")),4) occurs(action(("move","roomb","rooma")),4) occurs(action(("pick","ball2","rooma","left")),5) occurs(action(("pick","ball12","rooma","right")),5) occurs(action(("move","rooma","roomb")),5) occurs(action(("drop","ball2","roomb","left")),6) occurs(action(("drop","ball12","roomb","right")),6) occurs(action(("move","roomb","rooma")),6) occurs(action(("pick","ball4","rooma","left")),7) occurs(action(("pick","ball14","rooma","right")),7) occurs(action(("move","rooma","roomb")),7) occurs(action(("drop","ball4","roomb","left")),8) occurs(action(("drop","ball14","roomb","right")),8) occurs(action(("move","roomb","rooma")),8) occurs(action(("pick","ball9","rooma","left")),9) occurs(action(("pick","ball8","rooma","right")),9) occurs(action(("move","rooma","roomb")),9) occurs(action(("drop","ball9","roomb","left")),10) occurs(action(("drop","ball8","roomb","right")),10) occurs(action(("move","roomb","rooma")),10) occurs(action(("pick","ball5","rooma","left")),11) occurs(action(("pick","ball3","rooma","right")),11) occurs(action(("move","rooma","roomb")),11) occurs(action(("drop","ball5","roomb","left")),12) occurs(action(("drop","ball3","roomb","right")),12) occurs(action(("move","roomb","rooma")),12) occurs(action(("pick","ball7","rooma","left")),13) occurs(action(("pick","ball6","rooma","right")),13) occurs(action(("move","rooma","roomb")),13) occurs(action(("drop","ball7","roomb","left")),14) occurs(action(("drop","ball6","roomb","right")),14) occurs(action(("move","roomb","rooma")),15)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.477s (Solving: 0.38s 1st Model: 0.00s Unsat: 0.01s)
CPU Time : 0.472s
Choices : 21594 (Domain: 21594)
Conflicts : 8702 (Analyzed: 8701)
Restarts : 106 (Average: 82.08 Last: 93)
Model-Level : 158.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 8701 (Deleted: 4763)
Binary : 10 (Ratio: 0.11%)
Ternary : 20 (Ratio: 0.23%)
Conflict : 8701 (Average Length: 78.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 8701 (Average: 1.80 Max: 34 Sum: 15697)
Executed : 8699 (Average: 1.80 Max: 34 Sum: 15695 Ratio: 99.99%)
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.01%)
Rules : 2434
Atoms : 2434
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 4045 (Eliminated: 0 Frozen: 450)
Constraints : 17400 (Binary: 86.9% Ternary: 11.5% Other: 1.6%)
Memory Peak : 57MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 1