%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL518+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n017.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:07 AM UTC 2026
% Result : Theorem 0.68s 0.80s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL518+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 08:58:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.24/0.48 start to proof:theBenchmark.p
% 0.68/0.80 % Version : CSI_E---1.1
% 0.68/0.80 % Problem : theBenchmark.p
% 0.68/0.80 % Proof found!
% 0.68/0.80 % SZS status Theorem for theBenchmark.p
% 0.68/0.80 % SZS output start Proof
% 0.68/0.80 fof(op_implies_or, axiom, (op_implies_or=>![X1, X2]:implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_implies_or)).
% 0.68/0.80 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)).
% 0.68/0.80 fof(op_and, axiom, (op_and=>![X1, X2]:and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_and)).
% 0.68/0.80 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_op_implies_or)).
% 0.68/0.80 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)).
% 0.68/0.80 fof(rosser_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_op_implies_and)).
% 0.68/0.80 fof(modus_ponens, axiom, (modus_ponens<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 0.68/0.80 fof(kn2, axiom, (kn2<=>![X4, X5]:is_a_theorem(implies(and(X4,X5),X4))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', kn2)).
% 0.68/0.80 fof(principia_op_and, axiom, op_and, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_op_and)).
% 0.68/0.80 fof(rosser_op_or, axiom, op_or, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_op_or)).
% 0.68/0.80 fof(rosser_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_modus_ponens)).
% 0.68/0.80 fof(rosser_kn2, axiom, kn2, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_kn2)).
% 0.68/0.80 fof(kn1, axiom, (kn1<=>![X4]:is_a_theorem(implies(X4,and(X4,X4)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', kn1)).
% 0.68/0.80 fof(rosser_kn1, axiom, kn1, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_kn1)).
% 0.68/0.80 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)).
% 0.68/0.80 fof(kn3, axiom, (kn3<=>![X4, X5, X6]:is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', kn3)).
% 0.68/0.80 fof(rosser_op_equiv, axiom, op_equiv, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_op_equiv)).
% 0.68/0.80 fof(rosser_kn3, axiom, kn3, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', rosser_kn3)).
% 0.68/0.80 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)).
% 0.68/0.80 fof(use_substitution_of_equivalents, axiom, substitution_of_equivalents, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax', use_substitution_of_equivalents)).
% 0.68/0.80 fof(r1, axiom, (r1<=>![X4]:is_a_theorem(implies(or(X4,X4),X4))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r1)).
% 0.68/0.80 fof(principia_r1, conjecture, r1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r1)).
% 0.68/0.80 fof(c_0_22, plain, ![X188, X189]:(~op_implies_or|implies(X188,X189)=or(not(X188),X189)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])).
% 0.68/0.80 fof(c_0_23, plain, ![X186, X187]:(~op_implies_and|implies(X186,X187)=not(and(X186,not(X187)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])).
% 0.68/0.80 fof(c_0_24, plain, ![X184, X185]:(~op_and|and(X184,X185)=not(or(not(X184),not(X185)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])])).
% 0.68/0.80 cnf(c_0_25, plain, (implies(X1,X2)=or(not(X1),X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_22])).
% 0.68/0.80 cnf(c_0_26, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])).
% 0.68/0.80 fof(c_0_27, plain, ![X182, X183]:(~op_or|or(X182,X183)=not(and(not(X182),not(X183)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])).
% 0.68/0.80 cnf(c_0_28, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_23])).
% 0.68/0.80 cnf(c_0_29, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[rosser_op_implies_and])).
% 0.68/0.80 fof(c_0_30, plain, ![X72, X73]:((~modus_ponens|(~is_a_theorem(X72)|~is_a_theorem(implies(X72,X73))|is_a_theorem(X73)))&(((is_a_theorem(esk1_0)|modus_ponens)&(is_a_theorem(implies(esk1_0,esk2_0))|modus_ponens))&(~is_a_theorem(esk2_0)|modus_ponens))), 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])])])])])).
% 0.68/0.80 fof(c_0_31, plain, ![X138, X139]:((~kn2|is_a_theorem(implies(and(X138,X139),X138)))&(~is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))|kn2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])])).
% 0.68/0.80 cnf(c_0_32, plain, (and(X1,X2)=not(or(not(X1),not(X2)))|~op_and), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.68/0.80 cnf(c_0_33, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
% 0.68/0.80 cnf(c_0_34, plain, (op_and), inference(split_conjunct,[status(thm)],[principia_op_and])).
% 0.68/0.80 cnf(c_0_35, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.68/0.80 cnf(c_0_36, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])])).
% 0.68/0.80 cnf(c_0_37, plain, (op_or), inference(split_conjunct,[status(thm)],[rosser_op_or])).
% 0.68/0.80 cnf(c_0_38, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_30])).
% 0.68/0.80 cnf(c_0_39, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[rosser_modus_ponens])).
% 0.68/0.80 cnf(c_0_40, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2), inference(split_conjunct,[status(thm)],[c_0_31])).
% 0.68/0.80 cnf(c_0_41, plain, (kn2), inference(split_conjunct,[status(thm)],[rosser_kn2])).
% 0.68/0.80 cnf(c_0_42, plain, (not(implies(X1,not(X2)))=and(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_33]), c_0_34])])).
% 0.68/0.80 cnf(c_0_43, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_36]), c_0_37])])).
% 0.68/0.80 fof(c_0_44, plain, ![X136]:((~kn1|is_a_theorem(implies(X136,and(X136,X136))))&(~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))|kn1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])])).
% 0.68/0.80 cnf(c_0_45, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38, c_0_39])])).
% 0.68/0.80 cnf(c_0_46, plain, (is_a_theorem(implies(and(X1,X2),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])])).
% 0.68/0.80 cnf(c_0_47, plain, (not(or(X1,not(X2)))=and(not(X1),X2)), inference(spm,[status(thm)],[c_0_42, c_0_43])).
% 0.68/0.80 cnf(c_0_48, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1), inference(split_conjunct,[status(thm)],[c_0_44])).
% 0.68/0.80 cnf(c_0_49, plain, (kn1), inference(split_conjunct,[status(thm)],[rosser_kn1])).
% 0.68/0.80 cnf(c_0_50, plain, (is_a_theorem(X1)|~is_a_theorem(and(X1,X2))), inference(spm,[status(thm)],[c_0_45, c_0_46])).
% 0.68/0.80 cnf(c_0_51, plain, (and(not(not(X1)),X2)=and(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_33]), c_0_42])).
% 0.68/0.80 cnf(c_0_52, plain, (is_a_theorem(implies(X1,and(X1,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48, c_0_49])])).
% 0.68/0.80 cnf(c_0_53, plain, (is_a_theorem(not(not(X1)))|~is_a_theorem(and(X1,X2))), inference(spm,[status(thm)],[c_0_50, c_0_51])).
% 0.68/0.80 cnf(c_0_54, plain, (is_a_theorem(and(X1,X1))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_45, c_0_52])).
% 0.68/0.80 fof(c_0_55, plain, ![X190, X191]:(~op_equiv|equiv(X190,X191)=and(implies(X190,X191),implies(X191,X190))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])).
% 0.68/0.80 fof(c_0_56, plain, ![X142, X143, X144]:((~kn3|is_a_theorem(implies(implies(X142,X143),implies(not(and(X143,X144)),not(and(X144,X142))))))&(~is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0)))))|kn3)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])])).
% 0.68/0.80 cnf(c_0_57, plain, (is_a_theorem(not(not(X1)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_53, c_0_54])).
% 0.68/0.80 cnf(c_0_58, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv), inference(split_conjunct,[status(thm)],[c_0_55])).
% 0.68/0.80 cnf(c_0_59, plain, (op_equiv), inference(split_conjunct,[status(thm)],[rosser_op_equiv])).
% 0.68/0.80 cnf(c_0_60, plain, (or(and(X1,X2),X3)=implies(implies(X1,not(X2)),X3)), inference(spm,[status(thm)],[c_0_33, c_0_42])).
% 0.68/0.80 cnf(c_0_61, plain, (is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3), inference(split_conjunct,[status(thm)],[c_0_56])).
% 0.68/0.80 cnf(c_0_62, plain, (kn3), inference(split_conjunct,[status(thm)],[rosser_kn3])).
% 0.68/0.80 fof(c_0_63, plain, ![X76, X77]:((~substitution_of_equivalents|(~is_a_theorem(equiv(X76,X77))|X76=X77))&((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])])])])])).
% 0.68/0.80 cnf(c_0_64, plain, (is_a_theorem(not(implies(X1,X2)))|~is_a_theorem(and(X1,not(X2)))), inference(spm,[status(thm)],[c_0_57, c_0_36])).
% 0.68/0.80 cnf(c_0_65, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58, c_0_59])])).
% 0.68/0.80 cnf(c_0_66, plain, (and(X1,implies(X2,not(X3)))=not(implies(X1,and(X2,X3)))), inference(spm,[status(thm)],[c_0_42, c_0_42])).
% 0.68/0.80 cnf(c_0_67, plain, (implies(implies(X1,not(not(X2))),X3)=implies(implies(X1,X2),X3)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_36]), c_0_60])).
% 0.68/0.80 cnf(c_0_68, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61, c_0_43]), c_0_62])])).
% 0.68/0.80 cnf(c_0_69, plain, (X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_63])).
% 0.68/0.80 cnf(c_0_70, plain, (substitution_of_equivalents), inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents])).
% 0.68/0.80 cnf(c_0_71, plain, (is_a_theorem(not(implies(X1,and(X2,not(X3)))))|~is_a_theorem(and(X1,implies(X2,X3)))), inference(spm,[status(thm)],[c_0_64, c_0_36])).
% 0.68/0.80 cnf(c_0_72, plain, (not(implies(or(X1,X2),and(X2,X1)))=equiv(not(X1),X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_43]), c_0_66])).
% 0.68/0.80 cnf(c_0_73, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,not(not(X3))))|~is_a_theorem(implies(implies(X2,X3),X1))), inference(spm,[status(thm)],[c_0_45, c_0_67])).
% 0.68/0.80 cnf(c_0_74, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),not(and(X3,X1)))))), inference(rw,[status(thm)],[c_0_68, c_0_60])).
% 0.68/0.80 cnf(c_0_75, plain, (X1=X2|~is_a_theorem(equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69, c_0_70])])).
% 0.68/0.80 cnf(c_0_76, plain, (is_a_theorem(equiv(not(not(X1)),X2))|~is_a_theorem(equiv(X1,X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71, c_0_72]), c_0_33]), c_0_65])).
% 0.68/0.80 cnf(c_0_77, plain, (is_a_theorem(X1)|~is_a_theorem(implies(implies(and(X2,X3),X2),X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73, c_0_46]), c_0_51])).
% 0.68/0.80 cnf(c_0_78, plain, (is_a_theorem(implies(implies(X1,not(X2)),not(and(X2,X3))))|~is_a_theorem(implies(X3,X1))), inference(spm,[status(thm)],[c_0_45, c_0_74])).
% 0.68/0.80 cnf(c_0_79, plain, (not(not(X1))=X2|~is_a_theorem(equiv(X1,X2))), inference(spm,[status(thm)],[c_0_75, c_0_76])).
% 0.68/0.80 cnf(c_0_80, plain, (is_a_theorem(equiv(X1,X1))|~is_a_theorem(implies(X1,X1))), inference(spm,[status(thm)],[c_0_54, c_0_65])).
% 0.68/0.80 cnf(c_0_81, plain, (is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X2,and(not(X1),X3)))), inference(spm,[status(thm)],[c_0_77, c_0_78])).
% 0.68/0.80 cnf(c_0_82, plain, (not(not(X1))=X1|~is_a_theorem(implies(X1,X1))), inference(spm,[status(thm)],[c_0_79, c_0_80])).
% 0.68/0.80 cnf(c_0_83, plain, (is_a_theorem(implies(X1,X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81, c_0_52]), c_0_36])).
% 0.68/0.80 cnf(c_0_84, plain, (not(not(X1))=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82, c_0_83])])).
% 0.68/0.80 cnf(c_0_85, plain, (not(and(X1,X2))=implies(X1,not(X2))), inference(spm,[status(thm)],[c_0_36, c_0_84])).
% 0.68/0.80 cnf(c_0_86, plain, (is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X3))))|~is_a_theorem(implies(X3,X1))), inference(rw,[status(thm)],[c_0_78, c_0_85])).
% 0.68/0.80 cnf(c_0_87, plain, (is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X3,not(X1)))|~is_a_theorem(implies(X2,X3))), inference(spm,[status(thm)],[c_0_45, c_0_86])).
% 0.68/0.80 fof(c_0_88, plain, ![X160]:((~r1|is_a_theorem(implies(or(X160,X160),X160)))&(~is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))|r1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r1])])])])).
% 0.68/0.80 fof(c_0_89, negated_conjecture, ~r1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r1])])).
% 0.68/0.80 cnf(c_0_90, plain, (is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))), inference(spm,[status(thm)],[c_0_87, c_0_83])).
% 0.68/0.80 cnf(c_0_91, plain, (is_a_theorem(or(X1,and(not(X1),not(X1))))), inference(spm,[status(thm)],[c_0_52, c_0_43])).
% 0.68/0.80 cnf(c_0_92, plain, (and(X1,not(X2))=not(implies(X1,X2))), inference(spm,[status(thm)],[c_0_42, c_0_84])).
% 0.68/0.80 cnf(c_0_93, plain, (r1|~is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))), inference(split_conjunct,[status(thm)],[c_0_88])).
% 0.68/0.80 cnf(c_0_94, negated_conjecture, (~r1), inference(split_conjunct,[status(thm)],[c_0_89])).
% 0.68/0.80 cnf(c_0_95, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,not(X1)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90, c_0_43]), c_0_84])).
% 0.68/0.80 cnf(c_0_96, plain, (is_a_theorem(or(X1,not(or(X1,X1))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_91, c_0_92]), c_0_43])).
% 0.68/0.80 cnf(c_0_97, plain, (~is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))), inference(sr,[status(thm)],[c_0_93, c_0_94])).
% 0.68/0.80 cnf(c_0_98, plain, (is_a_theorem(implies(or(X1,X1),X1))), inference(spm,[status(thm)],[c_0_95, c_0_96])).
% 0.68/0.80 cnf(c_0_99, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97, c_0_98])]), ['proof']).
% 0.68/0.80 % SZS output end Proof
% 0.68/0.80 % User time : 0.278 s
% 0.68/0.80 % System time : 0.015 s
% 0.68/0.80 % Total time : 0.293 s
% 0.68/0.80
%------------------------------------------------------------------------------