%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT012+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n002.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 : Tue Sep 8 06:04:28 AM UTC 2026
% Result : Theorem 0.65s 0.70s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT012+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.05 % Command : java -jar mcs_scs.jar %d %s
% 0.15/0.42 % Computer : n002.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Mon Sep 7 11:52:37 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.28/0.60 start to proof:theBenchmark.p
% 0.65/0.70 % Version : CSI_E---1.1
% 0.65/0.70 % Problem : theBenchmark.p
% 0.65/0.70 % Proof found!
% 0.65/0.70 % SZS status Theorem for theBenchmark.p
% 0.65/0.70 % SZS output start Proof
% 0.65/0.70 fof(t12_FOL, conjecture, ![X1, X8, X9, X6, X7]:(((((((organization(X1,X6)&organization(X1,X7))&reorganization_free(X1,X6,X7))&complexity(X1,X8,X6))&complexity(X1,X9,X7))&greater(X7,X6))=>~(greater(X8,X9)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t12_FOL)).
% 0.65/0.70 fof(mp10, axiom, ![X1, X6, X7, X8, X9]:((((((organization(X1,X6)&organization(X1,X7))&reorganization_free(X1,X6,X7))&class(X1,X8,X6))&class(X1,X9,X7))=>X8=X9)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp10)).
% 0.65/0.70 fof(mp9, axiom, ![X1, X2]:((organization(X1,X2)=>?[X5]:(class(X1,X5,X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp9)).
% 0.65/0.70 fof(a12_FOL, hypothesis, ![X1, X4, X5, X8, X9, X10, X11, X6, X7]:((((((((((organization(X1,X6)&organization(X4,X7))&class(X1,X5,X6))&class(X4,X5,X7))&complexity(X1,X8,X6))&complexity(X4,X9,X7))&inertia(X1,X10,X6))&inertia(X4,X11,X7))&greater(X9,X8))=>greater(X11,X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', a12_FOL)).
% 0.65/0.70 fof(t2_FOL, hypothesis, ![X1, X10, X11, X6, X7]:(((((((organization(X1,X6)&organization(X1,X7))&reorganization_free(X1,X6,X7))&inertia(X1,X10,X6))&inertia(X1,X11,X7))&greater(X7,X6))=>greater(X11,X10))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t2_FOL)).
% 0.65/0.70 fof(mp5, axiom, ![X1, X2]:((organization(X1,X2)=>?[X3]:(inertia(X1,X3,X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp5)).
% 0.65/0.70 fof(mp6_2, axiom, ![X1, X4]:(~((greater(X1,X4)&greater(X4,X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp6_2)).
% 0.65/0.70 fof(c_0_7, negated_conjecture, ~(![X1, X8, X9, X6, X7]:(((((((organization(X1,X6)&organization(X1,X7))&reorganization_free(X1,X6,X7))&complexity(X1,X8,X6))&complexity(X1,X9,X7))&greater(X7,X6))=>~greater(X8,X9)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t12_FOL])])).
% 0.65/0.70 fof(c_0_8, plain, ![X41, X42, X43, X44, X45]:((~organization(X41,X42)|~organization(X41,X43)|~reorganization_free(X41,X42,X43)|~class(X41,X44,X42)|~class(X41,X45,X43)|X44=X45)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp10])])])).
% 0.65/0.70 fof(c_0_9, negated_conjecture, ((((((organization(esk1_0,esk4_0)&organization(esk1_0,esk5_0))&reorganization_free(esk1_0,esk4_0,esk5_0))&complexity(esk1_0,esk2_0,esk4_0))&complexity(esk1_0,esk3_0,esk5_0))&greater(esk5_0,esk4_0))&greater(esk2_0,esk3_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
% 0.65/0.70 cnf(c_0_10, plain, (X4=X5|~organization(X1,X2)|~organization(X1,X3)|~reorganization_free(X1,X2,X3)|~class(X1,X4,X2)|~class(X1,X5,X3)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.65/0.70 cnf(c_0_11, negated_conjecture, (reorganization_free(esk1_0,esk4_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 cnf(c_0_12, negated_conjecture, (organization(esk1_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 cnf(c_0_13, negated_conjecture, (organization(esk1_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 fof(c_0_14, plain, ![X38, X39]:((~organization(X38,X39)|class(X38,esk7_2(X38,X39),X39))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp9])])])])).
% 0.65/0.70 fof(c_0_15, hypothesis, ![X12, X13, X14, X15, X16, X17, X18, X19, X20]:((~organization(X12,X19)|~organization(X13,X20)|~class(X12,X14,X19)|~class(X13,X14,X20)|~complexity(X12,X15,X19)|~complexity(X13,X16,X20)|~inertia(X12,X17,X19)|~inertia(X13,X18,X20)|~greater(X16,X15)|greater(X18,X17))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a12_FOL])])])).
% 0.65/0.70 cnf(c_0_16, negated_conjecture, (X1=X2|~class(esk1_0,X2,esk5_0)|~class(esk1_0,X1,esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12]), c_0_13])])).
% 0.65/0.70 cnf(c_0_17, plain, (class(X1,esk7_2(X1,X2),X2)|~organization(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.65/0.70 cnf(c_0_18, hypothesis, (greater(X9,X8)|~organization(X1,X2)|~organization(X3,X4)|~class(X1,X5,X2)|~class(X3,X5,X4)|~complexity(X1,X6,X2)|~complexity(X3,X7,X4)|~inertia(X1,X8,X2)|~inertia(X3,X9,X4)|~greater(X7,X6)), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.65/0.70 cnf(c_0_19, negated_conjecture, (complexity(esk1_0,esk2_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 cnf(c_0_20, negated_conjecture, (X1=esk7_2(esk1_0,esk5_0)|~class(esk1_0,X1,esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_12])])).
% 0.65/0.70 fof(c_0_21, hypothesis, ![X21, X22, X23, X24, X25]:((~organization(X21,X24)|~organization(X21,X25)|~reorganization_free(X21,X24,X25)|~inertia(X21,X22,X24)|~inertia(X21,X23,X25)|~greater(X25,X24)|greater(X23,X22))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])])])).
% 0.65/0.70 cnf(c_0_22, negated_conjecture, (greater(X1,X2)|~complexity(X3,X4,X5)|~class(esk1_0,X6,esk4_0)|~class(X3,X6,X5)|~greater(esk2_0,X4)|~inertia(esk1_0,X1,esk4_0)|~inertia(X3,X2,X5)|~organization(X3,X5)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_13])])).
% 0.65/0.70 cnf(c_0_23, negated_conjecture, (esk7_2(esk1_0,esk5_0)=esk7_2(esk1_0,esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_17]), c_0_13])])).
% 0.65/0.70 cnf(c_0_24, hypothesis, (greater(X5,X4)|~organization(X1,X2)|~organization(X1,X3)|~reorganization_free(X1,X2,X3)|~inertia(X1,X4,X2)|~inertia(X1,X5,X3)|~greater(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_21])).
% 0.65/0.70 cnf(c_0_25, negated_conjecture, (greater(esk5_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 fof(c_0_26, plain, ![X35, X36]:((~organization(X35,X36)|inertia(X35,esk6_2(X35,X36),X36))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])])).
% 0.65/0.70 cnf(c_0_27, negated_conjecture, (greater(X1,X2)|~complexity(X3,X4,X5)|~class(X3,esk7_2(esk1_0,esk4_0),X5)|~greater(esk2_0,X4)|~inertia(esk1_0,X1,esk4_0)|~inertia(X3,X2,X5)|~organization(X3,X5)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_17]), c_0_13])])).
% 0.65/0.70 cnf(c_0_28, negated_conjecture, (class(esk1_0,esk7_2(esk1_0,esk4_0),esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_23]), c_0_12])])).
% 0.65/0.70 fof(c_0_29, plain, ![X33, X34]:((~greater(X33,X34)|~greater(X34,X33))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_2])])])).
% 0.65/0.70 cnf(c_0_30, negated_conjecture, (greater(X1,X2)|~inertia(esk1_0,X1,esk5_0)|~inertia(esk1_0,X2,esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_11]), c_0_25]), c_0_12]), c_0_13])])).
% 0.65/0.70 cnf(c_0_31, plain, (inertia(X1,esk6_2(X1,X2),X2)|~organization(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.65/0.70 cnf(c_0_32, negated_conjecture, (greater(X1,X2)|~complexity(esk1_0,X3,esk5_0)|~greater(esk2_0,X3)|~inertia(esk1_0,X1,esk4_0)|~inertia(esk1_0,X2,esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_12])])).
% 0.65/0.70 cnf(c_0_33, negated_conjecture, (complexity(esk1_0,esk3_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 cnf(c_0_34, negated_conjecture, (greater(esk2_0,esk3_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.65/0.70 cnf(c_0_35, plain, (~greater(X1,X2)|~greater(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
% 0.65/0.70 cnf(c_0_36, negated_conjecture, (greater(esk6_2(esk1_0,esk5_0),X1)|~inertia(esk1_0,X1,esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_12])])).
% 0.65/0.70 cnf(c_0_37, negated_conjecture, (greater(X1,X2)|~inertia(esk1_0,X1,esk4_0)|~inertia(esk1_0,X2,esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34])])).
% 0.65/0.70 cnf(c_0_38, negated_conjecture, (~greater(X1,esk6_2(esk1_0,esk5_0))|~inertia(esk1_0,X1,esk4_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
% 0.65/0.70 cnf(c_0_39, negated_conjecture, (greater(esk6_2(esk1_0,esk4_0),X1)|~inertia(esk1_0,X1,esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_31]), c_0_13])])).
% 0.65/0.70 cnf(c_0_40, negated_conjecture, (~inertia(esk1_0,esk6_2(esk1_0,esk4_0),esk4_0)|~inertia(esk1_0,esk6_2(esk1_0,esk5_0),esk5_0)), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 0.65/0.70 cnf(c_0_41, negated_conjecture, (~inertia(esk1_0,esk6_2(esk1_0,esk4_0),esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_31]), c_0_12])])).
% 0.65/0.70 cnf(c_0_42, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_31]), c_0_13])]), ['proof']).
% 0.65/0.70 % SZS output end Proof
% 0.65/0.70 % User time : 0.014 s
% 0.65/0.70 % System time : 0.002 s
% 0.65/0.70 % Total time : 0.016 s
% 0.65/0.70 % User time : 0.016 s
% 0.65/0.70 % System time : 0.007 s
% 0.65/0.70 % Total time : 0.023 s
% 0.65/0.70
%------------------------------------------------------------------------------