def testClausification(self):
"""
Test conversion of wrapped formulas into lists of clauses.
"""
lex = Lexer(self.testformulas)
while not lex.TestTok(Token.EOFToken):
wf = parseWFormula(lex)
clauses = wFormulaClausify(wf)
enableDerivationOutput()
print("==================")
for c in clauses:
print(c)
toggleDerivationOutput()
def testCNFization(self):
"""
Test conversion of wrapped formulas into conjunctive normal
form.
"""
lex = Lexer(self.testformulas)
while not lex.TestTok(Token.EOFToken):
wf = parseWFormula(lex)
wf = wFormulaCNF(wf)
enableDerivationOutput()
self.assertTrue(wf.formula.isCNF())
deriv = wf.orderedDerivation()
print("==================")
for s in deriv:
print(s)
toggleDerivationOutput()
"backward-subsumption"
"given-clause-heuristic=", "neg-lit-selection="
])
except getopt.GetoptError as err:
print(sys.argv[0], ":", err)
sys.exit(1)
params = processOptions(opts)
problem = ClauseSet()
for file in args:
fp = open(file, "r")
input = fp.read()
fp.close()
lex = Lexer(input)
problem.parse(lex)
state = ProofState(params, problem)
res = state.saturate()
print(state.statisticsStr())
if res != None:
print("# SZS status Unsatisfiable")
proof = res.orderedDerivation()
enableDerivationOutput()
for s in proof:
print(s)
disableDerivationOutput()
else:
print("# SZS status Satisfiable")
