TSTP Solution File: MGT005+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : MGT005+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 08:35:17 EDT 2024
% Result : Theorem 227.97s 29.22s
% Output : CNFRefutation 227.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 60 ( 24 unt; 0 def)
% Number of atoms : 371 ( 25 equ)
% Maximal formula atoms : 23 ( 6 avg)
% Number of connectives : 514 ( 203 ~; 214 |; 87 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 188 ( 7 sgn 82 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_plus_FOL,conjecture,
! [X1,X2,X12,X13,X7,X4,X5,X14,X15,X6,X10,X11,X16] :
( ( organization(X1,X10)
& organization(X2,X10)
& organization(X1,X16)
& organization(X2,X16)
& class(X1,X13,X10)
& class(X2,X13,X10)
& survival_chance(X1,X7,X10)
& survival_chance(X2,X7,X10)
& reorganization(X1,X10,X11)
& reorganization(X2,X10,X16)
& reorganization_type(X1,X12,X10)
& reorganization_type(X2,X12,X10)
& reorganization_free(X1,X11,X16)
& survival_chance(X1,X4,X6)
& survival_chance(X2,X5,X6)
& complexity(X1,X14,X10)
& complexity(X2,X15,X10)
& greater(X15,X14)
& ( X6 = X16
=> greater(X4,X5) ) )
=> ( X6 = X11
=> ( greater(X4,X5)
| X4 = X5 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3reVYNAJCd/E---3.1_11931.p',t5_plus_FOL) ).
fof(a11_FOL,hypothesis,
! [X1,X2,X12,X13,X7,X4,X5,X14,X15,X10,X11,X16] :
( ( organization(X1,X10)
& organization(X2,X10)
& organization(X1,X11)
& organization(X2,X11)
& class(X1,X13,X10)
& class(X2,X13,X10)
& survival_chance(X1,X7,X10)
& survival_chance(X2,X7,X10)
& reorganization(X1,X10,X11)
& reorganization(X2,X10,X16)
& reorganization_type(X1,X12,X10)
& reorganization_type(X2,X12,X10)
& survival_chance(X1,X4,X11)
& survival_chance(X2,X5,X11)
& complexity(X1,X14,X10)
& complexity(X2,X15,X10)
& greater(X15,X14) )
=> ( greater(X4,X5)
| X4 = X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.3reVYNAJCd/E---3.1_11931.p',a11_FOL) ).
fof(a10_FOL,hypothesis,
! [X1,X2,X12,X13,X14,X15,X10,X11,X16] :
( ( organization(X1,X10)
& organization(X2,X10)
& organization(X2,X16)
& class(X1,X13,X10)
& class(X2,X13,X10)
& reorganization(X1,X10,X11)
& reorganization(X2,X10,X16)
& reorganization_type(X1,X12,X10)
& reorganization_type(X2,X12,X10)
& complexity(X1,X14,X10)
& complexity(X2,X15,X10)
& greater(X15,X14) )
=> greater(X16,X11) ),
file('/export/starexec/sandbox2/tmp/tmp.3reVYNAJCd/E---3.1_11931.p',a10_FOL) ).
fof(mp13,axiom,
! [X1,X6,X8,X9] :
( ( organization(X1,X8)
& organization(X1,X9)
& greater(X6,X8)
& greater(X9,X6) )
=> organization(X1,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.3reVYNAJCd/E---3.1_11931.p',mp13) ).
fof(mp7,axiom,
! [X1,X10,X11] :
( reorganization(X1,X10,X11)
=> greater(X11,X10) ),
file('/export/starexec/sandbox2/tmp/tmp.3reVYNAJCd/E---3.1_11931.p',mp7) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X12,X13,X7,X4,X5,X14,X15,X6,X10,X11,X16] :
( ( organization(X1,X10)
& organization(X2,X10)
& organization(X1,X16)
& organization(X2,X16)
& class(X1,X13,X10)
& class(X2,X13,X10)
& survival_chance(X1,X7,X10)
& survival_chance(X2,X7,X10)
& reorganization(X1,X10,X11)
& reorganization(X2,X10,X16)
& reorganization_type(X1,X12,X10)
& reorganization_type(X2,X12,X10)
& reorganization_free(X1,X11,X16)
& survival_chance(X1,X4,X6)
& survival_chance(X2,X5,X6)
& complexity(X1,X14,X10)
& complexity(X2,X15,X10)
& greater(X15,X14)
& ( X6 = X16
=> greater(X4,X5) ) )
=> ( X6 = X11
=> ( greater(X4,X5)
| X4 = X5 ) ) ),
inference(assume_negation,[status(cth)],[t5_plus_FOL]) ).
fof(c_0_6,hypothesis,
! [X67,X68,X69,X70,X71,X72,X73,X74,X75,X76,X77,X78] :
( ~ organization(X67,X76)
| ~ organization(X68,X76)
| ~ organization(X67,X77)
| ~ organization(X68,X77)
| ~ class(X67,X70,X76)
| ~ class(X68,X70,X76)
| ~ survival_chance(X67,X71,X76)
| ~ survival_chance(X68,X71,X76)
| ~ reorganization(X67,X76,X77)
| ~ reorganization(X68,X76,X78)
| ~ reorganization_type(X67,X69,X76)
| ~ reorganization_type(X68,X69,X76)
| ~ survival_chance(X67,X72,X77)
| ~ survival_chance(X68,X73,X77)
| ~ complexity(X67,X74,X76)
| ~ complexity(X68,X75,X76)
| ~ greater(X75,X74)
| greater(X72,X73)
| X72 = X73 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a11_FOL])])]) ).
fof(c_0_7,negated_conjecture,
( organization(esk5_0,esk15_0)
& organization(esk6_0,esk15_0)
& organization(esk5_0,esk17_0)
& organization(esk6_0,esk17_0)
& class(esk5_0,esk8_0,esk15_0)
& class(esk6_0,esk8_0,esk15_0)
& survival_chance(esk5_0,esk9_0,esk15_0)
& survival_chance(esk6_0,esk9_0,esk15_0)
& reorganization(esk5_0,esk15_0,esk16_0)
& reorganization(esk6_0,esk15_0,esk17_0)
& reorganization_type(esk5_0,esk7_0,esk15_0)
& reorganization_type(esk6_0,esk7_0,esk15_0)
& reorganization_free(esk5_0,esk16_0,esk17_0)
& survival_chance(esk5_0,esk10_0,esk14_0)
& survival_chance(esk6_0,esk11_0,esk14_0)
& complexity(esk5_0,esk12_0,esk15_0)
& complexity(esk6_0,esk13_0,esk15_0)
& greater(esk13_0,esk12_0)
& ( esk14_0 != esk17_0
| greater(esk10_0,esk11_0) )
& esk14_0 = esk16_0
& ~ greater(esk10_0,esk11_0)
& esk10_0 != esk11_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,hypothesis,
! [X58,X59,X60,X61,X62,X63,X64,X65,X66] :
( ~ organization(X58,X64)
| ~ organization(X59,X64)
| ~ organization(X59,X66)
| ~ class(X58,X61,X64)
| ~ class(X59,X61,X64)
| ~ reorganization(X58,X64,X65)
| ~ reorganization(X59,X64,X66)
| ~ reorganization_type(X58,X60,X64)
| ~ reorganization_type(X59,X60,X64)
| ~ complexity(X58,X62,X64)
| ~ complexity(X59,X63,X64)
| ~ greater(X63,X62)
| greater(X66,X65) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a10_FOL])])]) ).
cnf(c_0_9,hypothesis,
( greater(X9,X10)
| X9 = X10
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X1,X4)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ survival_chance(X1,X6,X2)
| ~ survival_chance(X3,X6,X2)
| ~ reorganization(X1,X2,X4)
| ~ reorganization(X3,X2,X7)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization_type(X3,X8,X2)
| ~ survival_chance(X1,X9,X4)
| ~ survival_chance(X3,X10,X4)
| ~ complexity(X1,X11,X2)
| ~ complexity(X3,X12,X2)
| ~ greater(X12,X11) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
complexity(esk6_0,esk13_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
organization(esk6_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( greater(X4,X6)
| ~ organization(X1,X2)
| ~ organization(X3,X2)
| ~ organization(X3,X4)
| ~ class(X1,X5,X2)
| ~ class(X3,X5,X2)
| ~ reorganization(X1,X2,X6)
| ~ reorganization(X3,X2,X4)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ complexity(X1,X8,X2)
| ~ complexity(X3,X9,X2)
| ~ greater(X9,X8) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(esk6_0,X5,esk15_0)
| ~ reorganization_type(X3,X5,esk15_0)
| ~ class(esk6_0,X6,esk15_0)
| ~ class(X3,X6,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X7)
| ~ reorganization(X3,esk15_0,X8)
| ~ organization(esk6_0,X8)
| ~ organization(X3,esk15_0)
| ~ organization(X3,X8)
| ~ survival_chance(esk6_0,X9,esk15_0)
| ~ survival_chance(esk6_0,X2,X8)
| ~ survival_chance(X3,X9,esk15_0)
| ~ survival_chance(X3,X1,X8)
| ~ greater(esk13_0,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
reorganization_type(esk6_0,esk7_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(esk6_0,X5,esk15_0)
| ~ reorganization_type(X3,X5,esk15_0)
| ~ class(esk6_0,X6,esk15_0)
| ~ class(X3,X6,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X1)
| ~ reorganization(X3,esk15_0,X2)
| ~ organization(esk6_0,X1)
| ~ organization(X3,esk15_0)
| ~ greater(esk13_0,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(X3,esk7_0,esk15_0)
| ~ class(esk6_0,X5,esk15_0)
| ~ class(X3,X5,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X6)
| ~ reorganization(X3,esk15_0,X7)
| ~ organization(esk6_0,X7)
| ~ organization(X3,esk15_0)
| ~ organization(X3,X7)
| ~ survival_chance(esk6_0,X8,esk15_0)
| ~ survival_chance(esk6_0,X2,X7)
| ~ survival_chance(X3,X8,esk15_0)
| ~ survival_chance(X3,X1,X7)
| ~ greater(esk13_0,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
reorganization_type(esk5_0,esk7_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
organization(esk5_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( greater(X1,X2)
| ~ complexity(X3,X4,esk15_0)
| ~ reorganization_type(X3,esk7_0,esk15_0)
| ~ class(esk6_0,X5,esk15_0)
| ~ class(X3,X5,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X1)
| ~ reorganization(X3,esk15_0,X2)
| ~ organization(esk6_0,X1)
| ~ organization(X3,esk15_0)
| ~ greater(esk13_0,X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ complexity(esk5_0,X3,esk15_0)
| ~ class(esk6_0,X4,esk15_0)
| ~ class(esk5_0,X4,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X5)
| ~ reorganization(esk5_0,esk15_0,X6)
| ~ organization(esk6_0,X6)
| ~ organization(esk5_0,X6)
| ~ survival_chance(esk6_0,X7,esk15_0)
| ~ survival_chance(esk5_0,X7,esk15_0)
| ~ survival_chance(esk6_0,X2,X6)
| ~ survival_chance(esk5_0,X1,X6)
| ~ greater(esk13_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
complexity(esk5_0,esk12_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
greater(esk13_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( greater(X1,X2)
| ~ complexity(esk5_0,X3,esk15_0)
| ~ class(esk6_0,X4,esk15_0)
| ~ class(esk5_0,X4,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X1)
| ~ reorganization(esk5_0,esk15_0,X2)
| ~ organization(esk6_0,X1)
| ~ greater(esk13_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ class(esk6_0,X3,esk15_0)
| ~ class(esk5_0,X3,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X4)
| ~ reorganization(esk5_0,esk15_0,X5)
| ~ organization(esk6_0,X5)
| ~ organization(esk5_0,X5)
| ~ survival_chance(esk6_0,X6,esk15_0)
| ~ survival_chance(esk5_0,X6,esk15_0)
| ~ survival_chance(esk6_0,X2,X5)
| ~ survival_chance(esk5_0,X1,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
class(esk6_0,esk8_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
class(esk5_0,esk8_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_27,plain,
! [X39,X40,X41,X42] :
( ~ organization(X39,X41)
| ~ organization(X39,X42)
| ~ greater(X40,X41)
| ~ greater(X42,X40)
| organization(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp13])])]) ).
cnf(c_0_28,negated_conjecture,
( greater(X1,X2)
| ~ class(esk6_0,X3,esk15_0)
| ~ class(esk5_0,X3,esk15_0)
| ~ reorganization(esk6_0,esk15_0,X1)
| ~ reorganization(esk5_0,esk15_0,X2)
| ~ organization(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ reorganization(esk6_0,esk15_0,X3)
| ~ reorganization(esk5_0,esk15_0,X4)
| ~ organization(esk6_0,X4)
| ~ organization(esk5_0,X4)
| ~ survival_chance(esk6_0,X5,esk15_0)
| ~ survival_chance(esk5_0,X5,esk15_0)
| ~ survival_chance(esk6_0,X2,X4)
| ~ survival_chance(esk5_0,X1,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
reorganization(esk6_0,esk15_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,negated_conjecture,
reorganization(esk5_0,esk15_0,esk16_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
esk14_0 = esk16_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,plain,
( organization(X1,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ greater(X4,X2)
| ~ greater(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
organization(esk6_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
( greater(X1,X2)
| ~ reorganization(esk6_0,esk15_0,X1)
| ~ reorganization(esk5_0,esk15_0,X2)
| ~ organization(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26])]) ).
fof(c_0_36,plain,
! [X43,X44,X45] :
( ~ reorganization(X43,X44,X45)
| greater(X45,X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp7])])]) ).
cnf(c_0_37,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ reorganization(esk5_0,esk15_0,X3)
| ~ organization(esk6_0,X3)
| ~ organization(esk5_0,X3)
| ~ survival_chance(esk6_0,X4,esk15_0)
| ~ survival_chance(esk5_0,X4,esk15_0)
| ~ survival_chance(esk6_0,X2,X3)
| ~ survival_chance(esk5_0,X1,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
reorganization(esk5_0,esk15_0,esk14_0),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( organization(esk6_0,X1)
| ~ organization(esk6_0,X2)
| ~ greater(esk17_0,X1)
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( greater(esk17_0,X1)
| ~ reorganization(esk5_0,esk15_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_34])]) ).
cnf(c_0_41,plain,
( greater(X3,X2)
| ~ reorganization(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
organization(esk5_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_43,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ organization(esk6_0,esk14_0)
| ~ organization(esk5_0,esk14_0)
| ~ survival_chance(esk6_0,X3,esk15_0)
| ~ survival_chance(esk5_0,X3,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0)
| ~ survival_chance(esk5_0,X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( organization(esk6_0,X1)
| ~ greater(esk17_0,X1)
| ~ greater(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_11]) ).
cnf(c_0_45,negated_conjecture,
greater(esk17_0,esk14_0),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
greater(esk14_0,esk15_0),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_47,negated_conjecture,
( organization(esk5_0,X1)
| ~ organization(esk5_0,X2)
| ~ greater(esk17_0,X1)
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ organization(esk5_0,esk14_0)
| ~ survival_chance(esk6_0,X3,esk15_0)
| ~ survival_chance(esk5_0,X3,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0)
| ~ survival_chance(esk5_0,X1,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_49,negated_conjecture,
( organization(esk5_0,X1)
| ~ greater(esk17_0,X1)
| ~ greater(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_18]) ).
cnf(c_0_50,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ survival_chance(esk6_0,X3,esk15_0)
| ~ survival_chance(esk5_0,X3,esk15_0)
| ~ survival_chance(esk6_0,X2,esk14_0)
| ~ survival_chance(esk5_0,X1,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]),c_0_46])]) ).
cnf(c_0_51,negated_conjecture,
survival_chance(esk6_0,esk9_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_52,negated_conjecture,
survival_chance(esk5_0,esk9_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_53,negated_conjecture,
( X1 = X2
| greater(X1,X2)
| ~ survival_chance(esk6_0,X2,esk14_0)
| ~ survival_chance(esk5_0,X1,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).
cnf(c_0_54,negated_conjecture,
survival_chance(esk6_0,esk11_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_55,negated_conjecture,
( X1 = esk11_0
| greater(X1,esk11_0)
| ~ survival_chance(esk5_0,X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
survival_chance(esk5_0,esk10_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_57,negated_conjecture,
esk10_0 != esk11_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_58,negated_conjecture,
~ greater(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT005+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 14:12:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.3reVYNAJCd/E---3.1_11931.p
% 227.97/29.22 # Version: 3.1.0
% 227.97/29.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 227.97/29.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.97/29.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 227.97/29.22 # Starting new_bool_3 with 300s (1) cores
% 227.97/29.22 # Starting new_bool_1 with 300s (1) cores
% 227.97/29.22 # Starting sh5l with 300s (1) cores
% 227.97/29.22 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12009 completed with status 0
% 227.97/29.22 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 227.97/29.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 227.97/29.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.97/29.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 227.97/29.22 # No SInE strategy applied
% 227.97/29.22 # Search class: FGHSF-FFMM33-SFFFFFNN
% 227.97/29.22 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 227.97/29.22 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 227.97/29.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 227.97/29.22 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 227.97/29.22 # Starting new_bool_3 with 136s (1) cores
% 227.97/29.22 # Starting new_bool_1 with 136s (1) cores
% 227.97/29.22 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12014 completed with status 0
% 227.97/29.22 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 227.97/29.22 # Preprocessing class: FSMSSMSSSSSNFFN.
% 227.97/29.22 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.97/29.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 227.97/29.22 # No SInE strategy applied
% 227.97/29.22 # Search class: FGHSF-FFMM33-SFFFFFNN
% 227.97/29.22 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 227.97/29.22 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 227.97/29.22 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 227.97/29.22 # Preprocessing time : 0.002 s
% 227.97/29.22 # Presaturation interreduction done
% 227.97/29.22
% 227.97/29.22 # Proof found!
% 227.97/29.22 # SZS status Theorem
% 227.97/29.22 # SZS output start CNFRefutation
% See solution above
% 227.97/29.22 # Parsed axioms : 13
% 227.97/29.22 # Removed by relevancy pruning/SinE : 0
% 227.97/29.22 # Initial clauses : 38
% 227.97/29.22 # Removed in clause preprocessing : 0
% 227.97/29.22 # Initial clauses in saturation : 38
% 227.97/29.22 # Processed clauses : 41145
% 227.97/29.22 # ...of these trivial : 22
% 227.97/29.22 # ...subsumed : 31289
% 227.97/29.22 # ...remaining for further processing : 9834
% 227.97/29.22 # Other redundant clauses eliminated : 1
% 227.97/29.22 # Clauses deleted for lack of memory : 0
% 227.97/29.22 # Backward-subsumed : 855
% 227.97/29.22 # Backward-rewritten : 83
% 227.97/29.22 # Generated clauses : 94914
% 227.97/29.22 # ...of the previous two non-redundant : 93026
% 227.97/29.22 # ...aggressively subsumed : 0
% 227.97/29.22 # Contextual simplify-reflections : 1060
% 227.97/29.22 # Paramodulations : 94913
% 227.97/29.22 # Factorizations : 0
% 227.97/29.22 # NegExts : 0
% 227.97/29.22 # Equation resolutions : 1
% 227.97/29.22 # Disequality decompositions : 0
% 227.97/29.22 # Total rewrite steps : 26783
% 227.97/29.22 # ...of those cached : 26759
% 227.97/29.22 # Propositional unsat checks : 1
% 227.97/29.22 # Propositional check models : 1
% 227.97/29.22 # Propositional check unsatisfiable : 0
% 227.97/29.22 # Propositional clauses : 0
% 227.97/29.22 # Propositional clauses after purity: 0
% 227.97/29.22 # Propositional unsat core size : 0
% 227.97/29.22 # Propositional preprocessing time : 0.000
% 227.97/29.22 # Propositional encoding time : 0.072
% 227.97/29.22 # Propositional solver time : 0.003
% 227.97/29.22 # Success case prop preproc time : 0.000
% 227.97/29.22 # Success case prop encoding time : 0.000
% 227.97/29.22 # Success case prop solver time : 0.000
% 227.97/29.22 # Current number of processed clauses : 8857
% 227.97/29.22 # Positive orientable unit clauses : 33
% 227.97/29.22 # Positive unorientable unit clauses: 0
% 227.97/29.22 # Negative unit clauses : 19
% 227.97/29.22 # Non-unit-clauses : 8805
% 227.97/29.22 # Current number of unprocessed clauses: 49462
% 227.97/29.22 # ...number of literals in the above : 792320
% 227.97/29.22 # Current number of archived formulas : 0
% 227.97/29.22 # Current number of archived clauses : 976
% 227.97/29.22 # Clause-clause subsumption calls (NU) : 27005571
% 227.97/29.22 # Rec. Clause-clause subsumption calls : 865303
% 227.97/29.22 # Non-unit clause-clause subsumptions : 18112
% 227.97/29.22 # Unit Clause-clause subsumption calls : 3924
% 227.97/29.22 # Rewrite failures with RHS unbound : 0
% 227.97/29.22 # BW rewrite match attempts : 4
% 227.97/29.22 # BW rewrite match successes : 4
% 227.97/29.22 # Condensation attempts : 0
% 227.97/29.22 # Condensation successes : 0
% 227.97/29.22 # Termbank termtop insertions : 4635711
% 227.97/29.22 # Search garbage collected termcells : 912
% 227.97/29.22
% 227.97/29.22 # -------------------------------------------------
% 227.97/29.22 # User time : 28.404 s
% 227.97/29.22 # System time : 0.120 s
% 227.97/29.22 # Total time : 28.524 s
% 227.97/29.22 # Maximum resident set size: 1924 pages
% 227.97/29.22
% 227.97/29.22 # -------------------------------------------------
% 227.97/29.22 # User time : 140.780 s
% 227.97/29.22 # System time : 0.914 s
% 227.97/29.22 # Total time : 141.694 s
% 227.97/29.22 # Maximum resident set size: 1764 pages
% 227.97/29.22 % E---3.1 exiting
% 227.97/29.22 % E exiting
%------------------------------------------------------------------------------