%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL463+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n010.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:02 AM UTC 2026
% Result : Theorem 0.41s 35.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL463+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.34 % Computer : n010.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 22:58:09 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.24/0.46 start to proof:theBenchmark.p
% 0.41/35.57 % Version : CSI_E---1.1
% 0.41/35.57 % Problem : theBenchmark.p
% 0.41/35.57 % Proof found!
% 0.41/35.57 % SZS status Theorem for theBenchmark.p
% 0.41/35.57 % SZS output start Proof
% 0.41/35.57 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/sandbox2/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 0.41/35.57 fof(cn1, axiom, (cn1<=>![X4, X5, X6]:is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', cn1)).
% 0.41/35.57 fof(op_implies_and, axiom, (op_implies_and=>![X1, X2]:implies(X1,X2)=not(and(X1,not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_implies_and)).
% 0.41/35.57 fof(luka_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', luka_modus_ponens)).
% 0.41/35.57 fof(luka_cn1, axiom, cn1, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', luka_cn1)).
% 0.41/35.57 fof(cn2, axiom, (cn2<=>![X4, X5]:is_a_theorem(implies(X4,implies(not(X4),X5)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', cn2)).
% 0.41/35.57 fof(op_or, axiom, (op_or=>![X1, X2]:or(X1,X2)=not(and(not(X1),not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_or)).
% 0.41/35.57 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_op_implies_and)).
% 0.41/35.57 fof(luka_cn2, axiom, cn2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', luka_cn2)).
% 0.41/35.57 fof(luka_op_or, axiom, op_or, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', luka_op_or)).
% 0.41/35.57 fof(cn3, axiom, (cn3<=>![X4]:is_a_theorem(implies(implies(not(X4),X4),X4))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', cn3)).
% 0.41/35.57 fof(luka_cn3, axiom, cn3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', luka_cn3)).
% 0.41/35.57 fof(op_equiv, axiom, (op_equiv=>![X1, X2]:equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_equiv)).
% 0.41/35.57 fof(luka_op_equiv, axiom, op_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', luka_op_equiv)).
% 0.41/35.57 fof(substitution_of_equivalents, axiom, (substitution_of_equivalents<=>![X1, X2]:(is_a_theorem(equiv(X1,X2))=>X1=X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', substitution_of_equivalents)).
% 0.41/35.57 fof(use_substitution_of_equivalents, axiom, substitution_of_equivalents, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax', use_substitution_of_equivalents)).
% 0.41/35.57 fof(implies_1, axiom, (implies_1<=>![X1, X2]:is_a_theorem(implies(X1,implies(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', implies_1)).
% 0.41/35.57 fof(hilbert_implies_1, conjecture, implies_1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_implies_1)).
% 0.41/35.57 fof(c_0_18, 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.41/35.57 fof(c_0_19, plain, ![X148, X149, X150]:((~cn1|is_a_theorem(implies(implies(X148,X149),implies(implies(X149,X150),implies(X148,X150)))))&(~is_a_theorem(implies(implies(esk39_0,esk40_0),implies(implies(esk40_0,esk41_0),implies(esk39_0,esk41_0))))|cn1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn1])])])])).
% 0.41/35.57 fof(c_0_20, 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.41/35.57 cnf(c_0_21, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_18])).
% 0.41/35.57 cnf(c_0_22, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[luka_modus_ponens])).
% 0.41/35.57 cnf(c_0_23, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.41/35.57 cnf(c_0_24, plain, (cn1), inference(split_conjunct,[status(thm)],[luka_cn1])).
% 0.41/35.57 fof(c_0_25, plain, ![X154, X155]:((~cn2|is_a_theorem(implies(X154,implies(not(X154),X155))))&(~is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))|cn2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])])).
% 0.41/35.57 fof(c_0_26, 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.41/35.57 cnf(c_0_27, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_20])).
% 0.41/35.57 cnf(c_0_28, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])).
% 0.41/35.57 cnf(c_0_29, 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_21, c_0_22])])).
% 0.41/35.57 cnf(c_0_30, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])).
% 0.41/35.57 cnf(c_0_31, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.41/35.57 cnf(c_0_32, plain, (cn2), inference(split_conjunct,[status(thm)],[luka_cn2])).
% 0.41/35.57 cnf(c_0_33, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.41/35.57 cnf(c_0_34, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
% 0.41/35.57 cnf(c_0_35, plain, (op_or), inference(split_conjunct,[status(thm)],[luka_op_or])).
% 0.41/35.57 fof(c_0_36, plain, ![X158]:((~cn3|is_a_theorem(implies(implies(not(X158),X158),X158)))&(~is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0))|cn3)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn3])])])])).
% 0.41/35.57 cnf(c_0_37, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 0.41/35.57 cnf(c_0_38, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])])).
% 0.41/35.57 cnf(c_0_39, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_34]), c_0_35])])).
% 0.41/35.57 cnf(c_0_40, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))|~cn3), inference(split_conjunct,[status(thm)],[c_0_36])).
% 0.41/35.57 cnf(c_0_41, plain, (cn3), inference(split_conjunct,[status(thm)],[luka_cn3])).
% 0.41/35.57 cnf(c_0_42, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3))), inference(spm,[status(thm)],[c_0_29, c_0_37])).
% 0.41/35.57 cnf(c_0_43, plain, (is_a_theorem(implies(X1,or(X1,X2)))), inference(rw,[status(thm)],[c_0_38, c_0_39])).
% 0.41/35.57 cnf(c_0_44, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])])).
% 0.41/35.57 cnf(c_0_45, plain, (is_a_theorem(implies(X1,or(X2,X3)))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_42, c_0_43])).
% 0.41/35.57 cnf(c_0_46, plain, (is_a_theorem(implies(or(X1,X1),X1))), inference(rw,[status(thm)],[c_0_44, c_0_39])).
% 0.41/35.57 cnf(c_0_47, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,not(X3)))|~is_a_theorem(or(X3,X2))), inference(spm,[status(thm)],[c_0_42, c_0_39])).
% 0.41/35.57 cnf(c_0_48, plain, (is_a_theorem(implies(X1,or(X2,X3)))|~is_a_theorem(implies(X1,X4))|~is_a_theorem(implies(X4,X2))), inference(spm,[status(thm)],[c_0_42, c_0_45])).
% 0.41/35.57 cnf(c_0_49, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_42, c_0_46])).
% 0.41/35.57 cnf(c_0_50, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,not(X3)))|~is_a_theorem(or(X3,X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_39]), c_0_39])).
% 0.41/35.57 cnf(c_0_51, plain, (or(and(X1,not(X2)),X3)=implies(implies(X1,X2),X3)), inference(spm,[status(thm)],[c_0_39, c_0_34])).
% 0.41/35.57 cnf(c_0_52, plain, (is_a_theorem(implies(X1,or(X2,X3)))|~is_a_theorem(implies(or(X1,X4),X2))), inference(spm,[status(thm)],[c_0_48, c_0_43])).
% 0.41/35.57 cnf(c_0_53, plain, (is_a_theorem(implies(X1,X1))), inference(spm,[status(thm)],[c_0_49, c_0_43])).
% 0.41/35.57 cnf(c_0_54, plain, (is_a_theorem(implies(implies(X1,X2),or(X3,X2)))|~is_a_theorem(or(X3,X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_39]), c_0_39])).
% 0.41/35.57 cnf(c_0_55, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,implies(X3,X4)))|~is_a_theorem(implies(implies(X3,X4),X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_34]), c_0_51])).
% 0.41/35.57 cnf(c_0_56, plain, (is_a_theorem(implies(X1,or(or(X1,X2),X3)))), inference(spm,[status(thm)],[c_0_52, c_0_53])).
% 0.41/35.57 cnf(c_0_57, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_49, c_0_54])).
% 0.41/35.57 cnf(c_0_58, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_29, c_0_43])).
% 0.41/35.57 cnf(c_0_59, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,or(X3,X4)))|~is_a_theorem(implies(or(X3,X4),X2))), inference(spm,[status(thm)],[c_0_55, c_0_39])).
% 0.41/35.57 cnf(c_0_60, plain, (is_a_theorem(or(X1,or(or(not(X1),X2),X3)))), inference(spm,[status(thm)],[c_0_56, c_0_39])).
% 0.41/35.57 cnf(c_0_61, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_57, c_0_58])).
% 0.41/35.57 cnf(c_0_62, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(implies(or(or(not(X1),X3),X4),X2))), inference(spm,[status(thm)],[c_0_59, c_0_60])).
% 0.41/35.57 cnf(c_0_63, plain, (is_a_theorem(implies(or(X1,X2),X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_61, c_0_39])).
% 0.41/35.57 cnf(c_0_64, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_62, c_0_63])).
% 0.41/35.57 cnf(c_0_65, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_57, c_0_64])).
% 0.41/35.57 cnf(c_0_66, plain, (is_a_theorem(implies(implies(X1,or(X2,X2)),X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_49, c_0_65])).
% 0.41/35.57 fof(c_0_67, 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.41/35.57 cnf(c_0_68, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,or(X1,X1)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_29, c_0_66])).
% 0.41/35.57 cnf(c_0_69, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv), inference(split_conjunct,[status(thm)],[c_0_67])).
% 0.41/35.57 cnf(c_0_70, plain, (op_equiv), inference(split_conjunct,[status(thm)],[luka_op_equiv])).
% 0.41/35.57 cnf(c_0_71, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_68, c_0_54])).
% 0.41/35.57 cnf(c_0_72, plain, (is_a_theorem(or(X1,or(X2,X3)))|~is_a_theorem(or(X1,X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_39]), c_0_39])).
% 0.41/35.57 cnf(c_0_73, plain, (not(and(X1,implies(X2,X3)))=implies(X1,and(X2,not(X3)))), inference(spm,[status(thm)],[c_0_34, c_0_34])).
% 0.41/35.57 cnf(c_0_74, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69, c_0_70])])).
% 0.41/35.57 fof(c_0_75, 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.41/35.57 cnf(c_0_76, plain, (is_a_theorem(X1)|~is_a_theorem(implies(or(X2,X3),X1))|~is_a_theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_71, c_0_72])).
% 0.41/35.57 cnf(c_0_77, plain, (is_a_theorem(implies(or(X1,X2),X2))|~is_a_theorem(not(X1))), inference(spm,[status(thm)],[c_0_65, c_0_39])).
% 0.41/35.57 cnf(c_0_78, plain, (implies(implies(X1,X2),and(X2,not(X1)))=not(equiv(X1,X2))), inference(spm,[status(thm)],[c_0_73, c_0_74])).
% 0.41/35.57 cnf(c_0_79, plain, (X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_75])).
% 0.41/35.57 cnf(c_0_80, plain, (substitution_of_equivalents), inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents])).
% 0.41/35.57 cnf(c_0_81, plain, (is_a_theorem(X1)|~is_a_theorem(or(X1,X2))|~is_a_theorem(not(X2))), inference(spm,[status(thm)],[c_0_76, c_0_77])).
% 0.41/35.57 cnf(c_0_82, plain, (is_a_theorem(or(equiv(X1,X2),and(X2,not(X1))))|~is_a_theorem(implies(X1,X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_78]), c_0_39])).
% 0.41/35.57 cnf(c_0_83, plain, (is_a_theorem(implies(or(or(X1,X1),or(X1,X1)),X1))), inference(spm,[status(thm)],[c_0_49, c_0_46])).
% 0.41/35.57 cnf(c_0_84, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(implies(or(X3,X4),X2))|~is_a_theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_59, c_0_72])).
% 0.41/35.57 cnf(c_0_85, plain, (is_a_theorem(implies(implies(implies(X1,X2),and(X1,not(X2))),and(X1,not(X2))))), inference(spm,[status(thm)],[c_0_46, c_0_51])).
% 0.41/35.57 cnf(c_0_86, plain, (X1=X2|~is_a_theorem(equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79, c_0_80])])).
% 0.41/35.57 cnf(c_0_87, plain, (is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81, c_0_82]), c_0_34])).
% 0.41/35.57 cnf(c_0_88, plain, (is_a_theorem(implies(X1,or(X2,X3)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_52, c_0_63])).
% 0.41/35.57 cnf(c_0_89, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,or(or(X2,X2),or(X2,X2))))), inference(spm,[status(thm)],[c_0_42, c_0_83])).
% 0.41/35.57 cnf(c_0_90, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,X3))|~is_a_theorem(not(X3))), inference(spm,[status(thm)],[c_0_84, c_0_77])).
% 0.41/35.57 cnf(c_0_91, plain, (is_a_theorem(or(equiv(X1,X1),and(X1,not(X1))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85, c_0_78]), c_0_39])).
% 0.41/35.57 cnf(c_0_92, plain, (X1=X2|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_86, c_0_87])).
% 0.41/35.57 cnf(c_0_93, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_49, c_0_88])).
% 0.41/35.57 cnf(c_0_94, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(or(X2,X2))), inference(spm,[status(thm)],[c_0_89, c_0_88])).
% 0.41/35.57 cnf(c_0_95, plain, (is_a_theorem(or(equiv(X1,X1),X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90, c_0_91]), c_0_34]), c_0_53])])).
% 0.41/35.57 cnf(c_0_96, plain, (implies(X1,X2)=X2|~is_a_theorem(implies(X2,implies(X1,X2)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_92, c_0_65])).
% 0.41/35.57 cnf(c_0_97, plain, (is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X1,X3))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_39]), c_0_39])).
% 0.41/35.57 cnf(c_0_98, plain, (X1=X2|~is_a_theorem(implies(X1,X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_92, c_0_93])).
% 0.41/35.57 cnf(c_0_99, plain, (is_a_theorem(implies(X1,equiv(X2,X2)))), inference(spm,[status(thm)],[c_0_94, c_0_95])).
% 0.41/35.57 cnf(c_0_100, plain, (implies(implies(X1,X1),or(X2,X1))=or(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96, c_0_97]), c_0_53])])).
% 0.41/35.57 cnf(c_0_101, plain, (or(X1,X1)=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92, c_0_46]), c_0_43])])).
% 0.41/35.57 cnf(c_0_102, plain, (X1=equiv(X2,X2)|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_98, c_0_99])).
% 0.41/35.57 fof(c_0_103, plain, ![X84, X85]:((~implies_1|is_a_theorem(implies(X84,implies(X85,X84))))&(~is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))|implies_1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_1])])])])).
% 0.41/35.57 fof(c_0_104, negated_conjecture, ~implies_1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_implies_1])])).
% 0.41/35.57 cnf(c_0_105, plain, (implies(implies(X1,X1),X1)=X1), inference(spm,[status(thm)],[c_0_100, c_0_101])).
% 0.41/35.57 cnf(c_0_106, plain, (implies(X1,X1)=equiv(X2,X2)), inference(spm,[status(thm)],[c_0_102, c_0_53])).
% 0.41/35.57 cnf(c_0_107, plain, (implies_1|~is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))), inference(split_conjunct,[status(thm)],[c_0_103])).
% 0.41/35.57 cnf(c_0_108, negated_conjecture, (~implies_1), inference(split_conjunct,[status(thm)],[c_0_104])).
% 0.41/35.57 cnf(c_0_109, plain, (implies(equiv(X1,X1),X2)=X2), inference(spm,[status(thm)],[c_0_105, c_0_106])).
% 0.41/35.57 cnf(c_0_110, plain, (~is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))), inference(sr,[status(thm)],[c_0_107, c_0_108])).
% 0.41/35.57 cnf(c_0_111, plain, (is_a_theorem(implies(X1,implies(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_109]), c_0_99])])).
% 0.41/35.57 cnf(c_0_112, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110, c_0_111])]), ['proof']).
% 0.41/35.57 % SZS output end Proof
% 0.41/35.57 % User time : 33.490 s
% 0.41/35.57 % System time : 1.601 s
% 0.41/35.57 % Total time : 35.091 s
% 0.41/35.57
%------------------------------------------------------------------------------