%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT083+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:26 PM UTC 2026
% Result : Theorem 0.28s 1.62s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 54 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 55 ( 24 ~; 19 |; 9 &)
% ( 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 31 ( 1 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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) ).
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(odrl423,conjecture,
~ ? [X1] :
( in_open(X1,v0,v600)
& less(v600,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl423) ).
fof(in_open,axiom,
! [X1,X4,X5] :
( in_open(X1,X4,X5)
<=> ( less(X4,X1)
& less(X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_open) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(c_0_5,plain,
! [X79,X80] :
( ~ leq(X79,X80)
| ~ leq(X80,X79)
| X79 = X80 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).
fof(c_0_6,plain,
! [X77,X78] :
( ( ~ leq(X77,X78)
| less(X77,X78)
| X77 = X78 )
& ( ~ less(X77,X78)
| leq(X77,X78) )
& ( X77 != X78
| leq(X77,X78) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_7,negated_conjecture,
~ ~ ? [X1] :
( in_open(X1,v0,v600)
& less(v600,X1) ),
inference(assume_negation,[status(cth)],[odrl423]) ).
cnf(c_0_8,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X101,X102,X103] :
( ( less(X102,X101)
| ~ in_open(X101,X102,X103) )
& ( less(X101,X103)
| ~ in_open(X101,X102,X103) )
& ( ~ less(X102,X101)
| ~ less(X101,X103)
| in_open(X101,X102,X103) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_open])])]) ).
fof(c_0_11,negated_conjecture,
( in_open(esk4_0,v0,v600)
& less(v600,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( less(X1,X2)
| ~ in_open(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
in_open(esk4_0,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
less(esk4_0,v600),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
less(v600,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X71] : ~ less(X71,X71),
inference(variable_rename,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
esk4_0 = v600,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
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] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT083+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.15/0.33 % Computer : n002.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:32:16 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
%------------------------------------------------------------------------------