details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.181340932846 seconds
cpu usage	0.100360601
max memory	9289728.0

stage attributes

key	value
output-size	2940
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: and(tt(),X) -> activate(X) 4: isNat(n__0()) -> tt() 5: isNat(n__plus(V1,V2)) -> and(isNat(activate(V1)),n__isNat(activate(V2))) 6: isNat(n__s(V1)) -> isNat(activate(V1)) 7: plus(N,0()) -> U11(isNat(N),N) 8: plus(N,s(M)) -> U21(and(isNat(M),n__isNat(N)),M,N) 9: 0() -> n__0() 10: plus(X1,X2) -> n__plus(X1,X2) 11: isNat(X) -> n__isNat(X) 12: s(X) -> n__s(X) 13: activate(n__0()) -> 0() 14: activate(n__plus(X1,X2)) -> plus(activate(X1),activate(X2)) 15: activate(n__isNat(X)) -> isNat(X) 16: activate(n__s(X)) -> s(activate(X)) 17: activate(X) -> X Number of strict rules: 17 Direct poly ... failed. Freezing ... 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: #isNat(n__s(V1)) -> #isNat(activate(V1)) #6: #isNat(n__s(V1)) -> #activate(V1) #7: #activate(n__0()) -> #0() #8: #activate(n__plus(X1,X2)) -> #plus(activate(X1),activate(X2)) #9: #activate(n__plus(X1,X2)) -> #activate(X1) #10: #activate(n__plus(X1,X2)) -> #activate(X2) #11: #plus(N,0()) -> #U11(isNat(N),N) #12: #plus(N,0()) -> #isNat(N) #13: #isNat(n__plus(V1,V2)) -> #and(isNat(activate(V1)),n__isNat(activate(V2))) #14: #isNat(n__plus(V1,V2)) -> #isNat(activate(V1)) #15: #isNat(n__plus(V1,V2)) -> #activate(V1) #16: #isNat(n__plus(V1,V2)) -> #activate(V2) #17: #activate(n__s(X)) -> #s(activate(X)) #18: #activate(n__s(X)) -> #activate(X) #19: #and(tt(),X) -> #activate(X) #20: #U11(tt(),N) -> #activate(N) #21: #plus(N,s(M)) -> #U21(and(isNat(M),n__isNat(N)),M,N) #22: #plus(N,s(M)) -> #and(isNat(M),n__isNat(N)) #23: #plus(N,s(M)) -> #isNat(M) #24: #activate(n__isNat(X)) -> #isNat(X) Number of SCCs: 1, DPs: 21 SCC { #2..6 #8..16 #18..24 } Sum... succeeded. #0() w: (0) U21(x1,x2,x3) w: (15055 + x3 + x2) U11(x1,x2) w: (x2) s(x1) w: (4601 + x1) #isNat(x1) w: (1146 + x1) activate(x1) w: (x1) and(x1,x2) w: (1 + x2) #plus(x1,x2) w: (6999 + x2 + x1) #activate(x1) w: (1145 + x1) n__s(x1) w: (4601 + x1) 0() w: (28101) #s(x1) w: (0) n__isNat(x1) w: (2 + x1) n__plus(x1,x2) w: (10454 + x2 + x1) n__0() w: (28101) isNat(x1) w: (2 + x1) plus(x1,x2) w: (10454 + x2 + x1) #U11(x1,x2) w: (1146 + x2) #U21(x1,x2,x3) w: (11599 + x3 + x2) tt() w: (1) #and(x1,x2) w: (11595 + x2 + x1) USABLE RULES: { 1..17 } Removed DPs: #2..6 #8..16 #18..24 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to TRS Standard