details

property	value
status	complete
benchmark	#3.8a.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n183.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.12154 seconds
cpu usage	3.21015
user time	2.47893
system time	0.731217
max virtual memory	3199896.0
max residence set size	73200.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) Proof: DP Processor: DPs: minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> quot#(minus(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: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) log(s(0())) -> 0() log(s(s(x))) -> s(log(s(quot(x,s(s(0())))))) TDG Processor: DPs: minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> quot#(minus(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: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(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#(minus(x,y),s(y)) log#(s(s(x))) -> quot#(x,s(s(0()))) -> quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) -> quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) quot#(s(x),s(y)) -> quot#(minus(x,y),s(y)) -> quot#(s(x),s(y)) -> minus#(x,y) quot#(s(x),s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> pred#(minus(x,y)) quot#(s(x),s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> pred#(minus(x,y)) minus#(x,s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> minus#(x,y) SCC Processor: #sccs: 3 #rules: 3 #arcs: 10/36 DPs: log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(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(s) = [0,0] pi(pred) = 0 pi(minus) = 0 pi(quot) = 0 pi(log#) = [0,0] problem: DPs: TRS: pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(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#(minus(x,y),s(y)) TRS: popout

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

job log

popout

actions

all output return to TRS Standard