%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL455+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n015.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 0.24s 0.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL455+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 : n015.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 06:33:57 UTC 2026
% 0.08/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(r2, axiom, (r2<=>![X4, X5]:is_a_theorem(implies(X5,or(X4,X5)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r2)).
% 0.24/0.53 fof(principia_r2, conjecture, r2, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r2)).
% 0.24/0.53 fof(or_2, axiom, (or_2<=>![X1, X2]:is_a_theorem(implies(X2,or(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', or_2)).
% 0.24/0.53 fof(hilbert_or_2, axiom, or_2, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_or_2)).
% 0.24/0.53 fof(c_0_4, 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])])])])).
% 0.24/0.53 fof(c_0_5, negated_conjecture, ~r2, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r2])])).
% 0.24/0.53 fof(c_0_6, plain, ![X114, X115]:((~or_2|is_a_theorem(implies(X115,or(X114,X115))))&(~is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0)))|or_2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_2])])])])).
% 0.24/0.53 cnf(c_0_7, plain, (r2|~is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.24/0.53 cnf(c_0_8, negated_conjecture, (~r2), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.24/0.53 cnf(c_0_9, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~or_2), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.24/0.53 cnf(c_0_10, plain, (or_2), inference(split_conjunct,[status(thm)],[hilbert_or_2])).
% 0.24/0.53 cnf(c_0_11, plain, (~is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))), inference(sr,[status(thm)],[c_0_7, c_0_8])).
% 0.24/0.53 cnf(c_0_12, plain, (is_a_theorem(implies(X1,or(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
% 0.24/0.53 cnf(c_0_13, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])]), ['proof']).
% 0.24/0.53 % SZS output end Proof
% 0.24/0.53 % User time : 0.034 s
% 0.24/0.53 % System time : 0.004 s
% 0.24/0.53 % Total time : 0.038 s
% 0.24/0.53
%------------------------------------------------------------------------------