Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070526
details
property
value
status
complete
benchmark
OvConsOS_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.323467 seconds
cpu usage
0.067591
user time
0.044431
system time
0.02316
max virtual memory
113188.0
max residence set size
9304.0
stage attributes
key
value
starexec-result
NO
output
NO Input TRS: 1: a__zeros() -> cons(0(),zeros()) 2: a__and(tt(),X) -> mark(X) 3: a__length(nil()) -> 0() 4: a__length(cons(N,L)) -> s(a__length(mark(L))) 5: a__take(0(),IL) -> nil() 6: a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) 7: mark(zeros()) -> a__zeros() 8: mark(and(X1,X2)) -> a__and(mark(X1),X2) 9: mark(length(X)) -> a__length(mark(X)) 10: mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) 11: mark(cons(X1,X2)) -> cons(mark(X1),X2) 12: mark(0()) -> 0() 13: mark(tt()) -> tt() 14: mark(nil()) -> nil() 15: mark(s(X)) -> s(mark(X)) 16: a__zeros() -> zeros() 17: a__and(X1,X2) -> and(X1,X2) 18: a__length(X) -> length(X) 19: a__take(X1,X2) -> take(X1,X2) Number of strict rules: 19 Direct POLO(bPol) ... removes: 3 5 2 s w: x1 take w: x1 + x2 + 45991 and w: x1 + 2 * x2 + 1105 zeros w: 8405 0 w: 0 nil w: 24338 mark w: x1 cons w: x1 + x2 a__take w: x1 + x2 + 45991 tt w: 27857 a__and w: x1 + 2 * x2 + 1105 length w: x1 + 26929 a__zeros w: 8405 a__length w: x1 + 26929 Number of strict rules: 16 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__take(s(M),cons(N,IL)) -> #mark(N) #2: #mark(length(X)) -> #a__length(mark(X)) #3: #mark(length(X)) -> #mark(X) #4: #mark(cons(X1,X2)) -> #mark(X1) #5: #mark(zeros()) -> #a__zeros() #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(and(X1,X2)) -> #a__and(mark(X1),X2) #10: #mark(and(X1,X2)) -> #mark(X1) #11: #mark(s(X)) -> #mark(X) #12: #a__length(cons(N,L)) -> #a__length(mark(L)) #13: #a__length(cons(N,L)) -> #mark(L) Number of SCCs: 1, DPs: 11 SCC { #1..4 #6..8 #10..13 } POLO(Sum)... succeeded. s w: x1 take w: x1 + x2 + 2 and w: x1 + x2 + 1 zeros w: 29922 #a__take w: x2 + 4 #mark w: x1 + 3 0 w: 0 #a__and w: 0 #a__zeros w: 0 nil w: 58177 mark w: x1 #a__length w: x1 + 4 cons w: x1 + x2 a__take w: x1 + x2 + 2 tt w: 24653 a__and w: x1 + x2 + 1 length w: x1 + 14682 a__zeros w: 29922 a__length w: x1 + 14682 USABLE RULES: { 1 4 6..19 } Removed DPs: #1..3 #6..8 #10 #13 Number of SCCs: 2, DPs: 3 SCC { #12 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #a__length(cons(N,zeros())) -#12-> #a__length(mark(zeros())) --->* #a__length(cons(0(),zeros())) Looping with: [ N := 0(); ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard