/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: __(__(X,Y),Z) -> __(X,__(Y,Z)) 2: __(X,nil()) -> X 3: __(nil(),X) -> X 4: and(tt(),X) -> activate(X) 5: isList(V) -> isNeList(activate(V)) 6: isList(n__nil()) -> tt() 7: isList(n____(V1,V2)) -> and(isList(activate(V1)),n__isList(activate(V2))) 8: isNeList(V) -> isQid(activate(V)) 9: isNeList(n____(V1,V2)) -> and(isList(activate(V1)),n__isNeList(activate(V2))) 10: isNeList(n____(V1,V2)) -> and(isNeList(activate(V1)),n__isList(activate(V2))) 11: isNePal(V) -> isQid(activate(V)) 12: isNePal(n____(I,__(P,I))) -> and(isQid(activate(I)),n__isPal(activate(P))) 13: isPal(V) -> isNePal(activate(V)) 14: isPal(n__nil()) -> tt() 15: isQid(n__a()) -> tt() 16: isQid(n__e()) -> tt() 17: isQid(n__i()) -> tt() 18: isQid(n__o()) -> tt() 19: isQid(n__u()) -> tt() 20: nil() -> n__nil() 21: __(X1,X2) -> n____(X1,X2) 22: isList(X) -> n__isList(X) 23: isNeList(X) -> n__isNeList(X) 24: isPal(X) -> n__isPal(X) 25: a() -> n__a() 26: e() -> n__e() 27: i() -> n__i() 28: o() -> n__o() 29: u() -> n__u() 30: activate(n__nil()) -> nil() 31: activate(n____(X1,X2)) -> __(X1,X2) 32: activate(n__isList(X)) -> isList(X) 33: activate(n__isNeList(X)) -> isNeList(X) 34: activate(n__isPal(X)) -> isPal(X) 35: activate(n__a()) -> a() 36: activate(n__e()) -> e() 37: activate(n__i()) -> i() 38: activate(n__o()) -> o() 39: activate(n__u()) -> u() 40: activate(X) -> X Number of strict rules: 40 Direct POLO(bPol) ... removes: 18 4 15 8 1 3 16 21 36 26 19 32 17 27 34 22 28 5 33 10 39 7 20 25 30 14 31 12 23 24 11 9 13 40 6 38 37 35 29 2 a w: 4 n__a w: 3 n__o w: 3 isNeList w: x1 + 3 isPal w: x1 + 6 u w: 4 activate w: x1 + 2 and w: x1 + x2 + 1 n__isNeList w: x1 + 2 n__i w: 3 n__isList w: x1 + 5 isNePal w: x1 + 3 n__isPal w: x1 + 5 n__nil w: 1 isQid w: x1 n____ w: 2 * x1 + x2 + 11 n__e w: 3 o w: 4 isList w: x1 + 6 nil w: 2 n__u w: 3 i w: 4 e w: 4 tt w: 2 __ w: 2 * x1 + x2 + 12 Number of strict rules: 0