%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL498+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n027.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:05 AM UTC 2026
% Result : Theorem 0.45s 0.67s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL498+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.34 % Computer : n027.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 : Sun Sep 6 01:49:28 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.23/0.46 start to proof:theBenchmark.p
% 0.45/0.67 % Version : CSI_E---1.1
% 0.45/0.67 % Problem : theBenchmark.p
% 0.45/0.67 % Proof found!
% 0.45/0.67 % SZS status Theorem for theBenchmark.p
% 0.45/0.67 % SZS output start Proof
% 0.45/0.67 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.45/0.67 fof(r4, axiom, (r4<=>![X4, X5, X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r4)).
% 0.45/0.67 fof(principia_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_modus_ponens)).
% 0.45/0.67 fof(principia_r4, axiom, r4, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r4)).
% 0.45/0.67 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.45/0.67 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_op_implies_or)).
% 0.45/0.67 fof(r2, axiom, (r2<=>![X4, X5]:is_a_theorem(implies(X5,or(X4,X5)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r2)).
% 0.45/0.67 fof(r3, axiom, (r3<=>![X4, X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r3)).
% 0.45/0.67 fof(principia_r2, axiom, r2, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r2)).
% 0.45/0.67 fof(principia_r3, axiom, r3, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r3)).
% 0.45/0.67 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.45/0.67 fof(r5, axiom, (r5<=>![X4, X5, X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r5)).
% 0.45/0.67 fof(principia_op_and, axiom, op_and, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_op_and)).
% 0.45/0.67 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.45/0.67 fof(principia_r5, axiom, r5, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r5)).
% 0.45/0.67 fof(luka_op_or, axiom, op_or, file('/export/starexec/sandbox/benchmark/theBenchmark.p', luka_op_or)).
% 0.45/0.67 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.45/0.67 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.45/0.67 fof(principia_op_equiv, axiom, op_equiv, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_op_equiv)).
% 0.45/0.67 fof(r1, axiom, (r1<=>![X4]:is_a_theorem(implies(or(X4,X4),X4))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r1)).
% 0.45/0.67 fof(use_substitution_of_equivalents, axiom, substitution_of_equivalents, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', use_substitution_of_equivalents)).
% 0.45/0.67 fof(principia_r1, axiom, r1, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r1)).
% 0.45/0.67 fof(cn3, axiom, (cn3<=>![X4]:is_a_theorem(implies(implies(not(X4),X4),X4))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', cn3)).
% 0.45/0.67 fof(luka_cn3, conjecture, cn3, file('/export/starexec/sandbox/benchmark/theBenchmark.p', luka_cn3)).
% 0.45/0.67 fof(c_0_24, 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.45/0.67 fof(c_0_25, plain, ![X170, X171, X172]:((~r4|is_a_theorem(implies(or(X170,or(X171,X172)),or(X171,or(X170,X172)))))&(~is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))|r4)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])])).
% 0.45/0.67 cnf(c_0_26, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.45/0.67 cnf(c_0_27, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[principia_modus_ponens])).
% 0.45/0.67 cnf(c_0_28, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.45/0.67 cnf(c_0_29, plain, (r4), inference(split_conjunct,[status(thm)],[principia_r4])).
% 0.45/0.67 fof(c_0_30, 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.45/0.67 cnf(c_0_31, 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_26, c_0_27])])).
% 0.45/0.67 cnf(c_0_32, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])])).
% 0.45/0.67 cnf(c_0_33, plain, (implies(X1,X2)=or(not(X1),X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_30])).
% 0.45/0.67 cnf(c_0_34, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])).
% 0.45/0.67 fof(c_0_35, plain, ![X162, X163]:((~r2|is_a_theorem(implies(X163,or(X162,X163))))&(~is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))|r2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])])).
% 0.45/0.67 fof(c_0_36, plain, ![X166, X167]:((~r3|is_a_theorem(implies(or(X166,X167),or(X167,X166))))&(~is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))|r3)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])).
% 0.45/0.67 cnf(c_0_37, plain, (is_a_theorem(or(X1,or(X2,X3)))|~is_a_theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 0.45/0.67 cnf(c_0_38, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_34])])).
% 0.45/0.67 cnf(c_0_39, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2), inference(split_conjunct,[status(thm)],[c_0_35])).
% 0.45/0.67 cnf(c_0_40, plain, (r2), inference(split_conjunct,[status(thm)],[principia_r2])).
% 0.45/0.67 cnf(c_0_41, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3), inference(split_conjunct,[status(thm)],[c_0_36])).
% 0.45/0.67 cnf(c_0_42, plain, (r3), inference(split_conjunct,[status(thm)],[principia_r3])).
% 0.45/0.67 cnf(c_0_43, plain, (is_a_theorem(implies(X1,or(X2,X3)))|~is_a_theorem(or(X2,implies(X1,X3)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_38])).
% 0.45/0.67 cnf(c_0_44, plain, (is_a_theorem(implies(X1,or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_40])])).
% 0.45/0.67 cnf(c_0_45, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_42])])).
% 0.45/0.67 cnf(c_0_46, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(X2,implies(X1,X3)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_38]), c_0_38])).
% 0.45/0.67 cnf(c_0_47, plain, (is_a_theorem(implies(X1,implies(X2,X1)))), inference(spm,[status(thm)],[c_0_44, c_0_38])).
% 0.45/0.67 cnf(c_0_48, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_31, c_0_45])).
% 0.45/0.67 cnf(c_0_49, plain, (is_a_theorem(implies(X1,implies(X2,X2)))), inference(spm,[status(thm)],[c_0_46, c_0_47])).
% 0.45/0.67 cnf(c_0_50, plain, (is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))), inference(spm,[status(thm)],[c_0_48, c_0_38])).
% 0.45/0.67 cnf(c_0_51, plain, (is_a_theorem(implies(X1,X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_31, c_0_49])).
% 0.45/0.67 cnf(c_0_52, plain, (is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))), inference(spm,[status(thm)],[c_0_50, c_0_38])).
% 0.45/0.67 cnf(c_0_53, plain, (is_a_theorem(implies(X1,X1))), inference(spm,[status(thm)],[c_0_51, c_0_32])).
% 0.45/0.67 fof(c_0_54, 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.45/0.67 fof(c_0_55, plain, ![X176, X177, X178]:((~r5|is_a_theorem(implies(implies(X177,X178),implies(or(X176,X177),or(X176,X178)))))&(~is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))|r5)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])).
% 0.45/0.67 cnf(c_0_56, plain, (is_a_theorem(implies(X1,not(not(X1))))), inference(spm,[status(thm)],[c_0_52, c_0_53])).
% 0.45/0.67 cnf(c_0_57, plain, (and(X1,X2)=not(or(not(X1),not(X2)))|~op_and), inference(split_conjunct,[status(thm)],[c_0_54])).
% 0.45/0.67 cnf(c_0_58, plain, (op_and), inference(split_conjunct,[status(thm)],[principia_op_and])).
% 0.45/0.67 fof(c_0_59, 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.45/0.67 cnf(c_0_60, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5), inference(split_conjunct,[status(thm)],[c_0_55])).
% 0.45/0.67 cnf(c_0_61, plain, (r5), inference(split_conjunct,[status(thm)],[principia_r5])).
% 0.45/0.67 cnf(c_0_62, plain, (is_a_theorem(not(not(X1)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_31, c_0_56])).
% 0.45/0.67 cnf(c_0_63, plain, (not(implies(X1,not(X2)))=and(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57, c_0_38]), c_0_58])])).
% 0.45/0.67 cnf(c_0_64, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_59])).
% 0.45/0.67 cnf(c_0_65, plain, (op_or), inference(split_conjunct,[status(thm)],[luka_op_or])).
% 0.45/0.67 cnf(c_0_66, plain, (is_a_theorem(implies(X1,implies(implies(X1,X2),X2)))), inference(spm,[status(thm)],[c_0_46, c_0_53])).
% 0.45/0.67 cnf(c_0_67, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60, c_0_61])])).
% 0.45/0.67 cnf(c_0_68, plain, (is_a_theorem(not(and(X1,X2)))|~is_a_theorem(implies(X1,not(X2)))), inference(spm,[status(thm)],[c_0_62, c_0_63])).
% 0.45/0.67 cnf(c_0_69, plain, (not(and(not(X1),not(X2)))=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64, c_0_65])])).
% 0.45/0.67 cnf(c_0_70, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_31, c_0_66])).
% 0.45/0.67 fof(c_0_71, 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.45/0.67 cnf(c_0_72, plain, (is_a_theorem(implies(or(X1,X2),or(X1,X3)))|~is_a_theorem(implies(X2,X3))), inference(spm,[status(thm)],[c_0_31, c_0_67])).
% 0.45/0.67 cnf(c_0_73, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(implies(not(X1),not(not(X2))))), inference(spm,[status(thm)],[c_0_68, c_0_69])).
% 0.45/0.67 fof(c_0_74, 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.45/0.67 cnf(c_0_75, plain, (is_a_theorem(implies(X1,and(X2,X1)))|~is_a_theorem(X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_70]), c_0_63])).
% 0.45/0.67 cnf(c_0_76, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv), inference(split_conjunct,[status(thm)],[c_0_71])).
% 0.45/0.67 cnf(c_0_77, plain, (op_equiv), inference(split_conjunct,[status(thm)],[principia_op_equiv])).
% 0.45/0.67 fof(c_0_78, 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.45/0.67 cnf(c_0_79, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X1,X3))|~is_a_theorem(implies(X3,X2))), inference(spm,[status(thm)],[c_0_31, c_0_72])).
% 0.45/0.67 cnf(c_0_80, plain, (is_a_theorem(or(X1,not(X1)))), inference(spm,[status(thm)],[c_0_73, c_0_56])).
% 0.45/0.67 cnf(c_0_81, plain, (X1=X2|~substitution_of_equivalents|~is_a_theorem(equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_74])).
% 0.45/0.67 cnf(c_0_82, plain, (substitution_of_equivalents), inference(split_conjunct,[status(thm)],[use_substitution_of_equivalents])).
% 0.45/0.67 cnf(c_0_83, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_31, c_0_75])).
% 0.45/0.67 cnf(c_0_84, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76, c_0_77])])).
% 0.45/0.67 cnf(c_0_85, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1), inference(split_conjunct,[status(thm)],[c_0_78])).
% 0.45/0.67 cnf(c_0_86, plain, (r1), inference(split_conjunct,[status(thm)],[principia_r1])).
% 0.45/0.67 cnf(c_0_87, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,X3))|~is_a_theorem(implies(X3,X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79, c_0_38]), c_0_38])).
% 0.45/0.67 cnf(c_0_88, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(implies(not(X1),X2))), inference(spm,[status(thm)],[c_0_79, c_0_80])).
% 0.45/0.67 cnf(c_0_89, plain, (X1=X2|~is_a_theorem(equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81, c_0_82])])).
% 0.45/0.67 cnf(c_0_90, plain, (is_a_theorem(equiv(X1,X2))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_83, c_0_84])).
% 0.45/0.67 cnf(c_0_91, plain, (is_a_theorem(implies(or(X1,X1),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85, c_0_86])])).
% 0.45/0.67 cnf(c_0_92, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(or(X3,X1),X2))), inference(spm,[status(thm)],[c_0_87, c_0_44])).
% 0.45/0.67 cnf(c_0_93, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_45, c_0_38])).
% 0.45/0.67 cnf(c_0_94, plain, (is_a_theorem(or(X1,not(not(not(X1)))))), inference(spm,[status(thm)],[c_0_88, c_0_56])).
% 0.45/0.67 fof(c_0_95, 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.45/0.67 fof(c_0_96, negated_conjecture, ~cn3, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[luka_cn3])])).
% 0.45/0.67 cnf(c_0_97, plain, (X1=X2|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_89, c_0_90])).
% 0.45/0.67 cnf(c_0_98, plain, (is_a_theorem(implies(implies(X1,not(X1)),not(X1)))), inference(spm,[status(thm)],[c_0_91, c_0_38])).
% 0.45/0.67 cnf(c_0_99, plain, (is_a_theorem(implies(not(X1),implies(X1,X2)))), inference(spm,[status(thm)],[c_0_92, c_0_93])).
% 0.45/0.67 cnf(c_0_100, plain, (is_a_theorem(implies(not(not(X1)),X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_94]), c_0_38])).
% 0.45/0.67 cnf(c_0_101, plain, (cn3|~is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0))), inference(split_conjunct,[status(thm)],[c_0_95])).
% 0.45/0.67 cnf(c_0_102, negated_conjecture, (~cn3), inference(split_conjunct,[status(thm)],[c_0_96])).
% 0.45/0.67 cnf(c_0_103, plain, (implies(X1,not(X1))=not(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97, c_0_98]), c_0_99])])).
% 0.45/0.67 cnf(c_0_104, plain, (not(not(X1))=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97, c_0_100]), c_0_56])])).
% 0.45/0.67 cnf(c_0_105, plain, (~is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0))), inference(sr,[status(thm)],[c_0_101, c_0_102])).
% 0.45/0.67 cnf(c_0_106, plain, (implies(not(X1),X1)=X1), inference(spm,[status(thm)],[c_0_103, c_0_104])).
% 0.45/0.67 cnf(c_0_107, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_105, c_0_106]), c_0_53])]), ['proof']).
% 0.45/0.67 % SZS output end Proof
% 0.45/0.67 % User time : 0.171 s
% 0.45/0.67 % System time : 0.009 s
% 0.45/0.67 % Total time : 0.180 s
% 0.45/0.67
%------------------------------------------------------------------------------