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


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


YES
Input TRS:
    1: f(x,y,z) -> g(<=(x,y),x,y,z)
    2: g(true(),x,y,z) -> z
    3: g(false(),x,y,z) -> f(f(p(x),y,z),f(p(y),z,x),f(p(z),x,y))
    4: p(0()) -> 0()
    5: p(s(x)) -> x
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying g
1: f(x,y,z) -> g^1_<=(x,y,x,y,z)
2: g^1_true(x,y,z) -> z
3: g^1_false(x,y,z) -> f(f(p(x),y,z),f(p(y),z,x),f(p(z),x,y))
4: p(0()) -> 0()
5: p(s(x)) -> x
6: g(false(),_3,_4,_5) ->= g^1_false(_3,_4,_5)
7: g(<=(_1,_2),_5,_6,_7) ->= g^1_<=(_1,_2,_5,_6,_7)
8: g(true(),_3,_4,_5) ->= g^1_true(_3,_4,_5)
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #g(false(),_3,_4,_5) ->? #g^1_false(_3,_4,_5)
   #2: #g^1_false(x,y,z) -> #f(f(p(x),y,z),f(p(y),z,x),f(p(z),x,y))
   #3: #g^1_false(x,y,z) -> #f(p(x),y,z)
   #4: #g^1_false(x,y,z) -> #p(x)
   #5: #g^1_false(x,y,z) -> #f(p(y),z,x)
   #6: #g^1_false(x,y,z) -> #p(y)
   #7: #g^1_false(x,y,z) -> #f(p(z),x,y)
   #8: #g^1_false(x,y,z) -> #p(z)
   #9: #g(true(),_3,_4,_5) ->? #g^1_true(_3,_4,_5)
Number of SCCs: 0, DPs: 0