details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.109434843063 seconds
cpu usage	0.062495826
max memory	8806400.0

stage attributes

key	value
output-size	2371
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: minus(X,s(Y)) -> pred(minus(X,Y)) 2: minus(X,0()) -> X 3: pred(s(X)) -> X 4: le(s(X),s(Y)) -> le(X,Y) 5: le(s(X),0()) -> false() 6: le(0(),Y) -> true() 7: gcd(0(),Y) -> 0() 8: gcd(s(X),0()) -> s(X) 9: gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y)) 10: if(true(),s(X),s(Y)) -> gcd(minus(X,Y),s(Y)) 11: if(false(),s(X),s(Y)) -> gcd(minus(Y,X),s(X)) Number of strict rules: 11 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #gcd(s(X),s(Y)) -> #if(le(Y,X),s(X),s(Y)) #2: #gcd(s(X),s(Y)) -> #le(Y,X) #3: #if(false(),s(X),s(Y)) -> #gcd(minus(Y,X),s(X)) #4: #if(false(),s(X),s(Y)) -> #minus(Y,X) #5: #if(true(),s(X),s(Y)) -> #gcd(minus(X,Y),s(Y)) #6: #if(true(),s(X),s(Y)) -> #minus(X,Y) #7: #minus(X,s(Y)) -> #pred(minus(X,Y)) #8: #minus(X,s(Y)) -> #minus(X,Y) #9: #le(s(X),s(Y)) -> #le(X,Y) Number of SCCs: 3, DPs: 5 SCC { #8 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (0) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) false() w: (0) true() w: (0) pred(x1) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #minus(x1,x2) w: (x2) #pred(x1) w: (0) #if(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #8 Number of SCCs: 2, DPs: 4 SCC { #9 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (x2) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) false() w: (0) true() w: (0) pred(x1) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #minus(x1,x2) w: (0) #pred(x1) w: (0) #if(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 1, DPs: 3 SCC { #1 #3 #5 } Sum... succeeded. le(x1,x2) w: (1 + x2 + x1) s(x1) w: (10453 + x1) #le(x1,x2) w: (0) minus(x1,x2) w: (10451 + x1) gcd(x1,x2) w: (0) false() w: (10456) true() w: (3) pred(x1) w: (x1) 0() w: (1) if(x1,x2,x3) w: (0) #minus(x1,x2) w: (0) #pred(x1) w: (0) #if(x1,x2,x3) w: (x3 + x2) #gcd(x1,x2) w: (1 + x2 + x1) USABLE RULES: { 1..3 } Removed DPs: #1 #3 #5 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to TRS Standard