@article{ajmo2014215,
author={{Maurya, Vishwa Nath and Maurya, Avadhesh Kumar},
title={Polynomial Simulation and Refutation of Complex Formulas of Resolution over Linear Equations in Propositional Proof System},
journal={American Journal of Modeling and Optimization},
volume={2},
number={1},
pages={34--38},
year={2014},
url={http://pubs.sciepub.com/ajmo/2/1/5},
abstract={In this paper, we present that the propositional proof system R(lin) (Resolution over Linear Equations) established by Ran Raz and Iddo Tzameret is not a super system, there exists a sequence of tautologies, which require proof complexity exponential in size of tautologies. We show that there are the sequence of unsatisfiable collections of disjuncts of linear equations, which require exponential lower bounds in R(lin) and have polynomially bounded refutations by incorporating renaming inference rule to R(lin) system. Some additional properties of R(lin) have been described that many of the ¡°hard¡± provable in R outstanding examples of propositional tautologies (contradictions) have polynomially bounded proofs in R(lin).},
doi={10.12691/ajmo-2-1-5}
publisher={Science and Education Publishing}
}