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	n136.star.cs.uiowa.edu
space	Mixed_AC_and_C

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.212762 seconds
cpu usage	0.136309
user time	0.097525
system time	0.038784
max virtual memory	113176.0
max residence set size	6264.0

stage attributes

key	value
starexec-result	MAYBE

output

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

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

job log

popout

actions

all output return to TRS_Equational 2019-03-21 05.09