Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072586
details
property
value
status
complete
benchmark
20.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n174.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.536578 seconds
cpu usage
0.067156
user time
0.043345
system time
0.023811
max virtual memory
113188.0
max residence set size
9308.0
stage attributes
key
value
starexec-result
MAYBE
output
MAYBE Input TRS: 1: cond1(true(),x,y) -> cond2(gr(y,0()),x,y) 2: cond2(true(),x,y) -> cond2(gr(y,0()),p(x),p(y)) 3: cond2(false(),x,y) -> cond1(and(eq(x,y),gr(x,0())),x,y) 4: gr(0(),x) -> false() 5: gr(s(x),0()) -> true() 6: gr(s(x),s(y)) -> gr(x,y) 7: p(0()) -> 0() 8: p(s(x)) -> x 9: eq(0(),0()) -> true() 10: eq(s(x),0()) -> false() 11: eq(0(),s(x)) -> false() 12: eq(s(x),s(y)) -> eq(x,y) 13: and(true(),true()) -> true() 14: and(false(),x) -> false() 15: and(x,false()) -> false() Number of strict rules: 15 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #cond2(true(),x,y) -> #cond2(gr(y,0()),p(x),p(y)) #2: #cond2(true(),x,y) -> #gr(y,0()) #3: #cond2(true(),x,y) -> #p(x) #4: #cond2(true(),x,y) -> #p(y) #5: #gr(s(x),s(y)) -> #gr(x,y) #6: #eq(s(x),s(y)) -> #eq(x,y) #7: #cond2(false(),x,y) -> #cond1(and(eq(x,y),gr(x,0())),x,y) #8: #cond2(false(),x,y) -> #and(eq(x,y),gr(x,0())) #9: #cond2(false(),x,y) -> #eq(x,y) #10: #cond2(false(),x,y) -> #gr(x,0()) #11: #cond1(true(),x,y) -> #cond2(gr(y,0()),x,y) #12: #cond1(true(),x,y) -> #gr(y,0()) Number of SCCs: 3, DPs: 5 SCC { #5 } POLO(Sum)... succeeded. cond2 w: 0 s w: x1 + 1 #cond1 w: 0 and w: 0 eq w: 0 false w: 0 #p w: 0 true w: 0 cond1 w: 0 #eq w: 0 p w: 0 0 w: 0 #gr w: x2 #cond2 w: 0 gr w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 2, DPs: 4 SCC { #6 } POLO(Sum)... succeeded. cond2 w: 0 s w: x1 + 1 #cond1 w: 0 and w: 0 eq w: 0 false w: 0 #p w: 0 true w: 0 cond1 w: 0 #eq w: x2 p w: 0 0 w: 0 #gr w: 0 #cond2 w: 0 gr w: 0 #and w: 0 USABLE RULES: { } Removed DPs: #6 Number of SCCs: 1, DPs: 3 SCC { #1 #7 #11 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. cond2 w: max(x2 - 1, 0) s w: max(x1 + 287, 0) #cond1 w: max(x1 - 289, x2 - 283, x3 - 285, 0) and w: max(x1 + 1, 0) eq w: max(x2 + 2, 0) false w: 0 #p w: max(x1 - 1, 0) true w: 2 cond1 w: max(x1 - 1, 0) #eq w: 0 p w: max(x1 - 1, 0) 0 w: 0 #gr w: max(x1 - 1, 0) #cond2 w: max(x1 - 1, x2 - 283, x3 - 285, 0) gr w: max(x1 - 285, 0) #and w: 0 USABLE RULES: { 4 5 7..15 } Removed DPs: #1 Number of SCCs: 1, DPs: 2 SCC { #7 #11 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard