%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT014+1 : TPTP v9.2.1. Released v2.0.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 : n003.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:47:06 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 19 unt; 0 def)
% Number of atoms : 178 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 205 ( 79 ~; 68 |; 48 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 108 ( 1 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_FOL,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL) ).
fof(t14_FOL,conjecture,
! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_FOL) ).
fof(mp17,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp17) ).
fof(mp15,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15) ).
fof(t12_FOL,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp16,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp16) ).
fof(mp19,axiom,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& X4 = X5 )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp19) ).
fof(mp6_1,axiom,
! [X1,X2] :
~ ( greater(X1,X2)
& X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1) ).
fof(c_0_8,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X5,X4) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[t11_FOL]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X8,X9,X6,X7,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X6,X4)
& size(X1,X7,X5)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t14_FOL])]) ).
fof(c_0_10,hypothesis,
! [X59,X60,X61,X62,X63] :
( ~ organization(X59,X62)
| ~ organization(X59,X63)
| ~ reorganization_free(X59,X62,X63)
| ~ size(X59,X60,X62)
| ~ size(X59,X61,X63)
| ~ greater(X63,X62)
| ~ greater(X60,X61) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
fof(c_0_11,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& size(esk1_0,esk5_0,esk7_0)
& greater(esk5_0,esk4_0)
& greater(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X51,X52,X53] :
( ~ reorganization_free(X51,X52,X53)
| reorganization_free(X51,X53,X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp17])]) ).
fof(c_0_13,plain,
! [X47,X48] :
( ~ organization(X47,X48)
| time(X48) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp15])]) ).
cnf(c_0_14,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( reorganization_free(X1,X3,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[t12_FOL]) ).
fof(c_0_20,plain,
! [X49,X50] :
( ~ time(X49)
| ~ time(X50)
| greater(X49,X50)
| X49 = X50
| greater(X50,X49) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp16])]) ).
cnf(c_0_21,plain,
( time(X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ size(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk6_0)
| ~ organization(esk1_0,X2)
| ~ greater(X1,esk4_0)
| ~ greater(esk6_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_25,hypothesis,
! [X64,X65,X66,X67,X68] :
( ~ organization(X64,X67)
| ~ organization(X64,X68)
| ~ reorganization_free(X64,X67,X68)
| ~ complexity(X64,X65,X67)
| ~ complexity(X64,X66,X68)
| ~ greater(X68,X67)
| ~ greater(X65,X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_26,plain,
( greater(X1,X2)
| X1 = X2
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( ~ size(esk1_0,X1,esk7_0)
| ~ greater(esk6_0,esk7_0)
| ~ greater(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,hypothesis,
( ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X1,X5,X3)
| ~ greater(X3,X2)
| ~ greater(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X54,X55,X56,X57,X58] :
( ~ organization(X54,X57)
| ~ organization(X54,X58)
| ~ size(X54,X55,X57)
| ~ size(X54,X56,X58)
| X57 != X58
| X55 = X56 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp19])]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk7_0
| greater(X1,esk7_0)
| greater(esk7_0,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ organization(esk1_0,X2)
| ~ greater(X1,esk3_0)
| ~ greater(esk7_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22])]) ).
cnf(c_0_38,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_39,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,plain,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ size(X1,X4,X2)
| ~ size(X1,X5,X3)
| X2 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk7_0,esk6_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_18]),c_0_16]),c_0_39])]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ size(X3,X2,X4)
| ~ size(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_45,plain,
! [X43,X44] :
( ~ greater(X43,X44)
| X43 != X44 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_1])]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_15]),c_0_16])]) ).
cnf(c_0_47,negated_conjecture,
size(esk1_0,esk5_0,esk6_0),
inference(rw,[status(thm)],[c_0_29,c_0_44]) ).
cnf(c_0_48,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
esk4_0 = esk5_0,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT014+1 : TPTP v9.2.1. Released v2.0.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.16/0.33 % Computer : n003.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:27:56 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------