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


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


YES
Input TRS:
    1: active(f(f(a()))) -> mark(f(g(f(a()))))
    2: active(f(X)) -> f(active(X))
    3: f(mark(X)) -> mark(f(X))
    4: proper(f(X)) -> f(proper(X))
    5: proper(a()) -> ok(a())
    6: proper(g(X)) -> g(proper(X))
    7: f(ok(X)) -> ok(f(X))
    8: g(ok(X)) -> ok(g(X))
    9: top(mark(X)) -> top(proper(X))
    10: top(ok(X)) -> top(active(X))
Number of strict rules: 10
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(f(X)) -> #f(active(X))
   #2: #active(f(X)) -> #active(X)
   #3: #proper(g(X)) -> #g(proper(X))
   #4: #proper(g(X)) -> #proper(X)
   #5: #top(mark(X)) -> #top(proper(X))
   #6: #top(mark(X)) -> #proper(X)
   #7: #f(ok(X)) -> #f(X)
   #8: #top(ok(X)) -> #top(active(X))
   #9: #top(ok(X)) -> #active(X)
   #10: #f(mark(X)) -> #f(X)
   #11: #active(f(f(a()))) -> #f(g(f(a())))
   #12: #active(f(f(a()))) -> #g(f(a()))
   #13: #g(ok(X)) -> #g(X)
   #14: #proper(f(X)) -> #f(proper(X))
   #15: #proper(f(X)) -> #proper(X)
Number of SCCs: 5, DPs: 8
	SCC { #13 }
Sum... succeeded.
  a()		w: (0)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  f(x1)		w: (0)
  proper(x1)		w: (0)
  ok(x1)		w: (1 + x1)
  mark(x1)		w: (0)
  #f(x1)		w: (0)
  #g(x1)		w: (x1)
  #proper(x1)		w: (0)
  active(x1)		w: (0)
  #active(x1)		w: (0)
  g(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 4, DPs: 7
	SCC { #2 }
Sum... succeeded.
  a()		w: (0)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  f(x1)		w: (1 + x1)
  proper(x1)		w: (0)
  ok(x1)		w: (1)
  mark(x1)		w: (0)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (0)
  #active(x1)		w: (x1)
  g(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 3, DPs: 6
	SCC { #4 #15 }
Sum... succeeded.
  a()		w: (0)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  f(x1)		w: (1 + x1)
  proper(x1)		w: (0)
  ok(x1)		w: (1)
  mark(x1)		w: (0)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  #proper(x1)		w: (x1)
  active(x1)		w: (0)
  #active(x1)		w: (0)
  g(x1)		w: (1 + x1)
    USABLE RULES: { }
    Removed DPs: #4 #15
Number of SCCs: 2, DPs: 4
	SCC { #7 #10 }
Sum... succeeded.
  a()		w: (0)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  f(x1)		w: (1)
  proper(x1)		w: (0)
  ok(x1)		w: (1 + x1)
  mark(x1)		w: (1 + x1)
  #f(x1)		w: (x1)
  #g(x1)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (0)
  #active(x1)		w: (0)
  g(x1)		w: (1)
    USABLE RULES: { }
    Removed DPs: #7 #10
Number of SCCs: 1, DPs: 2
	SCC { #5 #8 }
Sum... succeeded.
  a()		w: (8369)
  top(x1)		w: (0)
  #top(x1)		w: (x1)
  f(x1)		w: (1 + x1)
  proper(x1)		w: (1 + x1)
  ok(x1)		w: (x1)
  mark(x1)		w: (2 + x1)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (x1)
  #active(x1)		w: (0)
  g(x1)		w: (3)
    USABLE RULES: { 1..8 }
    Removed DPs: #5
Number of SCCs: 1, DPs: 1
	SCC { #8 }
Sum... succeeded.
  a()		w: (1)
  top(x1)		w: (0)
  #top(x1)		w: (x1)
  f(x1)		w: (1143 + x1)
  proper(x1)		w: (28101 + x1)
  ok(x1)		w: (28101 + x1)
  mark(x1)		w: (x1)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (x1)
  #active(x1)		w: (0)
  g(x1)		w: (x1)
    USABLE RULES: { 1..8 }
    Removed DPs: #8
Number of SCCs: 0, DPs: 0