%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL550+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n018.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:09 AM UTC 2026
% Result : Theorem 0.66s 0.89s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL550+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 5 18:19:04 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.24/0.48 start to proof:theBenchmark.p
% 0.66/0.89 % Version : CSI_E---1.1
% 0.66/0.89 % Problem : theBenchmark.p
% 0.66/0.89 % Proof found!
% 0.66/0.89 % SZS status Theorem for theBenchmark.p
% 0.66/0.89 % SZS output start Proof
% 0.66/0.89 fof(adjunction, axiom, (adjunction<=>![X1, X2]:((is_a_theorem(X1)&is_a_theorem(X2))=>is_a_theorem(and(X1,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', adjunction)).
% 0.66/0.89 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/sandbox2/benchmark/Axioms/LCL007+1.ax', op_strict_equiv)).
% 0.66/0.89 fof(substitution_strict_equiv, axiom, (substitution_strict_equiv<=>![X1, X2]:(is_a_theorem(strict_equiv(X1,X2))=>X1=X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', substitution_strict_equiv)).
% 0.66/0.89 fof(s1_0_adjunction, axiom, adjunction, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_adjunction)).
% 0.66/0.89 fof(s1_0_op_strict_equiv, axiom, op_strict_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_strict_equiv)).
% 0.66/0.89 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/sandbox2/benchmark/Axioms/LCL007+0.ax', modus_ponens_strict_implies)).
% 0.66/0.89 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/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m5)).
% 0.66/0.89 fof(s1_0_substitution_strict_equiv, axiom, substitution_strict_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_substitution_strict_equiv)).
% 0.66/0.89 fof(axiom_m1, axiom, (axiom_m1<=>![X1, X2]:is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m1)).
% 0.66/0.89 fof(s1_0_modus_ponens_strict_implies, axiom, modus_ponens_strict_implies, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_modus_ponens_strict_implies)).
% 0.66/0.89 fof(s1_0_axiom_m5, axiom, axiom_m5, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m5)).
% 0.66/0.89 fof(axiom_m2, axiom, (axiom_m2<=>![X1, X2]:is_a_theorem(strict_implies(and(X1,X2),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m2)).
% 0.66/0.89 fof(s1_0_axiom_m1, axiom, axiom_m1, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m1)).
% 0.66/0.89 fof(s1_0_axiom_m2, axiom, axiom_m2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m2)).
% 0.66/0.89 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/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m3)).
% 0.66/0.89 fof(s1_0_axiom_m3, axiom, axiom_m3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m3)).
% 0.66/0.89 fof(axiom_m4, axiom, (axiom_m4<=>![X1]:is_a_theorem(strict_implies(X1,and(X1,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m4)).
% 0.66/0.89 fof(s1_0_axiom_m4, axiom, axiom_m4, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m4)).
% 0.66/0.89 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.66/0.89 fof(necessitation, axiom, (necessitation<=>![X1]:(is_a_theorem(X1)=>is_a_theorem(necessarily(X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', necessitation)).
% 0.66/0.89 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.66/0.89 fof(hilbert_modus_ponens, conjecture, modus_ponens, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_modus_ponens)).
% 0.66/0.89 fof(op_strict_implies, axiom, (op_strict_implies=>![X1, X2]:strict_implies(X1,X2)=necessarily(implies(X1,X2))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax', op_strict_implies)).
% 0.66/0.89 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.66/0.89 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_op_implies_and)).
% 0.66/0.89 fof(s1_0_op_strict_implies, axiom, op_strict_implies, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_strict_implies)).
% 0.66/0.89 fof(s1_0_op_or, axiom, op_or, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_or)).
% 0.66/0.89 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.66/0.89 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.66/0.89 fof(use_substitution_of_equivalents, axiom, substitution_of_equivalents, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', use_substitution_of_equivalents)).
% 0.66/0.89 fof(s1_0_op_equiv, axiom, op_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_equiv)).
% 0.66/0.89 fof(c_0_31, 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])])])])])).
% 0.66/0.89 fof(c_0_32, 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])])])).
% 0.66/0.89 fof(c_0_33, 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])])])])])).
% 0.66/0.89 cnf(c_0_34, plain, (is_a_theorem(and(X1,X2))|~adjunction|~is_a_theorem(X1)|~is_a_theorem(X2)), inference(split_conjunct,[status(thm)],[c_0_31])).
% 0.66/0.89 cnf(c_0_35, plain, (adjunction), inference(split_conjunct,[status(thm)],[s1_0_adjunction])).
% 0.66/0.89 cnf(c_0_36, plain, (strict_equiv(X1,X2)=and(strict_implies(X1,X2),strict_implies(X2,X1))|~op_strict_equiv), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.66/0.89 cnf(c_0_37, plain, (op_strict_equiv), inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv])).
% 0.66/0.89 fof(c_0_38, 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])])])])])).
% 0.66/0.89 fof(c_0_39, 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])])])])).
% 0.66/0.89 cnf(c_0_40, plain, (X1=X2|~substitution_strict_equiv|~is_a_theorem(strict_equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_33])).
% 0.66/0.89 cnf(c_0_41, plain, (substitution_strict_equiv), inference(split_conjunct,[status(thm)],[s1_0_substitution_strict_equiv])).
% 0.66/0.89 cnf(c_0_42, 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_34, c_0_35])])).
% 0.66/0.89 cnf(c_0_43, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36, c_0_37])])).
% 0.66/0.89 fof(c_0_44, 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])])])])).
% 0.66/0.89 cnf(c_0_45, 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_38])).
% 0.66/0.89 cnf(c_0_46, plain, (modus_ponens_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_modus_ponens_strict_implies])).
% 0.66/0.89 cnf(c_0_47, 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_39])).
% 0.66/0.89 cnf(c_0_48, plain, (axiom_m5), inference(split_conjunct,[status(thm)],[s1_0_axiom_m5])).
% 0.66/0.89 fof(c_0_49, 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])])])])).
% 0.66/0.89 cnf(c_0_50, plain, (X1=X2|~is_a_theorem(strict_equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])])).
% 0.66/0.89 cnf(c_0_51, 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_42, c_0_43])).
% 0.66/0.89 cnf(c_0_52, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|~axiom_m1), inference(split_conjunct,[status(thm)],[c_0_44])).
% 0.66/0.89 cnf(c_0_53, plain, (axiom_m1), inference(split_conjunct,[status(thm)],[s1_0_axiom_m1])).
% 0.66/0.89 cnf(c_0_54, 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_45, c_0_46])])).
% 0.66/0.89 cnf(c_0_55, 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_47, c_0_48])])).
% 0.66/0.89 cnf(c_0_56, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))|~axiom_m2), inference(split_conjunct,[status(thm)],[c_0_49])).
% 0.66/0.89 cnf(c_0_57, plain, (axiom_m2), inference(split_conjunct,[status(thm)],[s1_0_axiom_m2])).
% 0.66/0.89 cnf(c_0_58, plain, (X1=X2|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_50, c_0_51])).
% 0.66/0.89 cnf(c_0_59, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52, c_0_53])])).
% 0.66/0.89 cnf(c_0_60, 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_54, c_0_55])).
% 0.66/0.89 cnf(c_0_61, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56, c_0_57])])).
% 0.66/0.89 cnf(c_0_62, plain, (and(X1,X2)=and(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_59])])).
% 0.66/0.89 fof(c_0_63, 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])])])])).
% 0.66/0.89 cnf(c_0_64, 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_60, c_0_42])).
% 0.66/0.89 cnf(c_0_65, plain, (is_a_theorem(strict_implies(and(X1,X2),X2))), inference(spm,[status(thm)],[c_0_61, c_0_62])).
% 0.66/0.89 cnf(c_0_66, 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_63])).
% 0.66/0.89 cnf(c_0_67, plain, (axiom_m3), inference(split_conjunct,[status(thm)],[s1_0_axiom_m3])).
% 0.66/0.89 cnf(c_0_68, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,and(X3,X2)))), inference(spm,[status(thm)],[c_0_64, c_0_65])).
% 0.66/0.89 cnf(c_0_69, 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_66, c_0_67])])).
% 0.66/0.89 fof(c_0_70, 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])])])])).
% 0.66/0.89 cnf(c_0_71, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X2,X3)))), inference(spm,[status(thm)],[c_0_68, c_0_69])).
% 0.66/0.89 cnf(c_0_72, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))|~axiom_m4), inference(split_conjunct,[status(thm)],[c_0_70])).
% 0.66/0.89 cnf(c_0_73, plain, (axiom_m4), inference(split_conjunct,[status(thm)],[s1_0_axiom_m4])).
% 0.66/0.89 cnf(c_0_74, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(and(X3,X1),X2))), inference(spm,[status(thm)],[c_0_54, c_0_71])).
% 0.66/0.89 cnf(c_0_75, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72, c_0_73])])).
% 0.66/0.89 fof(c_0_76, 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])])])).
% 0.66/0.89 cnf(c_0_77, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(X3,X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_74, c_0_42])).
% 0.66/0.89 cnf(c_0_78, plain, (and(X1,X1)=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_75]), c_0_61])])).
% 0.66/0.89 fof(c_0_79, plain, ![X237]:((~necessitation|(~is_a_theorem(X237)|is_a_theorem(necessarily(X237))))&((is_a_theorem(esk56_0)|necessitation)&(~is_a_theorem(necessarily(esk56_0))|necessitation))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[necessitation])])])])])).
% 0.66/0.89 fof(c_0_80, plain, ![X117, X118]:((~modus_ponens|(~is_a_theorem(X117)|~is_a_theorem(implies(X117,X118))|is_a_theorem(X118)))&(((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.66/0.89 fof(c_0_81, negated_conjecture, ~modus_ponens, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_modus_ponens])])).
% 0.66/0.89 fof(c_0_82, 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])])])).
% 0.66/0.89 fof(c_0_83, 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])])])).
% 0.66/0.89 cnf(c_0_84, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_76])).
% 0.66/0.89 cnf(c_0_85, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])).
% 0.66/0.89 cnf(c_0_86, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(and(X1,X3),X2))), inference(spm,[status(thm)],[c_0_74, c_0_62])).
% 0.66/0.89 cnf(c_0_87, 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_77, c_0_43])).
% 0.66/0.90 cnf(c_0_88, plain, (strict_equiv(X1,X1)=strict_implies(X1,X1)), inference(spm,[status(thm)],[c_0_43, c_0_78])).
% 0.66/0.90 cnf(c_0_89, plain, (is_a_theorem(strict_implies(X1,X1))), inference(rw,[status(thm)],[c_0_75, c_0_78])).
% 0.66/0.90 cnf(c_0_90, plain, (is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1)), inference(split_conjunct,[status(thm)],[c_0_79])).
% 0.66/0.90 cnf(c_0_91, plain, (is_a_theorem(esk56_0)|necessitation), inference(split_conjunct,[status(thm)],[c_0_79])).
% 0.66/0.90 cnf(c_0_92, plain, (is_a_theorem(implies(esk1_0,esk2_0))|modus_ponens), inference(split_conjunct,[status(thm)],[c_0_80])).
% 0.66/0.90 cnf(c_0_93, negated_conjecture, (~modus_ponens), inference(split_conjunct,[status(thm)],[c_0_81])).
% 0.66/0.90 cnf(c_0_94, plain, (strict_implies(X1,X2)=necessarily(implies(X1,X2))|~op_strict_implies), inference(split_conjunct,[status(thm)],[c_0_82])).
% 0.66/0.90 cnf(c_0_95, plain, (op_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies])).
% 0.66/0.90 cnf(c_0_96, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_83])).
% 0.66/0.90 cnf(c_0_97, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84, c_0_85])])).
% 0.66/0.90 cnf(c_0_98, plain, (op_or), inference(split_conjunct,[status(thm)],[s1_0_op_or])).
% 0.66/0.90 cnf(c_0_99, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,and(X1,X3)))), inference(spm,[status(thm)],[c_0_86, c_0_62])).
% 0.66/0.90 cnf(c_0_100, 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_87, c_0_88]), c_0_89])])).
% 0.66/0.90 cnf(c_0_101, plain, (is_a_theorem(necessarily(X1))|is_a_theorem(esk56_0)|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_90, c_0_91])).
% 0.66/0.90 cnf(c_0_102, plain, (is_a_theorem(implies(esk1_0,esk2_0))), inference(sr,[status(thm)],[c_0_92, c_0_93])).
% 0.66/0.90 cnf(c_0_103, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94, c_0_95])])).
% 0.66/0.90 cnf(c_0_104, plain, (is_a_theorem(esk1_0)|modus_ponens), inference(split_conjunct,[status(thm)],[c_0_80])).
% 0.66/0.90 cnf(c_0_105, plain, (modus_ponens|~is_a_theorem(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_80])).
% 0.66/0.90 cnf(c_0_106, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_96, c_0_97]), c_0_98])])).
% 0.66/0.90 cnf(c_0_107, plain, (not(and(not(X1),X2))=implies(X2,X1)), inference(spm,[status(thm)],[c_0_97, c_0_62])).
% 0.66/0.90 cnf(c_0_108, plain, (is_a_theorem(and(X1,strict_implies(X2,X2)))|~is_a_theorem(and(X1,X3))), inference(spm,[status(thm)],[c_0_99, c_0_100])).
% 0.66/0.90 cnf(c_0_109, plain, (is_a_theorem(strict_implies(esk1_0,esk2_0))|is_a_theorem(esk56_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101, c_0_102]), c_0_103])).
% 0.66/0.90 cnf(c_0_110, plain, (is_a_theorem(esk1_0)), inference(sr,[status(thm)],[c_0_104, c_0_93])).
% 0.66/0.90 cnf(c_0_111, plain, (~is_a_theorem(esk2_0)), inference(sr,[status(thm)],[c_0_105, c_0_93])).
% 0.66/0.90 cnf(c_0_112, plain, (necessarily(or(X1,X2))=strict_implies(not(X1),X2)), inference(spm,[status(thm)],[c_0_103, c_0_106])).
% 0.66/0.90 cnf(c_0_113, plain, (or(X1,X2)=or(X2,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97, c_0_107]), c_0_106]), c_0_106])).
% 0.66/0.90 cnf(c_0_114, plain, (is_a_theorem(and(strict_implies(X1,X1),strict_implies(X2,X2)))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_108, c_0_100])).
% 0.66/0.90 cnf(c_0_115, plain, (is_a_theorem(esk56_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_109]), c_0_110])]), c_0_111])).
% 0.66/0.90 cnf(c_0_116, plain, (strict_implies(not(X1),X2)=strict_implies(not(X2),X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112, c_0_113]), c_0_112])).
% 0.66/0.90 cnf(c_0_117, plain, (not(not(X1))=or(X1,X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97, c_0_78]), c_0_106])).
% 0.66/0.90 cnf(c_0_118, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(X2,X1))), inference(spm,[status(thm)],[c_0_54, c_0_59])).
% 0.66/0.90 cnf(c_0_119, plain, (is_a_theorem(and(strict_implies(X1,X1),strict_implies(X2,X2)))), inference(spm,[status(thm)],[c_0_114, c_0_115])).
% 0.66/0.90 cnf(c_0_120, plain, (strict_implies(not(X1),not(X2))=strict_implies(or(X2,X2),X1)), inference(spm,[status(thm)],[c_0_116, c_0_117])).
% 0.66/0.90 cnf(c_0_121, 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_60, c_0_116])).
% 0.66/0.90 cnf(c_0_122, plain, (is_a_theorem(and(X1,strict_implies(X2,X2)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_118, c_0_100])).
% 0.66/0.90 cnf(c_0_123, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(and(X1,X3))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_77, c_0_62])).
% 0.66/0.90 cnf(c_0_124, plain, (is_a_theorem(and(strict_implies(or(X1,X1),X1),strict_implies(X2,X2)))), inference(spm,[status(thm)],[c_0_119, c_0_120])).
% 0.66/0.90 cnf(c_0_125, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_implies(not(and(X3,X2)),X1))), inference(spm,[status(thm)],[c_0_68, c_0_116])).
% 0.66/0.90 cnf(c_0_126, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,not(not(X2))))), inference(spm,[status(thm)],[c_0_121, c_0_122])).
% 0.66/0.90 cnf(c_0_127, plain, (is_a_theorem(and(strict_implies(or(X1,X1),X1),X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_123, c_0_124])).
% 0.66/0.90 cnf(c_0_128, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_implies(implies(X2,X3),X1))), inference(spm,[status(thm)],[c_0_125, c_0_107])).
% 0.66/0.90 cnf(c_0_129, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_126, c_0_117])).
% 0.66/0.90 cnf(c_0_130, plain, (is_a_theorem(strict_implies(or(X1,X1),X2))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_60, c_0_127])).
% 0.66/0.90 cnf(c_0_131, plain, (is_a_theorem(strict_implies(not(X1),implies(X1,X2)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128, c_0_89]), c_0_116])).
% 0.66/0.90 cnf(c_0_132, plain, (is_a_theorem(strict_implies(or(X1,X1),X2))|~is_a_theorem(strict_implies(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_129, c_0_130])).
% 0.66/0.90 cnf(c_0_133, plain, (is_a_theorem(strict_implies(or(X1,X1),or(X1,X2)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131, c_0_117]), c_0_106])).
% 0.66/0.90 cnf(c_0_134, 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_58, c_0_116])).
% 0.66/0.90 cnf(c_0_135, 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_132, c_0_133]), c_0_117]), c_0_116])).
% 0.66/0.90 fof(c_0_136, 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])])])])])).
% 0.66/0.90 fof(c_0_137, 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])])])).
% 0.66/0.90 cnf(c_0_138, plain, (not(not(X1))=X1|~is_a_theorem(strict_implies(X1,not(not(X1))))), inference(spm,[status(thm)],[c_0_134, c_0_89])).
% 0.66/0.90 cnf(c_0_139, plain, (is_a_theorem(strict_implies(not(X1),not(not(not(X1)))))), inference(spm,[status(thm)],[c_0_135, c_0_117])).
% 0.66/0.90 cnf(c_0_140, plain, (X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_136])).
% 0.66/0.90 cnf(c_0_141, plain, (substitution_of_equivalents), inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents])).
% 0.66/0.90 cnf(c_0_142, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv), inference(split_conjunct,[status(thm)],[c_0_137])).
% 0.66/0.90 cnf(c_0_143, plain, (op_equiv), inference(split_conjunct,[status(thm)],[s1_0_op_equiv])).
% 0.66/0.90 cnf(c_0_144, plain, (not(not(not(X1)))=not(X1)), inference(spm,[status(thm)],[c_0_138, c_0_139])).
% 0.66/0.90 cnf(c_0_145, plain, (X1=X2|~is_a_theorem(equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_140, c_0_141])])).
% 0.66/0.90 cnf(c_0_146, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_142, c_0_143])])).
% 0.66/0.90 cnf(c_0_147, plain, (is_a_theorem(strict_implies(not(X1),not(and(X2,X1))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125, c_0_89]), c_0_116])).
% 0.66/0.90 cnf(c_0_148, plain, (implies(X1,not(not(X2)))=implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97, c_0_144]), c_0_97])).
% 0.66/0.90 cnf(c_0_149, plain, (X1=X2|~is_a_theorem(and(implies(X1,X2),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_145, c_0_146])).
% 0.66/0.90 cnf(c_0_150, plain, (is_a_theorem(not(and(X1,X2)))|~is_a_theorem(not(X2))), inference(spm,[status(thm)],[c_0_54, c_0_147])).
% 0.66/0.90 cnf(c_0_151, plain, (strict_implies(X1,not(not(X2)))=strict_implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103, c_0_148]), c_0_103])).
% 0.66/0.90 cnf(c_0_152, plain, (X1=X2|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_149, c_0_42])).
% 0.66/0.90 cnf(c_0_153, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(not(not(X2)))), inference(spm,[status(thm)],[c_0_150, c_0_97])).
% 0.66/0.90 cnf(c_0_154, plain, (not(not(X1))=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_138, c_0_151]), c_0_89])])).
% 0.66/0.90 cnf(c_0_155, plain, (esk2_0=esk1_0|~is_a_theorem(implies(esk2_0,esk1_0))), inference(spm,[status(thm)],[c_0_152, c_0_102])).
% 0.66/0.90 cnf(c_0_156, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)), inference(rw,[status(thm)],[c_0_153, c_0_154])).
% 0.66/0.90 cnf(c_0_157, plain, (esk2_0=esk1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155, c_0_156]), c_0_110])])).
% 0.66/0.90 cnf(c_0_158, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_111, c_0_157]), c_0_110])]), ['proof']).
% 0.66/0.90 % SZS output end Proof
% 0.66/0.90 % User time : 0.349 s
% 0.66/0.90 % System time : 0.028 s
% 0.66/0.90 % Total time : 0.377 s
% 0.66/0.90
%------------------------------------------------------------------------------