details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.416559934616 seconds
cpu usage	0.479523719
max memory	1.83296E7

stage attributes

key	value
output-size	6480
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: U11(tt(),N) -> activate(N) 2: U21(tt(),M,N) -> s(plus(activate(N),activate(M))) 3: U31(tt()) -> 0() 4: U41(tt(),M,N) -> plus(x(activate(N),activate(M)),activate(N)) 5: and(tt(),X) -> activate(X) 6: isNat(n__0()) -> tt() 7: isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) 8: isNat(n__s(V1)) -> isNat(activate(V1)) 9: isNat(n__x(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) 10: plus(N,0()) -> U11(isNat(N),N) 11: plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 12: x(N,0()) -> U31(isNat(N)) 13: x(N,s(M)) -> U41(and(isNat(M),n__isNat(N)),M,N) 14: 0() -> n__0() 15: plus(X1,X2) -> n__plus(X1,X2) 16: isNat(X) -> n__isNat(X) 17: s(X) -> n__s(X) 18: x(X1,X2) -> n__x(X1,X2) 19: activate(n__0()) -> 0() 20: activate(n__plus(X1,X2)) -> plus(X1,X2) 21: activate(n__isNat(X)) -> isNat(X) 22: activate(n__s(X)) -> s(X) 23: activate(n__x(X1,X2)) -> x(X1,X2) 24: activate(X) -> X Number of strict rules: 24 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U21(tt(),M,N) -> #s(plus(activate(N),activate(M))) #2: #U21(tt(),M,N) -> #plus(activate(N),activate(M)) #3: #U21(tt(),M,N) -> #activate(N) #4: #U21(tt(),M,N) -> #activate(M) #5: #x(N,s(M)) -> #U41(and(isNat(M),n__isNat(N)),M,N) #6: #x(N,s(M)) -> #and(isNat(M),n__isNat(N)) #7: #x(N,s(M)) -> #isNat(M) #8: #isNat(n__x(V1,V2)) -> #and(isNat(activate(V1)),n__isNat(activate(V2))) #9: #isNat(n__x(V1,V2)) -> #isNat(activate(V1)) #10: #isNat(n__x(V1,V2)) -> #activate(V1) #11: #isNat(n__x(V1,V2)) -> #activate(V2) #12: #plus(N,s(M)) -> #U21(and(isNat(M),n__isNat(N)),M,N) #13: #plus(N,s(M)) -> #and(isNat(M),n__isNat(N)) #14: #plus(N,s(M)) -> #isNat(M) #15: #activate(n__x(X1,X2)) -> #x(X1,X2) #16: #x(N,0()) -> #U31(isNat(N)) #17: #x(N,0()) -> #isNat(N) #18: #activate(n__plus(X1,X2)) -> #plus(X1,X2) #19: #isNat(n__plus(V1,V2)) -> #and(isNat(activate(V1)),n__isNat(activate(V2))) #20: #isNat(n__plus(V1,V2)) -> #isNat(activate(V1)) #21: #isNat(n__plus(V1,V2)) -> #activate(V1) #22: #isNat(n__plus(V1,V2)) -> #activate(V2) #23: #plus(N,0()) -> #U11(isNat(N),N) #24: #plus(N,0()) -> #isNat(N) #25: #and(tt(),X) -> #activate(X) #26: #activate(n__s(X)) -> #s(X) #27: #activate(n__0()) -> #0() #28: #activate(n__isNat(X)) -> #isNat(X) #29: #U31(tt()) -> #0() #30: #U11(tt(),N) -> #activate(N) #31: #isNat(n__s(V1)) -> #isNat(activate(V1)) #32: #isNat(n__s(V1)) -> #activate(V1) #33: #U41(tt(),M,N) -> #plus(x(activate(N),activate(M)),activate(N)) #34: #U41(tt(),M,N) -> #x(activate(N),activate(M)) #35: #U41(tt(),M,N) -> #activate(N) #36: #U41(tt(),M,N) -> #activate(M) #37: #U41(tt(),M,N) -> #activate(N) Number of SCCs: 1, DPs: 32 SCC { #2..15 #17..25 #28 #30..37 } POLO(Sum)... POLO(max)... succeeded. #0 w: 0 U21 w: max(x1, x2, x3) U11 w: max(x2) s w: x1 #isNat w: x1 activate w: x1 and w: max(x2) #plus w: max(x1, x2) #activate w: x1 x w: max(x1 + 3, x2) n__s w: x1 0 w: 2 #x w: max(x1 + 3, x2) #s w: 0 n__isNat w: x1 n__plus w: max(x1, x2) n__0 w: 2 isNat w: x1 n__x w: max(x1 + 3, x2) plus w: max(x1, x2) #U11 w: max(x1, x2) U31 w: 3 #U41 w: max(x1 + 2, x2, x3 + 3) #U21 w: max(x1, x2, x3) popout

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

job log

popout

actions

all output return to TRS Stand 20472