%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT088+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 : n027.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.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 42 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 43 ( 18 ~; 16 |; 7 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl509,conjecture,
? [X1] :
( less(v200,X1)
& in_lopen(X1,v0,v400) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl509) ).
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_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(ord_v200_v400,axiom,
less(v200,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( less(v200,X1)
& in_lopen(X1,v0,v400) ),
inference(assume_negation,[status(cth)],[odrl509]) ).
fof(c_0_6,negated_conjecture,
! [X149] :
( ~ less(v200,X149)
| ~ in_lopen(X149,v0,v400) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_7,plain,
! [X101,X102,X103] :
( ( less(X102,X101)
| ~ in_lopen(X101,X102,X103) )
& ( leq(X101,X103)
| ~ in_lopen(X101,X102,X103) )
& ( ~ less(X102,X101)
| ~ leq(X101,X103)
| in_lopen(X101,X102,X103) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).
fof(c_0_8,plain,
! [X80,X81] :
( ( ~ leq(X80,X81)
| less(X80,X81)
| X80 = X81 )
& ( ~ less(X80,X81)
| leq(X80,X81) )
& ( X80 != X81
| leq(X80,X81) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ less(v200,X1)
| ~ in_lopen(X1,v0,v400) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in_lopen(X2,X1,X3)
| ~ less(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ leq(X1,v400)
| ~ less(v200,X1)
| ~ less(v0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
less(v200,v400),
inference(split_conjunct,[status(thm)],[ord_v200_v400]) ).
cnf(c_0_15,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT088+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.11 % 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.32 % Computer : n027.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 23:33:05 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Theorem for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.61 % Total time : 1.270s
%------------------------------------------------------------------------------