/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem: f(n__a(),X,X) -> f(activate(X),b(),n__b()) b() -> a() a() -> n__a() b() -> n__b() activate(n__a()) -> a() activate(n__b()) -> b() activate(X) -> X Proof: Matrix Interpretation Processor: dim=3 interpretation: [0] [a] = [1] [0], [0] [n__b] = [0] [0], [0] [b] = [1] [0], [1 1 0] [0] [activate](x0) = [0 1 0]x0 + [1] [1 0 1] [0], [1 0 1] [1 0 1] [1 1 0] [0] [f](x0, x1, x2) = [0 0 0]x0 + [0 0 0]x1 + [1 0 1]x2 + [0] [1 0 0] [1 0 0] [1 1 0] [1], [0] [n__a] = [1] [0] orientation: [2 1 1] [0] [2 1 1] [0] f(n__a(),X,X) = [1 0 1]X + [0] >= [0 0 0]X + [0] = f(activate(X),b(),n__b()) [2 1 0] [1] [1 1 0] [1] [0] [0] b() = [1] >= [1] = a() [0] [0] [0] [0] a() = [1] >= [1] = n__a() [0] [0] [0] [0] b() = [1] >= [0] = n__b() [0] [0] [1] [0] activate(n__a()) = [2] >= [1] = a() [0] [0] [0] [0] activate(n__b()) = [1] >= [1] = b() [0] [0] [1 1 0] [0] activate(X) = [0 1 0]X + [1] >= X = X [1 0 1] [0] problem: f(n__a(),X,X) -> f(activate(X),b(),n__b()) b() -> a() a() -> n__a() b() -> n__b() activate(n__b()) -> b() activate(X) -> X Unfolding Processor: loop length: 5 terms: f(n__a(),n__b(),n__b()) f(activate(n__b()),b(),n__b()) f(b(),b(),n__b()) f(a(),b(),n__b()) f(n__a(),b(),n__b()) context: [] substitution: Qed