%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT003+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 : n015.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:03 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 174 ( 70 ~; 67 |; 31 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 90 ( 2 sgn 46 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_FOL,conjecture,
! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL) ).
fof(mp4,axiom,
! [X1,X2,X3] :
( reorganization_free(X1,X2,X3)
=> ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4) ).
fof(t1_FOL,hypothesis,
! [X1,X6,X2,X3,X7,X8,X9,X10] :
( ( organization(X1,X2)
& organization(X6,X3)
& reorganization_free(X1,X2,X2)
& reorganization_free(X6,X3,X3)
& inertia(X1,X7,X2)
& inertia(X6,X8,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X6,X10,X3)
& greater(X8,X7) )
=> greater(X10,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X7,X8,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& inertia(X1,X7,X2)
& inertia(X1,X8,X3)
& greater(X3,X2) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).
fof(mp5,axiom,
! [X1,X4] :
( organization(X1,X4)
=> ? [X5] : inertia(X1,X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
inference(assume_negation,[status(cth)],[t3_FOL]) ).
fof(c_0_6,plain,
! [X35,X36,X37] :
( ( reorganization_free(X35,X36,X36)
| ~ reorganization_free(X35,X36,X37) )
& ( reorganization_free(X35,X37,X37)
| ~ reorganization_free(X35,X36,X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp4])])]) ).
fof(c_0_7,negated_conjecture,
( organization(esk2_0,esk5_0)
& organization(esk2_0,esk6_0)
& reorganization_free(esk2_0,esk5_0,esk6_0)
& survival_chance(esk2_0,esk3_0,esk5_0)
& survival_chance(esk2_0,esk4_0,esk6_0)
& greater(esk6_0,esk5_0)
& ~ greater(esk4_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,hypothesis,
! [X41,X42,X43,X44,X45,X46,X47,X48] :
( ~ organization(X41,X43)
| ~ organization(X42,X44)
| ~ reorganization_free(X41,X43,X43)
| ~ reorganization_free(X42,X44,X44)
| ~ inertia(X41,X45,X43)
| ~ inertia(X42,X46,X44)
| ~ survival_chance(X41,X47,X43)
| ~ survival_chance(X42,X48,X44)
| ~ greater(X46,X45)
| greater(X48,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_FOL])]) ).
cnf(c_0_9,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
reorganization_free(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X49,X50,X51,X52,X53] :
( ~ organization(X49,X52)
| ~ organization(X49,X53)
| ~ reorganization_free(X49,X52,X53)
| ~ inertia(X49,X50,X52)
| ~ inertia(X49,X51,X53)
| ~ greater(X53,X52)
| greater(X51,X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])]) ).
fof(c_0_12,plain,
! [X38,X39] :
( ~ organization(X38,X39)
| inertia(X38,esk1_2(X38,X39),X39) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])]) ).
cnf(c_0_13,hypothesis,
( greater(X8,X7)
| ~ organization(X1,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(X1,X2,X2)
| ~ reorganization_free(X3,X4,X4)
| ~ inertia(X1,X5,X2)
| ~ inertia(X3,X6,X4)
| ~ survival_chance(X1,X7,X2)
| ~ survival_chance(X3,X8,X4)
| ~ greater(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
survival_chance(esk2_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
organization(esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
reorganization_free(esk2_0,esk6_0,esk6_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,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_11]) ).
cnf(c_0_18,plain,
( inertia(X1,esk1_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( greater(esk4_0,X1)
| ~ greater(X2,X3)
| ~ survival_chance(X4,X1,X5)
| ~ inertia(esk2_0,X2,esk6_0)
| ~ inertia(X4,X3,X5)
| ~ organization(X4,X5)
| ~ reorganization_free(X4,X5,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_20,hypothesis,
( greater(esk1_2(X1,X2),X3)
| ~ greater(X2,X4)
| ~ inertia(X1,X3,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X4)
| ~ reorganization_free(X1,X4,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( greater(esk4_0,X1)
| ~ greater(esk1_2(esk2_0,esk6_0),X2)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,X2,X4)
| ~ organization(X3,X4)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_15])]) ).
cnf(c_0_22,hypothesis,
( greater(esk1_2(X1,X2),esk1_2(X1,X3))
| ~ greater(X2,X3)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_23,hypothesis,
( greater(esk4_0,X1)
| ~ greater(esk6_0,X2)
| ~ survival_chance(X3,X1,X4)
| ~ inertia(X3,esk1_2(esk2_0,X2),X4)
| ~ organization(esk2_0,X2)
| ~ organization(X3,X4)
| ~ reorganization_free(esk2_0,X2,esk6_0)
| ~ reorganization_free(X3,X4,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15])]) ).
cnf(c_0_24,plain,
( reorganization_free(X1,X2,X2)
| ~ reorganization_free(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,hypothesis,
( greater(esk4_0,X1)
| ~ greater(esk6_0,X2)
| ~ survival_chance(esk2_0,X1,X2)
| ~ organization(esk2_0,X2)
| ~ reorganization_free(esk2_0,X2,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
survival_chance(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
greater(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
organization(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
~ greater(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[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]),c_0_10])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT003+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.11 % 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.32 % Computer : n015.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 23:25:32 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/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.377s
%------------------------------------------------------------------------------