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


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


YES
Input TRS:
    1: del(.(x,.(y,z))) -> f(=(x,y),x,y,z)
    2: f(true(),x,y,z) -> del(.(y,z))
    3: f(false(),x,y,z) -> .(x,del(.(y,z)))
    4: =(nil(),nil()) -> true()
    5: =(.(x,y),nil()) -> false()
    6: =(nil(),.(y,z)) -> false()
    7: =(.(x,y),.(u(),v())) -> and(=(x,u()),=(y,v()))
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying del
1: del^1_.(x,.(y,z)) -> f(=(x,y),x,y,z)
2: f(true(),x,y,z) -> del^1_.(y,z)
3: f(false(),x,y,z) -> .(x,del^1_.(y,z))
4: =(nil(),nil()) -> true()
5: =(.(x,y),nil()) -> false()
6: =(nil(),.(y,z)) -> false()
7: =(.(x,y),.(u(),v())) -> and(=(x,u()),=(y,v()))
8: del(.(_1,_2)) ->= del^1_.(_1,_2)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #f(true(),x,y,z) -> #del^1_.(y,z)
   #2: #=(.(x,y),.(u(),v())) -> #=(x,u())
   #3: #=(.(x,y),.(u(),v())) -> #=(y,v())
   #4: #f(false(),x,y,z) -> #del^1_.(y,z)
   #5: #del^1_.(x,.(y,z)) -> #f(=(x,y),x,y,z)
   #6: #del^1_.(x,.(y,z)) -> #=(x,y)
   #7: #del(.(_1,_2)) ->? #del^1_.(_1,_2)
Number of SCCs: 1, DPs: 3
  SCC { #1 #4 #5 }
POLO(Sum)... succeeded.
      #del	w: 0
      #del^1_.	w: x2
      v 	w: 1
      u 	w: 1
      and	w: x2
      false	w: 4
      true	w: 3
      f 	w: 0
      del	w: 0
      = 	w: x1 + 1
      nil	w: 1
      #f 	w: x4 + 1
      . 	w: x2 + 2
      del^1_.	w: 0
      #= 	w: 0
    USABLE RULES: { }
    Removed DPs: #1 #4 #5
Number of SCCs: 0, DPs: 0