%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT092+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 : n001.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 : Theorem 0.28s 1.65s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 53 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 19 |; 6 &)
% ( 1 <=>; 2 =>; 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 : 28 ( 0 sgn 18 !; 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(leq_less_trans,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(ord_v800_v1200,axiom,
less(v800,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v800_v1200) ).
fof(odrl633,conjecture,
completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl633) ).
fof(sharpness_conflict,axiom,
! [X7,X4,X5,X6] :
( ( leq(X5,X7)
& leq(X7,X6)
& less(X7,X4)
& leq(X4,X6) )
=> completion_conflict(X7,X4,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(c_0_7,plain,
! [X111,X112] :
( ( ~ leq(X111,X112)
| less(X111,X112)
| X111 = X112 )
& ( ~ less(X111,X112)
| leq(X111,X112) )
& ( X111 != X112
| leq(X111,X112) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_8,plain,
! [X117,X118,X119] :
( ~ leq(X117,X118)
| ~ less(X118,X119)
| less(X117,X119) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_less_trans])]) ).
cnf(c_0_9,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[ord_v400_v800]) ).
cnf(c_0_11,plain,
( less(X1,X3)
| ~ leq(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
leq(v400,v800),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( less(v400,X1)
| ~ less(v800,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
less(v800,v1200),
inference(split_conjunct,[status(thm)],[ord_v800_v1200]) ).
fof(c_0_15,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl633])]) ).
fof(c_0_16,plain,
! [X137,X138,X139,X140] :
( ~ leq(X139,X137)
| ~ leq(X137,X140)
| ~ less(X137,X138)
| ~ leq(X138,X140)
| completion_conflict(X137,X138,X139,X140) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sharpness_conflict])]) ).
cnf(c_0_17,plain,
less(v400,v1200),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).
cnf(c_0_19,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( completion_conflict(X2,X4,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3)
| ~ less(X2,X4)
| ~ leq(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
leq(v800,v1200),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_22,plain,
leq(v400,v1200),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_23,plain,
leq(v0,v400),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : MGT092+1 : TPTP v9.3.0. Released v9.3.0.
% 0.11/0.14 % 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.16/0.36 % Computer : n001.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 4 23:33:48 EDT 2026
% 0.16/0.36 % CPUTime :
% 0.16/0.37 % start to proof: theBenchmark
% 0.28/1.65 % Version : CSE_E---1.7
% 0.28/1.65 % Problem : theBenchmark.p
% 0.28/1.65 % SZS status Theorem for theBenchmark.p
% 0.28/1.65 % SZS output start CNFRefutation
% See solution above
% 0.28/1.65 % Total time : 1.272s
%------------------------------------------------------------------------------