details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	1.34606480598 seconds
cpu usage	1.458861522
max memory	2.6107904E7

stage attributes

key	value
output-size	8648
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: a__U11(tt(),N) -> mark(N) 2: a__U21(tt(),M,N) -> s(a__plus(mark(N),mark(M))) 3: a__U31(tt()) -> 0() 4: a__U41(tt(),M,N) -> a__plus(a__x(mark(N),mark(M)),mark(N)) 5: a__and(tt(),X) -> mark(X) 6: a__isNat(0()) -> tt() 7: a__isNat(plus(V1,V2)) -> a__and(a__isNat(V1),isNat(V2)) 8: a__isNat(s(V1)) -> a__isNat(V1) 9: a__isNat(x(V1,V2)) -> a__and(a__isNat(V1),isNat(V2)) 10: a__plus(N,0()) -> a__U11(a__isNat(N),N) 11: a__plus(N,s(M)) -> a__U21(a__and(a__isNat(M),isNat(N)),M,N) 12: a__x(N,0()) -> a__U31(a__isNat(N)) 13: a__x(N,s(M)) -> a__U41(a__and(a__isNat(M),isNat(N)),M,N) 14: mark(U11(X1,X2)) -> a__U11(mark(X1),X2) 15: mark(U21(X1,X2,X3)) -> a__U21(mark(X1),X2,X3) 16: mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) 17: mark(U31(X)) -> a__U31(mark(X)) 18: mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) 19: mark(x(X1,X2)) -> a__x(mark(X1),mark(X2)) 20: mark(and(X1,X2)) -> a__and(mark(X1),X2) 21: mark(isNat(X)) -> a__isNat(X) 22: mark(tt()) -> tt() 23: mark(s(X)) -> s(mark(X)) 24: mark(0()) -> 0() 25: a__U11(X1,X2) -> U11(X1,X2) 26: a__U21(X1,X2,X3) -> U21(X1,X2,X3) 27: a__plus(X1,X2) -> plus(X1,X2) 28: a__U31(X) -> U31(X) 29: a__U41(X1,X2,X3) -> U41(X1,X2,X3) 30: a__x(X1,X2) -> x(X1,X2) 31: a__and(X1,X2) -> and(X1,X2) 32: a__isNat(X) -> isNat(X) Number of strict rules: 32 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #a__U21(tt(),M,N) -> #a__plus(mark(N),mark(M)) #2: #a__U21(tt(),M,N) -> #mark(N) #3: #a__U21(tt(),M,N) -> #mark(M) #4: #a__x(N,s(M)) -> #a__U41(a__and(a__isNat(M),isNat(N)),M,N) #5: #a__x(N,s(M)) -> #a__and(a__isNat(M),isNat(N)) #6: #a__x(N,s(M)) -> #a__isNat(M) #7: #a__isNat(x(V1,V2)) -> #a__and(a__isNat(V1),isNat(V2)) #8: #a__isNat(x(V1,V2)) -> #a__isNat(V1) #9: #a__plus(N,s(M)) -> #a__U21(a__and(a__isNat(M),isNat(N)),M,N) #10: #a__plus(N,s(M)) -> #a__and(a__isNat(M),isNat(N)) #11: #a__plus(N,s(M)) -> #a__isNat(M) #12: #mark(s(X)) -> #mark(X) #13: #a__x(N,0()) -> #a__U31(a__isNat(N)) #14: #a__x(N,0()) -> #a__isNat(N) #15: #mark(U11(X1,X2)) -> #a__U11(mark(X1),X2) #16: #mark(U11(X1,X2)) -> #mark(X1) #17: #mark(and(X1,X2)) -> #a__and(mark(X1),X2) #18: #mark(and(X1,X2)) -> #mark(X1) #19: #a__isNat(plus(V1,V2)) -> #a__and(a__isNat(V1),isNat(V2)) #20: #a__isNat(plus(V1,V2)) -> #a__isNat(V1) #21: #a__plus(N,0()) -> #a__U11(a__isNat(N),N) #22: #a__plus(N,0()) -> #a__isNat(N) #23: #a__and(tt(),X) -> #mark(X) #24: #mark(U31(X)) -> #a__U31(mark(X)) #25: #mark(U31(X)) -> #mark(X) #26: #mark(x(X1,X2)) -> #a__x(mark(X1),mark(X2)) #27: #mark(x(X1,X2)) -> #mark(X1) #28: #mark(x(X1,X2)) -> #mark(X2) #29: #mark(isNat(X)) -> #a__isNat(X) #30: #mark(plus(X1,X2)) -> #a__plus(mark(X1),mark(X2)) #31: #mark(plus(X1,X2)) -> #mark(X1) #32: #mark(plus(X1,X2)) -> #mark(X2) #33: #a__U11(tt(),N) -> #mark(N) #34: #a__isNat(s(V1)) -> #a__isNat(V1) #35: #mark(U21(X1,X2,X3)) -> #a__U21(mark(X1),X2,X3) #36: #mark(U21(X1,X2,X3)) -> #mark(X1) #37: #a__U41(tt(),M,N) -> #a__plus(a__x(mark(N),mark(M)),mark(N)) #38: #a__U41(tt(),M,N) -> #a__x(mark(N),mark(M)) #39: #a__U41(tt(),M,N) -> #mark(N) #40: #a__U41(tt(),M,N) -> #mark(M) #41: #a__U41(tt(),M,N) -> #mark(N) #42: #mark(U41(X1,X2,X3)) -> #a__U41(mark(X1),X2,X3) #43: #mark(U41(X1,X2,X3)) -> #mark(X1) Number of SCCs: 1, DPs: 41 SCC { #1..12 #14..23 #25..43 } Sum... Max... succeeded. a__plus(x1,x2) w: (max{14010 + x2, x1}) U21(x1,x2,x3) w: (max{x3, 14010 + x2, 1 + x1}) U11(x1,x2) w: (max{x2, 1 + x1}) s(x1) w: (x1) #a__U31(x1) w: (0) #a__isNat(x1) w: (3) and(x1,x2) w: (max{x2, x1}) #a__x(x1,x2) w: (max{9 + x2, 35667 + x1}) #a__U11(x1,x2) w: (max{2 + x2, 0}) a__U31(x1) w: (35664 + x1) popout

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

job log

popout

actions

all output return to TRS Standard