details

property	value
status	complete
benchmark	recursion-5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n060.star.cs.uiowa.edu
space	TCT_12

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0800070762634 seconds
cpu usage	0.024114565
max memory	2355200.0

stage attributes

key	value
output-size	10298
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 Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES f_0(x:S) -> a f_1(x:S) -> g_1(x:S,x:S) f_2(x:S) -> g_2(x:S,x:S) f_3(x:S) -> g_3(x:S,x:S) f_4(x:S) -> g_4(x:S,x:S) f_5(x:S) -> g_5(x:S,x:S) g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S)) g_2(s(x:S),y:S) -> b(f_1(y:S),g_2(x:S,y:S)) g_3(s(x:S),y:S) -> b(f_2(y:S),g_3(x:S,y:S)) g_4(s(x:S),y:S) -> b(f_3(y:S),g_4(x:S,y:S)) g_5(s(x:S),y:S) -> b(f_4(y:S),g_5(x:S,y:S)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f_0(x:S) -> a f_1(x:S) -> g_1(x:S,x:S) f_2(x:S) -> g_2(x:S,x:S) f_3(x:S) -> g_3(x:S,x:S) f_4(x:S) -> g_4(x:S,x:S) f_5(x:S) -> g_5(x:S,x:S) g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S)) g_2(s(x:S),y:S) -> b(f_1(y:S),g_2(x:S,y:S)) g_3(s(x:S),y:S) -> b(f_2(y:S),g_3(x:S,y:S)) g_4(s(x:S),y:S) -> b(f_3(y:S),g_4(x:S,y:S)) g_5(s(x:S),y:S) -> b(f_4(y:S),g_5(x:S,y:S)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F_1(x:S) -> G_1(x:S,x:S) F_2(x:S) -> G_2(x:S,x:S) F_3(x:S) -> G_3(x:S,x:S) F_4(x:S) -> G_4(x:S,x:S) F_5(x:S) -> G_5(x:S,x:S) G_1(s(x:S),y:S) -> F_0(y:S) G_1(s(x:S),y:S) -> G_1(x:S,y:S) G_2(s(x:S),y:S) -> F_1(y:S) G_2(s(x:S),y:S) -> G_2(x:S,y:S) G_3(s(x:S),y:S) -> F_2(y:S) G_3(s(x:S),y:S) -> G_3(x:S,y:S) G_4(s(x:S),y:S) -> F_3(y:S) G_4(s(x:S),y:S) -> G_4(x:S,y:S) G_5(s(x:S),y:S) -> F_4(y:S) G_5(s(x:S),y:S) -> G_5(x:S,y:S) -> Rules: f_0(x:S) -> a f_1(x:S) -> g_1(x:S,x:S) f_2(x:S) -> g_2(x:S,x:S) f_3(x:S) -> g_3(x:S,x:S) f_4(x:S) -> g_4(x:S,x:S) f_5(x:S) -> g_5(x:S,x:S) g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S)) g_2(s(x:S),y:S) -> b(f_1(y:S),g_2(x:S,y:S)) g_3(s(x:S),y:S) -> b(f_2(y:S),g_3(x:S,y:S)) g_4(s(x:S),y:S) -> b(f_3(y:S),g_4(x:S,y:S)) g_5(s(x:S),y:S) -> b(f_4(y:S),g_5(x:S,y:S)) Problem 1: SCC Processor: -> Pairs: F_1(x:S) -> G_1(x:S,x:S) F_2(x:S) -> G_2(x:S,x:S) F_3(x:S) -> G_3(x:S,x:S) F_4(x:S) -> G_4(x:S,x:S) F_5(x:S) -> G_5(x:S,x:S) G_1(s(x:S),y:S) -> F_0(y:S) G_1(s(x:S),y:S) -> G_1(x:S,y:S) G_2(s(x:S),y:S) -> F_1(y:S) G_2(s(x:S),y:S) -> G_2(x:S,y:S) G_3(s(x:S),y:S) -> F_2(y:S) G_3(s(x:S),y:S) -> G_3(x:S,y:S) G_4(s(x:S),y:S) -> F_3(y:S) G_4(s(x:S),y:S) -> G_4(x:S,y:S) G_5(s(x:S),y:S) -> F_4(y:S) G_5(s(x:S),y:S) -> G_5(x:S,y:S) -> Rules: f_0(x:S) -> a f_1(x:S) -> g_1(x:S,x:S) f_2(x:S) -> g_2(x:S,x:S) f_3(x:S) -> g_3(x:S,x:S) f_4(x:S) -> g_4(x:S,x:S) popout

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

job log

popout

actions

all output return to TRS Standard