details

property	value
status	complete
benchmark	kabasci04.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	AProVE_07

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.125715017319 seconds
cpu usage	0.083873795
max memory	1.1010048E7

stage attributes

key	value
output-size	2959
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: min(x,0()) -> 0() 2: min(0(),y) -> 0() 3: min(s(x),s(y)) -> s(min(x,y)) 4: max(x,0()) -> x 5: max(0(),y) -> y 6: max(s(x),s(y)) -> s(max(x,y)) 7: minus(x,0()) -> x 8: minus(s(x),s(y)) -> s(minus(x,any(y))) 9: gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,y)),s(min(x,y))) 10: any(s(x)) -> s(s(any(x))) 11: any(x) -> x Number of strict rules: 11 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #max(s(x),s(y)) -> #max(x,y) #2: #gcd(s(x),s(y)) -> #gcd(minus(max(x,y),min(x,y)),s(min(x,y))) #3: #gcd(s(x),s(y)) -> #minus(max(x,y),min(x,y)) #4: #gcd(s(x),s(y)) -> #max(x,y) #5: #gcd(s(x),s(y)) -> #min(x,y) #6: #gcd(s(x),s(y)) -> #min(x,y) #7: #any(s(x)) -> #any(x) #8: #min(s(x),s(y)) -> #min(x,y) #9: #minus(s(x),s(y)) -> #minus(x,any(y)) #10: #minus(s(x),s(y)) -> #any(y) Number of SCCs: 5, DPs: 5 SCC { #7 } Sum... succeeded. s(x1) w: (1 + x1) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) any(x1) w: (0) #min(x1,x2) w: (0) #any(x1) w: (x1) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (0) #minus(x1,x2) w: (0) min(x1,x2) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #7 Number of SCCs: 4, DPs: 4 SCC { #1 } Sum... succeeded. s(x1) w: (1 + x1) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) any(x1) w: (0) #min(x1,x2) w: (0) #any(x1) w: (0) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (x2) #minus(x1,x2) w: (0) min(x1,x2) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 3, DPs: 3 SCC { #8 } Sum... succeeded. s(x1) w: (1 + x1) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) any(x1) w: (0) #min(x1,x2) w: (x2) #any(x1) w: (0) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (0) #minus(x1,x2) w: (0) min(x1,x2) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #8 Number of SCCs: 2, DPs: 2 SCC { #9 } Sum... succeeded. s(x1) w: (1 + x1) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) any(x1) w: (1) #min(x1,x2) w: (0) #any(x1) w: (0) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (0) #minus(x1,x2) w: (2437 + x1) min(x1,x2) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } popout

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

job log

popout

actions

all output return to TRS Standard