details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	22.9025309086 seconds
cpu usage	23.434196505
max memory	1.05422848E8

stage attributes

key	value
output-size	4405
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(zeros()) -> mark(cons(0(),zeros())) 2: active(and(tt(),X)) -> mark(X) 3: active(length(nil())) -> mark(0()) 4: active(length(cons(N,L))) -> mark(s(length(L))) 5: active(cons(X1,X2)) -> cons(active(X1),X2) 6: active(and(X1,X2)) -> and(active(X1),X2) 7: active(length(X)) -> length(active(X)) 8: active(s(X)) -> s(active(X)) 9: cons(mark(X1),X2) -> mark(cons(X1,X2)) 10: and(mark(X1),X2) -> mark(and(X1,X2)) 11: length(mark(X)) -> mark(length(X)) 12: s(mark(X)) -> mark(s(X)) 13: proper(zeros()) -> ok(zeros()) 14: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 15: proper(0()) -> ok(0()) 16: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 17: proper(tt()) -> ok(tt()) 18: proper(length(X)) -> length(proper(X)) 19: proper(nil()) -> ok(nil()) 20: proper(s(X)) -> s(proper(X)) 21: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 22: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 23: length(ok(X)) -> ok(length(X)) 24: s(ok(X)) -> ok(s(X)) 25: top(mark(X)) -> top(proper(X)) 26: top(ok(X)) -> top(active(X)) Number of strict rules: 26 Direct poly ... removes: 3 2 s(x1) w: (x1) top(x1) w: (11841 + x1) and(x1,x2) w: (14756 + x2 + x1) zeros() w: (16494) proper(x1) w: (x1) ok(x1) w: (x1) 0() w: (0) nil() w: (26205) mark(x1) w: (x1) active(x1) w: (x1) cons(x1,x2) w: (x2 + x1) tt() w: (6168) length(x1) w: (8855 + x1) Number of strict rules: 24 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(and(X1,X2)) -> #and(active(X1),X2) #2: #active(and(X1,X2)) -> #active(X1) #3: #cons(mark(X1),X2) -> #cons(X1,X2) #4: #length(mark(X)) -> #length(X) #5: #s(ok(X)) -> #s(X) #6: #length(ok(X)) -> #length(X) #7: #s(mark(X)) -> #s(X) #8: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #9: #proper(cons(X1,X2)) -> #proper(X1) #10: #proper(cons(X1,X2)) -> #proper(X2) #11: #top(mark(X)) -> #top(proper(X)) #12: #top(mark(X)) -> #proper(X) #13: #proper(s(X)) -> #s(proper(X)) #14: #proper(s(X)) -> #proper(X) #15: #active(length(X)) -> #length(active(X)) #16: #active(length(X)) -> #active(X) #17: #and(mark(X1),X2) -> #and(X1,X2) #18: #active(cons(X1,X2)) -> #cons(active(X1),X2) #19: #active(cons(X1,X2)) -> #active(X1) #20: #and(ok(X1),ok(X2)) -> #and(X1,X2) #21: #top(ok(X)) -> #top(active(X)) #22: #top(ok(X)) -> #active(X) #23: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #24: #proper(and(X1,X2)) -> #and(proper(X1),proper(X2)) #25: #proper(and(X1,X2)) -> #proper(X1) #26: #proper(and(X1,X2)) -> #proper(X2) #27: #active(zeros()) -> #cons(0(),zeros()) #28: #active(s(X)) -> #s(active(X)) #29: #active(s(X)) -> #active(X) #30: #active(length(cons(N,L))) -> #s(length(L)) #31: #active(length(cons(N,L))) -> #length(L) #32: #proper(length(X)) -> #length(proper(X)) #33: #proper(length(X)) -> #proper(X) Number of SCCs: 7, DPs: 20 SCC { #5 #7 } Sum... succeeded. #cons(x1,x2) w: (0) s(x1) w: (0) top(x1) w: (0) and(x1,x2) w: (0) #top(x1) w: (0) zeros() w: (0) proper(x1) w: (0) ok(x1) w: (1 + x1) 0() w: (0) #s(x1) w: (x1) nil() w: (0) popout

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

job log

popout

actions

all output return to TRS Standard