details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.261303 seconds
cpu usage	0.087422
user time	0.054931
system time	0.032491
max virtual memory	113188.0
max residence set size	6988.0

stage attributes

key	value
starexec-result	MAYBE

output

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: U11(tt(),M',N') -> U12(equal(_>_(N',M'),true()),M',N') 9: U12(tt(),M',N') -> gcd(d(N',M'),M') 10: U21(tt(),M',N) -> U22(equal(_>_(M',N),true())) 11: U22(tt()) -> 0() 12: U31(tt(),M',N) -> U32(equal(_>_(N,M'),true()),M',N) 13: U32(tt(),M',N) -> s_(quot(d(N,M'),M')) 14: _*_(N,0()) -> 0() 15: _*_(s_(N),s_(M)) -> s_(_+_(N,_+_(M,_*_(N,M)))) 16: _+_(N,0()) -> N 17: _+_(s_(N),s_(M)) -> s_(s_(_+_(N,M))) 18: _<_(N,M) -> _>_(M,N) 19: _>_(0(),M) -> false() 20: _>_(N',0()) -> true() 21: _>_(s_(N),s_(M)) -> _>_(N,M) 22: and(tt(),X) -> X 23: d(0(),N) -> N 24: d(s_(N),s_(M)) -> d(N,M) 25: equal(X,X) -> tt() 26: gcd(0(),N) -> 0() 27: gcd(N',M') -> U11(tt(),M',N') 28: gcd(N',N') -> N' 29: p_(s_(N)) -> N 30: quot(M',M') -> s_(0()) 31: quot(N,M') -> U21(tt(),M',N) 32: quot(N,M') -> U31(tt(),M',N) Number of strict rules: 32 Direct POLO(bPol) ... failed. Uncurrying U11 U21 U31 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: U11^1_tt(M',N') -> U12(equal(_>_(N',M'),true()),M',N') 9: U12(tt(),M',N') -> gcd(d(N',M'),M') 10: U21^1_tt(M',N) -> U22(equal(_>_(M',N),true())) 11: U22(tt()) -> 0() 12: U31^1_tt(M',N) -> U32(equal(_>_(N,M'),true()),M',N) 13: U32(tt(),M',N) -> s_(quot(d(N,M'),M')) 14: _*_(N,0()) -> 0() 15: _*_(s_(N),s_(M)) -> s_(_+_(N,_+_(M,_*_(N,M)))) 16: _+_(N,0()) -> N 17: _+_(s_(N),s_(M)) -> s_(s_(_+_(N,M))) 18: _<_(N,M) -> _>_(M,N) 19: _>_(0(),M) -> false() 20: _>_(N',0()) -> true() 21: _>_(s_(N),s_(M)) -> _>_(N,M) 22: and(tt(),X) -> X 23: d(0(),N) -> N 24: d(s_(N),s_(M)) -> d(N,M) 25: equal(X,X) -> tt() 26: gcd(0(),N) -> 0() 27: gcd(N',M') -> U11^1_tt(M',N') 28: gcd(N',N') -> N' 29: p_(s_(N)) -> N 30: quot(M',M') -> s_(0()) 31: quot(N,M') -> U21^1_tt(M',N) 32: quot(N,M') -> U31^1_tt(M',N) 33: U31(tt(),_2,_3) ->= U31^1_tt(_2,_3) 34: U21(tt(),_2,_3) ->= U21^1_tt(_2,_3) 35: U11(tt(),_2,_3) ->= U11^1_tt(_2,_3) Number of strict rules: 32 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #U11(tt(),_2,_3) ->? #U11^1_tt(_2,_3) #2: #U32(tt(),M',N) -> #quot(d(N,M'),M') #3: #U32(tt(),M',N) -> #d(N,M') #4: #U12(tt(),M',N') -> #gcd(d(N',M'),M') #5: #U12(tt(),M',N') -> #d(N',M') #6: #d(s_(N),s_(M)) -> #d(N,M) #7: #U31^1_tt(M',N) -> #U32(equal(_>_(N,M'),true()),M',N) #8: #U31^1_tt(M',N) -> #equal(_>_(N,M'),true()) #9: #U31^1_tt(M',N) -> #_>_(N,M') #10: #quot(N,M') -> #U21^1_tt(M',N) #11: #U21^1_tt(M',N) -> #U22(equal(_>_(M',N),true())) #12: #U21^1_tt(M',N) -> #equal(_>_(M',N),true()) #13: #U21^1_tt(M',N) -> #_>_(M',N) #14: #U31(tt(),_2,_3) ->? #U31^1_tt(_2,_3) #15: #U21(tt(),_2,_3) ->? #U21^1_tt(_2,_3) #16: #gcd(N',M') -> #U11^1_tt(M',N') #17: #_+_(s_(N),s_(M)) -> #_+_(N,M) #18: #quot(N,M') -> #U31^1_tt(M',N) #19: #_>_(s_(N),s_(M)) -> #_>_(N,M) #20: #U11^1_tt(M',N') -> #U12(equal(_>_(N',M'),true()),M',N') #21: #U11^1_tt(M',N') -> #equal(_>_(N',M'),true()) #22: #U11^1_tt(M',N') -> #_>_(N',M') #23: #_*_(s_(N),s_(M)) -> #_+_(N,_+_(M,_*_(N,M))) popout

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

job log

popout

actions

all output return to TRS Equational