%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL448+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n014.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:01 AM UTC 2026
% Result : Theorem 150.60s 150.63s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL448+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.35 % Computer : n014.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 : Fri Sep 4 22:49:42 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.24/0.47 start to proof:theBenchmark.p
% 150.60/150.63 % Version : CSI_E---1.1
% 150.60/150.63 % Problem : theBenchmark.p
% 150.60/150.63 % Proof found!
% 150.60/150.63 % SZS status Theorem for theBenchmark.p
% 150.60/150.63 % SZS output start Proof
% 150.60/150.63 fof(r5, axiom, (r5<=>![X4, X5, X6]:is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r5)).
% 150.60/150.63 fof(op_implies_or, axiom, (op_implies_or=>![X1, X2]:implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_implies_or)).
% 150.60/150.63 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/sandbox/benchmark/Axioms/LCL006+0.ax', modus_ponens)).
% 150.60/150.63 fof(principia_r5, axiom, r5, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r5)).
% 150.60/150.63 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_op_implies_or)).
% 150.60/150.63 fof(principia_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_modus_ponens)).
% 150.60/150.63 fof(r3, axiom, (r3<=>![X4, X5]:is_a_theorem(implies(or(X4,X5),or(X5,X4)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r3)).
% 150.60/150.63 fof(r1, axiom, (r1<=>![X4]:is_a_theorem(implies(or(X4,X4),X4))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r1)).
% 150.60/150.63 fof(principia_r3, axiom, r3, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r3)).
% 150.60/150.63 fof(principia_r1, axiom, r1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r1)).
% 150.60/150.63 fof(r2, axiom, (r2<=>![X4, X5]:is_a_theorem(implies(X5,or(X4,X5)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r2)).
% 150.60/150.63 fof(principia_r2, axiom, r2, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r2)).
% 150.60/150.63 fof(r4, axiom, (r4<=>![X4, X5, X6]:is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r4)).
% 150.60/150.63 fof(principia_r4, conjecture, r4, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r4)).
% 150.60/150.63 fof(c_0_14, plain, ![X176, X177, X178]:((~r5|is_a_theorem(implies(implies(X177,X178),implies(or(X176,X177),or(X176,X178)))))&(~is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0))))|r5)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])).
% 150.60/150.63 fof(c_0_15, 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])])])).
% 150.60/150.63 fof(c_0_16, 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])])])])])).
% 150.60/150.63 cnf(c_0_17, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5), inference(split_conjunct,[status(thm)],[c_0_14])).
% 150.60/150.63 cnf(c_0_18, plain, (r5), inference(split_conjunct,[status(thm)],[principia_r5])).
% 150.60/150.63 cnf(c_0_19, plain, (implies(X1,X2)=or(not(X1),X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_15])).
% 150.60/150.63 cnf(c_0_20, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])).
% 150.60/150.63 cnf(c_0_21, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_16])).
% 150.60/150.63 cnf(c_0_22, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[principia_modus_ponens])).
% 150.60/150.63 cnf(c_0_23, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])])).
% 150.60/150.63 cnf(c_0_24, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])])).
% 150.60/150.63 cnf(c_0_25, 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_21, c_0_22])])).
% 150.60/150.63 cnf(c_0_26, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_24])).
% 150.60/150.63 fof(c_0_27, 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])])])])).
% 150.60/150.63 cnf(c_0_28, plain, (is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))|~is_a_theorem(implies(X2,X3))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
% 150.60/150.63 fof(c_0_29, plain, ![X160]:((~r1|is_a_theorem(implies(or(X160,X160),X160)))&(~is_a_theorem(implies(or(esk45_0,esk45_0),esk45_0))|r1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r1])])])])).
% 150.60/150.63 cnf(c_0_30, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3), inference(split_conjunct,[status(thm)],[c_0_27])).
% 150.60/150.63 cnf(c_0_31, plain, (r3), inference(split_conjunct,[status(thm)],[principia_r3])).
% 150.60/150.63 cnf(c_0_32, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,X3))|~is_a_theorem(implies(X3,X2))), inference(spm,[status(thm)],[c_0_25, c_0_28])).
% 150.60/150.63 cnf(c_0_33, plain, (is_a_theorem(implies(or(X1,X2),or(X1,X3)))|~is_a_theorem(implies(X2,X3))), inference(spm,[status(thm)],[c_0_25, c_0_23])).
% 150.60/150.63 cnf(c_0_34, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1), inference(split_conjunct,[status(thm)],[c_0_29])).
% 150.60/150.63 cnf(c_0_35, plain, (r1), inference(split_conjunct,[status(thm)],[principia_r1])).
% 150.60/150.63 fof(c_0_36, plain, ![X162, X163]:((~r2|is_a_theorem(implies(X163,or(X162,X163))))&(~is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))|r2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])])).
% 150.60/150.63 cnf(c_0_37, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_31])])).
% 150.60/150.63 cnf(c_0_38, plain, (is_a_theorem(implies(or(X1,X2),X3))|~is_a_theorem(implies(or(X1,X4),X3))|~is_a_theorem(implies(X2,X4))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
% 150.60/150.63 cnf(c_0_39, plain, (is_a_theorem(implies(or(X1,X1),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35])])).
% 150.60/150.63 cnf(c_0_40, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2), inference(split_conjunct,[status(thm)],[c_0_36])).
% 150.60/150.63 cnf(c_0_41, plain, (r2), inference(split_conjunct,[status(thm)],[principia_r2])).
% 150.60/150.63 fof(c_0_42, plain, ![X170, X171, X172]:((~r4|is_a_theorem(implies(or(X170,or(X171,X172)),or(X171,or(X170,X172)))))&(~is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))|r4)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])])).
% 150.60/150.63 fof(c_0_43, negated_conjecture, ~r4, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r4])])).
% 150.60/150.63 cnf(c_0_44, plain, (is_a_theorem(implies(or(X1,X2),X3))|~is_a_theorem(implies(or(X2,X1),X3))), inference(spm,[status(thm)],[c_0_32, c_0_37])).
% 150.60/150.63 cnf(c_0_45, plain, (is_a_theorem(implies(or(X1,X2),X1))|~is_a_theorem(implies(X2,X1))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 150.60/150.63 cnf(c_0_46, plain, (is_a_theorem(implies(X1,or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])])).
% 150.60/150.63 cnf(c_0_47, plain, (r4|~is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))), inference(split_conjunct,[status(thm)],[c_0_42])).
% 150.60/150.63 cnf(c_0_48, negated_conjecture, (~r4), inference(split_conjunct,[status(thm)],[c_0_43])).
% 150.60/150.63 cnf(c_0_49, plain, (is_a_theorem(implies(or(X1,X2),X2))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_44, c_0_45])).
% 150.60/150.63 cnf(c_0_50, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(or(X3,X1),X2))), inference(spm,[status(thm)],[c_0_32, c_0_46])).
% 150.60/150.63 cnf(c_0_51, plain, (is_a_theorem(implies(or(X1,X2),or(X3,or(X2,X1))))), inference(spm,[status(thm)],[c_0_44, c_0_46])).
% 150.60/150.63 cnf(c_0_52, plain, (~is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0))))), inference(sr,[status(thm)],[c_0_47, c_0_48])).
% 150.60/150.63 cnf(c_0_53, plain, (is_a_theorem(implies(or(X1,X2),X3))|~is_a_theorem(implies(X2,X3))|~is_a_theorem(implies(X1,X3))), inference(spm,[status(thm)],[c_0_38, c_0_49])).
% 150.60/150.63 cnf(c_0_54, plain, (is_a_theorem(implies(X1,or(X2,or(X1,X3))))), inference(spm,[status(thm)],[c_0_50, c_0_51])).
% 150.60/150.63 cnf(c_0_55, plain, (~is_a_theorem(implies(or(esk51_0,esk52_0),or(esk51_0,or(esk50_0,esk52_0))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54])])).
% 150.60/150.63 cnf(c_0_56, plain, (is_a_theorem(implies(X1,or(X2,or(X3,X1))))), inference(spm,[status(thm)],[c_0_50, c_0_46])).
% 150.60/150.63 cnf(c_0_57, plain, (is_a_theorem(implies(X1,or(X1,X2)))), inference(spm,[status(thm)],[c_0_50, c_0_37])).
% 150.60/150.63 cnf(c_0_58, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55, c_0_53]), c_0_56]), c_0_57])]), ['proof']).
% 150.60/150.63 % SZS output end Proof
% 150.60/150.63 % User time : 147.444 s
% 150.60/150.63 % System time : 2.690 s
% 150.60/150.63 % Total time : 150.134 s
% 150.60/150.63
%------------------------------------------------------------------------------