details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	6.05303 seconds
cpu usage	22.2971
user time	19.0931
system time	3.20407
max virtual memory	6256692.0
max residence set size	159168.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: app(nil(),k) -> k app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) sum(cons(x,nil())) -> cons(x,nil()) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) pred(cons(s(x),nil())) -> cons(x,nil()) plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) plus(zero(),y) -> y plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y)))) id(x) -> x if(true(),x,y) -> x if(false(),x,y) -> y not(x) -> if(x,false(),true()) gt(s(x),zero()) -> true() gt(zero(),y) -> false() gt(s(x),s(y)) -> gt(x,y) Proof: DP Processor: DPs: app#(cons(x,l),k) -> app#(l,k) sum#(cons(x,cons(y,l))) -> plus#(x,y) sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) 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#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l)))) plus#(s(x),s(y)) -> id#(y) plus#(s(x),s(y)) -> id#(x) plus#(s(x),s(y)) -> not#(gt(x,y)) plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y)) plus#(s(x),s(y)) -> gt#(x,y) plus#(s(x),s(y)) -> if#(gt(x,y),x,y) plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) plus#(s(x),x) -> id#(x) plus#(s(x),x) -> gt#(x,x) plus#(s(x),x) -> if#(gt(x,x),id(x),id(x)) plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) plus#(id(x),s(y)) -> gt#(s(y),y) plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y)) plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) not#(x) -> if#(x,false(),true()) gt#(s(x),s(y)) -> gt#(x,y) TRS: app(nil(),k) -> k app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) sum(cons(x,nil())) -> cons(x,nil()) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) pred(cons(s(x),nil())) -> cons(x,nil()) plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) plus(zero(),y) -> y plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y)))) id(x) -> x if(true(),x,y) -> x if(false(),x,y) -> y not(x) -> if(x,false(),true()) gt(s(x),zero()) -> true() gt(zero(),y) -> false() gt(s(x),s(y)) -> gt(x,y) TDG Processor: DPs: app#(cons(x,l),k) -> app#(l,k) sum#(cons(x,cons(y,l))) -> plus#(x,y) sum#(cons(x,cons(y,l))) -> sum#(cons(plus(x,y),l)) sum#(app(l,cons(x,cons(y,k)))) -> sum#(cons(x,cons(y,k))) 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#(plus(cons(0(),x),cons(y,l))) -> sum#(cons(s(x),cons(y,l))) sum#(plus(cons(0(),x),cons(y,l))) -> pred#(sum(cons(s(x),cons(y,l)))) plus#(s(x),s(y)) -> id#(y) plus#(s(x),s(y)) -> id#(x) plus#(s(x),s(y)) -> not#(gt(x,y)) plus#(s(x),s(y)) -> if#(not(gt(x,y)),id(x),id(y)) plus#(s(x),s(y)) -> gt#(x,y) plus#(s(x),s(y)) -> if#(gt(x,y),x,y) plus#(s(x),s(y)) -> plus#(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))) plus#(s(x),x) -> id#(x) plus#(s(x),x) -> gt#(x,x) plus#(s(x),x) -> if#(gt(x,x),id(x),id(x)) plus#(s(x),x) -> plus#(if(gt(x,x),id(x),id(x)),s(x)) plus#(id(x),s(y)) -> gt#(s(y),y) plus#(id(x),s(y)) -> if#(gt(s(y),y),y,s(y)) plus#(id(x),s(y)) -> plus#(x,if(gt(s(y),y),y,s(y))) not#(x) -> if#(x,false(),true()) gt#(s(x),s(y)) -> gt#(x,y) TRS: app(nil(),k) -> k app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) popout

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

job log

popout

actions

all output return to TRS Standard