Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516969947
details
property
value
status
complete
benchmark
214261.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
MnM 3.18b
configuration
default
runtime (wallclock)
3.6009349823 seconds
cpu usage
12.742943563
max memory
3.00806144E9
stage attributes
key
value
output-size
99517
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 { 0 ↦ 0, 1 ↦ 1, 2 ↦ 2, 3 ↦ 3, 4 ↦ 4, 5 ↦ 5 }, it remains to prove termination of the 50-rule system { 0 0 1 ⟶ 2 3 1 4 0 0 , 1 0 0 ⟶ 0 2 3 1 0 , 1 0 1 ⟶ 0 2 1 2 3 1 , 1 0 1 ⟶ 1 0 5 2 3 1 , 1 0 1 ⟶ 2 1 0 2 3 1 , 4 0 0 ⟶ 0 2 3 4 0 , 4 0 1 ⟶ 0 2 2 1 4 , 4 0 1 ⟶ 0 2 3 4 1 , 5 1 0 ⟶ 5 2 3 1 0 , 5 1 0 ⟶ 5 2 3 3 1 0 , 5 1 1 ⟶ 2 3 1 4 1 5 , 5 1 1 ⟶ 5 3 2 3 1 1 , 0 0 3 0 ⟶ 4 0 0 2 3 0 , 0 3 0 1 ⟶ 0 0 2 2 1 3 , 1 0 3 1 ⟶ 0 1 2 3 1 3 , 1 0 3 1 ⟶ 0 4 1 2 3 1 , 1 2 5 1 ⟶ 5 4 2 3 1 1 , 4 0 1 1 ⟶ 0 2 4 1 1 , 4 0 1 5 ⟶ 5 0 2 3 1 4 , 4 0 1 5 ⟶ 5 4 1 3 4 0 , 4 0 3 0 ⟶ 0 2 3 0 4 5 , 4 0 3 5 ⟶ 0 2 3 4 1 5 , 4 2 5 0 ⟶ 4 5 2 3 0 , 4 2 5 0 ⟶ 4 0 2 3 5 4 , 4 3 0 0 ⟶ 0 2 3 4 3 0 , 4 3 0 1 ⟶ 1 4 0 2 3 , 4 3 0 1 ⟶ 3 0 2 2 4 1 , 5 1 1 1 ⟶ 2 2 1 1 5 1 , 0 0 1 2 5 ⟶ 2 3 1 5 0 0 , 0 1 3 0 0 ⟶ 2 3 1 0 0 0 , 0 2 5 3 1 ⟶ 2 0 5 4 1 3 , 0 2 5 5 1 ⟶ 0 2 1 5 4 5 , 0 3 0 5 1 ⟶ 2 1 5 3 0 0 , 0 4 3 5 1 ⟶ 2 4 3 1 0 5 , 0 5 1 1 5 ⟶ 0 1 2 1 5 5 , 0 5 1 3 0 ⟶ 2 1 3 5 0 0 , 1 0 4 1 5 ⟶ 4 1 2 1 5 0 , 1 2 4 5 1 ⟶ 1 4 1 5 2 3 , 1 2 5 3 0 ⟶ 1 4 2 3 5 0 , 1 3 0 4 0 ⟶ 0 2 3 1 4 0 , 4 0 3 1 5 ⟶ 4 4 3 5 0 1 , 4 2 5 0 0 ⟶ 0 5 2 0 4 4 , 4 2 5 0 0 ⟶ 5 2 3 4 0 0 , 4 2 5 3 0 ⟶ 4 0 2 5 2 3 , 4 2 5 3 0 ⟶ 5 2 4 3 1 0 , 4 2 5 3 1 ⟶ 2 3 1 5 4 2 , 4 3 0 0 1 ⟶ 2 4 3 1 0 0 , 4 3 2 5 0 ⟶ 0 4 2 3 4 5 , 4 5 1 3 1 ⟶ 4 1 3 5 4 1 , 5 1 4 3 1 ⟶ 5 3 2 4 1 1 } Applying sparse tiling TRFC(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { (0,0) ↦ 0, (0,1) ↦ 1, (1,0) ↦ 2, (0,2) ↦ 3, (2,3) ↦ 4, (3,1) ↦ 5, (1,4) ↦ 6, (4,0) ↦ 7, (1,1) ↦ 8, (1,2) ↦ 9, (1,3) ↦ 10, (0,3) ↦ 11, (0,4) ↦ 12, (1,5) ↦ 13, (0,5) ↦ 14, (1,7) ↦ 15, (0,7) ↦ 16, (2,0) ↦ 17, (2,2) ↦ 18, (3,0) ↦ 19, (3,2) ↦ 20, (4,2) ↦ 21, (5,0) ↦ 22, (5,2) ↦ 23, (6,0) ↦ 24, (6,2) ↦ 25, (2,1) ↦ 26, (4,1) ↦ 27, (5,1) ↦ 28, (6,1) ↦ 29, (3,4) ↦ 30, (2,4) ↦ 31, (4,4) ↦ 32, (5,4) ↦ 33, (6,4) ↦ 34, (4,3) ↦ 35, (4,5) ↦ 36, (4,7) ↦ 37, (2,5) ↦ 38, (3,5) ↦ 39, (5,5) ↦ 40, (6,5) ↦ 41, (3,3) ↦ 42, (5,3) ↦ 43, (5,7) ↦ 44, (3,7) ↦ 45, (6,3) ↦ 46, (2,7) ↦ 47 }, it remains to prove termination of the 2450-rule system { 0 0 1 2 ⟶ 3 4 5 6 7 0 0 , 0 0 1 8 ⟶ 3 4 5 6 7 0 1 , 0 0 1 9 ⟶ 3 4 5 6 7 0 3 , 0 0 1 10 ⟶ 3 4 5 6 7 0 11 , 0 0 1 6 ⟶ 3 4 5 6 7 0 12 , 0 0 1 13 ⟶ 3 4 5 6 7 0 14 , 0 0 1 15 ⟶ 3 4 5 6 7 0 16 , 2 0 1 2 ⟶ 9 4 5 6 7 0 0 , 2 0 1 8 ⟶ 9 4 5 6 7 0 1 , 2 0 1 9 ⟶ 9 4 5 6 7 0 3 , 2 0 1 10 ⟶ 9 4 5 6 7 0 11 , 2 0 1 6 ⟶ 9 4 5 6 7 0 12 , 2 0 1 13 ⟶ 9 4 5 6 7 0 14 , 2 0 1 15 ⟶ 9 4 5 6 7 0 16 , 17 0 1 2 ⟶ 18 4 5 6 7 0 0 , 17 0 1 8 ⟶ 18 4 5 6 7 0 1 , 17 0 1 9 ⟶ 18 4 5 6 7 0 3 , 17 0 1 10 ⟶ 18 4 5 6 7 0 11 , 17 0 1 6 ⟶ 18 4 5 6 7 0 12 , 17 0 1 13 ⟶ 18 4 5 6 7 0 14 , 17 0 1 15 ⟶ 18 4 5 6 7 0 16 , 19 0 1 2 ⟶ 20 4 5 6 7 0 0 , 19 0 1 8 ⟶ 20 4 5 6 7 0 1 , 19 0 1 9 ⟶ 20 4 5 6 7 0 3 , 19 0 1 10 ⟶ 20 4 5 6 7 0 11 , 19 0 1 6 ⟶ 20 4 5 6 7 0 12 , 19 0 1 13 ⟶ 20 4 5 6 7 0 14 , 19 0 1 15 ⟶ 20 4 5 6 7 0 16 , 7 0 1 2 ⟶ 21 4 5 6 7 0 0 , 7 0 1 8 ⟶ 21 4 5 6 7 0 1 , 7 0 1 9 ⟶ 21 4 5 6 7 0 3 , 7 0 1 10 ⟶ 21 4 5 6 7 0 11 , 7 0 1 6 ⟶ 21 4 5 6 7 0 12 , 7 0 1 13 ⟶ 21 4 5 6 7 0 14 , 7 0 1 15 ⟶ 21 4 5 6 7 0 16 ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard