details

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

run statistics

property	value
solver	MnM 3.18b
configuration	default
runtime (wallclock)	0.96024107933 seconds
cpu usage	0.971451705
max memory	4.94788608E8

stage attributes

key	value
output-size	1066
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 { a ↦ 0, b ↦ 1, c ↦ 2 }, it remains to prove termination of the 3-rule system { 0 1 ⟶ 1 2 0 , 1 2 ⟶ 2 1 1 , 1 0 ⟶ 0 2 1 } Applying sparse untiling TRFCU(2) [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 1 ↦ 0, 2 ↦ 1, 0 ↦ 2 }, it remains to prove termination of the 2-rule system { 0 1 ⟶ 1 0 0 , 0 2 ⟶ 2 1 0 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { 1 ↦ 0, 0 ↦ 1 }, it remains to prove termination of the 1-rule system { 0 1 ⟶ 1 0 0 } Applying sparse untiling TRFCU(2) after reversal [Geser/Hofbauer/Waldmann, FSCD 2019]. After renaming modulo the bijection { }, it remains to prove termination of the 0-rule system { } The system is trivially terminating. popout

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

job log

popout

actions

all output return to SRS Standard