%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT103+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:28 PM UTC 2026
% Result : Unsatisfiable 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 38 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 14 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(contradiction,axiom,
( less(v800,v600)
& less(v600,v800) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contradiction) ).
fof(ord_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(c_0_5,plain,
! [X78,X79] :
( ~ leq(X78,X79)
| ~ leq(X79,X78)
| X78 = X79 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).
fof(c_0_6,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])])]) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ leq(X1,X2)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_10,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,plain,
less(v800,v600),
inference(split_conjunct,[status(thm)],[contradiction]) ).
cnf(c_0_13,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
fof(c_0_14,plain,
! [X70] : ~ less(X70,X70),
inference(variable_rename,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
v800 = v600,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT103+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.14/0.32 % Computer : n027.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 23:33:35 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.61 % Total time : 1.270s
%------------------------------------------------------------------------------