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