%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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:38 AM UTC 2026
% Result : Theorem 0.24s 0.52s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.06/0.33 % Computer : n002.cluster.edu
% 0.06/0.33 % Model : x86_64 x86_64
% 0.06/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.33 % Memory : 8046.5625MB
% 0.06/0.33 % OS : Linux 6.8.0-71-generic
% 0.06/0.33 % CPULimit : 300
% 0.06/0.33 % WCLimit : 300
% 0.06/0.33 % DateTime : Mon Sep 7 14:27:07 UTC 2026
% 0.06/0.34 % CPUTime :
% 0.13/0.45 start to proof:theBenchmark.p
% 0.24/0.52 % Version : CSI_E---1.1
% 0.24/0.52 % Problem : theBenchmark.p
% 0.24/0.52 % Proof found!
% 0.24/0.52 % SZS status Theorem for theBenchmark.p
% 0.24/0.52 % SZS output start Proof
% 0.24/0.52 fof(odrl633, conjecture, completion_conflict(v400,v800,v0,v1200), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', odrl633)).
% 0.24/0.52 fof(sharpness_conflict, axiom, ![X7, X4, X5, X6]:(((((leq(X5,X7)&leq(X7,X6))&less(X7,X4))&leq(X4,X6))=>completion_conflict(X7,X4,X5,X6))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax', sharpness_conflict)).
% 0.24/0.52 fof(ord_v400_v800, axiom, less(v400,v800), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ord_v400_v800)).
% 0.24/0.52 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)).
% 0.24/0.52 fof(ord_v0_v400, axiom, less(v0,v400), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ord_v0_v400)).
% 0.24/0.52 fof(ord_v800_v1200, axiom, less(v800,v1200), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ord_v800_v1200)).
% 0.24/0.52 fof(transitive, axiom, ![X1, X2, X3]:(((less(X1,X2)&less(X2,X3))=>less(X1,X3))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', transitive)).
% 0.24/0.52 fof(c_0_7, negated_conjecture, ~completion_conflict(v400,v800,v0,v1200), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl633])])).
% 0.24/0.52 fof(c_0_8, negated_conjecture, ~completion_conflict(v400,v800,v0,v1200), inference(fof_nnf,[status(thm)],[c_0_7])).
% 0.24/0.52 fof(c_0_9, plain, ![X26, X27, X28, X29]:((~leq(X28,X26)|~leq(X26,X29)|~less(X26,X27)|~leq(X27,X29)|completion_conflict(X26,X27,X28,X29))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sharpness_conflict])])])).
% 0.24/0.52 cnf(c_0_10, negated_conjecture, (~completion_conflict(v400,v800,v0,v1200)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.52 cnf(c_0_11, plain, (completion_conflict(X2,X4,X1,X3)|~leq(X1,X2)|~leq(X2,X3)|~less(X2,X4)|~leq(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.52 cnf(c_0_12, plain, (less(v400,v800)), inference(split_conjunct,[status(thm)],[ord_v400_v800])).
% 0.24/0.52 fof(c_0_13, plain, ![X36, X37]:(((~leq(X36,X37)|(less(X36,X37)|X36=X37))&((~less(X36,X37)|leq(X36,X37))&(X36!=X37|leq(X36,X37))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
% 0.24/0.52 cnf(c_0_14, negated_conjecture, (~leq(v800,v1200)|~leq(v400,v1200)|~leq(v0,v400)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])])).
% 0.24/0.52 cnf(c_0_15, plain, (leq(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.24/0.52 cnf(c_0_16, plain, (less(v0,v400)), inference(split_conjunct,[status(thm)],[ord_v0_v400])).
% 0.24/0.52 cnf(c_0_17, negated_conjecture, (~leq(v800,v1200)|~leq(v400,v1200)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])])).
% 0.24/0.52 cnf(c_0_18, plain, (less(v800,v1200)), inference(split_conjunct,[status(thm)],[ord_v800_v1200])).
% 0.24/0.52 fof(c_0_19, plain, ![X31, X32, X33]:((~less(X31,X32)|~less(X32,X33)|less(X31,X33))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])])])).
% 0.24/0.52 cnf(c_0_20, negated_conjecture, (~leq(v400,v1200)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_15]), c_0_18])])).
% 0.24/0.52 cnf(c_0_21, plain, (less(X1,X3)|~less(X1,X2)|~less(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.24/0.52 cnf(c_0_22, negated_conjecture, (~less(v400,v1200)), inference(spm,[status(thm)],[c_0_20, c_0_15])).
% 0.24/0.52 cnf(c_0_23, plain, (less(X1,v1200)|~less(X1,v800)), inference(spm,[status(thm)],[c_0_21, c_0_18])).
% 0.24/0.52 cnf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_12])]), ['proof']).
% 0.24/0.52 % SZS output end Proof
% 0.24/0.52 % User time : 0.006 s
% 0.24/0.52 % System time : 0.002 s
% 0.24/0.52 % Total time : 0.008 s
% 0.24/0.52 % User time : 0.009 s
% 0.24/0.52 % System time : 0.004 s
% 0.24/0.52 % Total time : 0.013 s
% 0.24/0.52
%------------------------------------------------------------------------------