details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	20.0964848995 seconds
cpu usage	20.681082206
max memory	1.48320256E8

stage attributes

key	value
output-size	9298
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(zeros()) -> mark(cons(0(),zeros())) 2: active(U11(tt(),L)) -> mark(s(length(L))) 3: active(and(tt(),X)) -> mark(X) 4: active(isNat(0())) -> mark(tt()) 5: active(isNat(length(V1))) -> mark(isNatList(V1)) 6: active(isNat(s(V1))) -> mark(isNat(V1)) 7: active(isNatIList(V)) -> mark(isNatList(V)) 8: active(isNatIList(zeros())) -> mark(tt()) 9: active(isNatIList(cons(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2))) 10: active(isNatList(nil())) -> mark(tt()) 11: active(isNatList(cons(V1,V2))) -> mark(and(isNat(V1),isNatList(V2))) 12: active(length(nil())) -> mark(0()) 13: active(length(cons(N,L))) -> mark(U11(and(isNatList(L),isNat(N)),L)) 14: active(cons(X1,X2)) -> cons(active(X1),X2) 15: active(U11(X1,X2)) -> U11(active(X1),X2) 16: active(s(X)) -> s(active(X)) 17: active(length(X)) -> length(active(X)) 18: active(and(X1,X2)) -> and(active(X1),X2) 19: cons(mark(X1),X2) -> mark(cons(X1,X2)) 20: U11(mark(X1),X2) -> mark(U11(X1,X2)) 21: s(mark(X)) -> mark(s(X)) 22: length(mark(X)) -> mark(length(X)) 23: and(mark(X1),X2) -> mark(and(X1,X2)) 24: proper(zeros()) -> ok(zeros()) 25: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 26: proper(0()) -> ok(0()) 27: proper(U11(X1,X2)) -> U11(proper(X1),proper(X2)) 28: proper(tt()) -> ok(tt()) 29: proper(s(X)) -> s(proper(X)) 30: proper(length(X)) -> length(proper(X)) 31: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 32: proper(isNat(X)) -> isNat(proper(X)) 33: proper(isNatList(X)) -> isNatList(proper(X)) 34: proper(isNatIList(X)) -> isNatIList(proper(X)) 35: proper(nil()) -> ok(nil()) 36: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 37: U11(ok(X1),ok(X2)) -> ok(U11(X1,X2)) 38: s(ok(X)) -> ok(s(X)) 39: length(ok(X)) -> ok(length(X)) 40: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 41: isNat(ok(X)) -> ok(isNat(X)) 42: isNatList(ok(X)) -> ok(isNatList(X)) 43: isNatIList(ok(X)) -> ok(isNatIList(X)) 44: top(mark(X)) -> top(proper(X)) 45: top(ok(X)) -> top(active(X)) Number of strict rules: 45 Direct poly ... removes: 8 5 10 7 12 isNatList(x1) w: (x1) U11(x1,x2) w: (9335 + 2 * x2 + x1) s(x1) w: (x1) top(x1) w: (x1) and(x1,x2) w: (x2 + x1) isNatIList(x1) w: (24498 + x1) zeros() w: (0) proper(x1) w: (x1) ok(x1) w: (x1) 0() w: (0) nil() w: (30478) mark(x1) w: (x1) isNat(x1) w: (x1) active(x1) w: (x1) cons(x1,x2) w: (2 * x2 + 2 * x1) tt() w: (0) length(x1) w: (9335 + 2 * x1) Number of strict rules: 40 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(U11(tt(),L)) -> #s(length(L)) #2: #active(U11(tt(),L)) -> #length(L) #3: #isNatIList(ok(X)) -> #isNatIList(X) #4: #proper(s(X)) -> #s(proper(X)) #5: #proper(s(X)) -> #proper(X) #6: #isNatList(ok(X)) -> #isNatList(X) #7: #isNat(ok(X)) -> #isNat(X) #8: #U11(ok(X1),ok(X2)) -> #U11(X1,X2) #9: #s(ok(X)) -> #s(X) #10: #active(isNat(s(V1))) -> #isNat(V1) #11: #and(ok(X1),ok(X2)) -> #and(X1,X2) #12: #active(length(cons(N,L))) -> #U11(and(isNatList(L),isNat(N)),L) #13: #active(length(cons(N,L))) -> #and(isNatList(L),isNat(N)) #14: #active(length(cons(N,L))) -> #isNatList(L) #15: #active(length(cons(N,L))) -> #isNat(N) #16: #active(isNatIList(cons(V1,V2))) -> #and(isNat(V1),isNatIList(V2)) #17: #active(isNatIList(cons(V1,V2))) -> #isNat(V1) #18: #active(isNatIList(cons(V1,V2))) -> #isNatIList(V2) #19: #active(isNatList(cons(V1,V2))) -> #and(isNat(V1),isNatList(V2)) #20: #active(isNatList(cons(V1,V2))) -> #isNat(V1) #21: #active(isNatList(cons(V1,V2))) -> #isNatList(V2) #22: #and(mark(X1),X2) -> #and(X1,X2) #23: #top(ok(X)) -> #top(active(X)) #24: #top(ok(X)) -> #active(X) popout

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

job log

popout

actions

all output return to TRS Standard