Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710845
details
property
value
status
complete
benchmark
#4.36.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n028.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.0803020000458 seconds
cpu usage
0.092283742
max memory
1.1186176E7
stage attributes
key
value
output-size
5407
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(m)) -> false() 3: eq(s(n),0()) -> false() 4: eq(s(n),s(m)) -> eq(n,m) 5: le(0(),m) -> true() 6: le(s(n),0()) -> false() 7: le(s(n),s(m)) -> le(n,m) 8: min(cons(0(),nil())) -> 0() 9: min(cons(s(n),nil())) -> s(n) 10: min(cons(n,cons(m,x))) -> if_min(le(n,m),cons(n,cons(m,x))) 11: if_min(true(),cons(n,cons(m,x))) -> min(cons(n,x)) 12: if_min(false(),cons(n,cons(m,x))) -> min(cons(m,x)) 13: replace(n,m,nil()) -> nil() 14: replace(n,m,cons(k,x)) -> if_replace(eq(n,k),n,m,cons(k,x)) 15: if_replace(true(),n,m,cons(k,x)) -> cons(m,x) 16: if_replace(false(),n,m,cons(k,x)) -> cons(k,replace(n,m,x)) 17: sort(nil()) -> nil() 18: sort(cons(n,x)) -> cons(min(cons(n,x)),sort(replace(min(cons(n,x)),n,x))) Number of strict rules: 18 Direct POLO(bPol) ... failed. Uncurrying min 1: eq(0(),0()) -> true() 2: eq(0(),s(m)) -> false() 3: eq(s(n),0()) -> false() 4: eq(s(n),s(m)) -> eq(n,m) 5: le(0(),m) -> true() 6: le(s(n),0()) -> false() 7: le(s(n),s(m)) -> le(n,m) 8: min^1_cons(0(),nil()) -> 0() 9: min^1_cons(s(n),nil()) -> s(n) 10: min^1_cons(n,cons(m,x)) -> if_min(le(n,m),cons(n,cons(m,x))) 11: if_min(true(),cons(n,cons(m,x))) -> min^1_cons(n,x) 12: if_min(false(),cons(n,cons(m,x))) -> min^1_cons(m,x) 13: replace(n,m,nil()) -> nil() 14: replace(n,m,cons(k,x)) -> if_replace(eq(n,k),n,m,cons(k,x)) 15: if_replace(true(),n,m,cons(k,x)) -> cons(m,x) 16: if_replace(false(),n,m,cons(k,x)) -> cons(k,replace(n,m,x)) 17: sort(nil()) -> nil() 18: sort(cons(n,x)) -> cons(min^1_cons(n,x),sort(replace(min^1_cons(n,x),n,x))) 19: min(cons(_1,_2)) ->= min^1_cons(_1,_2) Number of strict rules: 18 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #if_min(true(),cons(n,cons(m,x))) -> #min^1_cons(n,x) #2: #if_min(false(),cons(n,cons(m,x))) -> #min^1_cons(m,x) #3: #replace(n,m,cons(k,x)) -> #if_replace(eq(n,k),n,m,cons(k,x)) #4: #replace(n,m,cons(k,x)) -> #eq(n,k) #5: #le(s(n),s(m)) -> #le(n,m) #6: #min^1_cons(n,cons(m,x)) -> #if_min(le(n,m),cons(n,cons(m,x))) #7: #min^1_cons(n,cons(m,x)) -> #le(n,m) #8: #min(cons(_1,_2)) ->? #min^1_cons(_1,_2) #9: #if_replace(false(),n,m,cons(k,x)) -> #replace(n,m,x) #10: #eq(s(n),s(m)) -> #eq(n,m) #11: #sort(cons(n,x)) -> #min^1_cons(n,x) #12: #sort(cons(n,x)) -> #sort(replace(min^1_cons(n,x),n,x)) #13: #sort(cons(n,x)) -> #replace(min^1_cons(n,x),n,x) #14: #sort(cons(n,x)) -> #min^1_cons(n,x) Number of SCCs: 5, DPs: 8 SCC { #10 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: 0 #if_min w: 0 min^1_cons w: 0 eq w: 0 false w: 0 #min w: 0 true w: 0 #eq w: x1 + x2 #sort w: 0 0 w: 0 if_replace w: 0 nil w: 0 sort w: 0 #replace w: 0 #if_replace w: 0 min w: 0 #min^1_cons w: 0 cons w: 0 if_min w: 0 replace w: 0 USABLE RULES: { } Removed DPs: #10 Number of SCCs: 4, DPs: 7 SCC { #5 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: x1 #if_min w: 0 min^1_cons w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472