details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.0499558448792 seconds
cpu usage	0.052369459
max memory	7675904.0

stage attributes

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