%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n011.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.23s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.33 % Computer : n011.cluster.edu
% 0.08/0.33 % Model : x86_64 x86_64
% 0.08/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.33 % Memory : 8046.5625MB
% 0.08/0.33 % OS : Linux 6.8.0-71-generic
% 0.08/0.33 % CPULimit : 300
% 0.08/0.33 % WCLimit : 300
% 0.08/0.33 % DateTime : Mon Sep 7 14:18:00 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.12/0.45 start to proof:theBenchmark.p
% 0.23/0.51 % Version : CSI_E---1.1
% 0.23/0.51 % Problem : theBenchmark.p
% 0.23/0.51 % Proof found!
% 0.23/0.51 % SZS status Theorem for theBenchmark.p
% 0.23/0.51 % SZS output start Proof
% 0.23/0.51 fof(leq_antisym, axiom, ![X1, X2]:(((leq(X1,X2)&leq(X2,X1))=>X1=X2)), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', leq_antisym)).
% 0.23/0.51 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.23/0.51 fof(odrl423, conjecture, ~(?[X1]:((in_open(X1,v0,v600)&less(v600,X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', odrl423)).
% 0.23/0.51 fof(in_open, axiom, ![X1, X4, X5]:((in_open(X1,X4,X5)<=>(less(X4,X1)&less(X1,X5)))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax', in_open)).
% 0.23/0.51 fof(irreflexive, axiom, ![X1]:(~(less(X1,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax', irreflexive)).
% 0.23/0.51 fof(c_0_5, plain, ![X33, X34]:((~leq(X33,X34)|~leq(X34,X33)|X33=X34)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])])).
% 0.23/0.51 fof(c_0_6, plain, ![X20, X21]:(((~leq(X20,X21)|(less(X20,X21)|X20=X21))&((~less(X20,X21)|leq(X20,X21))&(X20!=X21|leq(X20,X21))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
% 0.23/0.51 fof(c_0_7, negated_conjecture, ~(~(?[X1]:((in_open(X1,v0,v600)&less(v600,X1))))), inference(assume_negation,[status(cth)],[odrl423])).
% 0.23/0.51 cnf(c_0_8, plain, (X1=X2|~leq(X1,X2)|~leq(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.23/0.51 cnf(c_0_9, plain, (leq(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.23/0.51 fof(c_0_10, plain, ![X30, X31, X32]:((((less(X31,X30)|~in_open(X30,X31,X32))&(less(X30,X32)|~in_open(X30,X31,X32)))&(~less(X31,X30)|~less(X30,X32)|in_open(X30,X31,X32)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_open])])])])).
% 0.23/0.51 fof(c_0_11, negated_conjecture, (in_open(esk1_0,v0,v600)&less(v600,esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
% 0.23/0.51 cnf(c_0_12, plain, (X1=X2|~leq(X1,X2)|~less(X2,X1)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.23/0.51 cnf(c_0_13, plain, (less(X1,X2)|~in_open(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.23/0.51 cnf(c_0_14, negated_conjecture, (in_open(esk1_0,v0,v600)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.23/0.51 fof(c_0_15, plain, ![X1]:(~less(X1,X1)), inference(fof_simplification,[status(thm)],[irreflexive])).
% 0.23/0.51 cnf(c_0_16, plain, (X1=X2|~less(X2,X1)|~less(X1,X2)), inference(spm,[status(thm)],[c_0_12, c_0_9])).
% 0.23/0.51 cnf(c_0_17, negated_conjecture, (less(esk1_0,v600)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.23/0.51 cnf(c_0_18, negated_conjecture, (less(v600,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.23/0.51 fof(c_0_19, plain, ![X14]:(~less(X14,X14)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])])).
% 0.23/0.51 cnf(c_0_20, negated_conjecture, (esk1_0=v600), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])])).
% 0.23/0.51 cnf(c_0_21, plain, (~less(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.23/0.51 cnf(c_0_22, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_20]), c_0_21]), ['proof']).
% 0.23/0.51 % SZS output end Proof
% 0.23/0.51 % User time : 0.004 s
% 0.23/0.51 % System time : 0.002 s
% 0.23/0.51 % Total time : 0.006 s
% 0.23/0.51 % User time : 0.005 s
% 0.23/0.51 % System time : 0.006 s
% 0.23/0.51 % Total time : 0.011 s
% 0.23/0.51
%------------------------------------------------------------------------------