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


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


MAYBE
Input TRS:
    1: active(zeros()) -> mark(cons(0(),zeros()))
    2: active(and(tt(),X)) -> mark(X)
    3: active(length(nil())) -> mark(0())
    4: active(length(cons(N,L))) -> mark(s(length(L)))
    5: mark(zeros()) -> active(zeros())
    6: mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
    7: mark(0()) -> active(0())
    8: mark(and(X1,X2)) -> active(and(mark(X1),X2))
    9: mark(tt()) -> active(tt())
    10: mark(length(X)) -> active(length(mark(X)))
    11: mark(nil()) -> active(nil())
    12: mark(s(X)) -> active(s(mark(X)))
    13: cons(mark(X1),X2) -> cons(X1,X2)
    14: cons(X1,mark(X2)) -> cons(X1,X2)
    15: cons(active(X1),X2) -> cons(X1,X2)
    16: cons(X1,active(X2)) -> cons(X1,X2)
    17: and(mark(X1),X2) -> and(X1,X2)
    18: and(X1,mark(X2)) -> and(X1,X2)
    19: and(active(X1),X2) -> and(X1,X2)
    20: and(X1,active(X2)) -> and(X1,X2)
    21: length(mark(X)) -> length(X)
    22: length(active(X)) -> length(X)
    23: s(mark(X)) -> s(X)
    24: s(active(X)) -> s(X)
Number of strict rules: 24
Direct POLO(bPol) ... removes: 8 3 11 9 2
      s 	w: x1
      and	w: x1 + 2 * x2 + 1
      zeros	w: 0
      0 	w: 0
      nil	w: 1
      mark	w: 2 * x1
      active	w: x1
      cons	w: x1 + 2 * x2
      tt	w: 1
      length	w: x1
Number of strict rules: 19
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2))
   #2: #mark(cons(X1,X2)) -> #cons(mark(X1),X2)
   #3: #mark(cons(X1,X2)) -> #mark(X1)
   #4: #cons(mark(X1),X2) -> #cons(X1,X2)
   #5: #s(active(X)) -> #s(X)
   #6: #s(mark(X)) -> #s(X)
   #7: #mark(s(X)) -> #active(s(mark(X)))
   #8: #mark(s(X)) -> #s(mark(X))
   #9: #mark(s(X)) -> #mark(X)
   #10: #cons(X1,mark(X2)) -> #cons(X1,X2)
   #11: #and(X1,active(X2)) -> #and(X1,X2)
   #12: #mark(0()) -> #active(0())
   #13: #mark(length(X)) -> #active(length(mark(X)))
   #14: #mark(length(X)) -> #length(mark(X))
   #15: #mark(length(X)) -> #mark(X)
   #16: #mark(zeros()) -> #active(zeros())
   #17: #length(active(X)) -> #length(X)
   #18: #and(mark(X1),X2) -> #and(X1,X2)
   #19: #and(active(X1),X2) -> #and(X1,X2)
   #20: #length(mark(X)) -> #length(X)
   #21: #cons(X1,active(X2)) -> #cons(X1,X2)
   #22: #active(zeros()) -> #mark(cons(0(),zeros()))
   #23: #active(zeros()) -> #cons(0(),zeros())
   #24: #cons(active(X1),X2) -> #cons(X1,X2)
   #25: #active(length(cons(N,L))) -> #mark(s(length(L)))
   #26: #active(length(cons(N,L))) -> #s(length(L))
   #27: #active(length(cons(N,L))) -> #length(L)
   #28: #and(X1,mark(X2)) -> #and(X1,X2)
Number of SCCs: 5, DPs: 19
  SCC { #5 #6 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: 0
      and	w: 0
      zeros	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: x1
      nil	w: 0
      mark	w: x1 + 1
      active	w: x1 + 1
      cons	w: 0
      #active	w: 0
      tt	w: 0
      length	w: 0
      #length	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #5 #6
Number of SCCs: 4, DPs: 17
  SCC { #17 #20 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: 0
      and	w: 0
      zeros	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      nil	w: 0
      mark	w: x1 + 1
      active	w: x1 + 1
      cons	w: 0
      #active	w: 0
      tt	w: 0
      length	w: 0
      #length	w: x1
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #17 #20
Number of SCCs: 3, DPs: 15
  SCC { #11 #18 #19 #28 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: 0
      and	w: 0
      zeros	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      nil	w: 0
      mark	w: x1 + 1
      active	w: x1 + 1
      cons	w: 0
      #active	w: 0
      tt	w: 0
      length	w: 0
      #length	w: 0
      #and	w: x1
    USABLE RULES: { }
    Removed DPs: #18 #19
Number of SCCs: 3, DPs: 13
  SCC { #11 #28 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: 0
      and	w: 0
      zeros	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      nil	w: 0
      mark	w: x1 + 1
      active	w: x1 + 1
      cons	w: 0
      #active	w: 0
      tt	w: 0
      length	w: 0
      #length	w: 0
      #and	w: x2
    USABLE RULES: { }
    Removed DPs: #11 #28
Number of SCCs: 2, DPs: 11
  SCC { #4 #10 #21 #24 }
POLO(Sum)... succeeded.
      #cons	w: x1
      s 	w: 0
      and	w: 0
      zeros	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      nil	w: 0
      mark	w: x1 + 1
      active	w: x1 + 1
      cons	w: 0
      #active	w: 0
      tt	w: 0
      length	w: 0
      #length	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #4 #24
Number of SCCs: 2, DPs: 9
  SCC { #10 #21 }
POLO(Sum)... succeeded.
      #cons	w: x2
      s 	w: 0
      and	w: 0
      zeros	w: 0
      #mark	w: 0
      0 	w: 0
      #s 	w: 0
      nil	w: 0
      mark	w: x1 + 1
      active	w: x1 + 1
      cons	w: 0
      #active	w: 0
      tt	w: 0
      length	w: 0
      #length	w: 0
      #and	w: 0
    USABLE RULES: { }
    Removed DPs: #10 #21
Number of SCCs: 1, DPs: 7
  SCC { #3 #9 #13 #15 #16 #22 #25 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: x1
      and	w: 0
      zeros	w: 1
      #mark	w: x1
      0 	w: 0
      #s 	w: 0
      nil	w: 0
      mark	w: x1
      active	w: x1
      cons	w: x1 + x2
      #active	w: x1
      tt	w: 0
      length	w: x1 + 1
      #length	w: 0
      #and	w: 0
    USABLE RULES: { 1 4..7 10 12..16 21..24 }
    Removed DPs: #15
Number of SCCs: 1, DPs: 6
  SCC { #3 #9 #13 #16 #22 #25 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: x1
      and	w: 0
      zeros	w: 5
      #mark	w: x1
      0 	w: 2
      #s 	w: 0
      nil	w: 0
      mark	w: 1
      active	w: x1
      cons	w: x1 + 1
      #active	w: 4
      tt	w: 0
      length	w: 4
      #length	w: 0
      #and	w: 0
    USABLE RULES: { 21 22 }
    Removed DPs: #3 #16 #22
Number of SCCs: 1, DPs: 3
  SCC { #9 #13 #25 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.