%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT090+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:27 PM UTC 2026
% Result : Theorem 0.28s 1.62s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 15 unt; 0 def)
% Number of atoms : 45 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 43 ( 19 ~; 15 |; 7 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(odrl613,conjecture,
wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl613) ).
fof(wf_lt,axiom,
! [X10,X13,X14] :
( wf(lt,X10,X13,X14)
<=> ( leq(X13,X10)
& leq(X10,X14)
& X10 != X13 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+8.ax',wf_lt) ).
fof(ord_v600_v1200,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(ord_v0_v600,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(c_0_6,plain,
! [X110,X111] :
( ( ~ leq(X110,X111)
| less(X110,X111)
| X110 = X111 )
& ( ~ less(X110,X111)
| leq(X110,X111) )
& ( X110 != X111
| leq(X110,X111) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_7,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl613])]) ).
fof(c_0_8,plain,
! [X185,X186,X187] :
( ( leq(X186,X185)
| ~ wf(lt,X185,X186,X187) )
& ( leq(X185,X187)
| ~ wf(lt,X185,X186,X187) )
& ( X185 != X186
| ~ wf(lt,X185,X186,X187) )
& ( ~ leq(X186,X185)
| ~ leq(X185,X187)
| X185 = X186
| wf(lt,X185,X186,X187) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[wf_lt])])]) ).
cnf(c_0_9,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
less(v600,v1200),
inference(split_conjunct,[status(thm)],[ord_v600_v1200]) ).
cnf(c_0_11,plain,
less(v0,v600),
inference(split_conjunct,[status(thm)],[ord_v0_v600]) ).
fof(c_0_12,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_13,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( X2 = X1
| wf(lt,X2,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
leq(v600,v1200),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
leq(v0,v600),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
fof(c_0_17,plain,
! [X104] : ~ less(X104,X104),
inference(variable_rename,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
v0 = v600,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT090+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.14/0.33 % Computer : n002.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 23:33:31 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/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.272s
%------------------------------------------------------------------------------