details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.27264 seconds
cpu usage	7.74181
user time	6.05683
system time	1.68498
max virtual memory	5866416.0
max residence set size	90592.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) times(0(),y) -> 0() times(s(x),y) -> plus(y,times(p(s(x)),y)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) fac(0(),x) -> x fac(s(x),y) -> fac(p(s(x)),times(s(x),y)) factorial(x) -> fac(x,s(0())) Proof: DP Processor: DPs: plus#(s(x),y) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) times#(s(x),y) -> p#(s(x)) times#(s(x),y) -> times#(p(s(x)),y) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) p#(s(s(x))) -> p#(s(x)) fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) factorial#(x) -> fac#(x,s(0())) TRS: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) times(0(),y) -> 0() times(s(x),y) -> plus(y,times(p(s(x)),y)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) fac(0(),x) -> x fac(s(x),y) -> fac(p(s(x)),times(s(x),y)) factorial(x) -> fac(x,s(0())) TDG Processor: DPs: plus#(s(x),y) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) times#(s(x),y) -> p#(s(x)) times#(s(x),y) -> times#(p(s(x)),y) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) p#(s(s(x))) -> p#(s(x)) fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) factorial#(x) -> fac#(x,s(0())) TRS: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) times(0(),y) -> 0() times(s(x),y) -> plus(y,times(p(s(x)),y)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) fac(0(),x) -> x fac(s(x),y) -> fac(p(s(x)),times(s(x),y)) factorial(x) -> fac(x,s(0())) graph: factorial#(x) -> fac#(x,s(0())) -> fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) factorial#(x) -> fac#(x,s(0())) -> fac#(s(x),y) -> p#(s(x)) factorial#(x) -> fac#(x,s(0())) -> fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) -> fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) -> fac#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) -> fac#(s(x),y) -> times#(s(x),y) fac#(s(x),y) -> times#(s(x),y) -> times#(s(x),y) -> plus#(y,times(p(s(x)),y)) fac#(s(x),y) -> times#(s(x),y) -> times#(s(x),y) -> times#(p(s(x)),y) fac#(s(x),y) -> times#(s(x),y) -> times#(s(x),y) -> p#(s(x)) fac#(s(x),y) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) times#(s(x),y) -> times#(p(s(x)),y) -> times#(s(x),y) -> plus#(y,times(p(s(x)),y)) times#(s(x),y) -> times#(p(s(x)),y) -> times#(s(x),y) -> times#(p(s(x)),y) times#(s(x),y) -> times#(p(s(x)),y) -> times#(s(x),y) -> p#(s(x)) times#(s(x),y) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) -> plus#(s(x),y) -> plus#(p(s(x)),y) times#(s(x),y) -> plus#(y,times(p(s(x)),y)) -> plus#(s(x),y) -> p#(s(x)) p#(s(s(x))) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) plus#(s(x),y) -> p#(s(x)) -> p#(s(s(x))) -> p#(s(x)) plus#(s(x),y) -> plus#(p(s(x)),y) -> plus#(s(x),y) -> plus#(p(s(x)),y) plus#(s(x),y) -> plus#(p(s(x)),y) -> plus#(s(x),y) -> p#(s(x)) SCC Processor: #sccs: 4 #rules: 4 #arcs: 20/100 DPs: fac#(s(x),y) -> fac#(p(s(x)),times(s(x),y)) TRS: plus(0(),x) -> x plus(s(x),y) -> s(plus(p(s(x)),y)) popout

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

job log

popout

actions

all output return to TRS Standard