details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.184785 seconds
cpu usage	0.055771
user time	0.032485
system time	0.023286
max virtual memory	113188.0
max residence set size	6436.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: active(U11(tt(),N)) -> mark(N) 2: active(U21(tt(),M,N)) -> mark(s(plus(N,M))) 3: active(and(tt(),X)) -> mark(X) 4: active(isNat(0())) -> mark(tt()) 5: active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) 6: active(isNat(s(V1))) -> mark(isNat(V1)) 7: active(plus(N,0())) -> mark(U11(isNat(N),N)) 8: active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) 9: mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) 10: mark(tt()) -> active(tt()) 11: mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) 12: mark(s(X)) -> active(s(mark(X))) 13: mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) 14: mark(and(X1,X2)) -> active(and(mark(X1),X2)) 15: mark(isNat(X)) -> active(isNat(X)) 16: mark(0()) -> active(0()) 17: U11(mark(X1),X2) -> U11(X1,X2) 18: U11(X1,mark(X2)) -> U11(X1,X2) 19: U11(active(X1),X2) -> U11(X1,X2) 20: U11(X1,active(X2)) -> U11(X1,X2) 21: U21(mark(X1),X2,X3) -> U21(X1,X2,X3) 22: U21(X1,mark(X2),X3) -> U21(X1,X2,X3) 23: U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) 24: U21(active(X1),X2,X3) -> U21(X1,X2,X3) 25: U21(X1,active(X2),X3) -> U21(X1,X2,X3) 26: U21(X1,X2,active(X3)) -> U21(X1,X2,X3) 27: s(mark(X)) -> s(X) 28: s(active(X)) -> s(X) 29: plus(mark(X1),X2) -> plus(X1,X2) 30: plus(X1,mark(X2)) -> plus(X1,X2) 31: plus(active(X1),X2) -> plus(X1,X2) 32: plus(X1,active(X2)) -> plus(X1,X2) 33: and(mark(X1),X2) -> and(X1,X2) 34: and(X1,mark(X2)) -> and(X1,X2) 35: and(active(X1),X2) -> and(X1,X2) 36: and(X1,active(X2)) -> and(X1,X2) 37: isNat(mark(X)) -> isNat(X) 38: isNat(active(X)) -> isNat(X) Number of strict rules: 38 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(U21(tt(),M,N)) -> #mark(s(plus(N,M))) #2: #active(U21(tt(),M,N)) -> #s(plus(N,M)) #3: #active(U21(tt(),M,N)) -> #plus(N,M) #4: #plus(mark(X1),X2) -> #plus(X1,X2) #5: #and(active(X1),X2) -> #and(X1,X2) #6: #isNat(mark(X)) -> #isNat(X) #7: #isNat(active(X)) -> #isNat(X) #8: #active(isNat(s(V1))) -> #mark(isNat(V1)) #9: #active(isNat(s(V1))) -> #isNat(V1) #10: #mark(plus(X1,X2)) -> #active(plus(mark(X1),mark(X2))) #11: #mark(plus(X1,X2)) -> #plus(mark(X1),mark(X2)) #12: #mark(plus(X1,X2)) -> #mark(X1) #13: #mark(plus(X1,X2)) -> #mark(X2) #14: #mark(U11(X1,X2)) -> #active(U11(mark(X1),X2)) #15: #mark(U11(X1,X2)) -> #U11(mark(X1),X2) #16: #mark(U11(X1,X2)) -> #mark(X1) #17: #mark(U21(X1,X2,X3)) -> #active(U21(mark(X1),X2,X3)) #18: #mark(U21(X1,X2,X3)) -> #U21(mark(X1),X2,X3) #19: #mark(U21(X1,X2,X3)) -> #mark(X1) #20: #U21(active(X1),X2,X3) -> #U21(X1,X2,X3) #21: #U21(X1,X2,mark(X3)) -> #U21(X1,X2,X3) #22: #mark(s(X)) -> #active(s(mark(X))) #23: #mark(s(X)) -> #s(mark(X)) #24: #mark(s(X)) -> #mark(X) #25: #plus(active(X1),X2) -> #plus(X1,X2) #26: #mark(and(X1,X2)) -> #active(and(mark(X1),X2)) #27: #mark(and(X1,X2)) -> #and(mark(X1),X2) #28: #mark(and(X1,X2)) -> #mark(X1) #29: #plus(X1,mark(X2)) -> #plus(X1,X2) #30: #U21(X1,active(X2),X3) -> #U21(X1,X2,X3) #31: #U11(X1,active(X2)) -> #U11(X1,X2) #32: #active(plus(N,0())) -> #mark(U11(isNat(N),N)) #33: #active(plus(N,0())) -> #U11(isNat(N),N) #34: #active(plus(N,0())) -> #isNat(N) #35: #mark(tt()) -> #active(tt()) #36: #and(mark(X1),X2) -> #and(X1,X2) #37: #active(isNat(plus(V1,V2))) -> #mark(and(isNat(V1),isNat(V2))) #38: #active(isNat(plus(V1,V2))) -> #and(isNat(V1),isNat(V2)) #39: #active(isNat(plus(V1,V2))) -> #isNat(V1) #40: #active(isNat(plus(V1,V2))) -> #isNat(V2) #41: #s(active(X)) -> #s(X) #42: #U21(X1,mark(X2),X3) -> #U21(X1,X2,X3) #43: #and(X1,mark(X2)) -> #and(X1,X2) #44: #s(mark(X)) -> #s(X) #45: #U11(mark(X1),X2) -> #U11(X1,X2) #46: #plus(X1,active(X2)) -> #plus(X1,X2) #47: #U11(active(X1),X2) -> #U11(X1,X2) #48: #U21(X1,X2,active(X3)) -> #U21(X1,X2,X3) #49: #and(X1,active(X2)) -> #and(X1,X2) #50: #U21(mark(X1),X2,X3) -> #U21(X1,X2,X3) #51: #mark(0()) -> #active(0()) #52: #active(and(tt(),X)) -> #mark(X) #53: #active(U11(tt(),N)) -> #mark(N) #54: #active(plus(N,s(M))) -> #mark(U21(and(isNat(M),isNat(N)),M,N)) #55: #active(plus(N,s(M))) -> #U21(and(isNat(M),isNat(N)),M,N) #56: #active(plus(N,s(M))) -> #and(isNat(M),isNat(N)) popout

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

job log

popout

actions

all output return to TRS Standard