details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	0.305855035782 seconds
cpu usage	0.33195014
max memory	4.794368E7

stage attributes

key	value
output-size	12810
starexec-result	"YES"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: a__U11(tt(),V1,V2) -> a__U12(a__isNat(V1),V2) 2: a__U12(tt(),V2) -> a__U13(a__isNat(V2)) 3: a__U13(tt()) -> tt() 4: a__U21(tt(),V1) -> a__U22(a__isNat(V1)) 5: a__U22(tt()) -> tt() 6: a__U31(tt(),N) -> mark(N) 7: a__U41(tt(),M,N) -> s(a__plus(mark(N),mark(M))) 8: a__and(tt(),X) -> mark(X) 9: a__isNat(0()) -> tt() 10: a__isNat(plus(V1,V2)) -> a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) 11: a__isNat(s(V1)) -> a__U21(a__isNatKind(V1),V1) 12: a__isNatKind(0()) -> tt() 13: a__isNatKind(plus(V1,V2)) -> a__and(a__isNatKind(V1),isNatKind(V2)) 14: a__isNatKind(s(V1)) -> a__isNatKind(V1) 15: a__plus(N,0()) -> a__U31(a__and(a__isNat(N),isNatKind(N)),N) 16: a__plus(N,s(M)) -> a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 17: mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) 18: mark(U12(X1,X2)) -> a__U12(mark(X1),X2) 19: mark(isNat(X)) -> a__isNat(X) 20: mark(U13(X)) -> a__U13(mark(X)) 21: mark(U21(X1,X2)) -> a__U21(mark(X1),X2) 22: mark(U22(X)) -> a__U22(mark(X)) 23: mark(U31(X1,X2)) -> a__U31(mark(X1),X2) 24: mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) 25: mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) 26: mark(and(X1,X2)) -> a__and(mark(X1),X2) 27: mark(isNatKind(X)) -> a__isNatKind(X) 28: mark(tt()) -> tt() 29: mark(s(X)) -> s(mark(X)) 30: mark(0()) -> 0() 31: a__U11(X1,X2,X3) -> U11(X1,X2,X3) 32: a__U12(X1,X2) -> U12(X1,X2) 33: a__isNat(X) -> isNat(X) 34: a__U13(X) -> U13(X) 35: a__U21(X1,X2) -> U21(X1,X2) 36: a__U22(X) -> U22(X) 37: a__U31(X1,X2) -> U31(X1,X2) 38: a__U41(X1,X2,X3) -> U41(X1,X2,X3) 39: a__plus(X1,X2) -> plus(X1,X2) 40: a__and(X1,X2) -> and(X1,X2) 41: a__isNatKind(X) -> isNatKind(X) Number of strict rules: 41 Direct Order(PosReal,>,Poly) ... failed. Freezing ... failed. Dependency Pairs: #1: #a__U12(tt(),V2) -> #a__U13(a__isNat(V2)) #2: #a__U12(tt(),V2) -> #a__isNat(V2) #3: #mark(s(X)) -> #mark(X) #4: #a__U31(tt(),N) -> #mark(N) #5: #a__isNatKind(plus(V1,V2)) -> #a__and(a__isNatKind(V1),isNatKind(V2)) #6: #a__isNatKind(plus(V1,V2)) -> #a__isNatKind(V1) #7: #a__isNat(s(V1)) -> #a__U21(a__isNatKind(V1),V1) #8: #a__isNat(s(V1)) -> #a__isNatKind(V1) #9: #mark(U41(X1,X2,X3)) -> #a__U41(mark(X1),X2,X3) #10: #mark(U41(X1,X2,X3)) -> #mark(X1) #11: #mark(U31(X1,X2)) -> #a__U31(mark(X1),X2) #12: #mark(U31(X1,X2)) -> #mark(X1) #13: #a__isNatKind(s(V1)) -> #a__isNatKind(V1) #14: #mark(plus(X1,X2)) -> #a__plus(mark(X1),mark(X2)) #15: #mark(plus(X1,X2)) -> #mark(X1) #16: #mark(plus(X1,X2)) -> #mark(X2) #17: #mark(U13(X)) -> #a__U13(mark(X)) #18: #mark(U13(X)) -> #mark(X) #19: #a__U41(tt(),M,N) -> #a__plus(mark(N),mark(M)) #20: #a__U41(tt(),M,N) -> #mark(N) #21: #a__U41(tt(),M,N) -> #mark(M) #22: #a__isNat(plus(V1,V2)) -> #a__U11(a__and(a__isNatKind(V1),isNatKind(V2)),V1,V2) #23: #a__isNat(plus(V1,V2)) -> #a__and(a__isNatKind(V1),isNatKind(V2)) #24: #a__isNat(plus(V1,V2)) -> #a__isNatKind(V1) #25: #mark(U22(X)) -> #a__U22(mark(X)) #26: #mark(U22(X)) -> #mark(X) #27: #mark(isNatKind(X)) -> #a__isNatKind(X) #28: #mark(U11(X1,X2,X3)) -> #a__U11(mark(X1),X2,X3) #29: #mark(U11(X1,X2,X3)) -> #mark(X1) #30: #mark(isNat(X)) -> #a__isNat(X) #31: #mark(and(X1,X2)) -> #a__and(mark(X1),X2) #32: #mark(and(X1,X2)) -> #mark(X1) #33: #mark(U21(X1,X2)) -> #a__U21(mark(X1),X2) #34: #mark(U21(X1,X2)) -> #mark(X1) #35: #a__plus(N,s(M)) -> #a__U41(a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) #36: #a__plus(N,s(M)) -> #a__and(a__and(a__isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))) #37: #a__plus(N,s(M)) -> #a__and(a__isNat(M),isNatKind(M)) #38: #a__plus(N,s(M)) -> #a__isNat(M) #39: #a__U11(tt(),V1,V2) -> #a__U12(a__isNat(V1),V2) #40: #a__U11(tt(),V1,V2) -> #a__isNat(V1) #41: #a__and(tt(),X) -> #mark(X) #42: #a__plus(N,0()) -> #a__U31(a__and(a__isNat(N),isNatKind(N)),N) #43: #a__plus(N,0()) -> #a__and(a__isNat(N),isNatKind(N)) #44: #a__plus(N,0()) -> #a__isNat(N) #45: #a__U21(tt(),V1) -> #a__U22(a__isNat(V1)) #46: #a__U21(tt(),V1) -> #a__isNat(V1) #47: #mark(U12(X1,X2)) -> #a__U12(mark(X1),X2) popout

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

job log

popout

actions

all output return to TRS Standard