/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) 2: active(__(X,nil())) -> mark(X) 3: active(__(nil(),X)) -> mark(X) 4: active(U11(tt())) -> mark(U12(tt())) 5: active(U12(tt())) -> mark(tt()) 6: active(isNePal(__(I,__(P,I)))) -> mark(U11(tt())) 7: active(__(X1,X2)) -> __(active(X1),X2) 8: active(__(X1,X2)) -> __(X1,active(X2)) 9: active(U11(X)) -> U11(active(X)) 10: active(U12(X)) -> U12(active(X)) 11: active(isNePal(X)) -> isNePal(active(X)) 12: __(mark(X1),X2) -> mark(__(X1,X2)) 13: __(X1,mark(X2)) -> mark(__(X1,X2)) 14: U11(mark(X)) -> mark(U11(X)) 15: U12(mark(X)) -> mark(U12(X)) 16: isNePal(mark(X)) -> mark(isNePal(X)) 17: proper(__(X1,X2)) -> __(proper(X1),proper(X2)) 18: proper(nil()) -> ok(nil()) 19: proper(U11(X)) -> U11(proper(X)) 20: proper(tt()) -> ok(tt()) 21: proper(U12(X)) -> U12(proper(X)) 22: proper(isNePal(X)) -> isNePal(proper(X)) 23: __(ok(X1),ok(X2)) -> ok(__(X1,X2)) 24: U11(ok(X)) -> ok(U11(X)) 25: U12(ok(X)) -> ok(U12(X)) 26: isNePal(ok(X)) -> ok(isNePal(X)) 27: top(mark(X)) -> top(proper(X)) 28: top(ok(X)) -> top(active(X)) Number of strict rules: 28 Direct POLO(bPol) ... removes: 4 3 5 6 2 U11 w: x1 + 2 top w: x1 isNePal w: x1 + 2 U12 w: x1 + 1 proper w: x1 ok w: x1 nil w: 3 mark w: x1 active w: x1 tt w: 1 __ w: x1 + x2 + 6 Number of strict rules: 23 Direct POLO(bPol) ... removes: 1 16 27 14 12 U11 w: 2 * x1 + 1 top w: x1 isNePal w: 2 * x1 + 1 U12 w: x1 + 1 proper w: x1 ok w: x1 nil w: 1 mark w: x1 + 1 active w: x1 tt w: 1 __ w: 2 * x1 + x2 + 2 Number of strict rules: 18 Direct POLO(bPol) ... removes: 18 17 20 U11 w: 2 * x1 top w: x1 isNePal w: 2 * x1 U12 w: x1 proper w: 2 * x1 ok w: x1 nil w: 1 mark w: x1 + 1 active w: x1 tt w: 1 __ w: 2 * x1 + x2 + 1 Number of strict rules: 15 Direct POLO(bPol) ... removes: 15 19 U11 w: x1 + 3 top w: x1 isNePal w: x1 U12 w: 2 * x1 proper w: 2 * x1 ok w: x1 nil w: 1 mark w: x1 + 2 active w: x1 tt w: 1 __ w: x1 + x2 + 3 Number of strict rules: 13 Direct POLO(bPol) ... removes: 28 23 U11 w: x1 + 3 top w: 2 * x1 isNePal w: x1 + 1 U12 w: x1 + 1 proper w: x1 + 5 ok w: x1 + 6 nil w: 1 mark w: x1 + 4 active w: x1 + 1 tt w: 1 __ w: x1 + x2 + 1 Number of strict rules: 11 Direct POLO(bPol) ... removes: 8 7 13 U11 w: x1 top w: x1 isNePal w: x1 U12 w: x1 proper w: x1 + 21 ok w: 2 * x1 + 1 nil w: 21 mark w: x1 + 20 active w: 2 * x1 + 2 tt w: 1 __ w: x1 + 2 * x2 + 3 Number of strict rules: 8 Direct POLO(bPol) ... removes: 21 U11 w: x1 top w: x1 isNePal w: x1 U12 w: x1 + 2 proper w: 2 * x1 + 2 ok w: x1 + 3 nil w: 0 mark w: 2 * x1 + 1 active w: x1 + 4 tt w: 10 __ w: x1 + 2 * x2 Number of strict rules: 7 Direct POLO(bPol) ... removes: 22 U11 w: x1 + 1 top w: x1 isNePal w: x1 + 1 U12 w: x1 + 4 proper w: 2 * x1 + 2 ok w: x1 + 3 nil w: 0 mark w: 2 * x1 + 1 active w: x1 + 4 tt w: 4 __ w: x1 + x2 Number of strict rules: 6 Direct POLO(bPol) ... removes: 24 9 U11 w: 2 * x1 + 3 top w: x1 isNePal w: x1 U12 w: x1 proper w: x1 + 10 ok w: x1 + 1 nil w: 1 mark w: 2 * x1 + 2 active w: 2 * x1 + 2 tt w: 2 __ w: 2 * x1 + 2 * x2 + 2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 26 11 U11 w: 2 * x1 + 2 top w: x1 isNePal w: 2 * x1 + 3 U12 w: x1 proper w: 2 * x1 + 4 ok w: x1 + 1 nil w: 1 mark w: 2 * x1 + 1 active w: 2 * x1 + 2 tt w: 3 __ w: x1 + x2 + 1 Number of strict rules: 2 Direct POLO(bPol) ... removes: 25 U11 w: x1 + 1 top w: x1 isNePal w: x1 + 1 U12 w: 2 * x1 + 1 proper w: 2 * x1 + 5 ok w: x1 + 7 nil w: 1 mark w: x1 + 4 active w: x1 tt w: 1 __ w: x1 + 2 * x2 + 1 Number of strict rules: 1 Direct POLO(bPol) ... removes: 10 U11 w: 2 * x1 + 8 top w: x1 isNePal w: x1 U12 w: x1 + 7 proper w: x1 + 1 ok w: 2 * x1 + 1 nil w: 1 mark w: 2 * x1 + 7 active w: 2 * x1 + 2 tt w: 1 __ w: x1 + x2 + 1 Number of strict rules: 0