%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT084+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n013.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.28s 1.62s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 62 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 21 ~; 16 |; 21 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 31 ( 1 sgn 17 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl432,conjecture,
~ ? [X1,X2,X3] :
( in_lopen(X1,v0,v600)
& leq(v600,X1)
& in_lopen(X2,v0,v400)
& less(v400,X2)
& in_lopen(X3,v0,v200)
& leq(v200,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl432) ).
fof(in_lopen,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( less(X4,X1)
& leq(X1,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
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) ).
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) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(c_0_5,negated_conjecture,
~ ~ ? [X1,X2,X3] :
( in_lopen(X1,v0,v600)
& leq(v600,X1)
& in_lopen(X2,v0,v400)
& less(v400,X2)
& in_lopen(X3,v0,v200)
& leq(v200,X3) ),
inference(assume_negation,[status(cth)],[odrl432]) ).
fof(c_0_6,plain,
! [X97,X98,X99] :
( ( less(X98,X97)
| ~ in_lopen(X97,X98,X99) )
& ( leq(X97,X99)
| ~ in_lopen(X97,X98,X99) )
& ( ~ less(X98,X97)
| ~ leq(X97,X99)
| in_lopen(X97,X98,X99) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).
fof(c_0_7,negated_conjecture,
( in_lopen(esk4_0,v0,v600)
& leq(v600,esk4_0)
& in_lopen(esk5_0,v0,v400)
& less(v400,esk5_0)
& in_lopen(esk6_0,v0,v200)
& leq(v200,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X81,X82] :
( ~ leq(X81,X82)
| ~ leq(X82,X81)
| X81 = X82 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).
cnf(c_0_9,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
in_lopen(esk5_0,v0,v400),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
leq(esk5_0,v400),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X79,X80] :
( ( ~ leq(X79,X80)
| less(X79,X80)
| X79 = X80 )
& ( ~ less(X79,X80)
| leq(X79,X80) )
& ( X79 != X80
| leq(X79,X80) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_14,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_15,negated_conjecture,
( esk5_0 = v400
| ~ leq(v400,esk5_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
less(v400,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_18,plain,
! [X73] : ~ less(X73,X73),
inference(variable_rename,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
esk5_0 = v400,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT084+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n013.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 23:31:56 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.28/1.62 % Version : CSE_E---1.7
% 0.28/1.62 % Problem : theBenchmark.p
% 0.28/1.62 % SZS status Theorem for theBenchmark.p
% 0.28/1.62 % SZS output start CNFRefutation
% See solution above
% 0.28/1.62 % Total time : 1.273s
%------------------------------------------------------------------------------