details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.679681062698 seconds
cpu usage	0.732574441
max memory	2.6058752E7

stage attributes

key	value
output-size	8818
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: active(f(X)) -> mark(cons(X,f(g(X)))) 2: active(g(0())) -> mark(s(0())) 3: active(g(s(X))) -> mark(s(s(g(X)))) 4: active(sel(0(),cons(X,Y))) -> mark(X) 5: active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) 6: active(f(X)) -> f(active(X)) 7: active(cons(X1,X2)) -> cons(active(X1),X2) 8: active(g(X)) -> g(active(X)) 9: active(s(X)) -> s(active(X)) 10: active(sel(X1,X2)) -> sel(active(X1),X2) 11: active(sel(X1,X2)) -> sel(X1,active(X2)) 12: f(mark(X)) -> mark(f(X)) 13: cons(mark(X1),X2) -> mark(cons(X1,X2)) 14: g(mark(X)) -> mark(g(X)) 15: s(mark(X)) -> mark(s(X)) 16: sel(mark(X1),X2) -> mark(sel(X1,X2)) 17: sel(X1,mark(X2)) -> mark(sel(X1,X2)) 18: proper(f(X)) -> f(proper(X)) 19: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 20: proper(g(X)) -> g(proper(X)) 21: proper(0()) -> ok(0()) 22: proper(s(X)) -> s(proper(X)) 23: proper(sel(X1,X2)) -> sel(proper(X1),proper(X2)) 24: f(ok(X)) -> ok(f(X)) 25: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 26: g(ok(X)) -> ok(g(X)) 27: s(ok(X)) -> ok(s(X)) 28: sel(ok(X1),ok(X2)) -> ok(sel(X1,X2)) 29: top(mark(X)) -> top(proper(X)) 30: top(ok(X)) -> top(active(X)) Number of strict rules: 30 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(g(0())) -> #s(0()) #2: #top(mark(X)) -> #top(proper(X)) #3: #top(mark(X)) -> #proper(X) #4: #active(f(X)) -> #f(active(X)) #5: #active(f(X)) -> #active(X) #6: #cons(mark(X1),X2) -> #cons(X1,X2) #7: #active(s(X)) -> #s(active(X)) #8: #active(s(X)) -> #active(X) #9: #active(sel(X1,X2)) -> #sel(X1,active(X2)) #10: #active(sel(X1,X2)) -> #active(X2) #11: #f(ok(X)) -> #f(X) #12: #proper(sel(X1,X2)) -> #sel(proper(X1),proper(X2)) #13: #proper(sel(X1,X2)) -> #proper(X1) #14: #proper(sel(X1,X2)) -> #proper(X2) #15: #f(mark(X)) -> #f(X) #16: #g(mark(X)) -> #g(X) #17: #top(ok(X)) -> #top(active(X)) #18: #top(ok(X)) -> #active(X) #19: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #20: #proper(g(X)) -> #g(proper(X)) #21: #proper(g(X)) -> #proper(X) #22: #active(cons(X1,X2)) -> #cons(active(X1),X2) #23: #active(cons(X1,X2)) -> #active(X1) #24: #active(sel(X1,X2)) -> #sel(active(X1),X2) #25: #active(sel(X1,X2)) -> #active(X1) #26: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #27: #sel(ok(X1),ok(X2)) -> #sel(X1,X2) #28: #proper(s(X)) -> #s(proper(X)) #29: #proper(s(X)) -> #proper(X) #30: #s(ok(X)) -> #s(X) #31: #sel(X1,mark(X2)) -> #sel(X1,X2) #32: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #33: #proper(cons(X1,X2)) -> #proper(X1) #34: #proper(cons(X1,X2)) -> #proper(X2) #35: #g(ok(X)) -> #g(X) #36: #sel(mark(X1),X2) -> #sel(X1,X2) #37: #active(g(s(X))) -> #s(s(g(X))) #38: #active(g(s(X))) -> #s(g(X)) #39: #active(g(s(X))) -> #g(X) #40: #active(f(X)) -> #cons(X,f(g(X))) #41: #active(f(X)) -> #f(g(X)) #42: #active(f(X)) -> #g(X) #43: #active(g(X)) -> #g(active(X)) #44: #active(g(X)) -> #active(X) #45: #s(mark(X)) -> #s(X) #46: #proper(f(X)) -> #f(proper(X)) #47: #proper(f(X)) -> #proper(X) Number of SCCs: 8, DPs: 26 SCC { #30 #45 } Sum... succeeded. #cons(x1,x2) w: (0) s(x1) w: (0) top(x1) w: (0) #top(x1) w: (0) f(x1) w: (0) proper(x1) w: (0) ok(x1) w: (1 + x1) 0() w: (0) popout

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

job log

popout

actions

all output return to TRS Standard