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