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


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


YES
Input TRS:
    1: minus(x,0()) -> x
    2: minus(0(),y) -> 0()
    3: minus(s(x),s(y)) -> minus(p(s(x)),p(s(y)))
    4: minus(x,plus(y,z)) -> minus(minus(x,y),z)
    5: p(s(s(x))) -> s(p(s(x)))
    6: p(0()) -> s(s(0()))
    7: div(s(x),s(y)) -> s(div(minus(x,y),s(y)))
    8: div(plus(x,y),z) -> plus(div(x,z),div(y,z))
    9: plus(0(),y) -> y
    10: plus(s(x),y) -> s(plus(y,minus(s(x),s(0()))))
Number of strict rules: 10
Direct poly ... failed.
Freezing p
1: minus(x,0()) -> x
2: minus(0(),y) -> 0()
3: minus(s(x),s(y)) -> minus(p❆1_s(x),p❆1_s(y))
4: minus(x,plus(y,z)) -> minus(minus(x,y),z)
5: p❆1_s(s(x)) -> s(p❆1_s(x))
6: p❆1_0() -> s(s(0()))
7: div(s(x),s(y)) -> s(div(minus(x,y),s(y)))
8: div(plus(x,y),z) -> plus(div(x,z),div(y,z))
9: plus(0(),y) -> y
10: plus(s(x),y) -> s(plus(y,minus(s(x),s(0()))))
11: p(0()) ->= p❆1_0()
12: p(s(_1)) ->= p❆1_s(_1)
Number of strict rules: 10
Direct poly ... failed.
Dependency Pairs:
   #1: #p(0()) ->? #p❆1_0()
   #2: #p(s(_1)) ->? #p❆1_s(_1)
   #3: #div(s(x),s(y)) -> #div(minus(x,y),s(y))
   #4: #div(s(x),s(y)) -> #minus(x,y)
   #5: #plus(s(x),y) -> #plus(y,minus(s(x),s(0())))
   #6: #plus(s(x),y) -> #minus(s(x),s(0()))
   #7: #p❆1_s(s(x)) -> #p❆1_s(x)
   #8: #minus(s(x),s(y)) -> #minus(p❆1_s(x),p❆1_s(y))
   #9: #minus(s(x),s(y)) -> #p❆1_s(x)
   #10: #minus(s(x),s(y)) -> #p❆1_s(y)
   #11: #div(plus(x,y),z) -> #plus(div(x,z),div(y,z))
   #12: #div(plus(x,y),z) -> #div(x,z)
   #13: #div(plus(x,y),z) -> #div(y,z)
   #14: #minus(x,plus(y,z)) -> #minus(minus(x,y),z)
   #15: #minus(x,plus(y,z)) -> #minus(x,y)
Number of SCCs: 5, DPs: 8
	SCC { #7 }
Sum... succeeded.
  #div(x1,x2)		w: (0)
  s(x1)		w: (1 + x1)
  minus(x1,x2)		w: (0)
  p❆1_s(x1)		w: (0)
  #p❆1_0()		w: (0)
  #plus(x1,x2)		w: (0)
  div(x1,x2)		w: (0)
  #p(x1)		w: (0)
  #p❆1_s(x1)		w: (x1)
  p(x1)		w: (0)
  0()		w: (0)
  p❆1_0()		w: (0)
  #minus(x1,x2)		w: (0)
  plus(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 4, DPs: 7
	SCC { #8 }
Sum... succeeded.
  #div(x1,x2)		w: (0)
  s(x1)		w: (2 + x1)
  minus(x1,x2)		w: (0)
  p❆1_s(x1)		w: (1 + x1)
  #p❆1_0()		w: (0)
  #plus(x1,x2)		w: (0)
  div(x1,x2)		w: (0)
  #p(x1)		w: (0)
  #p❆1_s(x1)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  p❆1_0()		w: (0)
  #minus(x1,x2)		w: (7719 + x2 + x1)
  plus(x1,x2)		w: (0)
    USABLE RULES: { 5 }
    Removed DPs: #8
Number of SCCs: 3, DPs: 6
	SCC { #5 }
Sum... succeeded.
  #div(x1,x2)		w: (0)
  s(x1)		w: (11799 + x1)
  minus(x1,x2)		w: (11798)
  p❆1_s(x1)		w: (1 + x1)
  #p❆1_0()		w: (0)
  #plus(x1,x2)		w: (x2 + x1)
  div(x1,x2)		w: (0)
  #p(x1)		w: (0)
  #p❆1_s(x1)		w: (0)
  p(x1)		w: (0)
  0()		w: (1)
  p❆1_0()		w: (0)
  #minus(x1,x2)		w: (7719 + x2 + x1)
  plus(x1,x2)		w: (0)
    USABLE RULES: { 3 5 }
    Removed DPs: #5
Number of SCCs: 2, DPs: 5
	SCC { #14 #15 }
Sum... succeeded.
  #div(x1,x2)		w: (0)
  s(x1)		w: (1 + x1)
  minus(x1,x2)		w: (x1)
  p❆1_s(x1)		w: (x1)
  #p❆1_0()		w: (0)
  #plus(x1,x2)		w: (x2)
  div(x1,x2)		w: (0)
  #p(x1)		w: (0)
  #p❆1_s(x1)		w: (0)
  p(x1)		w: (0)
  0()		w: (32286)
  p❆1_0()		w: (0)
  #minus(x1,x2)		w: (8365 + x2 + x1)
  plus(x1,x2)		w: (1 + x2 + x1)
    USABLE RULES: { 1..5 }
    Removed DPs: #14 #15
Number of SCCs: 1, DPs: 3
	SCC { #3 #12 #13 }
Sum... succeeded.
  #div(x1,x2)		w: (10450 + x2 + x1)
  s(x1)		w: (1 + x1)
  minus(x1,x2)		w: (x1)
  p❆1_s(x1)		w: (x1)
  #p❆1_0()		w: (0)
  #plus(x1,x2)		w: (x2)
  div(x1,x2)		w: (0)
  #p(x1)		w: (0)
  #p❆1_s(x1)		w: (0)
  p(x1)		w: (0)
  0()		w: (32286)
  p❆1_0()		w: (0)
  #minus(x1,x2)		w: (8365 + x2 + x1)
  plus(x1,x2)		w: (1 + x2 + x1)
    USABLE RULES: { 1..5 }
    Removed DPs: #3 #12 #13
Number of SCCs: 0, DPs: 0