%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT106+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 : n029.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:29 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 76 ( 18 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 68 ( 28 ~; 29 |; 7 &)
% ( 2 <=>; 2 =>; 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 37 ( 1 sgn 23 !; 0 ?)
% 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(wit_leq,axiom,
leq(v800,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wit_leq) ).
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(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(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(ord_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(wit_in_lopen,axiom,
in_lopen(w,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wit_in_lopen) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(c_0_8,plain,
! [X78,X79] :
( ~ leq(X78,X79)
| ~ leq(X79,X78)
| X78 = X79 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,plain,
leq(v800,w),
inference(split_conjunct,[status(thm)],[wit_leq]) ).
fof(c_0_11,plain,
! [X76,X77] :
( ( ~ leq(X76,X77)
| less(X76,X77)
| X76 = X77 )
& ( ~ less(X76,X77)
| leq(X76,X77) )
& ( X76 != X77
| leq(X76,X77) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_12,plain,
! [X71,X72,X73] :
( ~ less(X71,X72)
| ~ less(X72,X73)
| less(X71,X73) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])]) ).
fof(c_0_13,plain,
! [X94,X95,X96] :
( ( less(X95,X94)
| ~ in_lopen(X94,X95,X96) )
& ( leq(X94,X96)
| ~ in_lopen(X94,X95,X96) )
& ( ~ less(X95,X94)
| ~ leq(X94,X96)
| in_lopen(X94,X95,X96) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).
cnf(c_0_14,plain,
( w = v800
| ~ leq(w,v800) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
cnf(c_0_18,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
in_lopen(w,v0,v600),
inference(split_conjunct,[status(thm)],[wit_in_lopen]) ).
fof(c_0_20,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_21,plain,
( w = v800
| ~ less(w,v800) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( less(X1,v800)
| ~ less(X1,v600) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
leq(w,v600),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_25,plain,
! [X70] : ~ less(X70,X70),
inference(variable_rename,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( w = v800
| ~ less(w,v600) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( w = v600
| less(w,v600) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( w = v600
| w = v800 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
~ less(v800,v600),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_31,plain,
( w = v600
| v800 != v600 ),
inference(ef,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( w = v800
| less(v800,w) ),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_33,plain,
w = v600,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
v800 = v600,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]),c_0_30]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_34]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT106+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.32 % Computer : n029.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:29 EDT 2026
% 0.15/0.33 % 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 Unsatisfiable for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.61 % Total time : 1.271s
%------------------------------------------------------------------------------