Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516973823
details
property
value
status
complete
benchmark
size-12-alpha-3-num-451.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n032.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
3.04816699028 seconds
cpu usage
10.186223525
max memory
1.931558912E9
stage attributes
key
value
output-size
80043
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo the bijection { a ↦ 0, b ↦ 1, c ↦ 2 }, it remains to prove termination of the 3-rule system { 0 ⟶ 1 2 , 0 2 1 ⟶ 1 0 0 2 , 1 1 ⟶ } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (0,↑) ↦ 0, (1,↑) ↦ 1, (2,↓) ↦ 2, (1,↓) ↦ 3, (0,↓) ↦ 4 }, it remains to prove termination of the 7-rule system { 0 ⟶ 1 2 , 0 2 3 ⟶ 1 4 4 2 , 0 2 3 ⟶ 0 4 2 , 0 2 3 ⟶ 0 2 , 4 →= 3 2 , 4 2 3 →= 3 4 4 2 , 3 3 →= } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 1 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 2 ↦ 1, 3 ↦ 2, 4 ↦ 3 }, it remains to prove termination of the 5-rule system { 0 1 2 ⟶ 0 3 1 , 0 1 2 ⟶ 0 1 , 3 →= 2 1 , 3 1 2 →= 2 3 3 1 , 2 2 →= } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (4,0) ↦ 0, (0,1) ↦ 1, (1,2) ↦ 2, (2,1) ↦ 3, (0,3) ↦ 4, (3,1) ↦ 5, (1,1) ↦ 6, (2,2) ↦ 7, (2,3) ↦ 8, (1,3) ↦ 9, (0,2) ↦ 10, (3,2) ↦ 11, (3,3) ↦ 12, (4,3) ↦ 13, (4,2) ↦ 14, (4,1) ↦ 15 }, it remains to prove termination of the 51-rule system { 0 1 2 3 ⟶ 0 4 5 6 , 0 1 2 7 ⟶ 0 4 5 2 , 0 1 2 8 ⟶ 0 4 5 9 , 0 1 2 3 ⟶ 0 1 6 , 0 1 2 7 ⟶ 0 1 2 , 0 1 2 8 ⟶ 0 1 9 , 4 5 →= 10 3 6 , 4 11 →= 10 3 2 , 4 12 →= 10 3 9 , 9 5 →= 2 3 6 , 9 11 →= 2 3 2 , 9 12 →= 2 3 9 , 8 5 →= 7 3 6 , 8 11 →= 7 3 2 , 8 12 →= 7 3 9 , 12 5 →= 11 3 6 , 12 11 →= 11 3 2 , 12 12 →= 11 3 9 , 13 5 →= 14 3 6 , 13 11 →= 14 3 2 , 13 12 →= 14 3 9 , 4 5 2 3 →= 10 8 12 5 6 , 4 5 2 7 →= 10 8 12 5 2 , 4 5 2 8 →= 10 8 12 5 9 , 9 5 2 3 →= 2 8 12 5 6 , 9 5 2 7 →= 2 8 12 5 2 , 9 5 2 8 →= 2 8 12 5 9 , 8 5 2 3 →= 7 8 12 5 6 , 8 5 2 7 →= 7 8 12 5 2 , 8 5 2 8 →= 7 8 12 5 9 , 12 5 2 3 →= 11 8 12 5 6 , 12 5 2 7 →= 11 8 12 5 2 , 12 5 2 8 →= 11 8 12 5 9 , 13 5 2 3 →= 14 8 12 5 6 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard