%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT086+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:48:27 PM UTC 2026
% Result : Theorem 0.32s 1.64s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 102 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 115 ( 51 ~; 46 |; 15 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 53 ( 2 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl462,conjecture,
? [X1,X2] :
( leq(v800,X1)
& in_lopen(X2,v0,v200)
& ( ( in_lopen(X1,v0,v600)
& ~ in_lopen(X2,v0,v400) )
| ( ~ in_lopen(X1,v0,v600)
& in_lopen(X2,v0,v400) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl462) ).
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) ).
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) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(transitive,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(ord_v0_v200,axiom,
less(v0,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(ord_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(ord_v200_v400,axiom,
less(v200,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(c_0_8,negated_conjecture,
~ ? [X1,X2] :
( leq(v800,X1)
& in_lopen(X2,v0,v200)
& ( ( in_lopen(X1,v0,v600)
& ~ in_lopen(X2,v0,v400) )
| ( ~ in_lopen(X1,v0,v600)
& in_lopen(X2,v0,v400) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl462])]) ).
fof(c_0_9,negated_conjecture,
! [X144,X145] :
( ( ~ in_lopen(X144,v0,v600)
| in_lopen(X145,v0,v400)
| ~ leq(v800,X144)
| ~ in_lopen(X145,v0,v200) )
& ( in_lopen(X144,v0,v600)
| ~ in_lopen(X145,v0,v400)
| ~ leq(v800,X144)
| ~ in_lopen(X145,v0,v200) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X96,X97,X98] :
( ( less(X97,X96)
| ~ in_lopen(X96,X97,X98) )
& ( leq(X96,X98)
| ~ in_lopen(X96,X97,X98) )
& ( ~ less(X97,X96)
| ~ leq(X96,X98)
| in_lopen(X96,X97,X98) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).
cnf(c_0_11,negated_conjecture,
( in_lopen(X1,v0,v600)
| ~ in_lopen(X2,v0,v400)
| ~ leq(v800,X1)
| ~ in_lopen(X2,v0,v200) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( in_lopen(X2,X1,X3)
| ~ less(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( less(X1,X2)
| ~ in_lopen(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X78,X79] :
( ( ~ leq(X78,X79)
| less(X78,X79)
| X78 = X79 )
& ( ~ less(X78,X79)
| leq(X78,X79) )
& ( X78 != X79
| leq(X78,X79) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
cnf(c_0_15,negated_conjecture,
( in_lopen(X1,v0,v600)
| ~ in_lopen(X2,v0,v400)
| ~ leq(v800,X1)
| ~ leq(X2,v200) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( in_lopen(X1,v0,v600)
| ~ leq(v800,X1)
| ~ leq(X2,v200)
| ~ leq(X2,v400)
| ~ less(v0,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_18,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
fof(c_0_20,plain,
! [X73,X74,X75] :
( ~ less(X73,X74)
| ~ less(X74,X75)
| less(X73,X75) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])]) ).
cnf(c_0_21,negated_conjecture,
( in_lopen(v800,v0,v600)
| ~ leq(X1,v200)
| ~ leq(X1,v400)
| ~ less(v0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
less(v0,v200),
inference(split_conjunct,[status(thm)],[ord_v0_v200]) ).
fof(c_0_23,plain,
! [X72] : ~ less(X72,X72),
inference(variable_rename,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
cnf(c_0_26,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
( in_lopen(v800,v0,v600)
| ~ leq(v200,v400) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_22])]) ).
cnf(c_0_28,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( less(X1,v800)
| ~ less(X1,v600) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,negated_conjecture,
( leq(v800,v600)
| ~ leq(v200,v400) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
~ less(v800,v600),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( v800 = v600
| ~ leq(v200,v400) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_35,plain,
less(v200,v400),
inference(split_conjunct,[status(thm)],[ord_v200_v400]) ).
cnf(c_0_36,negated_conjecture,
v800 = v600,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_36]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT086+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n002.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:33:16 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.32/1.64 % Version : CSE_E---1.7
% 0.32/1.64 % Problem : theBenchmark.p
% 0.32/1.64 % SZS status Theorem for theBenchmark.p
% 0.32/1.64 % SZS output start CNFRefutation
% See solution above
% 0.32/1.64 % Total time : 1.276s
%------------------------------------------------------------------------------