%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT009+1 : TPTP v9.2.1. Released v2.0.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 : 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:47:05 PM UTC 2026
% Result : Theorem 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 178 ( 0 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 236 ( 93 ~; 90 |; 47 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 111 ( 0 sgn 56 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_FOL,conjecture,
! [X1,X4,X11,X7,X8,X12,X13,X5,X6] :
( ( organization(X1,X5)
& organization(X4,X6)
& reorganization_free(X1,X5,X5)
& reorganization_free(X4,X6,X6)
& class(X1,X11,X5)
& class(X4,X11,X6)
& reproducibility(X1,X7,X5)
& reproducibility(X4,X8,X6)
& size(X1,X12,X5)
& size(X4,X13,X6)
& greater(X13,X12) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_FOL) ).
fof(a5_FOL,hypothesis,
! [X1,X4,X11,X12,X13,X9,X10,X5,X6] :
( ( organization(X1,X5)
& organization(X4,X6)
& class(X1,X11,X5)
& class(X4,X11,X6)
& size(X1,X12,X5)
& size(X4,X13,X6)
& inertia(X1,X9,X5)
& inertia(X4,X10,X6)
& greater(X13,X12) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(a3_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10] :
( ( organization(X1,X5)
& organization(X4,X6)
& reorganization_free(X1,X5,X5)
& reorganization_free(X4,X6,X6)
& reproducibility(X1,X7,X5)
& reproducibility(X4,X8,X6)
& inertia(X1,X9,X5)
& inertia(X4,X10,X6) )
=> ( greater(X8,X7)
<=> greater(X10,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X4,X11,X7,X8,X12,X13,X5,X6] :
( ( organization(X1,X5)
& organization(X4,X6)
& reorganization_free(X1,X5,X5)
& reorganization_free(X4,X6,X6)
& class(X1,X11,X5)
& class(X4,X11,X6)
& reproducibility(X1,X7,X5)
& reproducibility(X4,X8,X6)
& size(X1,X12,X5)
& size(X4,X13,X6)
& greater(X13,X12) )
=> greater(X8,X7) ),
inference(assume_negation,[status(cth)],[t9_FOL]) ).
fof(c_0_5,hypothesis,
! [X54,X55,X56,X57,X58,X59,X60,X61,X62] :
( ~ organization(X54,X61)
| ~ organization(X55,X62)
| ~ class(X54,X56,X61)
| ~ class(X55,X56,X62)
| ~ size(X54,X57,X61)
| ~ size(X55,X58,X62)
| ~ inertia(X54,X59,X61)
| ~ inertia(X55,X60,X62)
| ~ greater(X58,X57)
| greater(X60,X59) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a5_FOL])]) ).
fof(c_0_6,negated_conjecture,
( organization(esk2_0,esk9_0)
& organization(esk3_0,esk10_0)
& reorganization_free(esk2_0,esk9_0,esk9_0)
& reorganization_free(esk3_0,esk10_0,esk10_0)
& class(esk2_0,esk4_0,esk9_0)
& class(esk3_0,esk4_0,esk10_0)
& reproducibility(esk2_0,esk5_0,esk9_0)
& reproducibility(esk3_0,esk6_0,esk10_0)
& size(esk2_0,esk7_0,esk9_0)
& size(esk3_0,esk8_0,esk10_0)
& greater(esk8_0,esk7_0)
& ~ greater(esk6_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,hypothesis,
( greater(X9,X8)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X4)
| ~ size(X1,X6,X2)
| ~ size(X3,X7,X4)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X4)
| ~ greater(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
size(esk3_0,esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk3_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(esk3_0,X6,esk10_0)
| ~ class(X3,X6,X5)
| ~ greater(esk8_0,X4)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,negated_conjecture,
class(esk3_0,esk4_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X43,X44] :
( ~ organization(X43,X44)
| inertia(X43,esk1_2(X43,X44),X44) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])]) ).
fof(c_0_13,hypothesis,
! [X46,X47,X48,X49,X50,X51,X52,X53] :
( ( ~ greater(X51,X50)
| greater(X53,X52)
| ~ organization(X46,X48)
| ~ organization(X47,X49)
| ~ reorganization_free(X46,X48,X48)
| ~ reorganization_free(X47,X49,X49)
| ~ reproducibility(X46,X50,X48)
| ~ reproducibility(X47,X51,X49)
| ~ inertia(X46,X52,X48)
| ~ inertia(X47,X53,X49) )
& ( ~ greater(X53,X52)
| greater(X51,X50)
| ~ organization(X46,X48)
| ~ organization(X47,X49)
| ~ reorganization_free(X46,X48,X48)
| ~ reorganization_free(X47,X49,X49)
| ~ reproducibility(X46,X50,X48)
| ~ reproducibility(X47,X51,X49)
| ~ inertia(X46,X52,X48)
| ~ inertia(X47,X53,X49) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a3_FOL])])]) ).
cnf(c_0_14,negated_conjecture,
( greater(X1,X2)
| ~ size(X3,X4,X5)
| ~ class(X3,esk4_0,X5)
| ~ greater(esk8_0,X4)
| ~ inertia(esk3_0,X1,esk10_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,hypothesis,
( greater(X3,X4)
| ~ greater(X1,X2)
| ~ organization(X5,X6)
| ~ organization(X7,X8)
| ~ reorganization_free(X5,X6,X6)
| ~ reorganization_free(X7,X8,X8)
| ~ reproducibility(X5,X4,X6)
| ~ reproducibility(X7,X3,X8)
| ~ inertia(X5,X2,X6)
| ~ inertia(X7,X1,X8) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
reproducibility(esk3_0,esk6_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
reorganization_free(esk3_0,esk10_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ size(X2,X3,X4)
| ~ class(X2,esk4_0,X4)
| ~ greater(esk8_0,X3)
| ~ inertia(X2,X1,X4)
| ~ organization(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9])]) ).
cnf(c_0_20,negated_conjecture,
class(esk2_0,esk4_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
organization(esk2_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
( greater(esk6_0,X1)
| ~ greater(X2,X3)
| ~ reproducibility(X4,X1,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ inertia(esk3_0,X2,esk10_0)
| ~ inertia(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_9])]) ).
cnf(c_0_23,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ size(esk2_0,X2,esk9_0)
| ~ greater(esk8_0,X2)
| ~ inertia(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
size(esk2_0,esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
greater(esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
( greater(esk6_0,X1)
| ~ greater(esk1_2(esk3_0,esk10_0),X2)
| ~ reproducibility(X3,X1,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_9])]) ).
cnf(c_0_27,negated_conjecture,
( greater(esk1_2(esk3_0,esk10_0),X1)
| ~ inertia(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
( greater(esk6_0,X1)
| ~ reproducibility(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(esk2_0,X4,esk9_0)
| ~ inertia(X2,X4,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( greater(esk6_0,X1)
| ~ reproducibility(X2,X1,X3)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X2,esk1_2(esk2_0,esk9_0),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_21])]) ).
cnf(c_0_30,negated_conjecture,
reorganization_free(esk2_0,esk9_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
( greater(esk6_0,X1)
| ~ reproducibility(esk2_0,X1,esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_30]),c_0_21])]) ).
cnf(c_0_32,negated_conjecture,
reproducibility(esk2_0,esk5_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,negated_conjecture,
~ greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT009+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n002.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 23:26:31 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Theorem for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.376s
%------------------------------------------------------------------------------