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