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