Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relat 75837 pair #381725087
details
property
value
status
complete
benchmark
#3.53_rand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
INVY_15
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.219138145447 seconds
cpu usage
0.280620794
max memory
1.6928768E7
stage attributes
key
value
output-size
6114
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: app(nil(),y) -> y 6: app(add(n,x),y) -> add(n,app(x,y)) 7: reverse(nil()) -> nil() 8: reverse(add(n,x)) -> app(reverse(x),add(n,nil())) 9: shuffle(nil()) -> nil() 10: shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) 11: concat(leaf(),y) -> y 12: concat(cons(u,v),y) -> cons(u,concat(v,y)) 13: less_leaves(x,leaf()) -> false() 14: less_leaves(leaf(),cons(w,z)) -> true() 15: less_leaves(cons(u,v),cons(w,z)) -> less_leaves(concat(u,v),concat(w,z)) 16: rand(x) ->= x 17: rand(x) ->= rand(s(x)) Number of strict rules: 15 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #app(add(n,x),y) -> #app(x,y) #3: #concat(cons(u,v),y) -> #concat(v,y) #4: #shuffle(add(n,x)) -> #shuffle(reverse(x)) #5: #shuffle(add(n,x)) -> #reverse(x) #6: #reverse(add(n,x)) -> #app(reverse(x),add(n,nil())) #7: #reverse(add(n,x)) -> #reverse(x) #8: #less_leaves(cons(u,v),cons(w,z)) -> #less_leaves(concat(u,v),concat(w,z)) #9: #less_leaves(cons(u,v),cons(w,z)) -> #concat(u,v) #10: #less_leaves(cons(u,v),cons(w,z)) -> #concat(w,z) #11: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y)) #12: #quot(s(x),s(y)) -> #minus(x,y) Number of SCCs: 7, DPs: 7 SCC { #7 } POLO(Sum)... succeeded. s w: x1 #reverse w: x1 minus w: x1 + 1 #less_leaves w: 0 #concat w: 0 false w: 0 reverse w: x1 true w: 0 rand w: x1 shuffle w: x1 + 1 concat w: x1 + x2 + 1 0 w: 1 quot w: 1 less_leaves w: x1 + x2 nil w: 0 #app w: 0 #minus w: 0 #shuffle w: 0 cons w: x1 + x2 + 1 add w: x2 + 1 #quot w: 0 leaf w: 1 app w: x1 + x2 Removed DPs: #7 Number of SCCs: 6, DPs: 6 SCC { #4 } POLO(Sum)... succeeded. s w: x1 #reverse w: 0 minus w: x1 + 1 #less_leaves w: 0 #concat w: 0 false w: 0 reverse w: x1 true w: 0 rand w: x1 shuffle w: x1 + 1 concat w: x1 + x2 + 1 0 w: 1 quot w: 1 less_leaves w: x1 + x2 nil w: 0 #app w: 0 #minus w: 0 #shuffle w: x1 cons w: x1 + x2 + 1 add w: x2 + 1 #quot w: 0 leaf w: 1 app w: x1 + x2 Removed DPs: #4 Number of SCCs: 5, DPs: 5 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. s s: [1] p: 0 w: x1 #reverse s: [] p: 0 w: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relat 75837