%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL469+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n007.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:03 AM UTC 2026
% Result : Theorem 0.24s 0.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL469+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 : n007.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 : Fri Sep 4 18:41:54 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.24/0.48 start to proof:theBenchmark.p
% 0.24/0.54 % Version : CSI_E---1.1
% 0.24/0.54 % Problem : theBenchmark.p
% 0.24/0.54 % Proof found!
% 0.24/0.54 % SZS status Theorem for theBenchmark.p
% 0.24/0.54 % SZS output start Proof
% 0.24/0.54 fof(op_implies_and, axiom, (op_implies_and=>![X1, X2]:implies(X1,X2)=not(and(X1,not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_implies_and)).
% 0.24/0.54 fof(cn2, axiom, (cn2<=>![X4, X5]:is_a_theorem(implies(X4,implies(not(X4),X5)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', cn2)).
% 0.24/0.54 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.24/0.54 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox/benchmark/theBenchmark.p', hilbert_op_implies_and)).
% 0.24/0.54 fof(or_1, axiom, (or_1<=>![X1, X2]:is_a_theorem(implies(X1,or(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', or_1)).
% 0.24/0.54 fof(hilbert_or_1, conjecture, or_1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', hilbert_or_1)).
% 0.24/0.54 fof(luka_cn2, axiom, cn2, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax', luka_cn2)).
% 0.24/0.54 fof(luka_op_or, axiom, op_or, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+3.ax', luka_op_or)).
% 0.24/0.54 fof(c_0_8, plain, ![X186, X187]:(~op_implies_and|implies(X186,X187)=not(and(X186,not(X187)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])).
% 0.24/0.54 fof(c_0_9, plain, ![X154, X155]:((~cn2|is_a_theorem(implies(X154,implies(not(X154),X155))))&(~is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))|cn2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])])).
% 0.24/0.54 fof(c_0_10, 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.24/0.54 cnf(c_0_11, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.54 cnf(c_0_12, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])).
% 0.24/0.54 fof(c_0_13, plain, ![X110, X111]:((~or_1|is_a_theorem(implies(X110,or(X110,X111))))&(~is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))|or_1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_1])])])])).
% 0.24/0.54 fof(c_0_14, negated_conjecture, ~or_1, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_or_1])])).
% 0.24/0.54 cnf(c_0_15, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.54 cnf(c_0_16, plain, (cn2), inference(split_conjunct,[status(thm)],[luka_cn2])).
% 0.24/0.54 cnf(c_0_17, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.24/0.54 cnf(c_0_18, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])])).
% 0.24/0.54 cnf(c_0_19, plain, (op_or), inference(split_conjunct,[status(thm)],[luka_op_or])).
% 0.24/0.54 cnf(c_0_20, plain, (or_1|~is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.24/0.54 cnf(c_0_21, negated_conjecture, (~or_1), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.24/0.54 cnf(c_0_22, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16])])).
% 0.24/0.54 cnf(c_0_23, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18]), c_0_19])])).
% 0.24/0.54 cnf(c_0_24, plain, (~is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))), inference(sr,[status(thm)],[c_0_20, c_0_21])).
% 0.24/0.54 cnf(c_0_25, plain, (is_a_theorem(implies(X1,or(X1,X2)))), inference(rw,[status(thm)],[c_0_22, c_0_23])).
% 0.24/0.54 cnf(c_0_26, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25])]), ['proof']).
% 0.24/0.54 % SZS output end Proof
% 0.24/0.54 % User time : 0.034 s
% 0.24/0.54 % System time : 0.006 s
% 0.24/0.54 % Total time : 0.040 s
% 0.24/0.54
%------------------------------------------------------------------------------