%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n019.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.52s 0.71s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL499+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : java -jar mcs_scs.jar %d %s
% 0.16/0.41 % Computer : n019.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sat Sep 5 02:53:53 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.28/0.58 start to proof:theBenchmark.p
% 0.52/0.71 % Version : CSI_E---1.1
% 0.52/0.71 % Problem : theBenchmark.p
% 0.52/0.71 % Proof found!
% 0.52/0.71 % SZS status Theorem for theBenchmark.p
% 0.52/0.71 % SZS output start Proof
% 0.52/0.71 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.52/0.71 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.52/0.71 fof(principia_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_modus_ponens)).
% 0.52/0.71 fof(principia_r3, axiom, r3, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r3)).
% 0.52/0.71 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.52/0.71 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_op_implies_or)).
% 0.52/0.71 fof(r1, axiom, (r1<=>![X4]:is_a_theorem(implies(or(X4,X4),X4))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r1)).
% 0.52/0.71 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.52/0.71 fof(kn1, axiom, (kn1<=>![X4]:is_a_theorem(implies(X4,and(X4,X4)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', kn1)).
% 0.52/0.71 fof(rosser_kn1, conjecture, kn1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', rosser_kn1)).
% 0.52/0.71 fof(principia_r1, axiom, r1, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_r1)).
% 0.52/0.71 fof(principia_op_and, axiom, op_and, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax', principia_op_and)).
% 0.52/0.71 fof(c_0_12, 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.52/0.71 fof(c_0_13, 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.52/0.71 cnf(c_0_14, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.52/0.71 cnf(c_0_15, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[principia_modus_ponens])).
% 0.52/0.71 cnf(c_0_16, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.52/0.71 cnf(c_0_17, plain, (r3), inference(split_conjunct,[status(thm)],[principia_r3])).
% 0.52/0.71 fof(c_0_18, 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.52/0.71 cnf(c_0_19, 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_14, c_0_15])])).
% 0.52/0.71 cnf(c_0_20, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])])).
% 0.52/0.71 cnf(c_0_21, plain, (implies(X1,X2)=or(not(X1),X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_18])).
% 0.52/0.71 cnf(c_0_22, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])).
% 0.52/0.71 cnf(c_0_23, plain, (is_a_theorem(or(X1,X2))|~is_a_theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.52/0.71 cnf(c_0_24, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22])])).
% 0.52/0.71 fof(c_0_25, 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.52/0.71 fof(c_0_26, 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.52/0.71 fof(c_0_27, 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.52/0.71 fof(c_0_28, negated_conjecture, ~kn1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[rosser_kn1])])).
% 0.52/0.71 cnf(c_0_29, plain, (is_a_theorem(or(X1,not(X2)))|~is_a_theorem(implies(X2,X1))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.52/0.71 cnf(c_0_30, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.52/0.71 cnf(c_0_31, plain, (r1), inference(split_conjunct,[status(thm)],[principia_r1])).
% 0.52/0.71 cnf(c_0_32, plain, (and(X1,X2)=not(or(not(X1),not(X2)))|~op_and), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.52/0.71 cnf(c_0_33, plain, (op_and), inference(split_conjunct,[status(thm)],[principia_op_and])).
% 0.52/0.71 cnf(c_0_34, plain, (kn1|~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.52/0.71 cnf(c_0_35, negated_conjecture, (~kn1), inference(split_conjunct,[status(thm)],[c_0_28])).
% 0.52/0.71 cnf(c_0_36, plain, (is_a_theorem(implies(X1,not(X2)))|~is_a_theorem(implies(X2,not(X1)))), inference(spm,[status(thm)],[c_0_29, c_0_24])).
% 0.52/0.71 cnf(c_0_37, plain, (is_a_theorem(implies(or(X1,X1),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_31])])).
% 0.52/0.71 cnf(c_0_38, 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_24]), c_0_33])])).
% 0.52/0.71 cnf(c_0_39, plain, (~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))), inference(sr,[status(thm)],[c_0_34, c_0_35])).
% 0.52/0.71 cnf(c_0_40, plain, (is_a_theorem(implies(X1,and(X1,X1)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_24]), c_0_38])).
% 0.52/0.71 cnf(c_0_41, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_40])]), ['proof']).
% 0.52/0.71 % SZS output end Proof
% 0.52/0.71 % User time : 0.092 s
% 0.52/0.71 % System time : 0.008 s
% 0.52/0.71 % Total time : 0.100 s
% 0.52/0.71
%------------------------------------------------------------------------------