details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.51874804497 seconds
cpu usage	4.473708526
max memory	6.63937024E8

stage attributes

key	value
output-size	9623
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) if_minus(true(),s(x),y) -> 0() if_minus(false(),s(x),y) -> s(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: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),y) -> le#(s(x),y) minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_minus#(false(),s(x),y) -> 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: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) if_minus(true(),s(x),y) -> 0() if_minus(false(),s(x),y) -> s(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: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),y) -> le#(s(x),y) minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_minus#(false(),s(x),y) -> 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: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) if_minus(true(),s(x),y) -> 0() if_minus(false(),s(x),y) -> s(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#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) quot#(s(x),s(y)) -> minus#(x,y) -> minus#(s(x),y) -> le#(s(x),y) if_minus#(false(),s(x),y) -> minus#(x,y) -> minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_minus#(false(),s(x),y) -> minus#(x,y) -> minus#(s(x),y) -> le#(s(x),y) minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) -> if_minus#(false(),s(x),y) -> minus#(x,y) minus#(s(x),y) -> le#(s(x),y) -> le#(s(x),s(y)) -> le#(x,y) le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y) SCC Processor: #sccs: 4 #rules: 5 #arcs: 13/64 DPs: log#(s(s(x))) -> log#(s(quot(x,s(s(0()))))) TRS: le(0(),y) -> true() le(s(x),0()) -> false() popout

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

job log

popout

actions

all output return to TRS Standard