details

property	value
status	complete
benchmark	matchbox1.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	Secret_05_TRS

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	40.6564 seconds
cpu usage	40.531
user time	36.9363
system time	3.59469
max virtual memory	599080.0
max residence set size	5856.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(f(x:S,a),y:S) -> F(x:S,y:S) F(f(x:S,a),y:S) -> F(y:S,f(x:S,y:S)) -> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) Problem 1: SCC Processor: -> Pairs: F(f(x:S,a),y:S) -> F(x:S,y:S) F(f(x:S,a),y:S) -> F(y:S,f(x:S,y:S)) -> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(x:S,a),y:S) -> F(x:S,y:S) F(f(x:S,a),y:S) -> F(y:S,f(x:S,y:S)) ->->-> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) Problem 1: Forward Instantiation Processor: -> Pairs: F(f(x:S,a),y:S) -> F(x:S,y:S) F(f(x:S,a),y:S) -> F(y:S,f(x:S,y:S)) -> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) ->Instantiated Pairs: ->->Original Pair: F(f(x:S,a),y:S) -> F(x:S,y:S) ->-> Instantiated pairs: F(f(f(x3:S,a),a),y:S) -> F(f(x3:S,a),y:S) F(f(f(x5:S,a),a),y:S) -> F(f(x5:S,a),y:S) ->->Original Pair: F(f(x:S,a),y:S) -> F(y:S,f(x:S,y:S)) ->-> Instantiated pairs: F(f(x:S,a),f(x3:S,a)) -> F(f(x3:S,a),f(x:S,f(x3:S,a))) F(f(x:S,a),f(x5:S,a)) -> F(f(x5:S,a),f(x:S,f(x5:S,a))) Problem 1: SCC Processor: -> Pairs: F(f(f(x3:S,a),a),y:S) -> F(f(x3:S,a),y:S) F(f(f(x5:S,a),a),y:S) -> F(f(x5:S,a),y:S) F(f(x:S,a),f(x3:S,a)) -> F(f(x3:S,a),f(x:S,f(x3:S,a))) F(f(x:S,a),f(x5:S,a)) -> F(f(x5:S,a),f(x:S,f(x5:S,a))) -> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(f(f(x3:S,a),a),y:S) -> F(f(x3:S,a),y:S) F(f(f(x5:S,a),a),y:S) -> F(f(x5:S,a),y:S) F(f(x:S,a),f(x3:S,a)) -> F(f(x3:S,a),f(x:S,f(x3:S,a))) F(f(x:S,a),f(x5:S,a)) -> F(f(x5:S,a),f(x:S,f(x5:S,a))) ->->-> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) Problem 1: Reduction Pair Processor: -> Pairs: F(f(f(x3:S,a),a),y:S) -> F(f(x3:S,a),y:S) F(f(f(x5:S,a),a),y:S) -> F(f(x5:S,a),y:S) F(f(x:S,a),f(x3:S,a)) -> F(f(x3:S,a),f(x:S,f(x3:S,a))) F(f(x:S,a),f(x5:S,a)) -> F(f(x5:S,a),f(x:S,f(x5:S,a))) -> Rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) -> Usable rules: f(f(x:S,a),y:S) -> f(y:S,f(x:S,y:S)) ->Interpretation type: Linear ->Coefficients: All rationals ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X1,X2) = 1/2.X2 [a] = 2 [F](X1,X2) = X2 popout

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

job log

popout

actions

all output return to TRS Standard