details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.06597 seconds
cpu usage	3.09088
user time	2.35544
system time	0.73544
max virtual memory	2811928.0
max residence set size	71816.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Proof: DP Processor: DPs: min#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) log#(s(s(X))) -> quot#(X,s(s(0()))) log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) TDG Processor: DPs: min#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) log#(s(s(X))) -> quot#(X,s(s(0()))) log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) graph: log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) -> log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) -> log#(s(s(X))) -> quot#(X,s(s(0()))) log#(s(s(X))) -> quot#(X,s(s(0()))) -> quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) log#(s(s(X))) -> quot#(X,s(s(0()))) -> quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) -> quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) -> quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> min#(X,Y) -> min#(s(X),s(Y)) -> min#(X,Y) min#(s(X),s(Y)) -> min#(X,Y) -> min#(s(X),s(Y)) -> min#(X,Y) SCC Processor: #sccs: 3 #rules: 3 #arcs: 8/25 DPs: log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Subterm Criterion Processor: simple projection: pi(min) = 0 pi(s) = [0,0,0] pi(quot) = [0,0] pi(log#) = [0,0,0] problem: DPs: TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Qed DPs: quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Subterm Criterion Processor: simple projection: pi(min) = 0 pi(quot#) = 0 problem: DPs: popout

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

job log

popout

actions

all output return to TRS Standard