Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516975911
details
property
value
status
complete
benchmark
06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
Zantema_06
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
2.20747995377 seconds
cpu usage
6.965781462
max memory
1.690902528E9
stage attributes
key
value
output-size
40908
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 { b ↦ 0, a ↦ 1, c ↦ 2 }, it remains to prove termination of the 4-rule system { 0 1 0 ⟶ 1 0 1 , 0 0 1 ⟶ 0 0 0 , 2 1 ⟶ 1 0 2 , 2 0 ⟶ 0 1 2 } Applying sparse untiling TRFCU(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1 }, it remains to prove termination of the 2-rule system { 0 1 0 ⟶ 1 0 1 , 0 0 1 ⟶ 0 0 0 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (0,0) ↦ 0, (0,1) ↦ 1, (1,0) ↦ 2, (1,1) ↦ 3, (0,3) ↦ 4, (1,3) ↦ 5, (2,0) ↦ 6, (2,1) ↦ 7 }, it remains to prove termination of the 18-rule system { 0 1 2 0 ⟶ 1 2 1 2 , 0 1 2 1 ⟶ 1 2 1 3 , 0 1 2 4 ⟶ 1 2 1 5 , 2 1 2 0 ⟶ 3 2 1 2 , 2 1 2 1 ⟶ 3 2 1 3 , 2 1 2 4 ⟶ 3 2 1 5 , 6 1 2 0 ⟶ 7 2 1 2 , 6 1 2 1 ⟶ 7 2 1 3 , 6 1 2 4 ⟶ 7 2 1 5 , 0 0 1 2 ⟶ 0 0 0 0 , 0 0 1 3 ⟶ 0 0 0 1 , 0 0 1 5 ⟶ 0 0 0 4 , 2 0 1 2 ⟶ 2 0 0 0 , 2 0 1 3 ⟶ 2 0 0 1 , 2 0 1 5 ⟶ 2 0 0 4 , 6 0 1 2 ⟶ 6 0 0 0 , 6 0 1 3 ⟶ 6 0 0 1 , 6 0 1 5 ⟶ 6 0 0 4 } 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 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 2 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 3 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 4 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 5 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 6 ↦ ⎛ ⎞ ⎜ 1 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ 7 ↦ ⎛ ⎞ ⎜ 1 0 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠ After renaming modulo the bijection { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5, 6 ↦ 6 }, it remains to prove termination of the 15-rule system { 0 1 2 0 ⟶ 1 2 1 2 , 0 1 2 1 ⟶ 1 2 1 3 , 0 1 2 4 ⟶ 1 2 1 5 , 2 1 2 0 ⟶ 3 2 1 2 , 2 1 2 1 ⟶ 3 2 1 3 , 2 1 2 4 ⟶ 3 2 1 5 , 0 0 1 2 ⟶ 0 0 0 0 , 0 0 1 3 ⟶ 0 0 0 1 , 0 0 1 5 ⟶ 0 0 0 4 , 2 0 1 2 ⟶ 2 0 0 0 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard