Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487069096
details
property
value
status
complete
benchmark
minsort.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
Mixed_TRS
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.214337 seconds
cpu usage
0.078673
user time
0.043005
system time
0.035668
max virtual memory
113188.0
max residence set size
6476.0
stage attributes
key
value
starexec-result
MAYBE
output
MAYBE Input TRS: 1: le(0(),y) -> true() 2: le(s(x),0()) -> false() 3: le(s(x),s(y)) -> le(x,y) 4: eq(0(),0()) -> true() 5: eq(0(),s(y)) -> false() 6: eq(s(x),0()) -> false() 7: eq(s(x),s(y)) -> eq(x,y) 8: if(true(),x,y) -> x 9: if(false(),x,y) -> y 10: minsort(nil()) -> nil() 11: minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y)))) 12: min(x,nil()) -> x 13: min(x,cons(y,z)) -> if(le(x,y),min(x,z),min(y,z)) 14: del(x,nil()) -> nil() 15: del(x,cons(y,z)) -> if(eq(x,y),z,cons(y,del(x,z))) Number of strict rules: 15 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #min(x,cons(y,z)) -> #if(le(x,y),min(x,z),min(y,z)) #2: #min(x,cons(y,z)) -> #le(x,y) #3: #min(x,cons(y,z)) -> #min(x,z) #4: #min(x,cons(y,z)) -> #min(y,z) #5: #minsort(cons(x,y)) -> #min(x,y) #6: #minsort(cons(x,y)) -> #minsort(del(min(x,y),cons(x,y))) #7: #minsort(cons(x,y)) -> #del(min(x,y),cons(x,y)) #8: #minsort(cons(x,y)) -> #min(x,y) #9: #eq(s(x),s(y)) -> #eq(x,y) #10: #le(s(x),s(y)) -> #le(x,y) #11: #del(x,cons(y,z)) -> #if(eq(x,y),z,cons(y,del(x,z))) #12: #del(x,cons(y,z)) -> #eq(x,y) #13: #del(x,cons(y,z)) -> #del(x,z) Number of SCCs: 5, DPs: 6 SCC { #13 } POLO(Sum)... succeeded. le w: 0 #del w: x2 s w: 0 #le w: 0 eq w: 0 false w: 0 #min w: 0 true w: 0 #eq w: 0 0 w: 0 if w: 0 del w: 0 nil w: 0 min w: 0 cons w: x2 + 1 #if w: 0 #minsort w: 0 minsort w: 0 USABLE RULES: { } Removed DPs: #13 Number of SCCs: 4, DPs: 5 SCC { #9 } POLO(Sum)... succeeded. le w: 0 #del w: 0 s w: x1 + 1 #le w: 0 eq w: 0 false w: 0 #min w: 0 true w: 0 #eq w: x2 0 w: 0 if w: 0 del w: 0 nil w: 0 min w: 0 cons w: 1 #if w: 0 #minsort w: 0 minsort w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 3, DPs: 4 SCC { #10 } POLO(Sum)... succeeded. le w: 0 #del w: 0 s w: x1 + 1 #le w: x2 eq w: 0 false w: 0 #min w: 0 true w: 0 #eq w: 0 0 w: 0 if w: 0 del w: 0 nil w: 0 min w: 0 cons w: 1 #if w: 0 #minsort w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard