Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516961878
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
2.92349505424 seconds
cpu usage
2.993795142
max memory
4.7747072E7
stage attributes
key
value
output-size
6836
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: mark(zeros()) -> active(zeros()) 6: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 7: mark(0()) -> active(0()) 8: mark(and(X1,X2)) -> active(and(mark(X1),X2)) 9: mark(tt()) -> active(tt()) 10: mark(length(X)) -> active(length(mark(X))) 11: mark(nil()) -> active(nil()) 12: mark(s(X)) -> active(s(mark(X))) 13: cons(mark(X1),X2) -> cons(X1,X2) 14: cons(X1,mark(X2)) -> cons(X1,X2) 15: cons(active(X1),X2) -> cons(X1,X2) 16: cons(X1,active(X2)) -> cons(X1,X2) 17: and(mark(X1),X2) -> and(X1,X2) 18: and(X1,mark(X2)) -> and(X1,X2) 19: and(active(X1),X2) -> and(X1,X2) 20: and(X1,active(X2)) -> and(X1,X2) 21: length(mark(X)) -> length(X) 22: length(active(X)) -> length(X) 23: s(mark(X)) -> s(X) 24: s(active(X)) -> s(X) Number of strict rules: 24 Direct poly ... removes: 3 2 s(x1) w: (x1) and(x1,x2) w: (28882 + 2 * x2 + x1) zeros() w: (9726) 0() w: (0) nil() w: (32279) mark(x1) w: (x1) active(x1) w: (x1) cons(x1,x2) w: (x2 + x1) tt() w: (2447) length(x1) w: (2241 + x1) Number of strict rules: 22 Direct poly ... removes: 8 11 9 s(x1) w: (x1) and(x1,x2) w: (1 + 2 * x2 + x1) zeros() w: (0) 0() w: (0) nil() w: (1) mark(x1) w: (2 * x1) active(x1) w: (x1) cons(x1,x2) w: (2 * x2 + x1) tt() w: (1) length(x1) w: (x1) Number of strict rules: 19 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #2: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #3: #mark(cons(X1,X2)) -> #mark(X1) #4: #cons(mark(X1),X2) -> #cons(X1,X2) #5: #s(active(X)) -> #s(X) #6: #s(mark(X)) -> #s(X) #7: #mark(s(X)) -> #active(s(mark(X))) #8: #mark(s(X)) -> #s(mark(X)) #9: #mark(s(X)) -> #mark(X) #10: #cons(X1,mark(X2)) -> #cons(X1,X2) #11: #and(X1,active(X2)) -> #and(X1,X2) #12: #mark(0()) -> #active(0()) #13: #mark(length(X)) -> #active(length(mark(X))) #14: #mark(length(X)) -> #length(mark(X)) #15: #mark(length(X)) -> #mark(X) #16: #mark(zeros()) -> #active(zeros()) #17: #length(active(X)) -> #length(X) #18: #and(mark(X1),X2) -> #and(X1,X2) #19: #and(active(X1),X2) -> #and(X1,X2) #20: #length(mark(X)) -> #length(X) #21: #cons(X1,active(X2)) -> #cons(X1,X2) #22: #active(zeros()) -> #mark(cons(0(),zeros())) #23: #active(zeros()) -> #cons(0(),zeros()) #24: #cons(active(X1),X2) -> #cons(X1,X2) #25: #active(length(cons(N,L))) -> #mark(s(length(L))) #26: #active(length(cons(N,L))) -> #s(length(L)) #27: #active(length(cons(N,L))) -> #length(L) #28: #and(X1,mark(X2)) -> #and(X1,X2) Number of SCCs: 5, DPs: 19 SCC { #5 #6 } Sum... succeeded. #cons(x1,x2) w: (0) s(x1) w: (0) and(x1,x2) w: (0) zeros() w: (0) #mark(x1) w: (0) 0() w: (0) #s(x1) w: (x1) nil() w: (0) mark(x1) w: (1 + x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard