%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT005-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:27:06 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.48s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 29
% Syntax : Number of clauses : 110 ( 51 unt; 20 nHn; 110 RR)
% Number of literals : 416 ( 19 equ; 293 neg)
% Maximal clause size : 19 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 12 con; 0-2 aty)
% Number of variables : 235 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a10_FOL_34,hypothesis,
( ~ greater(X9,X8)
| ~ complexity(X3,X9,X2)
| ~ complexity(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a10_FOL_34) ).
cnf(t5_FOL_52,negated_conjecture,
complexity(sk3,sk10,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_52) ).
cnf(t5_FOL_37,negated_conjecture,
organization(sk3,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_37) ).
cnf(t5_FOL_39,negated_conjecture,
organization(sk3,sk13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_39) ).
cnf(t5_FOL_45,negated_conjecture,
reorganization(sk3,sk11,sk13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_45) ).
cnf(t5_FOL_36,negated_conjecture,
organization(sk2,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_36) ).
cnf(t5_FOL_53,negated_conjecture,
greater(sk10,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_53) ).
cnf(t5_FOL_51,negated_conjecture,
complexity(sk2,sk9,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_51) ).
cnf(mp7_31,axiom,
( ~ reorganization(X1,X2,X3)
| greater(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp7_31) ).
cnf(t5_FOL_47,negated_conjecture,
reorganization_type(sk3,sk4,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_47) ).
cnf(t5_FOL_46,negated_conjecture,
reorganization_type(sk2,sk4,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_46) ).
cnf(mp13_30,axiom,
( ~ greater(X3,X4)
| ~ greater(X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| organization(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp13_30) ).
cnf(t5_FOL_44,negated_conjecture,
reorganization(sk2,sk11,sk12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_44) ).
cnf(t5_FOL_41,negated_conjecture,
class(sk3,sk5,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_41) ).
cnf(t5_FOL_40,negated_conjecture,
class(sk2,sk5,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_40) ).
cnf(a11_FOL_35,hypothesis,
( ~ greater(X12,X11)
| ~ complexity(X3,X12,X2)
| ~ complexity(X1,X11,X2)
| ~ survival_chance(X3,X10,X4)
| ~ survival_chance(X1,X9,X4)
| ~ reorganization_type(X3,X8,X2)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization(X3,X2,X7)
| ~ reorganization(X1,X2,X4)
| ~ survival_chance(X3,X6,X2)
| ~ survival_chance(X1,X6,X2)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| X9 = X10
| greater(X9,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a11_FOL_35) ).
cnf(t5_FOL_38,negated_conjecture,
organization(sk2,sk13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_38) ).
cnf(t4_FOL_33,hypothesis,
( ~ greater(X3,X2)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X1,X6,X2)
| ~ reorganization(X1,X4,X5)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X6,X7)
| greater(X3,X5)
| greater(X4,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_FOL_33) ).
cnf(mp6_1_26,axiom,
( X1 != X2
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1_26) ).
cnf(mp6_2_27,axiom,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2_27) ).
cnf(mp12_29,axiom,
( ~ organization(X1,X2)
| survival_chance(X1,sk1(X2,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp12_29) ).
cnf(t5_FOL_50,negated_conjecture,
survival_chance(sk3,sk8,sk13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_50) ).
cnf(t5_FOL_43,negated_conjecture,
survival_chance(sk3,sk6,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_43) ).
cnf(t5_FOL_42,negated_conjecture,
survival_chance(sk2,sk6,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_42) ).
cnf(t3_FOL_32,hypothesis,
( ~ greater(X3,X2)
| ~ survival_chance(X1,X5,X3)
| ~ survival_chance(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_FOL_32) ).
cnf(mp11_28,axiom,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp11_28) ).
cnf(t5_FOL_48,negated_conjecture,
reorganization_free(sk2,sk12,sk13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_48) ).
cnf(t5_FOL_49,negated_conjecture,
survival_chance(sk2,sk7,sk13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_49) ).
cnf(t5_FOL_54,negated_conjecture,
~ greater(sk7,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_FOL_54) ).
cnf(c_0_29,hypothesis,
( ~ greater(X9,X8)
| ~ complexity(X3,X9,X2)
| ~ complexity(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X4,X6) ),
inference(fof_simplification,[status(thm)],[a10_FOL_34]) ).
cnf(c_0_30,hypothesis,
( ~ greater(X9,X8)
| ~ complexity(X3,X9,X2)
| ~ complexity(X1,X8,X2)
| ~ reorganization_type(X3,X7,X2)
| ~ reorganization_type(X1,X7,X2)
| ~ reorganization(X3,X2,X4)
| ~ reorganization(X1,X2,X6)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| greater(X4,X6) ),
c_0_29 ).
cnf(c_0_31,negated_conjecture,
complexity(sk3,sk10,sk11),
t5_FOL_52 ).
cnf(c_0_32,negated_conjecture,
organization(sk3,sk11),
t5_FOL_37 ).
cnf(c_0_33,negated_conjecture,
( ~ greater(sk10,X4)
| ~ organization(X3,sk11)
| ~ organization(sk3,X1)
| ~ reorganization(X3,sk11,X2)
| ~ reorganization(sk3,sk11,X1)
| ~ class(X3,X6,sk11)
| ~ class(sk3,X6,sk11)
| ~ reorganization_type(X3,X5,sk11)
| ~ reorganization_type(sk3,X5,sk11)
| ~ complexity(X3,X4,sk11)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
organization(sk3,sk13),
t5_FOL_39 ).
cnf(c_0_35,negated_conjecture,
reorganization(sk3,sk11,sk13),
t5_FOL_45 ).
cnf(c_0_36,negated_conjecture,
( ~ greater(sk10,X3)
| ~ organization(X2,sk11)
| ~ reorganization(X2,sk11,X1)
| ~ class(X2,X5,sk11)
| ~ class(sk3,X5,sk11)
| ~ reorganization_type(X2,X4,sk11)
| ~ reorganization_type(sk3,X4,sk11)
| ~ complexity(X2,X3,sk11)
| greater(sk13,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_37,negated_conjecture,
organization(sk2,sk11),
t5_FOL_36 ).
cnf(c_0_38,negated_conjecture,
( ~ greater(sk10,X2)
| ~ reorganization(sk2,sk11,X1)
| ~ class(sk2,X4,sk11)
| ~ class(sk3,X4,sk11)
| ~ reorganization_type(sk2,X3,sk11)
| ~ reorganization_type(sk3,X3,sk11)
| ~ complexity(sk2,X2,sk11)
| greater(sk13,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
greater(sk10,sk9),
t5_FOL_53 ).
cnf(c_0_40,negated_conjecture,
complexity(sk2,sk9,sk11),
t5_FOL_51 ).
cnf(c_0_41,plain,
( ~ reorganization(X1,X2,X3)
| greater(X3,X2) ),
inference(fof_simplification,[status(thm)],[mp7_31]) ).
cnf(c_0_42,negated_conjecture,
( ~ reorganization(sk2,sk11,X1)
| ~ class(sk2,X3,sk11)
| ~ class(sk3,X3,sk11)
| ~ reorganization_type(sk2,X2,sk11)
| ~ reorganization_type(sk3,X2,sk11)
| greater(sk13,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,negated_conjecture,
reorganization_type(sk3,sk4,sk11),
t5_FOL_47 ).
cnf(c_0_44,negated_conjecture,
reorganization_type(sk2,sk4,sk11),
t5_FOL_46 ).
cnf(c_0_45,plain,
( ~ greater(X3,X4)
| ~ greater(X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| organization(X1,X4) ),
inference(fof_simplification,[status(thm)],[mp13_30]) ).
cnf(c_0_46,plain,
( ~ reorganization(X1,X2,X3)
| greater(X3,X2) ),
c_0_41 ).
cnf(c_0_47,negated_conjecture,
reorganization(sk2,sk11,sk12),
t5_FOL_44 ).
cnf(c_0_48,negated_conjecture,
( ~ reorganization(sk2,sk11,X1)
| ~ class(sk2,X2,sk11)
| ~ class(sk3,X2,sk11)
| greater(sk13,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
class(sk3,sk5,sk11),
t5_FOL_41 ).
cnf(c_0_50,negated_conjecture,
class(sk2,sk5,sk11),
t5_FOL_40 ).
cnf(c_0_51,plain,
( ~ greater(X3,X4)
| ~ greater(X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| organization(X1,X4) ),
c_0_45 ).
cnf(c_0_52,negated_conjecture,
greater(sk12,sk11),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( ~ reorganization(sk2,sk11,X1)
| greater(sk13,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,hypothesis,
( ~ greater(X12,X11)
| ~ complexity(X3,X12,X2)
| ~ complexity(X1,X11,X2)
| ~ survival_chance(X3,X10,X4)
| ~ survival_chance(X1,X9,X4)
| ~ reorganization_type(X3,X8,X2)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization(X3,X2,X7)
| ~ reorganization(X1,X2,X4)
| ~ survival_chance(X3,X6,X2)
| ~ survival_chance(X1,X6,X2)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| X9 = X10
| greater(X9,X10) ),
inference(fof_simplification,[status(thm)],[a11_FOL_35]) ).
cnf(c_0_55,negated_conjecture,
( ~ greater(X2,sk12)
| ~ organization(X1,X2)
| ~ organization(X1,sk11)
| organization(X1,sk12) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
greater(sk13,sk12),
inference(spm,[status(thm)],[c_0_53,c_0_47]) ).
cnf(c_0_57,hypothesis,
( ~ greater(X12,X11)
| ~ complexity(X3,X12,X2)
| ~ complexity(X1,X11,X2)
| ~ survival_chance(X3,X10,X4)
| ~ survival_chance(X1,X9,X4)
| ~ reorganization_type(X3,X8,X2)
| ~ reorganization_type(X1,X8,X2)
| ~ reorganization(X3,X2,X7)
| ~ reorganization(X1,X2,X4)
| ~ survival_chance(X3,X6,X2)
| ~ survival_chance(X1,X6,X2)
| ~ class(X3,X5,X2)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X4)
| ~ organization(X3,X2)
| ~ organization(X1,X2)
| X9 = X10
| greater(X9,X10) ),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
( ~ organization(X1,sk13)
| ~ organization(X1,sk11)
| organization(X1,sk12) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
( ~ greater(sk10,X4)
| ~ organization(X3,X8)
| ~ organization(X3,sk11)
| ~ organization(sk3,X8)
| ~ survival_chance(X3,X1,X8)
| ~ survival_chance(X3,X9,sk11)
| ~ survival_chance(sk3,X2,X8)
| ~ survival_chance(sk3,X9,sk11)
| ~ reorganization(X3,sk11,X8)
| ~ reorganization(sk3,sk11,X7)
| ~ class(X3,X6,sk11)
| ~ class(sk3,X6,sk11)
| ~ reorganization_type(X3,X5,sk11)
| ~ reorganization_type(sk3,X5,sk11)
| ~ complexity(X3,X4,sk11)
| greater(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_31]),c_0_32])]) ).
cnf(c_0_60,negated_conjecture,
organization(sk3,sk12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_32]),c_0_34])]) ).
cnf(c_0_61,negated_conjecture,
organization(sk2,sk13),
t5_FOL_38 ).
cnf(c_0_62,negated_conjecture,
( ~ greater(sk10,X4)
| ~ organization(X3,sk12)
| ~ organization(X3,sk11)
| ~ survival_chance(X3,X1,sk12)
| ~ survival_chance(X3,X8,sk11)
| ~ survival_chance(sk3,X2,sk12)
| ~ survival_chance(sk3,X8,sk11)
| ~ reorganization(X3,sk11,sk12)
| ~ reorganization(sk3,sk11,X7)
| ~ class(X3,X6,sk11)
| ~ class(sk3,X6,sk11)
| ~ reorganization_type(X3,X5,sk11)
| ~ reorganization_type(sk3,X5,sk11)
| ~ complexity(X3,X4,sk11)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
organization(sk2,sk12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_37]),c_0_61])]) ).
cnf(c_0_64,hypothesis,
( ~ greater(X3,X2)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X1,X6,X2)
| ~ reorganization(X1,X4,X5)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X6,X7)
| greater(X3,X5)
| greater(X4,X2) ),
inference(fof_simplification,[status(thm)],[t4_FOL_33]) ).
cnf(c_0_65,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp6_1_26]) ).
cnf(c_0_66,negated_conjecture,
( ~ greater(sk10,X3)
| ~ survival_chance(sk2,X1,sk12)
| ~ survival_chance(sk2,X7,sk11)
| ~ survival_chance(sk3,X2,sk12)
| ~ survival_chance(sk3,X7,sk11)
| ~ reorganization(sk3,sk11,X6)
| ~ class(sk2,X5,sk11)
| ~ class(sk3,X5,sk11)
| ~ reorganization_type(sk2,X4,sk11)
| ~ reorganization_type(sk3,X4,sk11)
| ~ complexity(sk2,X3,sk11)
| greater(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_37]),c_0_47]),c_0_63])]) ).
cnf(c_0_67,hypothesis,
( ~ greater(X3,X2)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X1,X6,X2)
| ~ reorganization(X1,X4,X5)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X6,X7)
| greater(X3,X5)
| greater(X4,X2) ),
c_0_64 ).
cnf(c_0_68,plain,
( X1 != X2
| ~ greater(X1,X2) ),
c_0_65 ).
cnf(c_0_69,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(fof_simplification,[status(thm)],[mp6_2_27]) ).
cnf(c_0_70,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| ~ survival_chance(sk2,X6,sk11)
| ~ survival_chance(sk3,X2,sk12)
| ~ survival_chance(sk3,X6,sk11)
| ~ reorganization(sk3,sk11,X5)
| ~ class(sk2,X4,sk11)
| ~ class(sk3,X4,sk11)
| ~ reorganization_type(sk2,X3,sk11)
| ~ reorganization_type(sk3,X3,sk11)
| greater(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_39]),c_0_40])]) ).
cnf(c_0_71,negated_conjecture,
( ~ greater(X1,X2)
| ~ organization(sk3,X2)
| ~ organization(sk3,X1)
| ~ survival_chance(sk3,X3,X2)
| ~ survival_chance(sk3,X4,X1)
| greater(X3,X4)
| greater(sk11,X2)
| greater(X1,sk13) ),
inference(spm,[status(thm)],[c_0_67,c_0_35]) ).
cnf(c_0_72,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_73,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
c_0_69 ).
cnf(c_0_74,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| ~ survival_chance(sk2,X5,sk11)
| ~ survival_chance(sk3,X2,sk12)
| ~ survival_chance(sk3,X5,sk11)
| ~ reorganization(sk3,sk11,X4)
| ~ class(sk2,X3,sk11)
| ~ class(sk3,X3,sk11)
| greater(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_43]),c_0_44])]) ).
cnf(c_0_75,negated_conjecture,
( ~ greater(sk13,X1)
| ~ organization(sk3,X1)
| ~ survival_chance(sk3,X2,X1)
| ~ survival_chance(sk3,X3,sk13)
| greater(X2,X3)
| greater(sk11,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_34]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
~ greater(sk11,sk12),
inference(spm,[status(thm)],[c_0_73,c_0_52]) ).
cnf(c_0_77,plain,
( ~ organization(X1,X2)
| survival_chance(X1,sk1(X2,X1),X2) ),
inference(fof_simplification,[status(thm)],[mp12_29]) ).
cnf(c_0_78,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| ~ survival_chance(sk2,X4,sk11)
| ~ survival_chance(sk3,X2,sk12)
| ~ survival_chance(sk3,X4,sk11)
| ~ reorganization(sk3,sk11,X3)
| greater(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_49]),c_0_50])]) ).
cnf(c_0_79,negated_conjecture,
( ~ survival_chance(sk3,X1,sk12)
| ~ survival_chance(sk3,X2,sk13)
| greater(X1,X2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_60]),c_0_56])]),c_0_76]) ).
cnf(c_0_80,negated_conjecture,
survival_chance(sk3,sk8,sk13),
t5_FOL_50 ).
cnf(c_0_81,plain,
( ~ organization(X1,X2)
| survival_chance(X1,sk1(X2,X1),X2) ),
c_0_77 ).
cnf(c_0_82,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| ~ survival_chance(sk2,X3,sk11)
| ~ survival_chance(sk3,X2,sk12)
| ~ survival_chance(sk3,X3,sk11)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_78,c_0_35]) ).
cnf(c_0_83,negated_conjecture,
survival_chance(sk3,sk6,sk11),
t5_FOL_43 ).
cnf(c_0_84,negated_conjecture,
survival_chance(sk2,sk6,sk11),
t5_FOL_42 ).
cnf(c_0_85,hypothesis,
( ~ greater(X3,X2)
| ~ survival_chance(X1,X5,X3)
| ~ survival_chance(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(fof_simplification,[status(thm)],[t3_FOL_32]) ).
cnf(c_0_86,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
inference(fof_simplification,[status(thm)],[mp11_28]) ).
cnf(c_0_87,negated_conjecture,
( ~ survival_chance(sk3,X1,sk12)
| greater(X1,sk8) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_88,negated_conjecture,
survival_chance(sk3,sk1(sk12,sk3),sk12),
inference(spm,[status(thm)],[c_0_81,c_0_60]) ).
cnf(c_0_89,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| ~ survival_chance(sk3,X2,sk12)
| greater(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_90,hypothesis,
( ~ greater(X3,X2)
| ~ survival_chance(X1,X5,X3)
| ~ survival_chance(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
c_0_85 ).
cnf(c_0_91,negated_conjecture,
reorganization_free(sk2,sk12,sk13),
t5_FOL_48 ).
cnf(c_0_92,plain,
( ~ greater(X2,X3)
| ~ greater(X1,X2)
| greater(X1,X3) ),
c_0_86 ).
cnf(c_0_93,negated_conjecture,
greater(sk1(sk12,sk3),sk8),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| greater(X1,sk1(sk12,sk3))
| X1 = sk1(sk12,sk3) ),
inference(spm,[status(thm)],[c_0_89,c_0_88]) ).
cnf(c_0_95,negated_conjecture,
survival_chance(sk2,sk1(sk12,sk2),sk12),
inference(spm,[status(thm)],[c_0_81,c_0_63]) ).
cnf(c_0_96,negated_conjecture,
( ~ greater(sk13,sk12)
| ~ organization(sk2,sk12)
| ~ survival_chance(sk2,X2,sk12)
| ~ survival_chance(sk2,X1,sk13)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_61])]) ).
cnf(c_0_97,negated_conjecture,
( ~ greater(X1,sk1(sk12,sk3))
| greater(X1,sk8) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,negated_conjecture,
( greater(sk1(sk12,sk2),sk1(sk12,sk3))
| sk1(sk12,sk3) = sk1(sk12,sk2) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,negated_conjecture,
( ~ survival_chance(sk2,X2,sk12)
| ~ survival_chance(sk2,X1,sk13)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_56])]),c_0_63])]) ).
cnf(c_0_100,negated_conjecture,
survival_chance(sk2,sk7,sk13),
t5_FOL_49 ).
cnf(c_0_101,negated_conjecture,
( greater(sk1(sk12,sk2),sk8)
| sk1(sk12,sk3) = sk1(sk12,sk2) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_102,negated_conjecture,
( ~ survival_chance(sk2,X1,sk12)
| greater(sk7,X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,negated_conjecture,
~ greater(sk7,sk8),
inference(fof_simplification,[status(thm)],[t5_FOL_54]) ).
cnf(c_0_104,negated_conjecture,
( ~ greater(X1,sk1(sk12,sk2))
| greater(X1,sk8)
| sk1(sk12,sk3) = sk1(sk12,sk2) ),
inference(spm,[status(thm)],[c_0_92,c_0_101]) ).
cnf(c_0_105,negated_conjecture,
greater(sk7,sk1(sk12,sk2)),
inference(spm,[status(thm)],[c_0_102,c_0_95]) ).
cnf(c_0_106,negated_conjecture,
~ greater(sk7,sk8),
c_0_103 ).
cnf(c_0_107,negated_conjecture,
sk1(sk12,sk3) = sk1(sk12,sk2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]) ).
cnf(c_0_108,negated_conjecture,
( ~ greater(X1,sk1(sk12,sk2))
| greater(X1,sk8) ),
inference(rw,[status(thm)],[c_0_97,c_0_107]) ).
cnf(c_0_109,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_105]),c_0_106]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT005-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 01:23:22 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.09/0.48 % Version: 3.5.1
% 0.09/0.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.48 % Starting sh5l with 300s (1) cores
% 0.09/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1058631 completed with status 0
% 0.09/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.09/0.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.48 % No SInE strategy applied
% 0.09/0.48 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.09/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.09/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1058640 completed with status 0
% 0.09/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.09/0.48 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.09/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.48 % No SInE strategy applied
% 0.09/0.48 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.09/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.09/0.48 % Preprocessing time : 0.002 s
% 0.09/0.48 % Presaturation interreduction done
% 0.09/0.48
% 0.09/0.48 % Proof found!
% 0.09/0.48 % SZS status Unsatisfiable
% 0.09/0.48 % SZS output start CNFRefutation
% See solution above
% 0.09/0.49 % Parsed axioms : 29
% 0.09/0.49 % Removed by relevancy pruning/SinE : 0
% 0.09/0.49 % Initial clauses : 29
% 0.09/0.49 % Removed in clause preprocessing : 0
% 0.09/0.49 % Initial clauses in saturation : 29
% 0.09/0.49 % Processed clauses : 235
% 0.09/0.49 % ...of these trivial : 0
% 0.09/0.49 % ...subsumed : 9
% 0.09/0.49 % ...remaining for further processing : 226
% 0.09/0.49 % Other redundant clauses eliminated : 1
% 0.09/0.49 % Clauses deleted for lack of memory : 0
% 0.09/0.49 % Backward-subsumed : 8
% 0.09/0.49 % Backward-rewritten : 47
% 0.09/0.49 % Generated clauses : 195
% 0.09/0.49 % ...of the previous two non-redundant : 203
% 0.09/0.49 % ...aggressively subsumed : 0
% 0.09/0.49 % Contextual simplify-reflections : 0
% 0.09/0.49 % Paramodulations : 194
% 0.09/0.49 % Factorizations : 0
% 0.09/0.49 % NegExts : 0
% 0.09/0.49 % Equation resolutions : 1
% 0.09/0.49 % Disequality decompositions : 0
% 0.09/0.49 % Total rewrite steps : 94
% 0.09/0.49 % ...of those cached : 72
% 0.09/0.49 % Propositional unsat checks : 0
% 0.09/0.49 % Propositional check models : 0
% 0.09/0.49 % Propositional check unsatisfiable : 0
% 0.09/0.49 % Propositional clauses : 0
% 0.09/0.49 % Propositional clauses after purity: 0
% 0.09/0.49 % Propositional unsat core size : 0
% 0.09/0.49 % Propositional preprocessing time : 0.000
% 0.09/0.49 % Propositional encoding time : 0.000
% 0.09/0.49 % Propositional solver time : 0.000
% 0.09/0.49 % Success case prop preproc time : 0.000
% 0.09/0.49 % Success case prop encoding time : 0.000
% 0.09/0.49 % Success case prop solver time : 0.000
% 0.09/0.49 % Current number of processed clauses : 141
% 0.09/0.49 % Positive orientable unit clauses : 39
% 0.09/0.49 % Positive unorientable unit clauses: 0
% 0.09/0.49 % Negative unit clauses : 17
% 0.09/0.49 % Non-unit-clauses : 85
% 0.09/0.49 % Current number of unprocessed clauses: 25
% 0.09/0.49 % ...number of literals in the above : 89
% 0.09/0.49 % Current number of archived formulas : 0
% 0.09/0.49 % Current number of archived clauses : 84
% 0.09/0.49 % Clause-clause subsumption calls (NU) : 7021
% 0.09/0.49 % Rec. Clause-clause subsumption calls : 991
% 0.09/0.49 % Non-unit clause-clause subsumptions : 9
% 0.09/0.49 % Unit Clause-clause subsumption calls : 650
% 0.09/0.49 % Rewrite failures with RHS unbound : 0
% 0.09/0.49 % BW rewrite match attempts : 2
% 0.09/0.49 % BW rewrite match successes : 2
% 0.09/0.49 % Condensation attempts : 0
% 0.09/0.49 % Condensation successes : 0
% 0.09/0.49 % Termbank termtop insertions : 7859
% 0.09/0.49 % Search garbage collected termcells : 126
% 0.09/0.49
% 0.09/0.49 % -------------------------------------------------
% 0.09/0.49 % User time : 0.038 s
% 0.09/0.49 % System time : 0.007 s
% 0.09/0.49 % Total time : 0.044 s
% 0.09/0.49 % Maximum resident set size: 3664 pages
% 0.09/0.49
% 0.09/0.49 % -------------------------------------------------
% 0.09/0.49 % User time : 0.159 s
% 0.09/0.49 % System time : 0.020 s
% 0.09/0.49 % Total time : 0.179 s
% 0.09/0.49 % Maximum resident set size: 4608 pages
% 0.09/0.49 % E exiting
%------------------------------------------------------------------------------