Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relat 75837 pair #381724875
details
property
value
status
complete
benchmark
#3.6_rand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n191.star.cs.uiowa.edu
space
INVY_15
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.270283937454 seconds
cpu usage
0.346189918
max memory
2.4223744E7
stage attributes
key
value
output-size
2621
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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(),s(x),s(y)) -> gcd(minus(x,y),s(y)) 11: if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(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(),s(x),s(y)) -> #gcd(minus(y,x),s(x)) #6: #if_gcd(false(),s(x),s(y)) -> #minus(y,x) #7: #if_gcd(true(),s(x),s(y)) -> #gcd(minus(x,y),s(y)) #8: #if_gcd(true(),s(x),s(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: [] p: 0 w: 0 s s: [1] p: 1 w: x1 #le s: [] p: 0 w: max(x1 + 1) minus s: 1 gcd s: [] p: 2 w: max(x1 + 1, x2 + 1) false s: [] p: 0 w: 0 true s: [] p: 0 w: 0 pred s: 1 rand s: [] p: 0 w: x1 + 1 0 s: [] p: 0 w: 1 #minus s: [2] p: 2 w: max(x1 + 2, x2 + 1) #pred s: [] p: 0 w: 1 if_gcd s: [] p: 2 w: max(x1 + 1, x2 + 1, x3 + 1) #if_gcd s: [1,3] p: 0 w: max(x1, x3 + 1) #gcd s: [] p: 0 w: max(x2) Removed DPs: #2 Number of SCCs: 2, DPs: 4 SCC { #9 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [] p: 0 w: 0 s s: [1] p: 1 w: x1 #le s: [1] p: 2 w: max(x1 + 1) minus s: 1 gcd s: [] p: 2 w: max(x1 + 1, x2 + 1) false s: [] p: 0 w: 0 true s: [] p: 0 w: 0 pred s: 1 rand s: [] p: 0 w: x1 + 1 0 s: [] p: 0 w: 1 #minus s: [2] p: 2 w: max(x1 + 2, x2 + 1) #pred s: [] p: 0 w: 1 if_gcd s: [] p: 2 w: max(x1 + 1, x2 + 1, x3 + 1) #if_gcd s: [1,3] p: 0 w: max(x1, x3 + 1) #gcd s: [] p: 0 w: max(x2) 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 Relat 75837