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


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


YES
Input TRS:
    1: sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> sortSu(cons(te(msubst(te(a),sortSu(t))),sortSu(circ(sortSu(s),sortSu(t)))))
    2: sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(te(a),sortSu(t))))) -> sortSu(cons(te(a),sortSu(circ(sortSu(s),sortSu(t)))))
    3: sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(sop(lift()),sortSu(t))))) -> sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t)))))
    4: sortSu(circ(sortSu(circ(sortSu(s),sortSu(t))),sortSu(u))) -> sortSu(circ(sortSu(s),sortSu(circ(sortSu(t),sortSu(u)))))
    5: sortSu(circ(sortSu(s),sortSu(id()))) -> sortSu(s)
    6: sortSu(circ(sortSu(id()),sortSu(s))) -> sortSu(s)
    7: sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> sortSu(circ(sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))),sortSu(u)))
    8: te(subst(te(a),sortSu(id()))) -> te(a)
    9: te(msubst(te(a),sortSu(id()))) -> te(a)
    10: te(msubst(te(msubst(te(a),sortSu(s))),sortSu(t))) -> te(msubst(te(a),sortSu(circ(sortSu(s),sortSu(t)))))
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(te(a),sortSu(t))))) -> #sortSu(cons(te(a),sortSu(circ(sortSu(s),sortSu(t)))))
   #2: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(te(a),sortSu(t))))) -> #sortSu(circ(sortSu(s),sortSu(t)))
   #3: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> #sortSu(circ(sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t))))),sortSu(u)))
   #4: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> #sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t)))))
   #5: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(circ(sortSu(cons(sop(lift()),sortSu(t))),sortSu(u))))) -> #sortSu(circ(sortSu(s),sortSu(t)))
   #6: #te(msubst(te(msubst(te(a),sortSu(s))),sortSu(t))) -> #te(msubst(te(a),sortSu(circ(sortSu(s),sortSu(t)))))
   #7: #te(msubst(te(msubst(te(a),sortSu(s))),sortSu(t))) -> #sortSu(circ(sortSu(s),sortSu(t)))
   #8: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(sop(lift()),sortSu(t))))) -> #sortSu(cons(sop(lift()),sortSu(circ(sortSu(s),sortSu(t)))))
   #9: #sortSu(circ(sortSu(cons(sop(lift()),sortSu(s))),sortSu(cons(sop(lift()),sortSu(t))))) -> #sortSu(circ(sortSu(s),sortSu(t)))
   #10: #sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> #sortSu(cons(te(msubst(te(a),sortSu(t))),sortSu(circ(sortSu(s),sortSu(t)))))
   #11: #sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> #te(msubst(te(a),sortSu(t)))
   #12: #sortSu(circ(sortSu(cons(te(a),sortSu(s))),sortSu(t))) -> #sortSu(circ(sortSu(s),sortSu(t)))
   #13: #sortSu(circ(sortSu(circ(sortSu(s),sortSu(t))),sortSu(u))) -> #sortSu(circ(sortSu(s),sortSu(circ(sortSu(t),sortSu(u)))))
   #14: #sortSu(circ(sortSu(circ(sortSu(s),sortSu(t))),sortSu(u))) -> #sortSu(circ(sortSu(t),sortSu(u)))
Number of SCCs: 1, DPs: 10
  SCC { #2 #3 #5..7 #9 #11..14 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      sortSu	w: max(x1 - 29, 0)
      sop	w: max(x1 - 34, 0)
      #te	w: max(x1 + 78, 0)
      #sortSu	w: max(x1 + 31, 0)
      lift	w: 1
      msubst	w: max(x1 + x2 + 12, 0)
      subst	w: max(x1 + x2 - 1, 0)
      te	w: max(x1 + 2, 0)
      cons	w: max(x1 + 83, x2 + 107, 0)
      id	w: 16
      circ	w: max(x1 + x2 + 43, 0)
    USABLE RULES: { 1..10 }
    Removed DPs: #2 #3 #5 #7 #9 #11 #12 #14
Number of SCCs: 2, DPs: 2
  SCC { #13 }
POLO(Sum)... POLO(max)... QLPOS... succeeded.
      sortSu	s: [1]	p: 0
      sop	s: []	p: 3
      #te	s: []	p: 0
      #sortSu	s: [1]	p: 0
      lift	s: []	p: 4
      msubst	s: []	p: 2
      subst	s: [1,2]	p: 0
      te	s: []	p: 3
      cons	s: []	p: 3
      id	s: []	p: 0
      circ	s: [1,2]	p: 1
    USABLE RULES: { 1..10 }
    Removed DPs: #13
Number of SCCs: 1, DPs: 1
  SCC { #6 }
POLO(Sum)... succeeded.
      sortSu	w: 1
      sop	w: 1
      #te	w: x1 + 3
      #sortSu	w: 0
      lift	w: 1
      msubst	w: x1
      subst	w: x1
      te	w: x1 + 1
      cons	w: 1
      id	w: 1
      circ	w: 2
    USABLE RULES: { 8..10 }
    Removed DPs: #6
Number of SCCs: 0, DPs: 0