details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.498804 seconds
cpu usage	0.499884
user time	0.278346
system time	0.221538
max virtual memory	113188.0
max residence set size	5788.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR k l x y) (THEORY (AC plus)) (RULES app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ) Problem 1: Reduction Order Processor: -> Rules: app(cons(x,l),k) -> cons(x,app(l,k)) app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [app](X1,X2) = 2.X1 + 2.X2 + 2 [plus](X1,X2) = X1 + X2 + 2 [pred](X) = X + 2 [sum](X) = X [0] = 1 [cons](X1,X2) = X1 + X2 + 2 [nil] = 2 [s](X) = X Problem 1: Reduction Order Processor: -> Rules: app(nil,k) -> k app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [app](X1,X2) = X1 + 2.X2 + 2 [plus](X1,X2) = X1 + X2 + 2 [pred](X) = X + 2 [sum](X) = X [0] = 2 [cons](X1,X2) = 2.X1 + 2.X2 + 2 [nil] = 2 [s](X) = X + 2 Problem 1: Reduction Order Processor: -> Rules: app(l,nil) -> l plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) pred(cons(s(x),nil)) -> cons(x,nil) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil)) -> cons(x,nil) ->Interpretation type: Linear ->Coefficients: popout

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

job log

popout

actions

all output return to TRS Equational