Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516965318
details
property
value
status
complete
benchmark
velroyen-nonloop-AlternatingIncr_c.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
EEG_IJCAR_12
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
3.09990286827 seconds
cpu usage
3.427065926
max memory
6.7170304E7
stage attributes
key
value
output-size
4579
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(s(s(i)))))) -> while(gt(s(s(s(s(s(i))))),0()),f(s(s(s(s(s(i))))))) 2: f(i) -> if(eq(mod2(i),0()),i) 3: gt(s(x),s(y)) -> gt(x,y) 4: gt(s(x),0()) -> true() 5: gt(0(),y) -> false() 6: if(true(),i) -> plus(i,s(0())) 7: if(false(),i) -> plus(i,s(s(s(0())))) 8: mod2(s(s(x))) -> mod2(x) 9: mod2(s(0())) -> s(0()) 10: mod2(0()) -> 0() 11: eq(s(x),s(y)) -> eq(x,y) 12: eq(0(),0()) -> true() 13: eq(0(),s(y)) -> false() 14: eq(s(x),0()) -> false() 15: plus(s(x),y) -> plus(x,s(y)) 16: plus(0(),y) -> y Number of strict rules: 16 Direct poly ... failed. Freezing gt 1: while(true(),s(s(s(s(s(i)))))) -> while(gt❆1_s(s(s(s(s(i)))),0()),f(s(s(s(s(s(i))))))) 2: f(i) -> if(eq(mod2(i),0()),i) 3: gt❆1_s(x,s(y)) -> gt(x,y) 4: gt❆1_s(x,0()) -> true() 5: gt❆1_0(y) -> false() 6: if(true(),i) -> plus(i,s(0())) 7: if(false(),i) -> plus(i,s(s(s(0())))) 8: mod2(s(s(x))) -> mod2(x) 9: mod2(s(0())) -> s(0()) 10: mod2(0()) -> 0() 11: eq(s(x),s(y)) -> eq(x,y) 12: eq(0(),0()) -> true() 13: eq(0(),s(y)) -> false() 14: eq(s(x),0()) -> false() 15: plus(s(x),y) -> plus(x,s(y)) 16: plus(0(),y) -> y 17: gt(0(),_1) ->= gt❆1_0(_1) 18: gt(s(_1),_2) ->= gt❆1_s(_1,_2) Number of strict rules: 16 Direct poly ... failed. Dependency Pairs: #1: #f(i) -> #if(eq(mod2(i),0()),i) #2: #f(i) -> #eq(mod2(i),0()) #3: #f(i) -> #mod2(i) #4: #if(true(),i) -> #plus(i,s(0())) #5: #eq(s(x),s(y)) -> #eq(x,y) #6: #if(false(),i) -> #plus(i,s(s(s(0())))) #7: #gt(0(),_1) ->? #gt❆1_0(_1) #8: #gt❆1_s(x,s(y)) -> #gt(x,y) #9: #while(true(),s(s(s(s(s(i)))))) -> #while(gt❆1_s(s(s(s(s(i)))),0()),f(s(s(s(s(s(i))))))) #10: #while(true(),s(s(s(s(s(i)))))) -> #gt❆1_s(s(s(s(s(i)))),0()) #11: #while(true(),s(s(s(s(s(i)))))) -> #f(s(s(s(s(s(i)))))) #12: #mod2(s(s(x))) -> #mod2(x) #13: #plus(s(x),y) -> #plus(x,s(y)) #14: #gt(s(_1),_2) ->? #gt❆1_s(_1,_2) Number of SCCs: 5, DPs: 6 SCC { #12 } Sum... succeeded. #mod2(x1) w: (x1) s(x1) w: (1 + x1) gt❆1_0(x1) w: (0) gt(x1,x2) w: (0) #plus(x1,x2) w: (0) eq(x1,x2) w: (0) false() w: (0) #while(x1,x2) w: (0) true() w: (0) f(x1) w: (0) #eq(x1,x2) w: (0) 0() w: (0) if(x1,x2) w: (0) while(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) mod2(x1) w: (0) gt❆1_s(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #12 Number of SCCs: 4, DPs: 5 SCC { #13 } Sum... succeeded. #mod2(x1) w: (0) s(x1) w: (1 + x1) gt❆1_0(x1) w: (0) gt(x1,x2) w: (0) #plus(x1,x2) w: (x1) eq(x1,x2) w: (0) false() w: (0) #while(x1,x2) w: (0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard