details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	4.66821 seconds
cpu usage	4.18991
user time	2.82801
system time	1.36191
max virtual memory	688028.0
max residence set size	8804.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x y z) (THEORY (AC plus times)) (RULES plus(x,0) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,plus(y,z)) -> plus(times(x,y),times(x,z)) times(x,0) -> 0 times(x,s(y)) -> plus(times(x,y),x) ) Problem 1: Dependency Pairs Processor: -> FAxioms: PLUS(plus(x3,x4),x5) = PLUS(x3,plus(x4,x5)) PLUS(x3,x4) = PLUS(x4,x3) TIMES(times(x3,x4),x5) = TIMES(x3,times(x4,x5)) TIMES(x3,x4) = TIMES(x4,x3) -> Pairs: PLUS(plus(x,0),x3) -> PLUS(x,x3) PLUS(plus(x,s(y)),x3) -> PLUS(s(plus(x,y)),x3) PLUS(plus(x,s(y)),x3) -> PLUS(x,y) PLUS(x,s(y)) -> PLUS(x,y) TIMES(times(x,plus(y,z)),x3) -> PLUS(times(x,y),times(x,z)) TIMES(times(x,plus(y,z)),x3) -> TIMES(plus(times(x,y),times(x,z)),x3) TIMES(times(x,plus(y,z)),x3) -> TIMES(x,y) TIMES(times(x,plus(y,z)),x3) -> TIMES(x,z) TIMES(times(x,0),x3) -> TIMES(0,x3) TIMES(times(x,s(y)),x3) -> PLUS(times(x,y),x) TIMES(times(x,s(y)),x3) -> TIMES(plus(times(x,y),x),x3) TIMES(times(x,s(y)),x3) -> TIMES(x,y) TIMES(x,plus(y,z)) -> PLUS(times(x,y),times(x,z)) TIMES(x,plus(y,z)) -> TIMES(x,y) TIMES(x,plus(y,z)) -> TIMES(x,z) TIMES(x,s(y)) -> PLUS(times(x,y),x) TIMES(x,s(y)) -> TIMES(x,y) -> EAxioms: plus(plus(x3,x4),x5) = plus(x3,plus(x4,x5)) plus(x3,x4) = plus(x4,x3) times(times(x3,x4),x5) = times(x3,times(x4,x5)) times(x3,x4) = times(x4,x3) -> Rules: plus(x,0) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,plus(y,z)) -> plus(times(x,y),times(x,z)) times(x,0) -> 0 times(x,s(y)) -> plus(times(x,y),x) -> SRules: PLUS(plus(x3,x4),x5) -> PLUS(x3,x4) PLUS(x3,plus(x4,x5)) -> PLUS(x4,x5) TIMES(times(x3,x4),x5) -> TIMES(x3,x4) TIMES(x3,times(x4,x5)) -> TIMES(x4,x5) Problem 1: SCC Processor: -> FAxioms: PLUS(plus(x3,x4),x5) = PLUS(x3,plus(x4,x5)) PLUS(x3,x4) = PLUS(x4,x3) TIMES(times(x3,x4),x5) = TIMES(x3,times(x4,x5)) TIMES(x3,x4) = TIMES(x4,x3) -> Pairs: PLUS(plus(x,0),x3) -> PLUS(x,x3) PLUS(plus(x,s(y)),x3) -> PLUS(s(plus(x,y)),x3) PLUS(plus(x,s(y)),x3) -> PLUS(x,y) PLUS(x,s(y)) -> PLUS(x,y) TIMES(times(x,plus(y,z)),x3) -> PLUS(times(x,y),times(x,z)) TIMES(times(x,plus(y,z)),x3) -> TIMES(plus(times(x,y),times(x,z)),x3) TIMES(times(x,plus(y,z)),x3) -> TIMES(x,y) TIMES(times(x,plus(y,z)),x3) -> TIMES(x,z) TIMES(times(x,0),x3) -> TIMES(0,x3) TIMES(times(x,s(y)),x3) -> PLUS(times(x,y),x) TIMES(times(x,s(y)),x3) -> TIMES(plus(times(x,y),x),x3) TIMES(times(x,s(y)),x3) -> TIMES(x,y) TIMES(x,plus(y,z)) -> PLUS(times(x,y),times(x,z)) TIMES(x,plus(y,z)) -> TIMES(x,y) TIMES(x,plus(y,z)) -> TIMES(x,z) TIMES(x,s(y)) -> PLUS(times(x,y),x) TIMES(x,s(y)) -> TIMES(x,y) -> EAxioms: plus(plus(x3,x4),x5) = plus(x3,plus(x4,x5)) plus(x3,x4) = plus(x4,x3) times(times(x3,x4),x5) = times(x3,times(x4,x5)) times(x3,x4) = times(x4,x3) -> Rules: plus(x,0) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,plus(y,z)) -> plus(times(x,y),times(x,z)) times(x,0) -> 0 times(x,s(y)) -> plus(times(x,y),x) -> SRules: PLUS(plus(x3,x4),x5) -> PLUS(x3,x4) PLUS(x3,plus(x4,x5)) -> PLUS(x4,x5) TIMES(times(x3,x4),x5) -> TIMES(x3,x4) TIMES(x3,times(x4,x5)) -> TIMES(x4,x5) popout

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

job log

popout

actions

all output return to TRS Equational