details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0956101417542 seconds
cpu usage	0.102758925
max memory	9474048.0

stage attributes

key	value
output-size	5317
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(),V2) -> a__U12(a__isNat(V2)) 2: a__U12(tt()) -> tt() 3: a__U21(tt()) -> tt() 4: a__U31(tt(),N) -> mark(N) 5: a__U41(tt(),M,N) -> a__U42(a__isNat(N),M,N) 6: a__U42(tt(),M,N) -> s(a__plus(mark(N),mark(M))) 7: a__isNat(0()) -> tt() 8: a__isNat(plus(V1,V2)) -> a__U11(a__isNat(V1),V2) 9: a__isNat(s(V1)) -> a__U21(a__isNat(V1)) 10: a__plus(N,0()) -> a__U31(a__isNat(N),N) 11: a__plus(N,s(M)) -> a__U41(a__isNat(M),M,N) 12: mark(U11(X1,X2)) -> a__U11(mark(X1),X2) 13: mark(U12(X)) -> a__U12(mark(X)) 14: mark(isNat(X)) -> a__isNat(X) 15: mark(U21(X)) -> a__U21(mark(X)) 16: mark(U31(X1,X2)) -> a__U31(mark(X1),X2) 17: mark(U41(X1,X2,X3)) -> a__U41(mark(X1),X2,X3) 18: mark(U42(X1,X2,X3)) -> a__U42(mark(X1),X2,X3) 19: mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) 20: mark(tt()) -> tt() 21: mark(s(X)) -> s(mark(X)) 22: mark(0()) -> 0() 23: a__U11(X1,X2) -> U11(X1,X2) 24: a__U12(X) -> U12(X) 25: a__isNat(X) -> isNat(X) 26: a__U21(X) -> U21(X) 27: a__U31(X1,X2) -> U31(X1,X2) 28: a__U41(X1,X2,X3) -> U41(X1,X2,X3) 29: a__U42(X1,X2,X3) -> U42(X1,X2,X3) 30: a__plus(X1,X2) -> plus(X1,X2) Number of strict rules: 30 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__U42(tt(),M,N) -> #a__plus(mark(N),mark(M)) #2: #a__U42(tt(),M,N) -> #mark(N) #3: #a__U42(tt(),M,N) -> #mark(M) #4: #mark(U12(X)) -> #a__U12(mark(X)) #5: #mark(U12(X)) -> #mark(X) #6: #a__isNat(s(V1)) -> #a__U21(a__isNat(V1)) #7: #a__isNat(s(V1)) -> #a__isNat(V1) #8: #a__plus(N,s(M)) -> #a__U41(a__isNat(M),M,N) #9: #a__plus(N,s(M)) -> #a__isNat(M) #10: #mark(U11(X1,X2)) -> #a__U11(mark(X1),X2) #11: #mark(U11(X1,X2)) -> #mark(X1) #12: #mark(isNat(X)) -> #a__isNat(X) #13: #a__plus(N,0()) -> #a__U31(a__isNat(N),N) #14: #a__plus(N,0()) -> #a__isNat(N) #15: #a__U41(tt(),M,N) -> #a__U42(a__isNat(N),M,N) #16: #a__U41(tt(),M,N) -> #a__isNat(N) #17: #mark(U41(X1,X2,X3)) -> #a__U41(mark(X1),X2,X3) #18: #mark(U41(X1,X2,X3)) -> #mark(X1) #19: #mark(plus(X1,X2)) -> #a__plus(mark(X1),mark(X2)) #20: #mark(plus(X1,X2)) -> #mark(X1) #21: #mark(plus(X1,X2)) -> #mark(X2) #22: #mark(s(X)) -> #mark(X) #23: #mark(U31(X1,X2)) -> #a__U31(mark(X1),X2) #24: #mark(U31(X1,X2)) -> #mark(X1) #25: #a__U11(tt(),V2) -> #a__U12(a__isNat(V2)) #26: #a__U11(tt(),V2) -> #a__isNat(V2) #27: #a__isNat(plus(V1,V2)) -> #a__U11(a__isNat(V1),V2) #28: #a__isNat(plus(V1,V2)) -> #a__isNat(V1) #29: #mark(U21(X)) -> #a__U21(mark(X)) #30: #mark(U21(X)) -> #mark(X) #31: #a__U31(tt(),N) -> #mark(N) #32: #mark(U42(X1,X2,X3)) -> #a__U42(mark(X1),X2,X3) #33: #mark(U42(X1,X2,X3)) -> #mark(X1) Number of SCCs: 2, DPs: 24 SCC { #7 #26..28 } POLO(Sum)... succeeded. a__plus w: 0 U21 w: 0 U11 w: 0 s w: x1 + 1 #a__U31 w: 0 U42 w: 0 #a__isNat w: x1 #a__U11 w: x1 + x2 a__U31 w: 0 U12 w: 0 #a__U42 w: 0 a__U41 w: 0 #a__U12 w: 0 #a__U21 w: 0 #a__plus w: 0 #mark w: 0 0 w: 1 a__U21 w: x1 mark w: 0 a__U11 w: x1 a__U42 w: 0 a__U12 w: x1 popout

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

job log

popout

actions

all output return to TRS Stand 20472