details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.942631006241 seconds
cpu usage	2.488292856
max memory	5.58321664E8

stage attributes

key	value
output-size	6690
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) pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) gcd(0(),y) -> y gcd(s(x),0()) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y)) if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x)) Proof: DP Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) gcd#(s(x),s(y)) -> le#(y,x) gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) if_gcd#(true(),s(x),s(y)) -> minus#(x,y) if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) if_gcd#(false(),s(x),s(y)) -> minus#(y,x) if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) gcd(0(),y) -> y gcd(s(x),0()) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y)) if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x)) TDG Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,s(y)) -> minus#(x,y) minus#(x,s(y)) -> pred#(minus(x,y)) gcd#(s(x),s(y)) -> le#(y,x) gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) if_gcd#(true(),s(x),s(y)) -> minus#(x,y) if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) if_gcd#(false(),s(x),s(y)) -> minus#(y,x) if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) pred(s(x)) -> x minus(x,0()) -> x minus(x,s(y)) -> pred(minus(x,y)) gcd(0(),y) -> y gcd(s(x),0()) -> s(x) gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y)) if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x)) graph: if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) -> gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) -> gcd#(s(x),s(y)) -> le#(y,x) if_gcd#(false(),s(x),s(y)) -> minus#(y,x) -> minus#(x,s(y)) -> pred#(minus(x,y)) if_gcd#(false(),s(x),s(y)) -> minus#(y,x) -> minus#(x,s(y)) -> minus#(x,y) if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) -> gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) -> gcd#(s(x),s(y)) -> le#(y,x) if_gcd#(true(),s(x),s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> pred#(minus(x,y)) if_gcd#(true(),s(x),s(y)) -> minus#(x,y) -> minus#(x,s(y)) -> minus#(x,y) gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) -> if_gcd#(false(),s(x),s(y)) -> gcd#(minus(y,x),s(x)) gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) -> if_gcd#(false(),s(x),s(y)) -> minus#(y,x) gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) -> if_gcd#(true(),s(x),s(y)) -> gcd#(minus(x,y),s(y)) gcd#(s(x),s(y)) -> if_gcd#(le(y,x),s(x),s(y)) -> if_gcd#(true(),s(x),s(y)) -> minus#(x,y) gcd#(s(x),s(y)) -> le#(y,x) -> le#(s(x),s(y)) -> le#(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) le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y) SCC Processor: #sccs: 3 popout

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

job log

popout

actions

all output return to TRS Standard