details

property	value
status	complete
benchmark	AC54.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	AProVE_AC_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.602413 seconds
cpu usage	0.579194
user time	0.323687
system time	0.255507
max virtual memory	686408.0
max residence set size	8168.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR k l x y z) (THEORY (AC plus)) (RULES app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l minus(minus(x,y),z) -> minus(x,plus(y,z)) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ) Problem 1: Dependency Pairs Processor: -> FAxioms: PLUS(plus(x5,x6),x7) = PLUS(x5,plus(x6,x7)) PLUS(x5,x6) = PLUS(x6,x5) -> Pairs: APP(cons(x,l),k) -> APP(l,k) MINUS(minus(x,y),z) -> MINUS(x,plus(y,z)) MINUS(minus(x,y),z) -> PLUS(y,z) MINUS(s(x),s(y)) -> MINUS(x,y) PLUS(plus(0,y),x5) -> PLUS(y,x5) PLUS(plus(s(x),y),x5) -> PLUS(s(plus(x,y)),x5) PLUS(plus(s(x),y),x5) -> PLUS(x,y) PLUS(s(x),y) -> PLUS(x,y) QUOT(s(x),s(y)) -> MINUS(x,y) QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) SUM(app(l,cons(x,cons(y,k)))) -> APP(l,sum(cons(x,cons(y,k)))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(cons(x,cons(y,k))) SUM(cons(x,cons(y,l))) -> PLUS(x,y) SUM(cons(x,cons(y,l))) -> SUM(cons(plus(x,y),l)) -> EAxioms: plus(plus(x5,x6),x7) = plus(x5,plus(x6,x7)) plus(x5,x6) = plus(x6,x5) -> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l minus(minus(x,y),z) -> minus(x,plus(y,z)) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) -> SRules: PLUS(plus(x5,x6),x7) -> PLUS(x5,x6) PLUS(x5,plus(x6,x7)) -> PLUS(x6,x7) Problem 1: SCC Processor: -> FAxioms: PLUS(plus(x5,x6),x7) = PLUS(x5,plus(x6,x7)) PLUS(x5,x6) = PLUS(x6,x5) -> Pairs: APP(cons(x,l),k) -> APP(l,k) MINUS(minus(x,y),z) -> MINUS(x,plus(y,z)) MINUS(minus(x,y),z) -> PLUS(y,z) MINUS(s(x),s(y)) -> MINUS(x,y) PLUS(plus(0,y),x5) -> PLUS(y,x5) PLUS(plus(s(x),y),x5) -> PLUS(s(plus(x,y)),x5) PLUS(plus(s(x),y),x5) -> PLUS(x,y) PLUS(s(x),y) -> PLUS(x,y) QUOT(s(x),s(y)) -> MINUS(x,y) QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) SUM(app(l,cons(x,cons(y,k)))) -> APP(l,sum(cons(x,cons(y,k)))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) SUM(app(l,cons(x,cons(y,k)))) -> SUM(cons(x,cons(y,k))) SUM(cons(x,cons(y,l))) -> PLUS(x,y) SUM(cons(x,cons(y,l))) -> SUM(cons(plus(x,y),l)) -> EAxioms: plus(plus(x5,x6),x7) = plus(x5,plus(x6,x7)) plus(x5,x6) = plus(x6,x5) -> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l minus(minus(x,y),z) -> minus(x,plus(y,z)) minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) popout

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

job log

popout

actions

all output return to TRS Equational