/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
Input TRS:
    1: f(true(),x) -> f(gt(x,0()),double(x))
    2: gt(s(x),0()) -> true()
    3: gt(0(),y) -> false()
    4: gt(s(x),s(y)) -> gt(x,y)
    5: double(x) -> times(s(s(0())),x)
    6: times(0(),y) -> 0()
    7: times(s(x),y) -> plus(y,times(x,y))
    8: plus(0(),y) -> y
    9: plus(s(x),y) -> plus(x,s(y))
Number of strict rules: 9
Direct poly ... failed.
Freezing times
1: f(true(),x) -> f(gt(x,0()),double(x))
2: gt(s(x),0()) -> true()
3: gt(0(),y) -> false()
4: gt(s(x),s(y)) -> gt(x,y)
5: double(x) -> times❆1_s(s(0()),x)
6: times❆1_0(y) -> 0()
7: times❆1_s(x,y) -> plus(y,times(x,y))
8: plus(0(),y) -> y
9: plus(s(x),y) -> plus(x,s(y))
10: times(0(),_1) ->= times❆1_0(_1)
11: times(s(_1),_2) ->= times❆1_s(_1,_2)
Number of strict rules: 9
Direct poly ... failed.
Dependency Pairs:
   #1: #plus(s(x),y) -> #plus(x,s(y))
   #2: #times(s(_1),_2) ->? #times❆1_s(_1,_2)
   #3: #times❆1_s(x,y) -> #plus(y,times(x,y))
   #4: #times❆1_s(x,y) -> #times(x,y)
   #5: #times(0(),_1) ->? #times❆1_0(_1)
   #6: #double(x) -> #times❆1_s(s(0()),x)
   #7: #f(true(),x) -> #f(gt(x,0()),double(x))
   #8: #f(true(),x) -> #gt(x,0())
   #9: #f(true(),x) -> #double(x)
   #10: #gt(s(x),s(y)) -> #gt(x,y)
Number of SCCs: 4, DPs: 5
	SCC { #10 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  gt(x1,x2)		w: (0)
  #times❆1_0(x1)		w: (0)
  #plus(x1,x2)		w: (0)
  false()		w: (0)
  true()		w: (0)
  f(x1,x2)		w: (0)
  #times(x1,x2)		w: (0)
  0()		w: (0)
  #double(x1)		w: (0)
  double(x1)		w: (0)
  times❆1_0(x1)		w: (0)
  times(x1,x2)		w: (0)
  #gt(x1,x2)		w: (x2)
  #f(x1,x2)		w: (0)
  #times❆1_s(x1,x2)		w: (0)
  plus(x1,x2)		w: (0)
  times❆1_s(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 3, DPs: 4
	SCC { #1 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  gt(x1,x2)		w: (0)
  #times❆1_0(x1)		w: (0)
  #plus(x1,x2)		w: (x1)
  false()		w: (0)
  true()		w: (0)
  f(x1,x2)		w: (0)
  #times(x1,x2)		w: (0)
  0()		w: (0)
  #double(x1)		w: (0)
  double(x1)		w: (0)
  times❆1_0(x1)		w: (0)
  times(x1,x2)		w: (0)
  #gt(x1,x2)		w: (0)
  #f(x1,x2)		w: (0)
  #times❆1_s(x1,x2)		w: (0)
  plus(x1,x2)		w: (0)
  times❆1_s(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 3
	SCC { #7 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.