details

property	value
status	complete
benchmark	rationals.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n138.star.cs.uiowa.edu
space	Mixed_AC_and_C

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.272572994232 seconds
cpu usage	0.27954407
max memory	1.91488E7

stage attributes

key	value
output-size	11755
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: AC symbols: + * C symbols: *_Q +_Q 1: 0(\#()) -> \#() 2: +(\#(),x) -> x 3: +(0(x),0(y)) -> 0(+(x,y)) 4: +(0(x),1(y)) -> 1(+(x,y)) 5: +(0(x),j(y)) -> j(+(x,y)) 6: +(1(x),1(y)) -> j(+(1(\#()),+(x,y))) 7: +(j(x),j(y)) -> 1(+(j(\#()),+(x,y))) 8: +(1(x),j(y)) -> 0(+(x,y)) 9: opp(\#()) -> \#() 10: opp(0(x)) -> 0(opp(x)) 11: opp(1(x)) -> j(opp(x)) 12: opp(j(x)) -> 1(opp(x)) 13: -(x,y) -> +(opp(y),x) 14: *(\#(),x) -> \#() 15: *(0(x),y) -> 0(*(x,y)) 16: *(1(x),y) -> +(0(*(x,y)),y) 17: *(j(x),y) -> -(0(*(x,y)),y) 18: abs(x) -> test_abs_pos(x,x) 19: test_abs_pos(\#(),x) -> x 20: test_abs_pos(0(x),y) -> test_abs_pos(x,y) 21: test_abs_pos(1(x),y) -> test_abs_pos(x,y) 22: test_abs_pos(j(x),y) -> test_abs_neg(x,y) 23: test_abs_neg(\#(),x) -> opp(x) 24: test_abs_neg(0(x),y) -> test_abs_neg(x,y) 25: test_abs_neg(1(x),y) -> test_abs_pos(x,y) 26: test_abs_neg(j(x),y) -> test_abs_neg(x,y) 27: signe(\#()) -> \#() 28: signe(0(x)) -> signe(x) 29: signe(1(x)) -> test_signe_pos(x) 30: signe(j(x)) -> test_signe_neg(x) 31: test_signe_pos(\#()) -> 1(\#()) 32: test_signe_pos(0(x)) -> test_signe_pos(x) 33: test_signe_pos(1(x)) -> test_signe_pos(x) 34: test_signe_pos(j(x)) -> test_signe_neg(x) 35: test_signe_neg(\#()) -> j(\#()) 36: test_signe_neg(0(x)) -> test_signe_neg(x) 37: test_signe_neg(1(x)) -> test_signe_pos(x) 38: test_signe_neg(j(x)) -> test_signe_neg(x) 39: min(x,y) -> test_min_pos(-(abs(y),abs(x)),x,y) 40: min'(x,y) -> test_min_pos(-(abs(1(y)),abs(1(x))),x,y) 41: min''(x,y) -> test_min_pos(-(abs(j(y)),abs(j(x))),x,y) 42: test_min_pos(\#(),x,y) -> x 43: test_min_pos(0(x),y,z) -> test_min_pos(x,y,z) 44: test_min_pos(1(x),y,z) -> test_min_pos(x,y,z) 45: test_min_pos(j(x),y,z) -> test_min_neg(x,y,z) 46: test_min_neg(\#(),x,y) -> y 47: test_min_neg(0(x),y,z) -> test_min_neg(x,y,z) 48: test_min_neg(1(x),y,z) -> test_min_pos(x,y,z) 49: test_min_neg(j(x),y,z) -> test_min_neg(x,y,z) 50: f(\#(),x) -> \#() 51: f(x,\#()) -> signe(x) 52: f(0(x),0(y)) -> f(x,y) 53: f(0(x),1(y)) -> 0(f(x,1(y))) 54: f(0(x),j(y)) -> 0(f(x,j(y))) 55: f(1(x),0(y)) -> f(1(x),y) 56: f(1(x),1(y)) -> +(0(f(-(x,min'(x,y)),1(y))),f(min(1(x),1(y)),-(x,y))) 57: f(1(x),j(y)) -> +(0(f(+(min''(opp(x),y),x),j(y))),f(min(1(x),1(opp(y))),+(x,y))) 58: f(j(x),0(y)) -> f(j(x),y) 59: f(j(x),1(y)) -> +(0(f(+(min'(opp(x),y),x),1(y))),f(min(j(x),j(opp(y))),+(x,y))) 60: f(j(x),j(y)) -> +(0(f(-(x,min''(x,y)),j(y))),f(min(j(x),j(y)),-(x,y))) 61: rat(x,y) -> irred(*(signe(y),f(x,y)),*(signe(y),f(y,x))) 62: +_Q(irred(x,y),irred(u,v)) -> irred(+(*(x,v),*(y,u)),*(y,v)) 63: *_Q(irred(x,y),irred(u,v)) -> rat(*(x,u),*(y,v)) Number of strict rules: 63 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #test_min_pos(0(x),y,z) -> #test_min_pos(x,y,z) #2: #signe(1(x)) -> #test_signe_pos(x) #3: #min''(x,y) -> #test_min_pos(-(abs(j(y)),abs(j(x))),x,y) #4: #min''(x,y) -> #-(abs(j(y)),abs(j(x))) #5: #min''(x,y) -> #abs(j(y)) #6: #min''(x,y) -> #abs(j(x)) #7: #test_signe_neg(1(x)) -> #test_signe_pos(x) #8: #test_min_neg(0(x),y,z) -> #test_min_neg(x,y,z) #9: #f(0(x),1(y)) -> #0(f(x,1(y))) #10: #f(0(x),1(y)) -> #f(x,1(y)) #11: #test_min_neg(1(x),y,z) -> #test_min_pos(x,y,z) #12: #f(j(x),0(y)) -> #f(j(x),y) #13: #rat(x,y) -> #*(signe(y),f(x,y)) #14: #rat(x,y) -> #signe(y) #15: #rat(x,y) -> #f(x,y) #16: #rat(x,y) -> #*(signe(y),f(y,x)) #17: #rat(x,y) -> #signe(y) #18: #rat(x,y) -> #f(y,x) #19: #test_signe_neg(j(x)) -> #test_signe_neg(x) #20: #+(1(x),1(y)) -> #+(1(\#()),+(x,y)) #21: #+(1(x),1(y)) -> #+(x,y) #22: #f(j(x),1(y)) -> #+(0(f(+(min'(opp(x),y),x),1(y))),f(min(j(x),j(opp(y))),+(x,y))) #23: #f(j(x),1(y)) -> #0(f(+(min'(opp(x),y),x),1(y))) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Equational