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


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


MAYBE
Input TRS:
    1: and(tt(),tt()) -> tt()
    2: is_nat(0()) -> tt()
    3: is_nat(s(x)) -> is_nat(x)
    4: is_natlist(nil()) -> tt()
    5: is_natlist(cons(x,xs)) -> and(is_nat(x),is_natlist(xs))
    6: from(x) -> fromCond(is_natlist(x),x)
    7: fromCond(tt(),cons(x,xs)) -> from(cons(s(x),cons(x,xs)))
Number of strict rules: 7
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #from(x) -> #fromCond(is_natlist(x),x)
   #2: #from(x) -> #is_natlist(x)
   #3: #fromCond(tt(),cons(x,xs)) -> #from(cons(s(x),cons(x,xs)))
   #4: #is_natlist(cons(x,xs)) -> #and(is_nat(x),is_natlist(xs))
   #5: #is_natlist(cons(x,xs)) -> #is_nat(x)
   #6: #is_natlist(cons(x,xs)) -> #is_natlist(xs)
   #7: #is_nat(s(x)) -> #is_nat(x)
Number of SCCs: 3, DPs: 4
	SCC { #7 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  is_nat(x1)		w: (0)
  and(x1,x2)		w: (0)
  #is_natlist(x1)		w: (0)
  fromCond(x1,x2)		w: (0)
  0()		w: (0)
  from(x1)		w: (0)
  nil()		w: (0)
  #is_nat(x1)		w: (x1)
  #from(x1)		w: (0)
  #fromCond(x1,x2)		w: (0)
  cons(x1,x2)		w: (0)
  tt()		w: (0)
  is_natlist(x1)		w: (0)
  #and(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 2, DPs: 3
	SCC { #6 }
Sum... succeeded.
  s(x1)		w: (1)
  is_nat(x1)		w: (0)
  and(x1,x2)		w: (0)
  #is_natlist(x1)		w: (x1)
  fromCond(x1,x2)		w: (0)
  0()		w: (0)
  from(x1)		w: (0)
  nil()		w: (0)
  #is_nat(x1)		w: (0)
  #from(x1)		w: (0)
  #fromCond(x1,x2)		w: (0)
  cons(x1,x2)		w: (1 + x2)
  tt()		w: (0)
  is_natlist(x1)		w: (0)
  #and(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 1, DPs: 2
	SCC { #1 #3 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.