%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n006.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:38 AM UTC 2026
% Result : Theorem 272.28s 136.46s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 14:00:31 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.14/0.43 start to proof:theBenchmark.p
% 272.28/136.46 % Version : CSI_E---1.1
% 272.28/136.46 % Problem : theBenchmark.p
% 272.28/136.46 % Proof found!
% 272.28/136.46 % SZS status Theorem for theBenchmark.p
% 272.28/136.46 % SZS output start Proof
% 272.28/136.46 fof(odrl604, conjecture, prec(v5,v5,o,o), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', odrl604)).
% 272.28/136.46 fof(leq_def, axiom, ![X1, X2]:((leq(X1,X2)<=>(less(X1,X2)|X1=X2))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', leq_def)).
% 272.28/136.46 fof(prec_oo, axiom, ![X14, X15]:((prec(X14,X15,o,o)<=>leq(X14,X15))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+5.ax', prec_oo)).
% 272.28/136.46 fof(c_0_3, negated_conjecture, ~prec(v5,v5,o,o), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl604])])).
% 272.28/136.46 fof(c_0_4, plain, ![X38, X39]:(((~leq(X38,X39)|(less(X38,X39)|X38=X39))&((~less(X38,X39)|leq(X38,X39))&(X38!=X39|leq(X38,X39))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
% 272.28/136.46 fof(c_0_5, negated_conjecture, ~prec(v5,v5,o,o), inference(fof_nnf,[status(thm)],[c_0_3])).
% 272.28/136.46 fof(c_0_6, plain, ![X30, X31]:(((~prec(X30,X31,o,o)|leq(X30,X31))&(~leq(X30,X31)|prec(X30,X31,o,o)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prec_oo])])])).
% 272.28/136.46 cnf(c_0_7, plain, (leq(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_4])).
% 272.28/136.46 cnf(c_0_8, negated_conjecture, (~prec(v5,v5,o,o)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 272.28/136.46 cnf(c_0_9, plain, (prec(X1,X2,o,o)|~leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 272.28/136.46 cnf(c_0_10, plain, (leq(X1,X1)), inference(er,[status(thm)],[c_0_7])).
% 272.28/136.46 cnf(c_0_11, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])]), ['proof']).
% 272.28/136.46 % SZS output end Proof
% 272.28/136.46 % User time : 0.004 s
% 272.28/136.46 % System time : 0.003 s
% 272.28/136.46 % Total time : 0.007 s
% 272.28/136.46 % User time : 0.005 s
% 272.28/136.46 % System time : 0.008 s
% 272.28/136.46 % Total time : 0.013 s
% 272.28/136.46
%------------------------------------------------------------------------------