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


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


MAYBE
Input TRS:
    1: f(tt(),x) -> f(eq(toOne(x),s(0())),s(x))
    2: eq(s(x),s(y)) -> eq(x,y)
    3: eq(0(),0()) -> tt()
    4: toOne(s(s(x))) -> toOne(s(x))
    5: toOne(s(0())) -> s(0())
Number of strict rules: 5
Direct poly ... failed.
Freezing toOne
1: f(tt(),x) -> f(eq(toOne(x),s(0())),s(x))
2: eq(s(x),s(y)) -> eq(x,y)
3: eq(0(),0()) -> tt()
4: toOne❆1_s(s(x)) -> toOne❆1_s(x)
5: toOne❆1_s(0()) -> s(0())
6: toOne(s(_1)) ->= toOne❆1_s(_1)
Number of strict rules: 5
Direct poly ... failed.
Dependency Pairs:
   #1: #eq(s(x),s(y)) -> #eq(x,y)
   #2: #toOne(s(_1)) ->? #toOne❆1_s(_1)
   #3: #f(tt(),x) -> #f(eq(toOne(x),s(0())),s(x))
   #4: #f(tt(),x) -> #eq(toOne(x),s(0()))
   #5: #f(tt(),x) -> #toOne(x)
   #6: #toOne❆1_s(s(x)) -> #toOne❆1_s(x)
Number of SCCs: 3, DPs: 3
	SCC { #6 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  toOne(x1)		w: (0)
  eq(x1,x2)		w: (0)
  #toOne❆1_s(x1)		w: (x1)
  f(x1,x2)		w: (0)
  #eq(x1,x2)		w: (0)
  0()		w: (0)
  toOne❆1_s(x1)		w: (0)
  #f(x1,x2)		w: (0)
  tt()		w: (0)
  #toOne(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 2
	SCC { #1 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  toOne(x1)		w: (0)
  eq(x1,x2)		w: (0)
  #toOne❆1_s(x1)		w: (0)
  f(x1,x2)		w: (0)
  #eq(x1,x2)		w: (x2)
  0()		w: (0)
  toOne❆1_s(x1)		w: (0)
  #f(x1,x2)		w: (0)
  tt()		w: (0)
  #toOne(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
	SCC { #3 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.