Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716838
details
property
value
status
complete
benchmark
Ex7_BLR02_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.180014133453 seconds
cpu usage
0.217800737
max memory
1.6101376E7
stage attributes
key
value
output-size
4134
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: a__from(X) -> cons(mark(X),from(s(X))) 2: a__head(cons(X,XS)) -> mark(X) 3: a__2nd(cons(X,XS)) -> a__head(mark(XS)) 4: a__take(0(),XS) -> nil() 5: a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) 6: a__sel(0(),cons(X,XS)) -> mark(X) 7: a__sel(s(N),cons(X,XS)) -> a__sel(mark(N),mark(XS)) 8: mark(from(X)) -> a__from(mark(X)) 9: mark(head(X)) -> a__head(mark(X)) 10: mark(2nd(X)) -> a__2nd(mark(X)) 11: mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) 12: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) 13: mark(cons(X1,X2)) -> cons(mark(X1),X2) 14: mark(s(X)) -> s(mark(X)) 15: mark(0()) -> 0() 16: mark(nil()) -> nil() 17: a__from(X) -> from(X) 18: a__head(X) -> head(X) 19: a__2nd(X) -> 2nd(X) 20: a__take(X1,X2) -> take(X1,X2) 21: a__sel(X1,X2) -> sel(X1,X2) Number of strict rules: 21 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__head(cons(X,XS)) -> #mark(X) #2: #a__sel(0(),cons(X,XS)) -> #mark(X) #3: #mark(cons(X1,X2)) -> #mark(X1) #4: #mark(head(X)) -> #a__head(mark(X)) #5: #mark(head(X)) -> #mark(X) #6: #mark(take(X1,X2)) -> #a__take(mark(X1),mark(X2)) #7: #mark(take(X1,X2)) -> #mark(X1) #8: #mark(take(X1,X2)) -> #mark(X2) #9: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2)) #10: #mark(sel(X1,X2)) -> #mark(X1) #11: #mark(sel(X1,X2)) -> #mark(X2) #12: #mark(s(X)) -> #mark(X) #13: #a__sel(s(N),cons(X,XS)) -> #a__sel(mark(N),mark(XS)) #14: #a__sel(s(N),cons(X,XS)) -> #mark(N) #15: #a__sel(s(N),cons(X,XS)) -> #mark(XS) #16: #mark(2nd(X)) -> #a__2nd(mark(X)) #17: #mark(2nd(X)) -> #mark(X) #18: #a__take(s(N),cons(X,XS)) -> #mark(X) #19: #a__2nd(cons(X,XS)) -> #a__head(mark(XS)) #20: #a__2nd(cons(X,XS)) -> #mark(XS) #21: #a__from(X) -> #mark(X) #22: #mark(from(X)) -> #a__from(mark(X)) #23: #mark(from(X)) -> #mark(X) Number of SCCs: 1, DPs: 23 SCC { #1..23 } POLO(Sum)... POLO(max)... succeeded. s w: x1 #a__head w: x1 + 4 #a__from w: x1 + 6 a__from w: x1 + 4 take w: max(x1 + 2, x2 + 2) 2nd w: x1 + 3 a__2nd w: x1 + 3 #a__take w: max(x1 + 4, x2) #a__2nd w: x1 + 5 #mark w: x1 + 3 0 w: 1 from w: x1 + 4 sel w: max(x1 + 7, x2 + 3) nil w: 3 #a__sel w: max(x1 + 4, x2 + 5) mark w: x1 a__sel w: max(x1 + 7, x2 + 3) head w: x1 + 1 cons w: max(x1 + 3, x2) a__take w: max(x1 + 2, x2 + 2) a__head w: x1 + 1 USABLE RULES: { 1..21 } Removed DPs: #1..3 #5..11 #14..17 #19..23 Number of SCCs: 2, DPs: 2 SCC { #12 } POLO(Sum)... succeeded. s w: x1 + 1 #a__head w: 0 #a__from w: 1 a__from w: 2 take w: x1 + 2 2nd w: x1 + 2 a__2nd w: 0 #a__take w: 0 #a__2nd w: 1 #mark w: x1 + 1 0 w: 2 from w: x1 + 3 sel w: 1 nil w: 2 #a__sel w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472