details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.885131835938 seconds
cpu usage	0.937609355
max memory	4.0374272E7

stage attributes

key	value
output-size	14176
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: C symbols: d _+_ _*_ gcd 1: 1() -> s_(0()) 2: 2() -> s_(s_(0())) 3: 3() -> s_(s_(s_(0()))) 4: 4() -> s_(s_(s_(s_(0())))) 5: 5() -> s_(s_(s_(s_(s_(0()))))) 6: 6() -> s_(s_(s_(s_(s_(s_(0())))))) 7: 7() -> s_(s_(s_(s_(s_(s_(s_(0()))))))) 8: U101(tt(),M,N) -> d(N,M) 9: U11(tt()) -> 0() 10: U111(tt()) -> 0() 11: U121(tt(),M',N') -> U122(equal(_>_(N',M'),true()),M',N') 12: U122(tt(),M',N') -> gcd(d(N',M'),M') 13: U131(tt(),N') -> N' 14: U141(tt(),N) -> N 15: U151(tt()) -> s_(0()) 16: U161(tt(),M',N) -> U162(equal(_>_(M',N),true())) 17: U162(tt()) -> 0() 18: U171(tt(),M',N) -> U172(equal(_>_(N,M'),true()),M',N) 19: U172(tt(),M',N) -> s_(quot(d(N,M'),M')) 20: U21(tt(),M,N) -> s_(_+_(N,_+_(M,_*_(N,M)))) 21: U31(tt(),N) -> N 22: U41(tt(),M,N) -> s_(s_(_+_(N,M))) 23: U51(tt(),M,N) -> _>_(M,N) 24: U61(tt()) -> false() 25: U71(tt()) -> true() 26: U81(tt(),M,N) -> _>_(N,M) 27: U91(tt(),N) -> N 28: _*_(N,0()) -> U11(isNat(N)) 29: _*_(s_(N),s_(M)) -> U21(and(isNat(M),isNat(N)),M,N) 30: _+_(N,0()) -> U31(isNat(N),N) 31: _+_(s_(N),s_(M)) -> U41(and(isNat(M),isNat(N)),M,N) 32: _<_(N,M) -> U51(and(isNat(M),isNat(N)),M,N) 33: _>_(0(),M) -> U61(isNat(M)) 34: _>_(N',0()) -> U71(isNzNat(N')) 35: _>_(s_(N),s_(M)) -> U81(and(isNat(M),isNat(N)),M,N) 36: and(tt(),X) -> X 37: d(0(),N) -> U91(isNat(N),N) 38: d(s_(N),s_(M)) -> U101(and(isNat(M),isNat(N)),M,N) 39: equal(X,X) -> tt() 40: gcd(0(),N) -> U111(isNat(N)) 41: gcd(N',M') -> U121(and(isNzNat(M'),isNzNat(N')),M',N') 42: gcd(N',N') -> U131(isNzNat(N'),N') 43: isBoolean(false()) -> tt() 44: isBoolean(true()) -> tt() 45: isBoolean(_<_(V1,V2)) -> and(isNat(V1),isNat(V2)) 46: isBoolean(_>_(V1,V2)) -> and(isNat(V1),isNat(V2)) 47: isNat(0()) -> tt() 48: isNat(V) -> isNzNat(V) 49: isNat(_*_(V1,V2)) -> and(isNat(V1),isNat(V2)) 50: isNat(_+_(V1,V2)) -> and(isNat(V1),isNat(V2)) 51: isNat(d(V1,V2)) -> and(isNat(V1),isNat(V2)) 52: isNat(gcd(V1,V2)) -> and(isNat(V1),isNat(V2)) 53: isNat(p_(V1)) -> isNzNat(V1) 54: isNat(quot(V1,V2)) -> and(isNat(V1),isNzNat(V2)) 55: isNzNat(1()) -> tt() 56: isNzNat(2()) -> tt() 57: isNzNat(3()) -> tt() 58: isNzNat(4()) -> tt() 59: isNzNat(5()) -> tt() 60: isNzNat(6()) -> tt() 61: isNzNat(7()) -> tt() 62: isNzNat(_*_(V1,V2)) -> and(isNzNat(V1),isNzNat(V2)) 63: isNzNat(gcd(V1,V2)) -> and(isNzNat(V1),isNzNat(V2)) 64: isNzNat(s_(V1)) -> isNat(V1) 65: p_(s_(N)) -> U141(isNat(N),N) 66: quot(M',M') -> U151(isNzNat(M')) 67: quot(N,M') -> U161(and(isNzNat(M'),isNat(N)),M',N) 68: quot(N,M') -> U171(and(isNzNat(M'),isNat(N)),M',N) Number of strict rules: 68 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #_*_(s_(N),s_(M)) -> #U21(and(isNat(M),isNat(N)),M,N) #2: #_*_(s_(N),s_(M)) -> #and(isNat(M),isNat(N)) #3: #_*_(s_(N),s_(M)) -> #isNat(M) #4: #_*_(s_(N),s_(M)) -> #isNat(N) #5: #_>_(s_(N),s_(M)) -> #U81(and(isNat(M),isNat(N)),M,N) #6: #_>_(s_(N),s_(M)) -> #and(isNat(M),isNat(N)) #7: #_>_(s_(N),s_(M)) -> #isNat(M) #8: #_>_(s_(N),s_(M)) -> #isNat(N) #9: #quot(M',M') -> #U151(isNzNat(M')) #10: #quot(M',M') -> #isNzNat(M') #11: #isBoolean(_>_(V1,V2)) -> #and(isNat(V1),isNat(V2)) #12: #isBoolean(_>_(V1,V2)) -> #isNat(V1) #13: #isBoolean(_>_(V1,V2)) -> #isNat(V2) #14: #gcd(N',N') -> #U131(isNzNat(N'),N') #15: #gcd(N',N') -> #isNzNat(N') #16: #gcd(N',M') -> #U121(and(isNzNat(M'),isNzNat(N')),M',N') #17: #gcd(N',M') -> #and(isNzNat(M'),isNzNat(N')) #18: #gcd(N',M') -> #isNzNat(M') #19: #gcd(N',M') -> #isNzNat(N') popout

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

job log

popout

actions

all output return to TRS Equational