details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.035861 seconds
cpu usage	0.031531
user time	0.012267
system time	0.019264
max virtual memory	113188.0
max residence set size	4440.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x y) (STRATEGY CONTEXTSENSITIVE (f_1) (g_1) (a_0) (i_0 1) ) (RULES f_1(x,i_0(g_1(x))) -> a_0 f_1(x,i_0(x)) -> f_1(x,x) f_1(x,x) -> f_1(i_0(x),g_1(g_1(x))) f_1(x,y) -> x g_1(x) -> i_0(x) ) Problem 1: Dependency Pairs Processor: -> Pairs: F_1(x,i_0(x)) -> F_1(x,x) F_1(x,x) -> F_1(i_0(x),g_1(g_1(x))) F_1(x,y) -> x G_1(x) -> x -> Rules: f_1(x,i_0(g_1(x))) -> a_0 f_1(x,i_0(x)) -> f_1(x,x) f_1(x,x) -> f_1(i_0(x),g_1(g_1(x))) f_1(x,y) -> x g_1(x) -> i_0(x) -> Unhiding Rules: g_1(g_1(x)) -> G_1(g_1(x)) i_0(x2) -> x2 Problem 1: SCC Processor: -> Pairs: F_1(x,i_0(x)) -> F_1(x,x) F_1(x,x) -> F_1(i_0(x),g_1(g_1(x))) F_1(x,y) -> x G_1(x) -> x -> Rules: f_1(x,i_0(g_1(x))) -> a_0 f_1(x,i_0(x)) -> f_1(x,x) f_1(x,x) -> f_1(i_0(x),g_1(g_1(x))) f_1(x,y) -> x g_1(x) -> i_0(x) -> Unhiding rules: g_1(g_1(x)) -> G_1(g_1(x)) i_0(x2) -> x2 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G_1(x) -> x ->->-> Rules: f_1(x,i_0(g_1(x))) -> a_0 f_1(x,i_0(x)) -> f_1(x,x) f_1(x,x) -> f_1(i_0(x),g_1(g_1(x))) f_1(x,y) -> x g_1(x) -> i_0(x) ->->-> Unhiding rules: g_1(g_1(x)) -> G_1(g_1(x)) i_0(x2) -> x2 Problem 1: Reduction Pairs Processor: -> Pairs: G_1(x) -> x -> Rules: f_1(x,i_0(g_1(x))) -> a_0 f_1(x,i_0(x)) -> f_1(x,x) f_1(x,x) -> f_1(i_0(x),g_1(g_1(x))) f_1(x,y) -> x g_1(x) -> i_0(x) -> Unhiding rules: g_1(g_1(x)) -> G_1(g_1(x)) i_0(x2) -> x2 -> Usable rules: g_1(x) -> i_0(x) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [g_1](X) = 2.X + 2 [i_0](X) = 2.X [G_1](X) = 2.X + 2 Problem 1: popout

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

job log

popout

actions

all output return to TRS Contextsensitive