details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.038712 seconds
cpu usage	0.039309
user time	0.022301
system time	0.017008
max virtual memory	113188.0
max residence set size	9456.0

stage attributes

key	value
starexec-result	YES

output

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_10(x:S) -> g_10(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) f_6(x:S) -> g_6(x:S,x:S) f_7(x:S) -> g_7(x:S,x:S) f_8(x:S) -> g_8(x:S,x:S) f_9(x:S) -> g_9(x:S,x:S) g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S)) g_10(s(x:S),y:S) -> b(f_9(y:S),g_10(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)) g_6(s(x:S),y:S) -> b(f_5(y:S),g_6(x:S,y:S)) g_7(s(x:S),y:S) -> b(f_6(y:S),g_7(x:S,y:S)) g_8(s(x:S),y:S) -> b(f_7(y:S),g_8(x:S,y:S)) g_9(s(x:S),y:S) -> b(f_8(y:S),g_9(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_10(x:S) -> g_10(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) f_6(x:S) -> g_6(x:S,x:S) f_7(x:S) -> g_7(x:S,x:S) f_8(x:S) -> g_8(x:S,x:S) f_9(x:S) -> g_9(x:S,x:S) g_1(s(x:S),y:S) -> b(f_0(y:S),g_1(x:S,y:S)) g_10(s(x:S),y:S) -> b(f_9(y:S),g_10(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)) g_6(s(x:S),y:S) -> b(f_5(y:S),g_6(x:S,y:S)) g_7(s(x:S),y:S) -> b(f_6(y:S),g_7(x:S,y:S)) g_8(s(x:S),y:S) -> b(f_7(y:S),g_8(x:S,y:S)) g_9(s(x:S),y:S) -> b(f_8(y:S),g_9(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_10(x:S) -> G_10(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) F_6(x:S) -> G_6(x:S,x:S) F_7(x:S) -> G_7(x:S,x:S) F_8(x:S) -> G_8(x:S,x:S) F_9(x:S) -> G_9(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_10(s(x:S),y:S) -> F_9(y:S) G_10(s(x:S),y:S) -> G_10(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) G_6(s(x:S),y:S) -> F_5(y:S) G_6(s(x:S),y:S) -> G_6(x:S,y:S) G_7(s(x:S),y:S) -> F_6(y:S) G_7(s(x:S),y:S) -> G_7(x:S,y:S) G_8(s(x:S),y:S) -> F_7(y:S) G_8(s(x:S),y:S) -> G_8(x:S,y:S) G_9(s(x:S),y:S) -> F_8(y:S) G_9(s(x:S),y:S) -> G_9(x:S,y:S) -> Rules: f_0(x:S) -> a f_1(x:S) -> g_1(x:S,x:S) f_10(x:S) -> g_10(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) f_6(x:S) -> g_6(x:S,x:S) popout

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

job log

popout

actions

all output return to TRS Standard