Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965118
details
property
value
status
complete
benchmark
velroyen-nonloop-ConvLower_c.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
3.14982199669 seconds
cpu usage
3.324173265
max memory
5.7573376E7
stage attributes
key
value
output-size
3613
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: while(true(),s(s(s(i)))) -> while(gt(s(s(s(i))),s(0())),f(s(s(s(i))))) 2: f(i) -> if(neq(i,s(s(0()))),i) 3: gt(s(x),s(y)) -> gt(x,y) 4: gt(s(x),0()) -> true() 5: gt(0(),0()) -> false() 6: gt(0(),s(y)) -> false() 7: if(true(),i) -> plus(i,s(0())) 8: if(false(),i) -> i 9: neq(s(x),s(y)) -> neq(x,y) 10: neq(0(),0()) -> false() 11: neq(0(),s(y)) -> true() 12: neq(s(x),0()) -> true() 13: plus(s(x),y) -> plus(x,s(y)) 14: plus(0(),y) -> y Number of strict rules: 14 Direct poly ... failed. Freezing gt 1: while(true(),s(s(s(i)))) -> while(gt❆1_s(s(s(i)),s(0())),f(s(s(s(i))))) 2: f(i) -> if(neq(i,s(s(0()))),i) 3: gt❆1_s(x,s(y)) -> gt(x,y) 4: gt❆1_s(x,0()) -> true() 5: gt❆1_0(0()) -> false() 6: gt❆1_0(s(y)) -> false() 7: if(true(),i) -> plus(i,s(0())) 8: if(false(),i) -> i 9: neq(s(x),s(y)) -> neq(x,y) 10: neq(0(),0()) -> false() 11: neq(0(),s(y)) -> true() 12: neq(s(x),0()) -> true() 13: plus(s(x),y) -> plus(x,s(y)) 14: plus(0(),y) -> y 15: gt(0(),_1) ->= gt❆1_0(_1) 16: gt(s(_1),_2) ->= gt❆1_s(_1,_2) Number of strict rules: 14 Direct poly ... failed. Dependency Pairs: #1: #f(i) -> #if(neq(i,s(s(0()))),i) #2: #f(i) -> #neq(i,s(s(0()))) #3: #plus(s(x),y) -> #plus(x,s(y)) #4: #neq(s(x),s(y)) -> #neq(x,y) #5: #if(true(),i) -> #plus(i,s(0())) #6: #gt(s(_1),_2) ->? #gt❆1_s(_1,_2) #7: #gt❆1_s(x,s(y)) -> #gt(x,y) #8: #while(true(),s(s(s(i)))) -> #while(gt❆1_s(s(s(i)),s(0())),f(s(s(s(i))))) #9: #while(true(),s(s(s(i)))) -> #gt❆1_s(s(s(i)),s(0())) #10: #while(true(),s(s(s(i)))) -> #f(s(s(s(i)))) #11: #gt(0(),_1) ->? #gt❆1_0(_1) Number of SCCs: 4, DPs: 5 SCC { #3 } Sum... succeeded. neq(x1,x2) w: (0) s(x1) w: (1 + x1) gt❆1_0(x1) w: (0) gt(x1,x2) w: (0) #plus(x1,x2) w: (x1) false() w: (0) #while(x1,x2) w: (0) true() w: (0) f(x1) w: (0) 0() w: (0) if(x1,x2) w: (0) while(x1,x2) w: (0) #neq(x1,x2) w: (0) #gt❆1_0(x1) w: (0) #gt(x1,x2) w: (0) #f(x1) w: (0) #gt❆1_s(x1,x2) w: (0) plus(x1,x2) w: (0) #if(x1,x2) w: (0) gt❆1_s(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #3 Number of SCCs: 3, DPs: 4 SCC { #4 } Sum... succeeded. neq(x1,x2) w: (0) s(x1) w: (1 + x1) gt❆1_0(x1) w: (0) gt(x1,x2) w: (0) #plus(x1,x2) w: (0) false() w: (0) #while(x1,x2) w: (0) true() w: (0) f(x1) w: (0) 0() w: (0) if(x1,x2) w: (0) while(x1,x2) w: (0) #neq(x1,x2) w: (x2) #gt❆1_0(x1) w: (0) #gt(x1,x2) w: (0) #f(x1) w: (0) #gt❆1_s(x1,x2) w: (0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard