%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n027.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.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.34 % Computer : n027.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 7 14:17:45 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.12/0.46 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(leq_def, axiom, ![X1, X2]:((leq(X1,X2)<=>(less(X1,X2)|X1=X2))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', leq_def)).
% 0.24/0.53 fof(odrl350, conjecture, ?[X1, X2, X3]:((((in_lopen(X1,v0,v600)&in_lopen(X2,v0,v400))&in_lopen(X3,v0,v32))&~(((in_lopen(X1,v0,v1200)&in_lopen(X2,v0,v800))&in_lopen(X3,v0,v16))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', odrl350)).
% 0.24/0.53 fof(in_lopen, axiom, ![X1, X4, X5]:((in_lopen(X1,X4,X5)<=>(less(X4,X1)&leq(X1,X5)))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax', in_lopen)).
% 0.24/0.53 fof(ord_v0_v400, axiom, less(v0,v400), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v0_v400)).
% 0.24/0.53 fof(leq_antisym, axiom, ![X1, X2]:(((leq(X1,X2)&leq(X2,X1))=>X1=X2)), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', leq_antisym)).
% 0.24/0.53 fof(ord_v0_v600, axiom, less(v0,v600), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v0_v600)).
% 0.24/0.53 fof(distinct, axiom, ((((((((((((((((((((v0!=v16&v0!=v32)&v0!=v400)&v0!=v600)&v0!=v800)&v0!=v1200)&v16!=v32)&v16!=v400)&v16!=v600)&v16!=v800)&v16!=v1200)&v32!=v400)&v32!=v600)&v32!=v800)&v32!=v1200)&v400!=v600)&v400!=v800)&v400!=v1200)&v600!=v800)&v600!=v1200)&v800!=v1200), file('/export/starexec/sandbox/benchmark/theBenchmark.p', distinct)).
% 0.24/0.53 fof(ord_v16_v32, axiom, less(v16,v32), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v16_v32)).
% 0.24/0.53 fof(ord_v0_v32, axiom, less(v0,v32), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v0_v32)).
% 0.24/0.53 fof(c_0_9, plain, ![X19, X20]:(((~leq(X19,X20)|(less(X19,X20)|X19=X20))&((~less(X19,X20)|leq(X19,X20))&(X19!=X20|leq(X19,X20))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
% 0.24/0.53 fof(c_0_10, negated_conjecture, ~(?[X1, X2, X3]:((((in_lopen(X1,v0,v600)&in_lopen(X2,v0,v400))&in_lopen(X3,v0,v32))&~(((in_lopen(X1,v0,v1200)&in_lopen(X2,v0,v800))&in_lopen(X3,v0,v16)))))), inference(assume_negation,[status(cth)],[odrl350])).
% 0.24/0.53 fof(c_0_11, plain, ![X16, X17, X18]:((((less(X17,X16)|~in_lopen(X16,X17,X18))&(leq(X16,X18)|~in_lopen(X16,X17,X18)))&(~less(X17,X16)|~leq(X16,X18)|in_lopen(X16,X17,X18)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])])).
% 0.24/0.53 cnf(c_0_12, plain, (leq(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.53 fof(c_0_13, negated_conjecture, ![X13, X14, X15]:((((in_lopen(X13,v0,v1200)|(~in_lopen(X13,v0,v600)|~in_lopen(X14,v0,v400)|~in_lopen(X15,v0,v32)))&(in_lopen(X14,v0,v800)|(~in_lopen(X13,v0,v600)|~in_lopen(X14,v0,v400)|~in_lopen(X15,v0,v32))))&(in_lopen(X15,v0,v16)|(~in_lopen(X13,v0,v600)|~in_lopen(X14,v0,v400)|~in_lopen(X15,v0,v32))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])).
% 0.24/0.53 cnf(c_0_14, plain, (in_lopen(X2,X1,X3)|~less(X1,X2)|~leq(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.24/0.53 cnf(c_0_15, plain, (leq(X1,X1)), inference(er,[status(thm)],[c_0_12])).
% 0.24/0.53 cnf(c_0_16, negated_conjecture, (in_lopen(X1,v0,v16)|~in_lopen(X2,v0,v600)|~in_lopen(X3,v0,v400)|~in_lopen(X1,v0,v32)), inference(split_conjunct,[status(thm)],[c_0_13])).
% 0.24/0.53 cnf(c_0_17, plain, (in_lopen(X1,X2,X1)|~less(X2,X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.24/0.53 cnf(c_0_18, plain, (less(v0,v400)), inference(split_conjunct,[status(thm)],[ord_v0_v400])).
% 0.24/0.53 fof(c_0_19, plain, ![X21, X22]:((~leq(X21,X22)|~leq(X22,X21)|X21=X22)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])])).
% 0.24/0.53 cnf(c_0_20, negated_conjecture, (in_lopen(X1,v0,v16)|~in_lopen(X2,v0,v600)|~in_lopen(X1,v0,v32)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])])).
% 0.24/0.53 cnf(c_0_21, plain, (less(v0,v600)), inference(split_conjunct,[status(thm)],[ord_v0_v600])).
% 0.24/0.53 cnf(c_0_22, plain, (X1=X2|~leq(X1,X2)|~leq(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.24/0.53 cnf(c_0_23, plain, (leq(X1,X2)|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.53 cnf(c_0_24, plain, (leq(X1,X2)|~in_lopen(X1,X3,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.24/0.53 cnf(c_0_25, negated_conjecture, (in_lopen(X1,v0,v16)|~in_lopen(X1,v0,v32)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_17]), c_0_21])])).
% 0.24/0.53 fof(c_0_26, plain, ((((((((((((((((((((v0!=v16&v0!=v32)&v0!=v400)&v0!=v600)&v0!=v800)&v0!=v1200)&v16!=v32)&v16!=v400)&v16!=v600)&v16!=v800)&v16!=v1200)&v32!=v400)&v32!=v600)&v32!=v800)&v32!=v1200)&v400!=v600)&v400!=v800)&v400!=v1200)&v600!=v800)&v600!=v1200)&v800!=v1200), inference(fof_simplification,[status(thm)],[distinct])).
% 0.24/0.53 cnf(c_0_27, plain, (X1=X2|~leq(X1,X2)|~less(X2,X1)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
% 0.24/0.53 cnf(c_0_28, negated_conjecture, (leq(X1,v16)|~in_lopen(X1,v0,v32)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
% 0.24/0.53 fof(c_0_29, plain, ((((((((((((((((((((v0!=v16&v0!=v32)&v0!=v400)&v0!=v600)&v0!=v800)&v0!=v1200)&v16!=v32)&v16!=v400)&v16!=v600)&v16!=v800)&v16!=v1200)&v32!=v400)&v32!=v600)&v32!=v800)&v32!=v1200)&v400!=v600)&v400!=v800)&v400!=v1200)&v600!=v800)&v600!=v1200)&v800!=v1200), inference(fof_nnf,[status(thm)],[c_0_26])).
% 0.24/0.53 cnf(c_0_30, negated_conjecture, (X1=v16|~in_lopen(X1,v0,v32)|~less(v16,X1)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 0.24/0.53 cnf(c_0_31, plain, (less(v16,v32)), inference(split_conjunct,[status(thm)],[ord_v16_v32])).
% 0.24/0.53 cnf(c_0_32, plain, (less(v0,v32)), inference(split_conjunct,[status(thm)],[ord_v0_v32])).
% 0.24/0.53 cnf(c_0_33, plain, (v16!=v32), inference(split_conjunct,[status(thm)],[c_0_29])).
% 0.24/0.53 cnf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_17]), c_0_31]), c_0_32])]), c_0_33]), ['proof']).
% 0.24/0.53 % SZS output end Proof
% 0.24/0.53 % User time : 0.012 s
% 0.24/0.53 % System time : 0.004 s
% 0.24/0.53 % Total time : 0.016 s
% 0.24/0.53 % User time : 0.013 s
% 0.24/0.53 % System time : 0.007 s
% 0.24/0.53 % Total time : 0.019 s
% 0.24/0.53
%------------------------------------------------------------------------------