Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516973517
details
property
value
status
complete
benchmark
size-12-alpha-3-num-472.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
6.35631608963 seconds
cpu usage
23.574269375
max memory
3.898343424E9
stage attributes
key
value
output-size
107521
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 }, it remains to prove termination of the 3-rule system { 0 0 ⟶ , 1 1 ⟶ 2 2 2 , 1 2 ⟶ 0 1 1 } Applying the dependency pairs transformation. Here, ↑ marks so-called defined symbols. After renaming modulo the bijection { (1,↑) ↦ 0, (2,↓) ↦ 1, (0,↑) ↦ 2, (1,↓) ↦ 3, (0,↓) ↦ 4 }, it remains to prove termination of the 6-rule system { 0 1 ⟶ 2 3 3 , 0 1 ⟶ 0 3 , 0 1 ⟶ 0 , 4 4 →= , 3 3 →= 1 1 1 , 3 1 →= 4 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, 1 ↦ 1, 3 ↦ 2, 4 ↦ 3 }, it remains to prove termination of the 5-rule system { 0 1 ⟶ 0 2 , 0 1 ⟶ 0 , 3 3 →= , 2 2 →= 1 1 1 , 2 1 →= 3 2 2 } Applying sparse tiling TROC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (4,0) ↦ 0, (0,1) ↦ 1, (1,1) ↦ 2, (0,2) ↦ 3, (2,1) ↦ 4, (1,2) ↦ 5, (2,2) ↦ 6, (1,3) ↦ 7, (2,3) ↦ 8, (1,5) ↦ 9, (2,5) ↦ 10, (0,3) ↦ 11, (0,5) ↦ 12, (3,3) ↦ 13, (3,1) ↦ 14, (3,2) ↦ 15, (4,3) ↦ 16, (4,1) ↦ 17, (4,2) ↦ 18 }, it remains to prove termination of the 63-rule system { 0 1 2 ⟶ 0 3 4 , 0 1 5 ⟶ 0 3 6 , 0 1 7 ⟶ 0 3 8 , 0 1 9 ⟶ 0 3 10 , 0 1 2 ⟶ 0 1 , 0 1 5 ⟶ 0 3 , 0 1 7 ⟶ 0 11 , 0 1 9 ⟶ 0 12 , 11 13 14 →= 1 , 11 13 15 →= 3 , 11 13 13 →= 11 , 7 13 14 →= 2 , 7 13 15 →= 5 , 7 13 13 →= 7 , 8 13 14 →= 4 , 8 13 15 →= 6 , 8 13 13 →= 8 , 13 13 14 →= 14 , 13 13 15 →= 15 , 13 13 13 →= 13 , 16 13 14 →= 17 , 16 13 15 →= 18 , 16 13 13 →= 16 , 3 6 4 →= 1 2 2 2 , 3 6 6 →= 1 2 2 5 , 3 6 8 →= 1 2 2 7 , 3 6 10 →= 1 2 2 9 , 5 6 4 →= 2 2 2 2 , 5 6 6 →= 2 2 2 5 , 5 6 8 →= 2 2 2 7 , 5 6 10 →= 2 2 2 9 , 6 6 4 →= 4 2 2 2 , 6 6 6 →= 4 2 2 5 , 6 6 8 →= 4 2 2 7 , 6 6 10 →= 4 2 2 9 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard