details

property	value
status	complete
benchmark	213537.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n095.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	3.35658717155 seconds
cpu usage	11.313702204
max memory	2.827321344E9

stage attributes

key	value
output-size	98285
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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 1 0 0 ⟶ 2 0 2 0 0 1 , 1 0 0 1 ⟶ 1 0 3 0 1 , 1 0 0 4 ⟶ 1 4 0 2 0 , 1 0 0 4 ⟶ 1 4 0 3 2 0 , 1 0 1 0 ⟶ 1 3 0 0 3 1 , 1 0 1 4 ⟶ 1 0 3 1 2 4 , 1 0 1 5 ⟶ 1 0 2 1 5 , 1 0 4 1 ⟶ 1 0 3 4 1 , 1 0 5 0 ⟶ 1 2 5 2 0 0 , 1 2 0 4 ⟶ 1 3 4 2 0 , 1 3 0 4 ⟶ 1 3 4 2 0 , 1 4 1 0 ⟶ 1 4 0 2 1 , 1 4 1 0 ⟶ 1 4 0 3 1 , 1 4 5 0 ⟶ 4 0 2 1 2 5 , 1 5 0 1 ⟶ 0 1 3 1 3 5 , 1 5 0 1 ⟶ 1 5 0 3 1 3 , 4 1 0 0 ⟶ 0 2 4 2 0 1 , 4 1 0 0 ⟶ 0 3 4 3 0 1 , 4 1 0 5 ⟶ 4 0 2 1 5 , 4 1 2 0 ⟶ 3 0 2 1 3 4 , 4 5 0 0 ⟶ 3 0 4 0 5 , 5 0 0 4 ⟶ 5 4 0 2 0 , 5 0 1 4 ⟶ 1 5 4 3 0 , 5 4 1 5 ⟶ 4 3 1 5 5 , 1 0 1 4 5 ⟶ 1 3 1 5 4 0 , 1 0 4 0 4 ⟶ 1 0 4 3 4 0 , 1 1 1 0 0 ⟶ 1 1 0 0 3 1 , 1 1 4 5 0 ⟶ 1 1 3 4 0 5 , 1 2 0 5 0 ⟶ 5 2 1 0 2 0 , 1 4 5 0 0 ⟶ 4 0 5 0 2 1 , 1 4 5 2 0 ⟶ 0 3 1 2 5 4 , 1 5 0 4 5 ⟶ 3 4 0 5 1 5 , 4 1 0 0 1 ⟶ 1 0 4 0 3 1 , 4 1 2 0 0 ⟶ 4 2 0 0 2 1 , 4 1 3 0 5 ⟶ 3 2 4 0 1 5 , 4 1 5 3 1 ⟶ 2 1 5 4 3 1 , 4 4 1 0 1 ⟶ 1 3 4 4 0 1 , 4 5 0 1 0 ⟶ 4 0 0 5 3 1 , 4 5 1 1 0 ⟶ 1 1 3 4 0 5 , 4 5 1 1 0 ⟶ 4 0 2 1 5 1 , 4 5 1 5 1 ⟶ 4 1 5 5 3 1 , 4 5 5 0 4 ⟶ 5 4 0 5 4 2 , 5 0 0 4 1 ⟶ 5 4 0 3 0 1 , 5 0 0 4 5 ⟶ 0 3 4 0 5 5 , 5 0 0 4 5 ⟶ 4 0 0 3 5 5 , 5 0 4 1 0 ⟶ 5 0 4 0 3 1 , 5 1 5 0 1 ⟶ 5 0 3 5 1 1 , 5 4 1 1 0 ⟶ 1 2 4 0 1 5 , 5 4 5 1 0 ⟶ 5 5 1 3 4 0 , 5 5 2 0 4 ⟶ 5 5 3 4 2 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, (0,2) ↦ 3, (2,0) ↦ 4, (1,1) ↦ 5, (1,2) ↦ 6, (0,3) ↦ 7, (1,3) ↦ 8, (0,4) ↦ 9, (1,4) ↦ 10, (0,5) ↦ 11, (1,5) ↦ 12, (0,7) ↦ 13, (1,7) ↦ 14, (2,2) ↦ 15, (3,0) ↦ 16, (3,2) ↦ 17, (4,0) ↦ 18, (4,2) ↦ 19, (5,0) ↦ 20, (5,2) ↦ 21, (6,0) ↦ 22, (6,2) ↦ 23, (2,1) ↦ 24, (3,1) ↦ 25, (4,1) ↦ 26, (5,1) ↦ 27, (6,1) ↦ 28, (4,3) ↦ 29, (4,4) ↦ 30, (4,5) ↦ 31, (4,7) ↦ 32, (2,4) ↦ 33, (5,3) ↦ 34, (5,4) ↦ 35, (5,5) ↦ 36, (5,7) ↦ 37, (3,4) ↦ 38, (2,5) ↦ 39, (6,4) ↦ 40, (3,5) ↦ 41, (3,3) ↦ 42, (3,7) ↦ 43, (2,3) ↦ 44, (6,3) ↦ 45, (6,5) ↦ 46, (2,7) ↦ 47 }, it remains to prove termination of the 2450-rule system { 0 1 2 0 0 ⟶ 3 4 3 4 0 1 2 , 0 1 2 0 1 ⟶ 3 4 3 4 0 1 5 , 0 1 2 0 3 ⟶ 3 4 3 4 0 1 6 , 0 1 2 0 7 ⟶ 3 4 3 4 0 1 8 , 0 1 2 0 9 ⟶ 3 4 3 4 0 1 10 , 0 1 2 0 11 ⟶ 3 4 3 4 0 1 12 , 0 1 2 0 13 ⟶ 3 4 3 4 0 1 14 , 2 1 2 0 0 ⟶ 6 4 3 4 0 1 2 , 2 1 2 0 1 ⟶ 6 4 3 4 0 1 5 , 2 1 2 0 3 ⟶ 6 4 3 4 0 1 6 , 2 1 2 0 7 ⟶ 6 4 3 4 0 1 8 , 2 1 2 0 9 ⟶ 6 4 3 4 0 1 10 , 2 1 2 0 11 ⟶ 6 4 3 4 0 1 12 , 2 1 2 0 13 ⟶ 6 4 3 4 0 1 14 , 4 1 2 0 0 ⟶ 15 4 3 4 0 1 2 , 4 1 2 0 1 ⟶ 15 4 3 4 0 1 5 , 4 1 2 0 3 ⟶ 15 4 3 4 0 1 6 , 4 1 2 0 7 ⟶ 15 4 3 4 0 1 8 , 4 1 2 0 9 ⟶ 15 4 3 4 0 1 10 , 4 1 2 0 11 ⟶ 15 4 3 4 0 1 12 , 4 1 2 0 13 ⟶ 15 4 3 4 0 1 14 , 16 1 2 0 0 ⟶ 17 4 3 4 0 1 2 , 16 1 2 0 1 ⟶ 17 4 3 4 0 1 5 , 16 1 2 0 3 ⟶ 17 4 3 4 0 1 6 , 16 1 2 0 7 ⟶ 17 4 3 4 0 1 8 , 16 1 2 0 9 ⟶ 17 4 3 4 0 1 10 , 16 1 2 0 11 ⟶ 17 4 3 4 0 1 12 , 16 1 2 0 13 ⟶ 17 4 3 4 0 1 14 , 18 1 2 0 0 ⟶ 19 4 3 4 0 1 2 , 18 1 2 0 1 ⟶ 19 4 3 4 0 1 5 , 18 1 2 0 3 ⟶ 19 4 3 4 0 1 6 , 18 1 2 0 7 ⟶ 19 4 3 4 0 1 8 , 18 1 2 0 9 ⟶ 19 4 3 4 0 1 10 , 18 1 2 0 11 ⟶ 19 4 3 4 0 1 12 , 18 1 2 0 13 ⟶ 19 4 3 4 0 1 14 , popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Standard