details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.199498 seconds
cpu usage	0.176478
user time	0.083159
system time	0.093319
max virtual memory	113188.0
max residence set size	4984.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x y) (THEORY (AC plus)) (RULES plus(x,0) -> x plus(x,s(y)) -> s(plus(x,y)) ) Problem 1: Reduction Order Processor: -> Rules: plus(x,0) -> x plus(x,s(y)) -> s(plus(x,y)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [plus](X1,X2) = X1 + X2 + 2 [0] = 2 [s](X) = X + 2 Problem 1: Dependency Pairs Processor: -> FAxioms: PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4)) PLUS(x2,x3) = PLUS(x3,x2) -> Pairs: PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2) PLUS(plus(x,s(y)),x2) -> PLUS(x,y) PLUS(x,s(y)) -> PLUS(x,y) -> EAxioms: plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4)) plus(x2,x3) = plus(x3,x2) -> Rules: plus(x,s(y)) -> s(plus(x,y)) -> SRules: PLUS(plus(x2,x3),x4) -> PLUS(x2,x3) PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4) Problem 1: SCC Processor: -> FAxioms: PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4)) PLUS(x2,x3) = PLUS(x3,x2) -> Pairs: PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2) PLUS(plus(x,s(y)),x2) -> PLUS(x,y) PLUS(x,s(y)) -> PLUS(x,y) -> EAxioms: plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4)) plus(x2,x3) = plus(x3,x2) -> Rules: plus(x,s(y)) -> s(plus(x,y)) -> SRules: PLUS(plus(x2,x3),x4) -> PLUS(x2,x3) PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2) PLUS(plus(x,s(y)),x2) -> PLUS(x,y) PLUS(x,s(y)) -> PLUS(x,y) -> FAxioms: plus(plus(x2,x3),x4) -> plus(x2,plus(x3,x4)) plus(x2,x3) -> plus(x3,x2) PLUS(plus(x2,x3),x4) -> PLUS(x2,plus(x3,x4)) PLUS(x2,x3) -> PLUS(x3,x2) -> EAxioms: plus(plus(x2,x3),x4) = plus(x2,plus(x3,x4)) plus(x2,x3) = plus(x3,x2) ->->-> Rules: plus(x,s(y)) -> s(plus(x,y)) -> SRules: PLUS(plus(x2,x3),x4) -> PLUS(x2,x3) PLUS(x2,plus(x3,x4)) -> PLUS(x3,x4) Problem 1: Reduction Pairs Processor: -> FAxioms: PLUS(plus(x2,x3),x4) = PLUS(x2,plus(x3,x4)) PLUS(x2,x3) = PLUS(x3,x2) -> Pairs: PLUS(plus(x,s(y)),x2) -> PLUS(s(plus(x,y)),x2) PLUS(plus(x,s(y)),x2) -> PLUS(x,y) PLUS(x,s(y)) -> PLUS(x,y) -> EAxioms: popout

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

job log

popout

actions

all output return to TRS Equational