Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072776
details
property
value
status
complete
benchmark
reverse.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n182.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.131623 seconds
cpu usage
0.05034
user time
0.029494
system time
0.020846
max virtual memory
113188.0
max residence set size
6456.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: isEmpty(nil()) -> true() 2: isEmpty(cons(x,xs)) -> false() 3: last(cons(x,nil())) -> x 4: last(cons(x,cons(y,ys))) -> last(cons(y,ys)) 5: dropLast(nil()) -> nil() 6: dropLast(cons(x,nil())) -> nil() 7: dropLast(cons(x,cons(y,ys))) -> cons(x,dropLast(cons(y,ys))) 8: append(nil(),ys) -> ys 9: append(cons(x,xs),ys) -> cons(x,append(xs,ys)) 10: reverse(xs) -> rev(xs,nil()) 11: rev(xs,ys) -> if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) 12: if(true(),xs,ys,zs) -> zs 13: if(false(),xs,ys,zs) -> rev(xs,ys) Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying last dropLast 1: isEmpty(nil()) -> true() 2: isEmpty(cons(x,xs)) -> false() 3: last^1_cons(x,nil()) -> x 4: last^1_cons(x,cons(y,ys)) -> last^1_cons(y,ys) 5: dropLast^1_nil() -> nil() 6: dropLast^1_cons(x,nil()) -> nil() 7: dropLast^1_cons(x,cons(y,ys)) -> cons(x,dropLast^1_cons(y,ys)) 8: append(nil(),ys) -> ys 9: append(cons(x,xs),ys) -> cons(x,append(xs,ys)) 10: reverse(xs) -> rev(xs,nil()) 11: rev(xs,ys) -> if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) 12: if(true(),xs,ys,zs) -> zs 13: if(false(),xs,ys,zs) -> rev(xs,ys) 14: dropLast(cons(_1,_2)) ->= dropLast^1_cons(_1,_2) 15: dropLast(nil()) ->= dropLast^1_nil() 16: last(cons(_1,_2)) ->= last^1_cons(_1,_2) Number of strict rules: 13 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #if(false(),xs,ys,zs) -> #rev(xs,ys) #2: #append(cons(x,xs),ys) -> #append(xs,ys) #3: #rev(xs,ys) -> #if(isEmpty(xs),dropLast(xs),append(ys,last(xs)),ys) #4: #rev(xs,ys) -> #isEmpty(xs) #5: #rev(xs,ys) -> #dropLast(xs) #6: #rev(xs,ys) -> #append(ys,last(xs)) #7: #rev(xs,ys) -> #last(xs) #8: #dropLast(cons(_1,_2)) ->? #dropLast^1_cons(_1,_2) #9: #dropLast^1_cons(x,cons(y,ys)) -> #dropLast^1_cons(y,ys) #10: #reverse(xs) -> #rev(xs,nil()) #11: #last(cons(_1,_2)) ->? #last^1_cons(_1,_2) #12: #dropLast(nil()) ->? #dropLast^1_nil() #13: #last^1_cons(x,cons(y,ys)) -> #last^1_cons(y,ys) Number of SCCs: 4, DPs: 5 SCC { #9 } POLO(Sum)... succeeded. #rev w: 0 #append w: 0 #reverse w: 0 #isEmpty w: 0 false w: 0 isEmpty w: 0 reverse w: 0 true w: 0 #last w: 0 append w: 0 if w: 0 #dropLast w: 0 dropLast w: 0 #last^1_cons w: 0 last w: 0 nil w: 0 #dropLast^1_cons w: x2 rev w: 0 #dropLast^1_nil w: 0 last^1_cons w: 0 cons w: x2 + 1 #if w: 0 dropLast^1_cons w: 0 dropLast^1_nil w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 3, DPs: 4 SCC { #13 } POLO(Sum)... succeeded. #rev w: 0 #append w: 0 #reverse w: 0 #isEmpty w: 0 false w: 0 isEmpty w: 0 reverse w: 0 true w: 0 #last w: 0 append w: 0 if w: 0 #dropLast w: 0 dropLast w: 0 #last^1_cons w: x2 last w: 0 nil w: 0 #dropLast^1_cons w: 0 rev w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard