Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relative pair #487081678
details
property
value
status
complete
benchmark
#4.30c_rand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n137.star.cs.uiowa.edu
space
INVY_15
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.385154 seconds
cpu usage
0.090322
user time
0.058393
system time
0.031929
max virtual memory
113188.0
max residence set size
9304.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: pred(s(x)) -> x 5: minus(x,0()) -> x 6: minus(x,s(y)) -> pred(minus(x,y)) 7: gcd(0(),y) -> y 8: gcd(s(x),0()) -> s(x) 9: gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 10: if_gcd(true(),x,y) -> gcd(minus(x,y),y) 11: if_gcd(false(),x,y) -> gcd(minus(y,x),x) 12: rand(x) ->= x 13: rand(x) ->= rand(s(x)) Number of strict rules: 11 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(x,s(y)) -> #pred(minus(x,y)) #2: #minus(x,s(y)) -> #minus(x,y) #3: #gcd(s(x),s(y)) -> #if_gcd(le(y,x),s(x),s(y)) #4: #gcd(s(x),s(y)) -> #le(y,x) #5: #if_gcd(false(),x,y) -> #gcd(minus(y,x),x) #6: #if_gcd(false(),x,y) -> #minus(y,x) #7: #if_gcd(true(),x,y) -> #gcd(minus(x,y),y) #8: #if_gcd(true(),x,y) -> #minus(x,y) #9: #le(s(x),s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 5 SCC { #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [1,2] p: 2 w: max(x1 + 1, x2 + 2) s s: [1] p: 1 w: x1 #le s: [] p: 0 w: max(x1 + 1) minus s: [1] p: 3 w: max(x1) gcd s: [] p: 4 w: max(x1 + 4, x2 + 4) false s: [] p: 2 w: 3 true s: [] p: 2 w: 5 pred s: 1 rand s: [] p: 0 w: x1 + 1 0 s: [] p: 0 w: 6 #minus s: 2 #pred s: [] p: 0 w: 1 if_gcd s: [] p: 4 w: max(x1 + 2, x2 + 4, x3 + 4) #if_gcd s: [1] p: 0 w: max(x1 + 1) #gcd s: [1,2] p: 0 w: max(x1 + 1, x2 + 1) Removed DPs: #2 Number of SCCs: 2, DPs: 4 SCC { #9 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [1,2] p: 2 w: max(x1 + 40651, x2 + 40652) s s: [1] p: 1 w: x1 #le s: 2 minus s: [1] p: 3 w: max(x1) gcd s: [] p: 4 w: max(x1 + 52451, x2 + 52451) false s: [] p: 2 w: 40653 true s: [] p: 2 w: 52452 pred s: 1 rand s: [] p: 0 w: x1 + 1 0 s: [] p: 0 w: 52453 #minus s: 2 #pred s: [] p: 0 w: 1 if_gcd s: [] p: 4 w: max(x1 + 11799, x2 + 52451, x3 + 52451) #if_gcd s: [1] p: 0 w: max(x1 + 1) #gcd s: [1,2] p: 0 w: max(x1 + 1, x2 + 1) Removed DPs: #9 Number of SCCs: 1, DPs: 3 SCC { #3 #5 #7 } 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 Relative