%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT012+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 : n005.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.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 158 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 198 ( 83 ~; 74 |; 34 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 111 ( 0 sgn 60 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t12_FOL,conjecture,
! [X1,X8,X9,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& complexity(X1,X8,X6)
& complexity(X1,X9,X7)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp10,axiom,
! [X1,X6,X7,X8,X9] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& class(X1,X8,X6)
& class(X1,X9,X7) )
=> X8 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(mp9,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X5] : class(X1,X5,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(a12_FOL,hypothesis,
! [X1,X4,X5,X8,X9,X10,X11,X6,X7] :
( ( organization(X1,X6)
& organization(X4,X7)
& class(X1,X5,X6)
& class(X4,X5,X7)
& complexity(X1,X8,X6)
& complexity(X4,X9,X7)
& inertia(X1,X10,X6)
& inertia(X4,X11,X7)
& greater(X9,X8) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X10,X11,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& inertia(X1,X10,X6)
& inertia(X1,X11,X7)
& greater(X7,X6) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(mp6_2,axiom,
! [X1,X4] :
~ ( greater(X1,X4)
& greater(X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X8,X9,X6,X7] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization_free(X1,X6,X7)
& complexity(X1,X8,X6)
& complexity(X1,X9,X7)
& greater(X7,X6) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t12_FOL])]) ).
fof(c_0_8,plain,
! [X56,X57,X58,X59,X60] :
( ~ organization(X56,X57)
| ~ organization(X56,X58)
| ~ reorganization_free(X56,X57,X58)
| ~ class(X56,X59,X57)
| ~ class(X56,X60,X58)
| X59 = X60 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp10])]) ).
fof(c_0_9,negated_conjecture,
( organization(esk3_0,esk6_0)
& organization(esk3_0,esk7_0)
& reorganization_free(esk3_0,esk6_0,esk7_0)
& complexity(esk3_0,esk4_0,esk6_0)
& complexity(esk3_0,esk5_0,esk7_0)
& greater(esk7_0,esk6_0)
& greater(esk4_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_10,plain,
( X4 = X5
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ class(X1,X4,X2)
| ~ class(X1,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
reorganization_free(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
organization(esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
organization(esk3_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X53,X54] :
( ~ organization(X53,X54)
| class(X53,esk2_2(X53,X54),X54) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp9])])]) ).
fof(c_0_15,hypothesis,
! [X61,X62,X63,X64,X65,X66,X67,X68,X69] :
( ~ organization(X61,X68)
| ~ organization(X62,X69)
| ~ class(X61,X63,X68)
| ~ class(X62,X63,X69)
| ~ complexity(X61,X64,X68)
| ~ complexity(X62,X65,X69)
| ~ inertia(X61,X66,X68)
| ~ inertia(X62,X67,X69)
| ~ greater(X65,X64)
| greater(X67,X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a12_FOL])]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| ~ class(esk3_0,X2,esk7_0)
| ~ class(esk3_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
( class(X1,esk2_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
( greater(X9,X8)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X4)
| ~ complexity(X1,X6,X2)
| ~ complexity(X3,X7,X4)
| ~ inertia(X1,X8,X2)
| ~ inertia(X3,X9,X4)
| ~ greater(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
complexity(esk3_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( X1 = esk2_2(esk3_0,esk7_0)
| ~ class(esk3_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12])]) ).
fof(c_0_21,hypothesis,
! [X70,X71,X72,X73,X74] :
( ~ organization(X70,X73)
| ~ organization(X70,X74)
| ~ reorganization_free(X70,X73,X74)
| ~ inertia(X70,X71,X73)
| ~ inertia(X70,X72,X74)
| ~ greater(X74,X73)
| greater(X72,X71) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])]) ).
cnf(c_0_22,negated_conjecture,
( greater(X1,X2)
| ~ complexity(X3,X4,X5)
| ~ class(esk3_0,X6,esk6_0)
| ~ class(X3,X6,X5)
| ~ greater(esk4_0,X4)
| ~ inertia(esk3_0,X1,esk6_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_23,negated_conjecture,
esk2_2(esk3_0,esk7_0) = esk2_2(esk3_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_13])]) ).
cnf(c_0_24,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ inertia(X1,X4,X2)
| ~ inertia(X1,X5,X3)
| ~ greater(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
! [X46,X47] :
( ~ organization(X46,X47)
| inertia(X46,esk1_2(X46,X47),X47) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])]) ).
cnf(c_0_27,negated_conjecture,
( greater(X1,X2)
| ~ complexity(X3,X4,X5)
| ~ class(X3,esk2_2(esk3_0,esk6_0),X5)
| ~ greater(esk4_0,X4)
| ~ inertia(esk3_0,X1,esk6_0)
| ~ inertia(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_13])]) ).
cnf(c_0_28,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk6_0),esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_12])]) ).
fof(c_0_29,plain,
! [X51,X52] :
( ~ greater(X51,X52)
| ~ greater(X52,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_2])]) ).
cnf(c_0_30,negated_conjecture,
( greater(X1,X2)
| ~ inertia(esk3_0,X1,esk7_0)
| ~ inertia(esk3_0,X2,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_11]),c_0_25]),c_0_12]),c_0_13])]) ).
cnf(c_0_31,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( greater(X1,X2)
| ~ complexity(esk3_0,X3,esk7_0)
| ~ greater(esk4_0,X3)
| ~ inertia(esk3_0,X1,esk6_0)
| ~ inertia(esk3_0,X2,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]) ).
cnf(c_0_33,negated_conjecture,
complexity(esk3_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
greater(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( greater(esk1_2(esk3_0,esk7_0),X1)
| ~ inertia(esk3_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_12])]) ).
cnf(c_0_37,negated_conjecture,
( greater(X1,X2)
| ~ inertia(esk3_0,X1,esk6_0)
| ~ inertia(esk3_0,X2,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
( ~ greater(X1,esk1_2(esk3_0,esk7_0))
| ~ inertia(esk3_0,X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( greater(esk1_2(esk3_0,esk6_0),X1)
| ~ inertia(esk3_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_13])]) ).
cnf(c_0_40,negated_conjecture,
( ~ inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0)
| ~ inertia(esk3_0,esk1_2(esk3_0,esk7_0),esk7_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
~ inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_12])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_31]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT012+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.11 % 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.13/0.32 % Computer : n005.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon May 4 23:25:45 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Theorem for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------