%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT091+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:27 PM UTC 2026
% Result : Theorem 0.61s 1.74s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 77 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 81 ( 34 ~; 32 |; 11 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-8 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 73 ( 0 sgn 39 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(in_closed,axiom,
! [X1,X4,X5] :
( in_closed(X1,X4,X5)
<=> ( leq(X4,X1)
& leq(X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_closed) ).
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(odrl624,conjecture,
box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl624) ).
fof(box2_overlap,axiom,
! [X15,X16,X17,X18,X22,X23,X24,X25] :
( box2_compatible(X15,X16,X17,X18,X22,X23,X24,X25)
<=> ( axis_compatible(X15,X16,X22,X23)
& axis_compatible(X17,X18,X24,X25) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+6.ax',box2_overlap) ).
fof(axis_compatible_def,axiom,
! [X6,X7,X8,X9] :
( axis_compatible(X6,X7,X8,X9)
<=> ? [X1] :
( in_closed(X1,X6,X7)
& in_closed(X1,X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(ord_v400_v600,axiom,
less(v400,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v600) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(c_0_8,plain,
! [X149,X150,X151] :
( ( leq(X150,X149)
| ~ in_closed(X149,X150,X151) )
& ( leq(X149,X151)
| ~ in_closed(X149,X150,X151) )
& ( ~ leq(X150,X149)
| ~ leq(X149,X151)
| in_closed(X149,X150,X151) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_closed])])]) ).
fof(c_0_9,plain,
! [X134,X135] :
( ( ~ leq(X134,X135)
| less(X134,X135)
| X134 = X135 )
& ( ~ less(X134,X135)
| leq(X134,X135) )
& ( X134 != X135
| leq(X134,X135) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
cnf(c_0_10,plain,
( in_closed(X2,X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl624])]) ).
fof(c_0_14,plain,
! [X215,X216,X217,X218,X219,X220,X221,X222] :
( ( axis_compatible(X215,X216,X219,X220)
| ~ box2_compatible(X215,X216,X217,X218,X219,X220,X221,X222) )
& ( axis_compatible(X217,X218,X221,X222)
| ~ box2_compatible(X215,X216,X217,X218,X219,X220,X221,X222) )
& ( ~ axis_compatible(X215,X216,X219,X220)
| ~ axis_compatible(X217,X218,X221,X222)
| box2_compatible(X215,X216,X217,X218,X219,X220,X221,X222) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[box2_overlap])])]) ).
fof(c_0_15,plain,
! [X171,X172,X173,X174,X176,X177,X178,X179,X180] :
( ( in_closed(esk2_4(X171,X172,X173,X174),X171,X172)
| ~ axis_compatible(X171,X172,X173,X174) )
& ( in_closed(esk2_4(X171,X172,X173,X174),X173,X174)
| ~ axis_compatible(X171,X172,X173,X174) )
& ( ~ in_closed(X180,X176,X177)
| ~ in_closed(X180,X178,X179)
| axis_compatible(X176,X177,X178,X179) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axis_compatible_def])])])])])]) ).
cnf(c_0_16,plain,
( in_closed(X1,X2,X3)
| ~ leq(X2,X1)
| ~ less(X1,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( box2_compatible(X1,X2,X5,X6,X3,X4,X7,X8)
| ~ axis_compatible(X1,X2,X3,X4)
| ~ axis_compatible(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( axis_compatible(X2,X3,X4,X5)
| ~ in_closed(X1,X2,X3)
| ~ in_closed(X1,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( in_closed(X1,X1,X2)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ axis_compatible(v0,v600,v400,v800),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X3,X1,X2)
| ~ less(X3,X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[ord_v400_v800]) ).
cnf(c_0_25,negated_conjecture,
~ in_closed(v400,v0,v600),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,plain,
( in_closed(X1,X2,X3)
| ~ less(X1,X3)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_27,plain,
less(v400,v600),
inference(split_conjunct,[status(thm)],[ord_v400_v600]) ).
cnf(c_0_28,plain,
less(v0,v400),
inference(split_conjunct,[status(thm)],[ord_v0_v400]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT091+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 : n029.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:14 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.61/1.74 % Version : CSE_E---1.7
% 0.61/1.74 % Problem : theBenchmark.p
% 0.61/1.74 % SZS status Theorem for theBenchmark.p
% 0.61/1.74 % SZS output start CNFRefutation
% See solution above
% 0.61/1.74 % Total time : 1.271s
%------------------------------------------------------------------------------