details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.539484 seconds
cpu usage	0.51
user time	0.5
system time	0.01
max virtual memory	219852.0
max residence set size	7956.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2)) 2: U12(tt(),V2) -> U13(isNat(activate(V2))) 3: U13(tt()) -> tt() 4: U21(tt(),V1) -> U22(isNat(activate(V1))) 5: U22(tt()) -> tt() 6: U31(tt(),N) -> activate(N) 7: U41(tt(),M,N) -> s(plus(activate(N),activate(M))) 8: and(tt(),X) -> activate(X) 9: isNat(n__0()) -> tt() 10: isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) 11: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1)) 12: isNatKind(n__0()) -> tt() 13: isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) 14: isNatKind(n__s(V1)) -> isNatKind(activate(V1)) 15: plus(N,0()) -> U31(and(isNat(N),n__isNatKind(N)),N) 16: plus(N,s(M)) -> U41(and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))),M,N) 17: 0() -> n__0() 18: plus(X1,X2) -> n__plus(X1,X2) 19: isNatKind(X) -> n__isNatKind(X) 20: s(X) -> n__s(X) 21: and(X1,X2) -> n__and(X1,X2) 22: isNat(X) -> n__isNat(X) 23: activate(n__0()) -> 0() 24: activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) 25: activate(n__isNatKind(X)) -> isNatKind(X) 26: activate(n__s(X)) -> s(activate(X)) 27: activate(n__and(X1,X2)) -> and(activate(X1),X2) 28: activate(n__isNat(X)) -> isNat(X) 29: activate(X) -> X Number of strict rules: 29 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U12(tt(),V2) -> #U13(isNat(activate(V2))) #2: #U12(tt(),V2) -> #isNat(activate(V2)) #3: #U12(tt(),V2) -> #activate(V2) #4: #U31(tt(),N) -> #activate(N) #5: #isNatKind(n__plus(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) #6: #isNatKind(n__plus(V1,V2)) -> #isNatKind(activate(V1)) #7: #isNatKind(n__plus(V1,V2)) -> #activate(V1) #8: #isNatKind(n__plus(V1,V2)) -> #activate(V2) #9: #isNat(n__s(V1)) -> #U21(isNatKind(activate(V1)),activate(V1)) #10: #isNat(n__s(V1)) -> #isNatKind(activate(V1)) #11: #isNat(n__s(V1)) -> #activate(V1) #12: #isNat(n__s(V1)) -> #activate(V1) #13: #activate(n__plus(X1,X2)) -> #plus(activate(X1),activate(X2)) #14: #activate(n__plus(X1,X2)) -> #activate(X1) #15: #activate(n__plus(X1,X2)) -> #activate(X2) #16: #activate(n__0()) -> #0() #17: #isNatKind(n__s(V1)) -> #isNatKind(activate(V1)) #18: #isNatKind(n__s(V1)) -> #activate(V1) #19: #activate(n__isNatKind(X)) -> #isNatKind(X) #20: #U41(tt(),M,N) -> #s(plus(activate(N),activate(M))) #21: #U41(tt(),M,N) -> #plus(activate(N),activate(M)) #22: #U41(tt(),M,N) -> #activate(N) #23: #U41(tt(),M,N) -> #activate(M) #24: #isNat(n__plus(V1,V2)) -> #U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2)) #25: #isNat(n__plus(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatKind(activate(V2))) #26: #isNat(n__plus(V1,V2)) -> #isNatKind(activate(V1)) #27: #isNat(n__plus(V1,V2)) -> #activate(V1) #28: #isNat(n__plus(V1,V2)) -> #activate(V2) #29: #isNat(n__plus(V1,V2)) -> #activate(V1) #30: #isNat(n__plus(V1,V2)) -> #activate(V2) #31: #activate(n__isNat(X)) -> #isNat(X) #32: #activate(n__and(X1,X2)) -> #and(activate(X1),X2) #33: #activate(n__and(X1,X2)) -> #activate(X1) #34: #activate(n__s(X)) -> #s(activate(X)) #35: #activate(n__s(X)) -> #activate(X) #36: #plus(N,s(M)) -> #U41(and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))),M,N) #37: #plus(N,s(M)) -> #and(and(isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N))) #38: #plus(N,s(M)) -> #and(isNat(M),n__isNatKind(M)) #39: #plus(N,s(M)) -> #isNat(M) #40: #U11(tt(),V1,V2) -> #U12(isNat(activate(V1)),activate(V2)) #41: #U11(tt(),V1,V2) -> #isNat(activate(V1)) #42: #U11(tt(),V1,V2) -> #activate(V1) #43: #U11(tt(),V1,V2) -> #activate(V2) #44: #and(tt(),X) -> #activate(X) #45: #plus(N,0()) -> #U31(and(isNat(N),n__isNatKind(N)),N) #46: #plus(N,0()) -> #and(isNat(N),n__isNatKind(N)) #47: #plus(N,0()) -> #isNat(N) #48: #U21(tt(),V1) -> #U22(isNat(activate(V1))) #49: #U21(tt(),V1) -> #isNat(activate(V1)) #50: #U21(tt(),V1) -> #activate(V1) Number of SCCs: 1, DPs: 45 SCC { #2..15 #17..19 #21..33 #35..47 #49 #50 } POLO(Sum)... POLO(max)... succeeded. #0 w: 0 isNatKind w: x1 + 2 U21 w: max(x2 + 3) U11 w: max(x2 + 3, x3 + 1664) s w: x1 #isNat w: x1 + 3 activate w: x1 n__isNatKind w: x1 + 2 and w: max(x1 + 2, x2 + 3) #plus w: max(x1 + 9, x2 + 8) #activate w: x1 + 1 #U13 w: 0 popout

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

job log

popout

actions

all output return to TRS Standard