%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL506+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n012.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:06 AM UTC 2026
% Result : Theorem 0.12s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL506+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.01 % Command : java -jar mcs_scs.jar %d %s
% 0.02/0.28 % Computer : n012.cluster.edu
% 0.02/0.28 % Model : x86_64 x86_64
% 0.02/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.28 % Memory : 8046.5625MB
% 0.02/0.28 % OS : Linux 6.8.0-71-generic
% 0.02/0.28 % CPULimit : 300
% 0.02/0.28 % WCLimit : 300
% 0.02/0.28 % DateTime : Fri Sep 4 22:27:27 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.02/0.35 start to proof:theBenchmark.p
% 0.12/0.38 % Version : CSI_E---1.1
% 0.12/0.38 % Problem : theBenchmark.p
% 0.12/0.38 % Proof found!
% 0.12/0.38 % SZS status Theorem for theBenchmark.p
% 0.12/0.38 % SZS output start Proof
% 0.12/0.38 fof(and_1, axiom, (and_1<=>![X1, X2]:is_a_theorem(implies(and(X1,X2),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', and_1)).
% 0.12/0.38 fof(hilbert_and_1, conjecture, and_1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_and_1)).
% 0.12/0.38 fof(kn2, axiom, (kn2<=>![X4, X5]:is_a_theorem(implies(and(X4,X5),X4))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', kn2)).
% 0.12/0.38 fof(rosser_kn2, axiom, kn2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax', rosser_kn2)).
% 0.12/0.38 fof(c_0_4, plain, ![X98, X99]:((~and_1|is_a_theorem(implies(and(X98,X99),X98)))&(~is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))|and_1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_1])])])])).
% 0.12/0.38 fof(c_0_5, negated_conjecture, ~and_1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_and_1])])).
% 0.12/0.38 fof(c_0_6, plain, ![X138, X139]:((~kn2|is_a_theorem(implies(and(X138,X139),X138)))&(~is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))|kn2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])])).
% 0.12/0.38 cnf(c_0_7, plain, (and_1|~is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.38 cnf(c_0_8, negated_conjecture, (~and_1), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.12/0.38 cnf(c_0_9, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.12/0.38 cnf(c_0_10, plain, (kn2), inference(split_conjunct,[status(thm)],[rosser_kn2])).
% 0.12/0.38 cnf(c_0_11, plain, (~is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))), inference(sr,[status(thm)],[c_0_7, c_0_8])).
% 0.12/0.38 cnf(c_0_12, plain, (is_a_theorem(implies(and(X1,X2),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
% 0.12/0.38 cnf(c_0_13, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])]), ['proof']).
% 0.12/0.38 % SZS output end Proof
% 0.12/0.38 % User time : 0.015 s
% 0.12/0.38 % System time : 0.004 s
% 0.12/0.38 % Total time : 0.019 s
% 0.12/0.38
%------------------------------------------------------------------------------