/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(b(),X,c())) -> mark(f(X,c(),X))
    2: active(c()) -> mark(b())
    3: active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
    4: f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
    5: proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
    6: proper(b()) -> ok(b())
    7: proper(c()) -> ok(c())
    8: f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
    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: #top(mark(X)) -> #top(proper(X))
   #2: #top(mark(X)) -> #proper(X)
   #3: #top(ok(X)) -> #top(active(X))
   #4: #top(ok(X)) -> #active(X)
   #5: #proper(f(X1,X2,X3)) -> #f(proper(X1),proper(X2),proper(X3))
   #6: #proper(f(X1,X2,X3)) -> #proper(X1)
   #7: #proper(f(X1,X2,X3)) -> #proper(X2)
   #8: #proper(f(X1,X2,X3)) -> #proper(X3)
   #9: #active(f(X1,X2,X3)) -> #f(X1,active(X2),X3)
   #10: #active(f(X1,X2,X3)) -> #active(X2)
   #11: #active(f(b(),X,c())) -> #f(X,c(),X)
   #12: #f(ok(X1),ok(X2),ok(X3)) -> #f(X1,X2,X3)
   #13: #f(X1,mark(X2),X3) -> #f(X1,X2,X3)
Number of SCCs: 4, DPs: 8
	SCC { #10 }
Sum... succeeded.
  b()		w: (0)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  c()		w: (0)
  f(x1,x2,x3)		w: (1 + x2)
  proper(x1)		w: (0)
  ok(x1)		w: (0)
  mark(x1)		w: (0)
  #f(x1,x2,x3)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (0)
  #active(x1)		w: (x1)
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 3, DPs: 7
	SCC { #1 #3 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... succeeded.
  b()		w: (10968, 10967)
  top(x1)		w: (0, 0)
  #top(x1)		w: (10757 + x1_1, 0)
  c()		w: (29615, 3286)
  f(x1,x2,x3)		w: (30099 + x3_1 + x2_1 + x2_2 + x1_2, 1)
  proper(x1)		w: (x1_1, x1_2)
  ok(x1)		w: (x1_1, x1_2)
  mark(x1)		w: (7680 + x1_1 + x1_2, 1)
  #f(x1,x2,x3)		w: (0, 0)
  #proper(x1)		w: (0, 0)
  active(x1)		w: (x1_1, x1_2)
  #active(x1)		w: (0, 0)
    USABLE RULES: { 1..8 }
    Removed DPs: #1
Number of SCCs: 3, DPs: 6
	SCC { #3 }
Sum... succeeded.
  b()		w: (21656)
  top(x1)		w: (0)
  #top(x1)		w: (x1)
  c()		w: (31892)
  f(x1,x2,x3)		w: (x2)
  proper(x1)		w: (20978)
  ok(x1)		w: (20978)
  mark(x1)		w: (1)
  #f(x1,x2,x3)		w: (0)
  #proper(x1)		w: (0)
  active(x1)		w: (1)
  #active(x1)		w: (0)
    USABLE RULES: { 1..8 }
    Removed DPs: #3
Number of SCCs: 2, DPs: 5
	SCC { #12 #13 }
Sum... succeeded.
  b()		w: (1480)
  top(x1)		w: (0)
  #top(x1)		w: (x1)
  c()		w: (2241)
  f(x1,x2,x3)		w: (x2)
  proper(x1)		w: (2242)
  ok(x1)		w: (1 + x1)
  mark(x1)		w: (1)
  #f(x1,x2,x3)		w: (32278 + x3)
  #proper(x1)		w: (0)
  active(x1)		w: (1)
  #active(x1)		w: (0)
    USABLE RULES: { 1..8 }
    Removed DPs: #12
Number of SCCs: 2, DPs: 4
	SCC { #13 }
Sum... succeeded.
  b()		w: (1)
  top(x1)		w: (0)
  #top(x1)		w: (x1)
  c()		w: (1)
  f(x1,x2,x3)		w: (x2)
  proper(x1)		w: (12619)
  ok(x1)		w: (1 + x1)
  mark(x1)		w: (1 + x1)
  #f(x1,x2,x3)		w: (32278 + x2)
  #proper(x1)		w: (0)
  active(x1)		w: (2)
  #active(x1)		w: (0)
    USABLE RULES: { 1..8 }
    Removed DPs: #13
Number of SCCs: 1, DPs: 3
	SCC { #6..8 }
Sum... succeeded.
  b()		w: (1)
  top(x1)		w: (0)
  #top(x1)		w: (0)
  c()		w: (0)
  f(x1,x2,x3)		w: (1 + x3 + x2 + x1)
  proper(x1)		w: (2)
  ok(x1)		w: (1 + x1)
  mark(x1)		w: (1 + x1)
  #f(x1,x2,x3)		w: (32278)
  #proper(x1)		w: (x1)
  active(x1)		w: (17068)
  #active(x1)		w: (0)
    USABLE RULES: { 2 4 6..8 }
    Removed DPs: #6..8
Number of SCCs: 0, DPs: 0