details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	0.925079107285 seconds
cpu usage	1.194950082
max memory	1.40578816E8

stage attributes

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

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

job log

popout

actions

all output return to TRS Standard