%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL551+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 11:21:10 AM UTC 2026
% Result : Theorem 1.17s 1.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL551+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.33 % Computer : n011.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Fri Sep 4 17:28:58 UTC 2026
% 0.07/0.33 % CPUTime :
% 0.11/0.45 start to proof:theBenchmark.p
% 1.17/1.31 % Version : CSI_E---1.1
% 1.17/1.31 % Problem : theBenchmark.p
% 1.17/1.31 % Proof found!
% 1.17/1.31 % SZS status Theorem for theBenchmark.p
% 1.17/1.31 % SZS output start Proof
% 1.17/1.31 fof(adjunction, axiom, (adjunction<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(X2))=>is_a_theorem(and(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', adjunction)).
% 1.17/1.31 fof(op_strict_equiv, axiom, (op_strict_equiv=>![X1, X2]:strict_equiv(X1,X2)=and(strict_implies(X1,X2),strict_implies(X2,X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax', op_strict_equiv)).
% 1.17/1.31 fof(substitution_strict_equiv, axiom, (substitution_strict_equiv<=>![X1, X2]:(is_a_theorem(strict_equiv(X1,X2))=>X1=X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', substitution_strict_equiv)).
% 1.17/1.31 fof(s1_0_adjunction, axiom, adjunction, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_adjunction)).
% 1.17/1.31 fof(s1_0_op_strict_equiv, axiom, op_strict_equiv, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_op_strict_equiv)).
% 1.17/1.31 fof(modus_ponens_strict_implies, axiom, (modus_ponens_strict_implies<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(strict_implies(X1,X2)))=>is_a_theorem(X2))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', modus_ponens_strict_implies)).
% 1.17/1.31 fof(axiom_m5, axiom, (axiom_m5<=>![X1, X2, X3]:is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', axiom_m5)).
% 1.17/1.31 fof(s1_0_substitution_strict_equiv, axiom, substitution_strict_equiv, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_substitution_strict_equiv)).
% 1.17/1.31 fof(axiom_m1, axiom, (axiom_m1<=>![X1, X2]:is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', axiom_m1)).
% 1.17/1.31 fof(s1_0_modus_ponens_strict_implies, axiom, modus_ponens_strict_implies, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_modus_ponens_strict_implies)).
% 1.17/1.31 fof(s1_0_axiom_m5, axiom, axiom_m5, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m5)).
% 1.17/1.31 fof(axiom_m2, axiom, (axiom_m2<=>![X1, X2]:is_a_theorem(strict_implies(and(X1,X2),X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', axiom_m2)).
% 1.17/1.31 fof(s1_0_axiom_m1, axiom, axiom_m1, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m1)).
% 1.17/1.31 fof(s1_0_axiom_m2, axiom, axiom_m2, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m2)).
% 1.17/1.31 fof(op_implies_and, axiom, (op_implies_and=>![X1, X2]:implies(X1,X2)=not(and(X1,not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_implies_and)).
% 1.17/1.31 fof(axiom_m3, axiom, (axiom_m3<=>![X1, X2, X3]:is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', axiom_m3)).
% 1.17/1.31 fof(op_strict_implies, axiom, (op_strict_implies=>![X1, X2]:strict_implies(X1,X2)=necessarily(implies(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax', op_strict_implies)).
% 1.17/1.31 fof(op_or, axiom, (op_or=>![X1, X2]:or(X1,X2)=not(and(not(X1),not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_or)).
% 1.17/1.31 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox/benchmark/theBenchmark.p', hilbert_op_implies_and)).
% 1.17/1.31 fof(s1_0_axiom_m3, axiom, axiom_m3, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m3)).
% 1.17/1.31 fof(s1_0_op_strict_implies, axiom, op_strict_implies, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_op_strict_implies)).
% 1.17/1.31 fof(s1_0_op_or, axiom, op_or, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_op_or)).
% 1.17/1.31 fof(axiom_m4, axiom, (axiom_m4<=>![X1]:is_a_theorem(strict_implies(X1,and(X1,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax', axiom_m4)).
% 1.17/1.31 fof(s1_0_axiom_m4, axiom, axiom_m4, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m4)).
% 1.17/1.31 fof(substitution_of_equivalents, axiom, (substitution_of_equivalents<=>![X1, X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', substitution_of_equivalents)).
% 1.17/1.31 fof(op_equiv, axiom, (op_equiv=>![X1, X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_equiv)).
% 1.17/1.31 fof(use_substitution_of_equivalents, axiom, substitution_of_equivalents, file('/export/starexec/sandbox/benchmark/theBenchmark.p', use_substitution_of_equivalents)).
% 1.17/1.31 fof(s1_0_op_equiv, axiom, op_equiv, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_op_equiv)).
% 1.17/1.31 fof(modus_tollens, axiom, (modus_tollens<=>![X1, X2]:is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', modus_tollens)).
% 1.17/1.31 fof(hilbert_modus_tollens, conjecture, modus_tollens, file('/export/starexec/sandbox/benchmark/theBenchmark.p', hilbert_modus_tollens)).
% 1.17/1.31 fof(op_possibly, axiom, (op_possibly=>![X1]:possibly(X1)=not(necessarily(not(X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax', op_possibly)).
% 1.17/1.31 fof(s1_0_op_possibly, axiom, op_possibly, file('/export/starexec/sandbox/benchmark/Axioms/LCL007+4.ax', s1_0_op_possibly)).
% 1.17/1.31 fof(c_0_32, plain, ![X243, X244]:((~adjunction|(~is_a_theorem(X243)|~is_a_theorem(X244)|is_a_theorem(and(X243,X244))))&(((is_a_theorem(esk59_0)|adjunction)&(is_a_theorem(esk60_0)|adjunction))&(~is_a_theorem(and(esk59_0,esk60_0))|adjunction))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[adjunction])])])])])).
% 1.17/1.31 fof(c_0_33, plain, ![X319, X320]:(~op_strict_equiv|strict_equiv(X319,X320)=and(strict_implies(X319,X320),strict_implies(X320,X319))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_equiv])])])).
% 1.17/1.31 fof(c_0_34, plain, ![X247, X248]:((~substitution_strict_equiv|(~is_a_theorem(strict_equiv(X247,X248))|X247=X248))&((is_a_theorem(strict_equiv(esk61_0,esk62_0))|substitution_strict_equiv)&(esk61_0!=esk62_0|substitution_strict_equiv))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_strict_equiv])])])])])).
% 1.17/1.31 cnf(c_0_35, plain, (is_a_theorem(and(X1,X2))|~adjunction|~is_a_theorem(X1)|~is_a_theorem(X2)), inference(split_conjunct,[status(thm)],[c_0_32])).
% 1.17/1.31 cnf(c_0_36, plain, (adjunction), inference(split_conjunct,[status(thm)],[s1_0_adjunction])).
% 1.17/1.31 cnf(c_0_37, plain, (strict_equiv(X1,X2)=and(strict_implies(X1,X2),strict_implies(X2,X1))|~op_strict_equiv), inference(split_conjunct,[status(thm)],[c_0_33])).
% 1.17/1.31 cnf(c_0_38, plain, (op_strict_equiv), inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv])).
% 1.17/1.31 fof(c_0_39, plain, ![X239, X240]:((~modus_ponens_strict_implies|(~is_a_theorem(X239)|~is_a_theorem(strict_implies(X239,X240))|is_a_theorem(X240)))&(((is_a_theorem(esk57_0)|modus_ponens_strict_implies)&(is_a_theorem(strict_implies(esk57_0,esk58_0))|modus_ponens_strict_implies))&(~is_a_theorem(esk58_0)|modus_ponens_strict_implies))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens_strict_implies])])])])])).
% 1.17/1.31 fof(c_0_40, plain, ![X295, X296, X297]:((~axiom_m5|is_a_theorem(strict_implies(and(strict_implies(X295,X296),strict_implies(X296,X297)),strict_implies(X295,X297))))&(~is_a_theorem(strict_implies(and(strict_implies(esk85_0,esk86_0),strict_implies(esk86_0,esk87_0)),strict_implies(esk85_0,esk87_0)))|axiom_m5)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m5])])])])).
% 1.17/1.31 cnf(c_0_41, plain, (X1=X2|~substitution_strict_equiv|~is_a_theorem(strict_equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_34])).
% 1.17/1.31 cnf(c_0_42, plain, (substitution_strict_equiv), inference(split_conjunct,[status(thm)],[s1_0_substitution_strict_equiv])).
% 1.17/1.31 cnf(c_0_43, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_36])])).
% 1.17/1.31 cnf(c_0_44, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_38])])).
% 1.17/1.31 fof(c_0_45, plain, ![X279, X280]:((~axiom_m1|is_a_theorem(strict_implies(and(X279,X280),and(X280,X279))))&(~is_a_theorem(strict_implies(and(esk77_0,esk78_0),and(esk78_0,esk77_0)))|axiom_m1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m1])])])])).
% 1.17/1.31 cnf(c_0_46, plain, (is_a_theorem(X2)|~modus_ponens_strict_implies|~is_a_theorem(X1)|~is_a_theorem(strict_implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_39])).
% 1.17/1.31 cnf(c_0_47, plain, (modus_ponens_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_modus_ponens_strict_implies])).
% 1.17/1.31 cnf(c_0_48, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_m5), inference(split_conjunct,[status(thm)],[c_0_40])).
% 1.17/1.31 cnf(c_0_49, plain, (axiom_m5), inference(split_conjunct,[status(thm)],[s1_0_axiom_m5])).
% 1.17/1.31 fof(c_0_50, plain, ![X283, X284]:((~axiom_m2|is_a_theorem(strict_implies(and(X283,X284),X283)))&(~is_a_theorem(strict_implies(and(esk79_0,esk80_0),esk79_0))|axiom_m2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m2])])])])).
% 1.17/1.31 cnf(c_0_51, plain, (X1=X2|~is_a_theorem(strict_equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_42])])).
% 1.17/1.31 cnf(c_0_52, plain, (is_a_theorem(strict_equiv(X1,X2))|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_43, c_0_44])).
% 1.17/1.31 cnf(c_0_53, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|~axiom_m1), inference(split_conjunct,[status(thm)],[c_0_45])).
% 1.17/1.31 cnf(c_0_54, plain, (axiom_m1), inference(split_conjunct,[status(thm)],[s1_0_axiom_m1])).
% 1.17/1.31 cnf(c_0_55, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46, c_0_47])])).
% 1.17/1.31 cnf(c_0_56, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48, c_0_49])])).
% 1.17/1.31 cnf(c_0_57, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))|~axiom_m2), inference(split_conjunct,[status(thm)],[c_0_50])).
% 1.17/1.31 cnf(c_0_58, plain, (axiom_m2), inference(split_conjunct,[status(thm)],[s1_0_axiom_m2])).
% 1.17/1.31 cnf(c_0_59, plain, (X1=X2|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_51, c_0_52])).
% 1.17/1.31 cnf(c_0_60, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53, c_0_54])])).
% 1.17/1.31 fof(c_0_61, plain, ![X231, X232]:(~op_implies_and|implies(X231,X232)=not(and(X231,not(X232)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])).
% 1.17/1.31 cnf(c_0_62, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(and(strict_implies(X1,X3),strict_implies(X3,X2)))), inference(spm,[status(thm)],[c_0_55, c_0_56])).
% 1.17/1.31 cnf(c_0_63, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57, c_0_58])])).
% 1.17/1.31 cnf(c_0_64, plain, (and(X1,X2)=and(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_60]), c_0_60])])).
% 1.17/1.31 fof(c_0_65, plain, ![X287, X288, X289]:((~axiom_m3|is_a_theorem(strict_implies(and(and(X287,X288),X289),and(X287,and(X288,X289)))))&(~is_a_theorem(strict_implies(and(and(esk81_0,esk82_0),esk83_0),and(esk81_0,and(esk82_0,esk83_0))))|axiom_m3)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m3])])])])).
% 1.17/1.31 fof(c_0_66, plain, ![X317, X318]:(~op_strict_implies|strict_implies(X317,X318)=necessarily(implies(X317,X318))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])])).
% 1.17/1.31 fof(c_0_67, plain, ![X227, X228]:(~op_or|or(X227,X228)=not(and(not(X227),not(X228)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])).
% 1.17/1.31 cnf(c_0_68, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_61])).
% 1.17/1.31 cnf(c_0_69, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])).
% 1.17/1.31 cnf(c_0_70, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X3,X2))|~is_a_theorem(strict_implies(X1,X3))), inference(spm,[status(thm)],[c_0_62, c_0_43])).
% 1.17/1.31 cnf(c_0_71, plain, (is_a_theorem(strict_implies(and(X1,X2),X2))), inference(spm,[status(thm)],[c_0_63, c_0_64])).
% 1.17/1.31 cnf(c_0_72, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))|~axiom_m3), inference(split_conjunct,[status(thm)],[c_0_65])).
% 1.17/1.31 cnf(c_0_73, plain, (axiom_m3), inference(split_conjunct,[status(thm)],[s1_0_axiom_m3])).
% 1.17/1.31 cnf(c_0_74, plain, (strict_implies(X1,X2)=necessarily(implies(X1,X2))|~op_strict_implies), inference(split_conjunct,[status(thm)],[c_0_66])).
% 1.17/1.31 cnf(c_0_75, plain, (op_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies])).
% 1.17/1.31 cnf(c_0_76, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_67])).
% 1.17/1.31 cnf(c_0_77, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68, c_0_69])])).
% 1.17/1.31 cnf(c_0_78, plain, (op_or), inference(split_conjunct,[status(thm)],[s1_0_op_or])).
% 1.17/1.31 fof(c_0_79, plain, ![X293]:((~axiom_m4|is_a_theorem(strict_implies(X293,and(X293,X293))))&(~is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))|axiom_m4)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])])).
% 1.17/1.31 cnf(c_0_80, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,and(X3,X2)))), inference(spm,[status(thm)],[c_0_70, c_0_71])).
% 1.17/1.31 cnf(c_0_81, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72, c_0_73])])).
% 1.17/1.31 cnf(c_0_82, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74, c_0_75])])).
% 1.17/1.31 cnf(c_0_83, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76, c_0_77]), c_0_78])])).
% 1.17/1.31 cnf(c_0_84, plain, (not(and(not(X1),X2))=implies(X2,X1)), inference(spm,[status(thm)],[c_0_77, c_0_64])).
% 1.17/1.31 cnf(c_0_85, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))|~axiom_m4), inference(split_conjunct,[status(thm)],[c_0_79])).
% 1.17/1.31 cnf(c_0_86, plain, (axiom_m4), inference(split_conjunct,[status(thm)],[s1_0_axiom_m4])).
% 1.17/1.31 cnf(c_0_87, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X2,X3)))), inference(spm,[status(thm)],[c_0_80, c_0_81])).
% 1.17/1.31 cnf(c_0_88, plain, (necessarily(or(X1,X2))=strict_implies(not(X1),X2)), inference(spm,[status(thm)],[c_0_82, c_0_83])).
% 1.17/1.31 cnf(c_0_89, plain, (or(X1,X2)=or(X2,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77, c_0_84]), c_0_83]), c_0_83])).
% 1.17/1.31 cnf(c_0_90, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85, c_0_86])])).
% 1.17/1.31 cnf(c_0_91, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(and(X3,X1),X2))), inference(spm,[status(thm)],[c_0_55, c_0_87])).
% 1.17/1.31 cnf(c_0_92, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,and(X2,X3)))), inference(spm,[status(thm)],[c_0_70, c_0_63])).
% 1.17/1.31 cnf(c_0_93, plain, (strict_implies(not(X1),X2)=strict_implies(not(X2),X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88, c_0_89]), c_0_88])).
% 1.17/1.32 cnf(c_0_94, plain, (and(X1,X1)=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_90]), c_0_63])])).
% 1.17/1.32 cnf(c_0_95, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(X3,X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_91, c_0_43])).
% 1.17/1.32 cnf(c_0_96, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_implies(not(and(X2,X3)),X1))), inference(spm,[status(thm)],[c_0_92, c_0_93])).
% 1.17/1.32 cnf(c_0_97, plain, (is_a_theorem(strict_implies(X1,X1))), inference(rw,[status(thm)],[c_0_90, c_0_94])).
% 1.17/1.32 cnf(c_0_98, plain, (is_a_theorem(and(strict_implies(X1,X2),X3))|~is_a_theorem(strict_equiv(X2,X1))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_95, c_0_44])).
% 1.17/1.32 cnf(c_0_99, plain, (strict_equiv(X1,X1)=strict_implies(X1,X1)), inference(spm,[status(thm)],[c_0_44, c_0_94])).
% 1.17/1.32 cnf(c_0_100, plain, (is_a_theorem(strict_implies(not(X1),not(and(X1,X2))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96, c_0_97]), c_0_93])).
% 1.17/1.32 cnf(c_0_101, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,X1))), inference(spm,[status(thm)],[c_0_55, c_0_60])).
% 1.17/1.32 cnf(c_0_102, plain, (is_a_theorem(and(strict_implies(X1,X1),X2))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98, c_0_99]), c_0_97])])).
% 1.17/1.32 cnf(c_0_103, plain, (is_a_theorem(strict_implies(not(X1),implies(X1,X2)))), inference(spm,[status(thm)],[c_0_100, c_0_77])).
% 1.17/1.32 cnf(c_0_104, plain, (not(not(X1))=or(X1,X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77, c_0_94]), c_0_83])).
% 1.17/1.32 cnf(c_0_105, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(and(strict_implies(X1,not(X3)),strict_implies(not(X2),X3)))), inference(spm,[status(thm)],[c_0_62, c_0_93])).
% 1.17/1.32 cnf(c_0_106, plain, (is_a_theorem(and(X1,strict_implies(X2,X2)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_101, c_0_102])).
% 1.17/1.32 cnf(c_0_107, plain, (is_a_theorem(strict_implies(or(X1,X1),or(X1,X2)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103, c_0_104]), c_0_83])).
% 1.17/1.32 cnf(c_0_108, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,not(not(X2))))), inference(spm,[status(thm)],[c_0_105, c_0_106])).
% 1.17/1.32 cnf(c_0_109, plain, (is_a_theorem(strict_implies(or(X1,X1),not(not(X1))))), inference(spm,[status(thm)],[c_0_107, c_0_104])).
% 1.17/1.32 cnf(c_0_110, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_108, c_0_104])).
% 1.17/1.32 cnf(c_0_111, plain, (is_a_theorem(strict_implies(or(X1,X1),X1))), inference(spm,[status(thm)],[c_0_108, c_0_109])).
% 1.17/1.32 cnf(c_0_112, plain, (is_a_theorem(strict_implies(not(X1),not(or(X1,X1))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110, c_0_111]), c_0_104]), c_0_93])).
% 1.17/1.32 cnf(c_0_113, plain, (is_a_theorem(strict_implies(not(not(X1)),or(X1,X2)))), inference(spm,[status(thm)],[c_0_103, c_0_83])).
% 1.17/1.32 cnf(c_0_114, plain, (X1=not(X2)|~is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_implies(X1,not(X2)))), inference(spm,[status(thm)],[c_0_59, c_0_93])).
% 1.17/1.32 cnf(c_0_115, plain, (not(or(X1,X1))=not(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_112]), c_0_93]), c_0_113])])).
% 1.17/1.32 cnf(c_0_116, plain, (and(and(X1,X2),X3)=and(X1,and(X2,X3))|~is_a_theorem(strict_implies(and(X1,and(X2,X3)),and(and(X1,X2),X3)))), inference(spm,[status(thm)],[c_0_59, c_0_81])).
% 1.17/1.32 cnf(c_0_117, plain, (not(not(X1))=X1|~is_a_theorem(strict_implies(X1,not(not(X1))))), inference(spm,[status(thm)],[c_0_114, c_0_97])).
% 1.17/1.32 cnf(c_0_118, plain, (implies(X1,or(X2,X2))=implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77, c_0_115]), c_0_77])).
% 1.17/1.32 fof(c_0_119, plain, ![X121, X122]:((~substitution_of_equivalents|(~is_a_theorem(equiv(X121,X122))|X121=X122))&((is_a_theorem(equiv(esk3_0,esk4_0))|substitution_of_equivalents)&(esk3_0!=esk4_0|substitution_of_equivalents))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])])).
% 1.17/1.32 fof(c_0_120, plain, ![X235, X236]:(~op_equiv|equiv(X235,X236)=and(implies(X235,X236),implies(X236,X235))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])).
% 1.17/1.32 cnf(c_0_121, plain, (and(X1,and(X1,X2))=and(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116, c_0_94]), c_0_71])])).
% 1.17/1.32 cnf(c_0_122, plain, (or(X1,X1)=X1|~is_a_theorem(strict_implies(X1,or(X1,X1)))), inference(spm,[status(thm)],[c_0_117, c_0_104])).
% 1.17/1.32 cnf(c_0_123, plain, (strict_implies(X1,or(X2,X2))=strict_implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82, c_0_118]), c_0_82])).
% 1.17/1.32 cnf(c_0_124, plain, (not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))), inference(spm,[status(thm)],[c_0_77, c_0_77])).
% 1.17/1.32 cnf(c_0_125, plain, (X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_119])).
% 1.17/1.32 cnf(c_0_126, plain, (substitution_of_equivalents), inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents])).
% 1.17/1.32 cnf(c_0_127, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv), inference(split_conjunct,[status(thm)],[c_0_120])).
% 1.17/1.32 cnf(c_0_128, plain, (op_equiv), inference(split_conjunct,[status(thm)],[s1_0_op_equiv])).
% 1.17/1.32 cnf(c_0_129, plain, (and(X1,and(X2,X1))=and(X2,X1)), inference(spm,[status(thm)],[c_0_121, c_0_64])).
% 1.17/1.32 cnf(c_0_130, plain, (or(and(X1,not(X2)),X3)=implies(implies(X1,X2),X3)), inference(spm,[status(thm)],[c_0_83, c_0_77])).
% 1.17/1.32 cnf(c_0_131, plain, (or(X1,X1)=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_122, c_0_123]), c_0_97])])).
% 1.17/1.32 cnf(c_0_132, plain, (implies(implies(X1,X2),and(X1,not(X2)))=not(implies(X1,X2))), inference(spm,[status(thm)],[c_0_124, c_0_94])).
% 1.17/1.32 cnf(c_0_133, plain, (X1=X2|~is_a_theorem(equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125, c_0_126])])).
% 1.17/1.32 cnf(c_0_134, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127, c_0_128])])).
% 1.17/1.32 cnf(c_0_135, plain, (implies(and(X1,not(X2)),X2)=implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84, c_0_129]), c_0_77])).
% 1.17/1.32 cnf(c_0_136, plain, (and(X1,not(X2))=not(implies(X1,X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130, c_0_131]), c_0_132])).
% 1.17/1.32 cnf(c_0_137, plain, (not(and(X1,or(X2,X2)))=implies(X1,not(X2))), inference(spm,[status(thm)],[c_0_77, c_0_104])).
% 1.17/1.32 cnf(c_0_138, plain, (X1=X2|~is_a_theorem(and(implies(X1,X2),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_133, c_0_134])).
% 1.17/1.32 cnf(c_0_139, plain, (implies(or(X1,X1),X2)=or(not(X1),X2)), inference(spm,[status(thm)],[c_0_83, c_0_104])).
% 1.17/1.32 cnf(c_0_140, plain, (or(X1,implies(X2,X1))=implies(X2,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_135, c_0_136]), c_0_83]), c_0_89])).
% 1.17/1.32 cnf(c_0_141, plain, (or(X1,not(X2))=implies(or(X2,X2),X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84, c_0_137]), c_0_83])).
% 1.17/1.32 cnf(c_0_142, plain, (X1=X2|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_138, c_0_43])).
% 1.17/1.32 cnf(c_0_143, plain, (is_a_theorem(strict_implies(not(not(X1)),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_100, c_0_84])).
% 1.17/1.32 cnf(c_0_144, plain, (or(not(X1),X2)=implies(X1,X2)), inference(rw,[status(thm)],[c_0_139, c_0_131])).
% 1.17/1.32 cnf(c_0_145, plain, (or(X1,or(X2,X1))=or(X2,X1)), inference(spm,[status(thm)],[c_0_140, c_0_83])).
% 1.17/1.32 cnf(c_0_146, plain, (or(X1,not(X2))=implies(X2,X1)), inference(rw,[status(thm)],[c_0_141, c_0_131])).
% 1.17/1.32 cnf(c_0_147, plain, (X1=not(X2)|~is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_142, c_0_83])).
% 1.17/1.32 cnf(c_0_148, plain, (is_a_theorem(strict_implies(not(not(X1)),or(X2,X1)))), inference(spm,[status(thm)],[c_0_143, c_0_83])).
% 1.17/1.32 cnf(c_0_149, plain, (implies(X1,implies(X1,X2))=implies(X1,X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144, c_0_145]), c_0_146]), c_0_146])).
% 1.17/1.32 cnf(c_0_150, plain, (X1=or(X2,X2)|~is_a_theorem(implies(X1,or(X2,X2)))|~is_a_theorem(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_147, c_0_104])).
% 1.17/1.32 cnf(c_0_151, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(not(not(X2)))), inference(spm,[status(thm)],[c_0_55, c_0_148])).
% 1.17/1.32 cnf(c_0_152, plain, (is_a_theorem(not(and(X1,X2)))|~is_a_theorem(not(X1))), inference(spm,[status(thm)],[c_0_55, c_0_100])).
% 1.17/1.32 cnf(c_0_153, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(and(strict_implies(not(X3),X1),strict_implies(X3,X2)))), inference(spm,[status(thm)],[c_0_62, c_0_93])).
% 1.17/1.32 cnf(c_0_154, plain, (is_a_theorem(strict_implies(X1,implies(X2,X3)))|~is_a_theorem(strict_implies(X1,not(X2)))), inference(spm,[status(thm)],[c_0_70, c_0_103])).
% 1.17/1.32 cnf(c_0_155, plain, (strict_implies(not(X1),X1)=necessarily(X1)), inference(spm,[status(thm)],[c_0_88, c_0_131])).
% 1.17/1.32 cnf(c_0_156, plain, (not(not(X1))=X1), inference(rw,[status(thm)],[c_0_104, c_0_131])).
% 1.17/1.32 cnf(c_0_157, plain, (strict_implies(X1,implies(X1,X2))=strict_implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82, c_0_149]), c_0_82])).
% 1.17/1.32 cnf(c_0_158, plain, (X1=or(X2,X2)|~is_a_theorem(or(not(X2),X1))|~is_a_theorem(implies(X1,X2))), inference(rw,[status(thm)],[c_0_150, c_0_118])).
% 1.17/1.32 cnf(c_0_159, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X2))), inference(spm,[status(thm)],[c_0_151, c_0_104])).
% 1.17/1.32 cnf(c_0_160, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(not(not(X2)))), inference(spm,[status(thm)],[c_0_152, c_0_84])).
% 1.17/1.32 cnf(c_0_161, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(not(X2))), inference(spm,[status(thm)],[c_0_55, c_0_93])).
% 1.17/1.32 cnf(c_0_162, plain, (is_a_theorem(strict_implies(not(not(X1)),X2))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_153, c_0_102])).
% 1.17/1.32 cnf(c_0_163, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(necessarily(not(X1)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154, c_0_155]), c_0_156]), c_0_157])).
% 1.17/1.32 cnf(c_0_164, plain, (X1=X2|~is_a_theorem(or(not(X2),X1))|~is_a_theorem(implies(X1,X2))), inference(rw,[status(thm)],[c_0_158, c_0_131])).
% 1.17/1.32 cnf(c_0_165, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(X2)), inference(rw,[status(thm)],[c_0_159, c_0_131])).
% 1.17/1.32 cnf(c_0_166, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,X2))), inference(spm,[status(thm)],[c_0_160, c_0_104])).
% 1.17/1.32 fof(c_0_167, plain, ![X125, X126]:((~modus_tollens|is_a_theorem(implies(implies(not(X126),not(X125)),implies(X125,X126))))&(~is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))|modus_tollens)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])])).
% 1.17/1.32 fof(c_0_168, negated_conjecture, ~modus_tollens, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_modus_tollens])])).
% 1.17/1.32 cnf(c_0_169, plain, (is_a_theorem(not(X1))|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(not(X2))), inference(spm,[status(thm)],[c_0_161, c_0_162])).
% 1.17/1.32 cnf(c_0_170, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(necessarily(X1))), inference(spm,[status(thm)],[c_0_163, c_0_156])).
% 1.17/1.32 cnf(c_0_171, plain, (X1=X2|~is_a_theorem(implies(X1,X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_164, c_0_165])).
% 1.17/1.32 cnf(c_0_172, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)), inference(rw,[status(thm)],[c_0_166, c_0_131])).
% 1.17/1.32 cnf(c_0_173, plain, (modus_tollens|~is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))), inference(split_conjunct,[status(thm)],[c_0_167])).
% 1.17/1.32 cnf(c_0_174, negated_conjecture, (~modus_tollens), inference(split_conjunct,[status(thm)],[c_0_168])).
% 1.17/1.32 cnf(c_0_175, plain, (is_a_theorem(X1)|~is_a_theorem(not(X2))|~is_a_theorem(necessarily(X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169, c_0_170]), c_0_156])).
% 1.17/1.32 cnf(c_0_176, plain, (X1=X2|~is_a_theorem(X1)|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_171, c_0_172])).
% 1.17/1.32 fof(c_0_177, plain, ![X315]:(~op_possibly|possibly(X315)=not(necessarily(not(X315)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_possibly])])])).
% 1.17/1.32 cnf(c_0_178, plain, (~is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))), inference(sr,[status(thm)],[c_0_173, c_0_174])).
% 1.17/1.32 cnf(c_0_179, plain, (is_a_theorem(X1)|~is_a_theorem(necessarily(X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_175, c_0_156])).
% 1.17/1.32 cnf(c_0_180, plain, (strict_implies(X1,X1)=X2|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_176, c_0_97])).
% 1.17/1.32 cnf(c_0_181, plain, (possibly(X1)=not(necessarily(not(X1)))|~op_possibly), inference(split_conjunct,[status(thm)],[c_0_177])).
% 1.17/1.32 cnf(c_0_182, plain, (op_possibly), inference(split_conjunct,[status(thm)],[s1_0_op_possibly])).
% 1.17/1.32 cnf(c_0_183, plain, (~is_a_theorem(implies(or(esk6_0,not(esk5_0)),implies(esk5_0,esk6_0)))), inference(rw,[status(thm)],[c_0_178, c_0_83])).
% 1.17/1.32 cnf(c_0_184, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_179, c_0_82])).
% 1.17/1.32 cnf(c_0_185, plain, (strict_implies(X1,X1)=strict_implies(X2,X2)), inference(spm,[status(thm)],[c_0_180, c_0_97])).
% 1.17/1.32 cnf(c_0_186, plain, (not(necessarily(not(X1)))=possibly(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181, c_0_182])])).
% 1.17/1.32 cnf(c_0_187, plain, (~is_a_theorem(implies(implies(or(esk5_0,esk5_0),esk6_0),implies(esk5_0,esk6_0)))), inference(rw,[status(thm)],[c_0_183, c_0_141])).
% 1.17/1.32 cnf(c_0_188, plain, (is_a_theorem(implies(X1,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184, c_0_185]), c_0_97])])).
% 1.17/1.32 cnf(c_0_189, plain, (is_a_theorem(strict_implies(possibly(X1),implies(necessarily(not(X1)),X2)))), inference(spm,[status(thm)],[c_0_103, c_0_186])).
% 1.17/1.32 cnf(c_0_190, plain, (~is_a_theorem(implies(implies(esk5_0,esk6_0),implies(esk5_0,esk6_0)))), inference(rw,[status(thm)],[c_0_187, c_0_131])).
% 1.17/1.32 cnf(c_0_191, plain, (is_a_theorem(implies(X1,X1))), inference(spm,[status(thm)],[c_0_188, c_0_189])).
% 1.17/1.32 cnf(c_0_192, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_190, c_0_191])]), ['proof']).
% 1.17/1.32 % SZS output end Proof
% 1.17/1.32 % User time : 0.781 s
% 1.17/1.32 % System time : 0.042 s
% 1.17/1.32 % Total time : 0.823 s
% 1.17/1.32
%------------------------------------------------------------------------------