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	n007.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.0965001583099 seconds
cpu usage	0.076457563
max memory	8540160.0

stage attributes

key	value
output-size	2420
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: le(0(),y) -> true() 2: le(s(x),0()) -> false() 3: le(s(x),s(y)) -> le(x,y) 4: pred(s(x)) -> x 5: minus(x,0()) -> x 6: minus(x,s(y)) -> pred(minus(x,y)) 7: gcd(0(),y) -> y 8: gcd(s(x),0()) -> s(x) 9: gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 10: if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y)) 11: if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x)) Number of strict rules: 11 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #minus(x,s(y)) -> #pred(minus(x,y)) #2: #minus(x,s(y)) -> #minus(x,y) #3: #gcd(s(x),s(y)) -> #if_gcd(le(y,x),s(x),s(y)) #4: #gcd(s(x),s(y)) -> #le(y,x) #5: #if_gcd(false(),s(x),s(y)) -> #gcd(minus(y,x),s(x)) #6: #if_gcd(false(),s(x),s(y)) -> #minus(y,x) #7: #if_gcd(true(),s(x),s(y)) -> #gcd(minus(x,y),s(y)) #8: #if_gcd(true(),s(x),s(y)) -> #minus(x,y) #9: #le(s(x),s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 5 SCC { #2 } 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) #minus(x1,x2) w: (x2) #pred(x1) w: (0) if_gcd(x1,x2,x3) w: (0) #if_gcd(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #2 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) #minus(x1,x2) w: (0) #pred(x1) w: (0) if_gcd(x1,x2,x3) w: (0) #if_gcd(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 1, DPs: 3 SCC { #3 #5 #7 } Sum... succeeded. le(x1,x2) w: (4 + x2) s(x1) w: (3 + x1) #le(x1,x2) w: (0) minus(x1,x2) w: (1 + x1) gcd(x1,x2) w: (0) false() w: (6) true() w: (5) pred(x1) w: (x1) 0() w: (1) #minus(x1,x2) w: (0) #pred(x1) w: (0) if_gcd(x1,x2,x3) w: (0) #if_gcd(x1,x2,x3) w: (28881 + x3 + x2) #gcd(x1,x2) w: (28882 + x2 + x1) USABLE RULES: { 4..6 } Removed DPs: #3 #5 #7 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