details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.119173 seconds
cpu usage	0.117451
user time	0.055952
system time	0.061499
max virtual memory	113188.0
max residence set size	4864.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (THEORY (AC plus)) (RULES f(plus(a,a)) -> plus(f(a),f(a)) plus(f(a),f(a)) -> plus(a,f(f(a))) ) Problem 1: Reduction Order Processor: -> Rules: f(plus(a,a)) -> plus(f(a),f(a)) plus(f(a),f(a)) -> plus(a,f(f(a))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = 2.X [plus](X1,X2) = X1 + X2 + 2 [a] = 0 Problem 1: Dependency Pairs Processor: -> FAxioms: PLUS(plus(x0,x1),x2) = PLUS(x0,plus(x1,x2)) PLUS(x0,x1) = PLUS(x1,x0) -> Pairs: PLUS(f(a),f(a)) -> F(f(a)) PLUS(f(a),f(a)) -> PLUS(a,f(f(a))) PLUS(plus(f(a),f(a)),x0) -> F(f(a)) PLUS(plus(f(a),f(a)),x0) -> PLUS(plus(a,f(f(a))),x0) PLUS(plus(f(a),f(a)),x0) -> PLUS(a,f(f(a))) -> EAxioms: plus(plus(x0,x1),x2) = plus(x0,plus(x1,x2)) plus(x0,x1) = plus(x1,x0) -> Rules: plus(f(a),f(a)) -> plus(a,f(f(a))) -> SRules: PLUS(plus(x0,x1),x2) -> PLUS(x0,x1) PLUS(x0,plus(x1,x2)) -> PLUS(x1,x2) Problem 1: SCC Processor: -> FAxioms: PLUS(plus(x0,x1),x2) = PLUS(x0,plus(x1,x2)) PLUS(x0,x1) = PLUS(x1,x0) -> Pairs: PLUS(f(a),f(a)) -> F(f(a)) PLUS(f(a),f(a)) -> PLUS(a,f(f(a))) PLUS(plus(f(a),f(a)),x0) -> F(f(a)) PLUS(plus(f(a),f(a)),x0) -> PLUS(plus(a,f(f(a))),x0) PLUS(plus(f(a),f(a)),x0) -> PLUS(a,f(f(a))) -> EAxioms: plus(plus(x0,x1),x2) = plus(x0,plus(x1,x2)) plus(x0,x1) = plus(x1,x0) -> Rules: plus(f(a),f(a)) -> plus(a,f(f(a))) -> SRules: PLUS(plus(x0,x1),x2) -> PLUS(x0,x1) PLUS(x0,plus(x1,x2)) -> PLUS(x1,x2) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(f(a),f(a)) -> PLUS(a,f(f(a))) PLUS(plus(f(a),f(a)),x0) -> PLUS(plus(a,f(f(a))),x0) PLUS(plus(f(a),f(a)),x0) -> PLUS(a,f(f(a))) -> FAxioms: plus(plus(x0,x1),x2) -> plus(x0,plus(x1,x2)) plus(x0,x1) -> plus(x1,x0) PLUS(plus(x0,x1),x2) -> PLUS(x0,plus(x1,x2)) PLUS(x0,x1) -> PLUS(x1,x0) -> EAxioms: plus(plus(x0,x1),x2) = plus(x0,plus(x1,x2)) plus(x0,x1) = plus(x1,x0) ->->-> Rules: plus(f(a),f(a)) -> plus(a,f(f(a))) -> SRules: PLUS(plus(x0,x1),x2) -> PLUS(x0,x1) PLUS(x0,plus(x1,x2)) -> PLUS(x1,x2) Problem 1: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x0,x1),x2) = PLUS(x0,plus(x1,x2)) PLUS(x0,x1) = PLUS(x1,x0) -> Pairs: PLUS(f(a),f(a)) -> PLUS(a,f(f(a))) popout

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

job log

popout

actions

all output return to TRS Equational