details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.336106 seconds
cpu usage	0.08003
user time	0.05098
system time	0.02905
max virtual memory	113188.0
max residence set size	9300.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: C symbols: d + gcd * 1: p(s(N)) -> N 2: +(N,0()) -> N 3: +(s(N),s(M)) -> s(s(+(N,M))) 4: *(N,0()) -> 0() 5: *(s(N),s(M)) -> s(+(N,+(M,*(N,M)))) 6: gt(0(),M) -> False() 7: gt(NzN,0()) -> u_4(is_NzNat(NzN)) 8: u_4(True()) -> True() 9: is_NzNat(0()) -> False() 10: is_NzNat(s(N)) -> True() 11: gt(s(N),s(M)) -> gt(N,M) 12: lt(N,M) -> gt(M,N) 13: d(0(),N) -> N 14: d(s(N),s(M)) -> d(N,M) 15: quot(N,NzM) -> u_11(is_NzNat(NzM),N,NzM) 16: u_11(True(),N,NzM) -> u_1(gt(N,NzM),N,NzM) 17: u_1(True(),N,NzM) -> s(quot(d(N,NzM),NzM)) 18: quot(NzM,NzM) -> u_01(is_NzNat(NzM)) 19: u_01(True()) -> s(0()) 20: quot(N,NzM) -> u_21(is_NzNat(NzM),NzM,N) 21: u_21(True(),NzM,N) -> u_2(gt(NzM,N)) 22: u_2(True()) -> 0() 23: gcd(0(),N) -> 0() 24: gcd(NzM,NzM) -> u_02(is_NzNat(NzM),NzM) 25: u_02(True(),NzM) -> NzM 26: gcd(NzN,NzM) -> u_31(is_NzNat(NzN),is_NzNat(NzM),NzN,NzM) 27: u_31(True(),True(),NzN,NzM) -> u_3(gt(NzN,NzM),NzN,NzM) 28: u_3(True(),NzN,NzM) -> gcd(d(NzN,NzM),NzM) Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #gt(s(N),s(M)) -> #gt(N,M) #2: #gcd(NzM,NzM) -> #u_02(is_NzNat(NzM),NzM) #3: #gcd(NzM,NzM) -> #is_NzNat(NzM) #4: #lt(N,M) -> #gt(M,N) #5: #d(s(N),s(M)) -> #d(N,M) #6: #quot(N,NzM) -> #u_21(is_NzNat(NzM),NzM,N) #7: #quot(N,NzM) -> #is_NzNat(NzM) #8: #gt(NzN,0()) -> #u_4(is_NzNat(NzN)) #9: #gt(NzN,0()) -> #is_NzNat(NzN) #10: #*(s(N),s(M)) -> #+(N,+(M,*(N,M))) #11: #*(s(N),s(M)) -> #+(M,*(N,M)) #12: #*(s(N),s(M)) -> #*(N,M) #13: #u_3(True(),NzN,NzM) -> #gcd(d(NzN,NzM),NzM) #14: #u_3(True(),NzN,NzM) -> #d(NzN,NzM) #15: #u_31(True(),True(),NzN,NzM) -> #u_3(gt(NzN,NzM),NzN,NzM) #16: #u_31(True(),True(),NzN,NzM) -> #gt(NzN,NzM) #17: #u_1(True(),N,NzM) -> #quot(d(N,NzM),NzM) #18: #u_1(True(),N,NzM) -> #d(N,NzM) #19: #gcd(NzN,NzM) -> #u_31(is_NzNat(NzN),is_NzNat(NzM),NzN,NzM) #20: #gcd(NzN,NzM) -> #is_NzNat(NzN) #21: #gcd(NzN,NzM) -> #is_NzNat(NzM) #22: #u_21(True(),NzM,N) -> #u_2(gt(NzM,N)) #23: #u_21(True(),NzM,N) -> #gt(NzM,N) #24: #u_11(True(),N,NzM) -> #u_1(gt(N,NzM),N,NzM) #25: #u_11(True(),N,NzM) -> #gt(N,NzM) #26: #+(s(N),s(M)) -> #+(N,M) #27: #quot(N,NzM) -> #u_11(is_NzNat(NzM),N,NzM) #28: #quot(N,NzM) -> #is_NzNat(NzM) #29: #quot(NzM,NzM) -> #u_01(is_NzNat(NzM)) #30: #quot(NzM,NzM) -> #is_NzNat(NzM) Number of SCCs: 6, DPs: 10 SCC { #12 } POLO(Sum)... succeeded. #u_3 w: 0 u_11 w: 0 d w: 0 is_NzNat w: 0 s w: x1 + 1 #lt w: 0 u_3 w: 0 #u_01 w: 0 u_21 w: 0 gt w: 0 u_2 w: 0 gcd w: 0 #u_21 w: 0 False w: 0 #* w: x1 + x2 #p w: 0 True w: 0 #is_NzNat w: 0 p w: 0 0 w: 0 quot w: 0 #u_2 w: 0 u_4 w: 0 #d w: 0 #gt w: 0 #u_4 w: 0 u_31 w: 0 u_02 w: 0 #u_11 w: 0 #u_31 w: 0 u_1 w: 0 #quot w: 0 popout

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

job log

popout

actions

all output return to TRS Equational