details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.788681 seconds
cpu usage	2.03757
user time	1.43561
system time	0.601954
max virtual memory	4074712.0
max residence set size	68688.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) Proof: DP Processor: DPs: fact#(s(x)) -> p#(s(x)) fact#(s(x)) -> fact#(p(s(x))) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) *#(s(x),y) -> *#(x,y) *#(s(x),y) -> +#(*(x,y),y) +#(x,s(y)) -> +#(x,y) TRS: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) TDG Processor: DPs: fact#(s(x)) -> p#(s(x)) fact#(s(x)) -> fact#(p(s(x))) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) *#(s(x),y) -> *#(x,y) *#(s(x),y) -> +#(*(x,y),y) +#(x,s(y)) -> +#(x,y) TRS: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) graph: +#(x,s(y)) -> +#(x,y) -> +#(x,s(y)) -> +#(x,y) *#(s(x),y) -> +#(*(x,y),y) -> +#(x,s(y)) -> +#(x,y) *#(s(x),y) -> *#(x,y) -> *#(s(x),y) -> +#(*(x,y),y) *#(s(x),y) -> *#(x,y) -> *#(s(x),y) -> *#(x,y) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) -> *#(s(x),y) -> +#(*(x,y),y) fact#(s(x)) -> *#(s(x),fact(p(s(x)))) -> *#(s(x),y) -> *#(x,y) fact#(s(x)) -> fact#(p(s(x))) -> fact#(s(x)) -> *#(s(x),fact(p(s(x)))) fact#(s(x)) -> fact#(p(s(x))) -> fact#(s(x)) -> fact#(p(s(x))) fact#(s(x)) -> fact#(p(s(x))) -> fact#(s(x)) -> p#(s(x)) SCC Processor: #sccs: 3 #rules: 3 #arcs: 9/36 DPs: fact#(s(x)) -> fact#(p(s(x))) TRS: p(s(x)) -> x fact(0()) -> s(0()) fact(s(x)) -> *(s(x),fact(p(s(x)))) *(0(),y) -> 0() *(s(x),y) -> +(*(x,y),y) +(x,0()) -> x +(x,s(y)) -> s(+(x,y)) Usable Rule Processor: DPs: fact#(s(x)) -> fact#(p(s(x))) TRS: p(s(x)) -> x Semantic Labeling Processor: dimension: 2 usable rules: interpretation: [0 1] [p](x0) = [0 1]x0, [1 1] [1] [s](x0) = [1 1]x0 + [0] labeled: fact# usable (for model): fact# s p argument filtering: pi(s) = 0 pi(p) = 0 pi(fact#) = [] precedence: fact# ~ p ~ s problem: DPs: popout

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

job log

popout

actions

all output return to TRS Standard