%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL483+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n017.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:04 AM UTC 2026
% Result : Theorem 0.41s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL483+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.35 % Computer : n017.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 10:25:06 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.23/0.47 start to proof:theBenchmark.p
% 0.41/0.58 % Version : CSI_E---1.1
% 0.41/0.58 % Problem : theBenchmark.p
% 0.41/0.58 % Proof found!
% 0.41/0.58 % SZS status Theorem for theBenchmark.p
% 0.41/0.58 % SZS output start Proof
% 0.41/0.58 fof(op_implies_and, axiom, (op_implies_and=>![X1, X2]:implies(X1,X2)=not(and(X1,not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_implies_and)).
% 0.41/0.58 fof(modus_tollens, axiom, (modus_tollens<=>![X1, X2]:is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', modus_tollens)).
% 0.41/0.58 fof(hilbert_modus_tollens, conjecture, modus_tollens, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_modus_tollens)).
% 0.41/0.58 fof(op_or, axiom, (op_or=>![X1, X2]:or(X1,X2)=not(and(not(X1),not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_or)).
% 0.41/0.58 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_op_implies_and)).
% 0.41/0.58 fof(r3, axiom, (r3<=>![X4, X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', r3)).
% 0.41/0.58 fof(op_implies_or, axiom, (op_implies_or=>![X1, X2]:implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_implies_or)).
% 0.41/0.58 fof(hilbert_op_or, axiom, op_or, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_op_or)).
% 0.41/0.58 fof(principia_r3, axiom, r3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_r3)).
% 0.41/0.58 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_op_implies_or)).
% 0.41/0.58 fof(c_0_10, 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.41/0.58 fof(c_0_11, plain, ![X80, X81]:((~modus_tollens|is_a_theorem(implies(implies(not(X81),not(X80)),implies(X80,X81))))&(~is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))|modus_tollens)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])])).
% 0.41/0.58 fof(c_0_12, negated_conjecture, ~modus_tollens, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_modus_tollens])])).
% 0.41/0.58 fof(c_0_13, 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.41/0.58 cnf(c_0_14, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.41/0.58 cnf(c_0_15, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])).
% 0.41/0.58 fof(c_0_16, 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.41/0.58 fof(c_0_17, 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.41/0.58 cnf(c_0_18, plain, (modus_tollens|~is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.41/0.58 cnf(c_0_19, negated_conjecture, (~modus_tollens), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.41/0.58 cnf(c_0_20, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.41/0.58 cnf(c_0_21, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])])).
% 0.41/0.58 cnf(c_0_22, plain, (op_or), inference(split_conjunct,[status(thm)],[hilbert_op_or])).
% 0.41/0.58 cnf(c_0_23, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.41/0.58 cnf(c_0_24, plain, (r3), inference(split_conjunct,[status(thm)],[principia_r3])).
% 0.41/0.58 cnf(c_0_25, plain, (implies(X1,X2)=or(not(X1),X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_17])).
% 0.41/0.58 cnf(c_0_26, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])).
% 0.41/0.58 cnf(c_0_27, plain, (~is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))), inference(sr,[status(thm)],[c_0_18, c_0_19])).
% 0.41/0.58 cnf(c_0_28, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_21]), c_0_22])])).
% 0.41/0.58 cnf(c_0_29, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])).
% 0.41/0.58 cnf(c_0_30, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
% 0.41/0.58 cnf(c_0_31, plain, (~is_a_theorem(implies(or(esk6_0,not(esk5_0)),implies(esk5_0,esk6_0)))), inference(rw,[status(thm)],[c_0_27, c_0_28])).
% 0.41/0.58 cnf(c_0_32, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 0.41/0.58 cnf(c_0_33, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])]), ['proof']).
% 0.41/0.58 % SZS output end Proof
% 0.41/0.58 % User time : 0.092 s
% 0.41/0.58 % System time : 0.006 s
% 0.41/0.58 % Total time : 0.098 s
% 0.41/0.58
%------------------------------------------------------------------------------