%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n001.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.24s 0.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.10/0.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 5 17:18:47 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.24/0.47 start to proof:theBenchmark.p
% 0.24/0.53 % Version : CSI_E---1.1
% 0.24/0.53 % Problem : theBenchmark.p
% 0.24/0.53 % Proof found!
% 0.24/0.53 % SZS status Theorem for theBenchmark.p
% 0.24/0.53 % SZS output start Proof
% 0.24/0.53 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.24/0.53 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.24/0.53 fof(equivalence_1, axiom, (equivalence_1<=>![X1, X2]:is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', equivalence_1)).
% 0.24/0.53 fof(hilbert_equivalence_1, conjecture, equivalence_1, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_equivalence_1)).
% 0.24/0.53 fof(rosser_kn2, axiom, kn2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax', rosser_kn2)).
% 0.24/0.53 fof(rosser_op_equiv, axiom, op_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax', rosser_op_equiv)).
% 0.24/0.53 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.24/0.53 fof(c_0_7, 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.24/0.53 fof(c_0_8, plain, ![X124, X125]:((~equivalence_1|is_a_theorem(implies(equiv(X124,X125),implies(X124,X125))))&(~is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0)))|equivalence_1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_1])])])])).
% 0.24/0.53 fof(c_0_9, negated_conjecture, ~equivalence_1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_equivalence_1])])).
% 0.24/0.53 cnf(c_0_10, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.24/0.53 cnf(c_0_11, plain, (kn2), inference(split_conjunct,[status(thm)],[rosser_kn2])).
% 0.24/0.53 cnf(c_0_12, plain, (equiv(X1,X2)=and(implies(X1,X2),implies(X2,X1))|~op_equiv), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.24/0.53 cnf(c_0_13, plain, (op_equiv), inference(split_conjunct,[status(thm)],[rosser_op_equiv])).
% 0.24/0.53 cnf(c_0_14, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.53 cnf(c_0_15, negated_conjecture, (~equivalence_1), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.53 cnf(c_0_16, plain, (is_a_theorem(implies(and(X1,X2),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])).
% 0.24/0.53 cnf(c_0_17, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])])).
% 0.24/0.53 cnf(c_0_18, plain, (~is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0)))), inference(sr,[status(thm)],[c_0_14, c_0_15])).
% 0.24/0.53 cnf(c_0_19, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.24/0.53 cnf(c_0_20, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19])]), ['proof']).
% 0.24/0.53 % SZS output end Proof
% 0.24/0.53 % User time : 0.037 s
% 0.24/0.53 % System time : 0.006 s
% 0.24/0.53 % Total time : 0.043 s
% 0.24/0.53
%------------------------------------------------------------------------------