details

property	value
status	complete
benchmark	gen-9.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n177.star.cs.uiowa.edu
space	Secret_06_TRS

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.433703 seconds
cpu usage	0.386787
user time	0.29203
system time	0.094757
max virtual memory	113188.0
max residence set size	6900.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S z:S) (RULES b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) f(c(x:S,y:S,z:S)) -> c(z:S,f(b(y:S,z:S)),a) ) Problem 1: Dependency Pairs Processor: -> Pairs: B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(c(y:S,a,z:S),z:S,x:S) B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(y:S,a,z:S) C(c(z:S,y:S,a),a,a) -> B(z:S,y:S) F(c(x:S,y:S,z:S)) -> B(y:S,z:S) F(c(x:S,y:S,z:S)) -> C(z:S,f(b(y:S,z:S)),a) F(c(x:S,y:S,z:S)) -> F(b(y:S,z:S)) -> Rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) f(c(x:S,y:S,z:S)) -> c(z:S,f(b(y:S,z:S)),a) Problem 1: SCC Processor: -> Pairs: B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(c(y:S,a,z:S),z:S,x:S) B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(y:S,a,z:S) C(c(z:S,y:S,a),a,a) -> B(z:S,y:S) F(c(x:S,y:S,z:S)) -> B(y:S,z:S) F(c(x:S,y:S,z:S)) -> C(z:S,f(b(y:S,z:S)),a) F(c(x:S,y:S,z:S)) -> F(b(y:S,z:S)) -> Rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) f(c(x:S,y:S,z:S)) -> c(z:S,f(b(y:S,z:S)),a) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(c(y:S,a,z:S),z:S,x:S) B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(y:S,a,z:S) C(c(z:S,y:S,a),a,a) -> B(z:S,y:S) ->->-> Rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) f(c(x:S,y:S,z:S)) -> c(z:S,f(b(y:S,z:S)),a) ->->Cycle: ->->-> Pairs: F(c(x:S,y:S,z:S)) -> F(b(y:S,z:S)) ->->-> Rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) f(c(x:S,y:S,z:S)) -> c(z:S,f(b(y:S,z:S)),a) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pair Processor: -> Pairs: B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(c(y:S,a,z:S),z:S,x:S) B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(y:S,a,z:S) C(c(z:S,y:S,a),a,a) -> B(z:S,y:S) -> Rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) f(c(x:S,y:S,z:S)) -> c(z:S,f(b(y:S,z:S)),a) -> Usable rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) c(c(z:S,y:S,a),a,a) -> b(z:S,y:S) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [b](X1,X2) = 2.X1 + 2.X2 [c](X1,X2,X3) = 2.X1 + 2.X2 [f](X) = 2.X + 1 [a] = 0 [B](X1,X2) = 2.X1 + 2.X2 + 2 [C](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 Problem 1.1: SCC Processor: -> Pairs: B(z:S,b(c(a,y:S,a),f(f(x:S)))) -> C(y:S,a,z:S) C(c(z:S,y:S,a),a,a) -> B(z:S,y:S) -> Rules: b(z:S,b(c(a,y:S,a),f(f(x:S)))) -> c(c(y:S,a,z:S),z:S,x:S) popout

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

job log

popout

actions

all output return to TRS Standard