%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n026.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.26s 0.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.34 % Computer : n026.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 4 14:32:55 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.26/0.47 start to proof:theBenchmark.p
% 0.26/0.53 % Version : CSI_E---1.1
% 0.26/0.53 % Problem : theBenchmark.p
% 0.26/0.53 % Proof found!
% 0.26/0.53 % SZS status Theorem for theBenchmark.p
% 0.26/0.53 % SZS output start Proof
% 0.26/0.53 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.26/0.53 fof(implies_2, axiom, (implies_2<=>![X1, X2]:is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', implies_2)).
% 0.26/0.53 fof(hilbert_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax', hilbert_modus_ponens)).
% 0.26/0.53 fof(hilbert_implies_2, axiom, implies_2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax', hilbert_implies_2)).
% 0.26/0.53 fof(and_3, axiom, (and_3<=>![X1, X2]:is_a_theorem(implies(X1,implies(X2,and(X1,X2))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', and_3)).
% 0.26/0.53 fof(kn1, axiom, (kn1<=>![X4]:is_a_theorem(implies(X4,and(X4,X4)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', kn1)).
% 0.26/0.53 fof(rosser_kn1, conjecture, kn1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rosser_kn1)).
% 0.26/0.53 fof(hilbert_and_3, axiom, and_3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax', hilbert_and_3)).
% 0.26/0.53 fof(c_0_8, 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.26/0.53 fof(c_0_9, plain, ![X88, X89]:((~implies_2|is_a_theorem(implies(implies(X88,implies(X88,X89)),implies(X88,X89))))&(~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))|implies_2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])])).
% 0.26/0.53 cnf(c_0_10, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.26/0.53 cnf(c_0_11, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[hilbert_modus_ponens])).
% 0.26/0.53 cnf(c_0_12, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.26/0.53 cnf(c_0_13, plain, (implies_2), inference(split_conjunct,[status(thm)],[hilbert_implies_2])).
% 0.26/0.53 fof(c_0_14, plain, ![X106, X107]:((~and_3|is_a_theorem(implies(X106,implies(X107,and(X106,X107)))))&(~is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))|and_3)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])])).
% 0.26/0.53 fof(c_0_15, 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.26/0.53 fof(c_0_16, negated_conjecture, ~kn1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[rosser_kn1])])).
% 0.26/0.53 cnf(c_0_17, 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_10, c_0_11])])).
% 0.26/0.53 cnf(c_0_18, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])])).
% 0.26/0.53 cnf(c_0_19, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.26/0.53 cnf(c_0_20, plain, (and_3), inference(split_conjunct,[status(thm)],[hilbert_and_3])).
% 0.26/0.53 cnf(c_0_21, plain, (kn1|~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.26/0.53 cnf(c_0_22, negated_conjecture, (~kn1), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.26/0.53 cnf(c_0_23, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.26/0.53 cnf(c_0_24, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])])).
% 0.26/0.53 cnf(c_0_25, plain, (~is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))), inference(sr,[status(thm)],[c_0_21, c_0_22])).
% 0.26/0.53 cnf(c_0_26, plain, (is_a_theorem(implies(X1,and(X1,X1)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.26/0.53 cnf(c_0_27, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])]), ['proof']).
% 0.26/0.53 % SZS output end Proof
% 0.26/0.53 % User time : 0.038 s
% 0.26/0.53 % System time : 0.007 s
% 0.26/0.53 % Total time : 0.045 s
% 0.26/0.53
%------------------------------------------------------------------------------