Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relat 75837 pair #381724893
details
property
value
status
complete
benchmark
#3.10_rand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
INVY_15
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.412981033325 seconds
cpu usage
0.537772801
max memory
2.6103808E7
stage attributes
key
value
output-size
8713
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: eq(0(),0()) -> true() 2: eq(0(),s(x)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: app(nil(),y) -> y 9: app(add(n,x),y) -> add(n,app(x,y)) 10: min(add(n,nil())) -> n 11: min(add(n,add(m,x))) -> if_min(le(n,m),add(n,add(m,x))) 12: if_min(true(),add(n,add(m,x))) -> min(add(n,x)) 13: if_min(false(),add(n,add(m,x))) -> min(add(m,x)) 14: rm(n,nil()) -> nil() 15: rm(n,add(m,x)) -> if_rm(eq(n,m),n,add(m,x)) 16: if_rm(true(),n,add(m,x)) -> rm(n,x) 17: if_rm(false(),n,add(m,x)) -> add(m,rm(n,x)) 18: minsort(nil(),nil()) -> nil() 19: minsort(add(n,x),y) -> if_minsort(eq(n,min(add(n,x))),add(n,x),y) 20: if_minsort(true(),add(n,x),y) -> add(n,minsort(app(rm(n,x),y),nil())) 21: if_minsort(false(),add(n,x),y) -> minsort(x,add(n,y)) 22: rand(x) ->= x 23: rand(x) ->= rand(s(x)) Number of strict rules: 21 Direct POLO(bPol) ... failed. Uncurrying min 1: eq(0(),0()) -> true() 2: eq(0(),s(x)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: app(nil(),y) -> y 9: app(add(n,x),y) -> add(n,app(x,y)) 10: min^1_add(n,nil()) -> n 11: min^1_add(n,add(m,x)) -> if_min(le(n,m),add(n,add(m,x))) 12: if_min(true(),add(n,add(m,x))) -> min^1_add(n,x) 13: if_min(false(),add(n,add(m,x))) -> min^1_add(m,x) 14: rm(n,nil()) -> nil() 15: rm(n,add(m,x)) -> if_rm(eq(n,m),n,add(m,x)) 16: if_rm(true(),n,add(m,x)) -> rm(n,x) 17: if_rm(false(),n,add(m,x)) -> add(m,rm(n,x)) 18: minsort(nil(),nil()) -> nil() 19: minsort(add(n,x),y) -> if_minsort(eq(n,min^1_add(n,x)),add(n,x),y) 20: if_minsort(true(),add(n,x),y) -> add(n,minsort(app(rm(n,x),y),nil())) 21: if_minsort(false(),add(n,x),y) -> minsort(x,add(n,y)) 22: rand(x) ->= x 23: rand(x) ->= rand(s(x)) 24: min(add(_1,_2)) ->= min^1_add(_1,_2) Number of strict rules: 21 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #if_min(false(),add(n,add(m,x))) -> #min^1_add(m,x) #2: #app(add(n,x),y) -> #app(x,y) #3: #min^1_add(n,add(m,x)) -> #if_min(le(n,m),add(n,add(m,x))) #4: #min^1_add(n,add(m,x)) -> #le(n,m) #5: #min(add(_1,_2)) ->? #min^1_add(_1,_2) #6: #if_min(true(),add(n,add(m,x))) -> #min^1_add(n,x) #7: #if_minsort(true(),add(n,x),y) -> #minsort(app(rm(n,x),y),nil()) #8: #if_minsort(true(),add(n,x),y) -> #app(rm(n,x),y) #9: #if_minsort(true(),add(n,x),y) -> #rm(n,x) #10: #le(s(x),s(y)) -> #le(x,y) #11: #if_rm(false(),n,add(m,x)) -> #rm(n,x) #12: #minsort(add(n,x),y) -> #if_minsort(eq(n,min^1_add(n,x)),add(n,x),y) #13: #minsort(add(n,x),y) -> #eq(n,min^1_add(n,x)) #14: #minsort(add(n,x),y) -> #min^1_add(n,x) #15: #if_minsort(false(),add(n,x),y) -> #minsort(x,add(n,y)) #16: #if_rm(true(),n,add(m,x)) -> #rm(n,x) #17: #rm(n,add(m,x)) -> #if_rm(eq(n,m),n,add(m,x)) #18: #rm(n,add(m,x)) -> #eq(n,m) #19: #eq(s(x),s(y)) -> #eq(x,y) Number of SCCs: 6, DPs: 12 SCC { #19 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [2,1] p: 2 w: max(x1 + 8, x2 + 6) if_rm s: [] p: 1 w: max(x1 + 3, x3) s s: [1] p: 0 w: x1 #le s: [] p: 0 w: max(x2) #if_rm s: [] p: 0 w: max(x1) #if_min s: [2,1] p: 0 w: max(x1 + 1, x2) eq s: [] p: 5 w: max(x2 + 4) false s: [] p: 1 w: 0 #min s: [] p: 0 w: 0 min^1_add s: [] p: 3 w: max(x1 + 12, x2 + 5) true s: [] p: 0 w: 2 rand s: [] p: 0 w: x1 + 1 #eq s: [2] p: 1 w: max(x1 + 2, x2 + 1) 0 s: [] p: 1 w: 2 nil s: [] p: 1 w: 7 #app s: [2] p: 0 w: max(x2) #if_minsort s: [2,1,3] p: 0 w: max(x1, x2, x3)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relat 75837