%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT005+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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 : Sun Sep 27 08:02:03 AM UTC 2026
% Result : Theorem 4.01s 0.99s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 10
% Syntax : Number of formulae : 108 ( 35 unt; 0 def)
% Number of atoms : 565 ( 20 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 770 ( 313 ~; 333 |; 114 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 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 : 285 ( 12 sgn 75 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp6_2,axiom,
! [X,Y] :
~ ( greater(Y,X)
& greater(X,Y) ),
file('theBenchmark.p',mp6_2) ).
fof(mp11,axiom,
! [X,Y,Z] :
( ( greater(Y,Z)
& greater(X,Y) )
=> greater(X,Z) ),
file('theBenchmark.p',mp11) ).
fof(mp12,axiom,
! [X,T] :
( organization(X,T)
=> ? [P] : survival_chance(X,P,T) ),
file('theBenchmark.p',mp12) ).
fof(mp13,axiom,
! [X,T,T1,T2] :
( ( greater(T2,T)
& greater(T,T1)
& organization(X,T2)
& organization(X,T1) )
=> organization(X,T) ),
file('theBenchmark.p',mp13) ).
fof(mp7,axiom,
! [X,Ta,Tb] :
( reorganization(X,Ta,Tb)
=> greater(Tb,Ta) ),
file('theBenchmark.p',mp7) ).
fof(t3_FOL,axiom,
! [X,P1,P2,T1,T2] :
( ( greater(T2,T1)
& survival_chance(X,P2,T2)
& survival_chance(X,P1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
file('theBenchmark.p',t3_FOL) ).
fof(t4_FOL,axiom,
! [X,P1,P2,T1,T2,Ta,Tb] :
( ( ~ greater(T2,Tb)
& greater(T2,T1)
& ~ greater(Ta,T1)
& survival_chance(X,P2,T2)
& survival_chance(X,P1,T1)
& reorganization(X,Ta,Tb)
& organization(X,T2)
& organization(X,T1) )
=> greater(P1,P2) ),
file('theBenchmark.p',t4_FOL) ).
fof(a10_FOL,axiom,
! [X,Y,Re,C,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
file('theBenchmark.p',a10_FOL) ).
fof(a11_FOL,axiom,
! [X,Y,Re,C,P,P1,P2,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& survival_chance(Y,P2,Tb)
& survival_chance(X,P1,Tb)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& survival_chance(Y,P,Ta)
& survival_chance(X,P,Ta)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tb)
& organization(X,Tb)
& organization(Y,Ta)
& organization(X,Ta) )
=> ( P1 = P2
| greater(P1,P2) ) ),
file('theBenchmark.p',a11_FOL) ).
fof(t5_FOL,conjecture,
! [X,Y,Re,C,P,P1,P2,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& survival_chance(Y,P2,Tc)
& survival_chance(X,P1,Tc)
& reorganization_free(X,Tb,Tc)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& survival_chance(Y,P,Ta)
& survival_chance(X,P,Ta)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(X,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(P1,P2) ),
file('theBenchmark.p',t5_FOL) ).
fof(t5_FOL_neg,negated_conjecture,
~ ! [X,Y,Re,C,P,P1,P2,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& survival_chance(Y,P2,Tc)
& survival_chance(X,P1,Tc)
& reorganization_free(X,Tb,Tc)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& survival_chance(Y,P,Ta)
& survival_chance(X,P,Ta)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(X,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(P1,P2) ),
inference(assume_negation,[status(cth)],[t5_FOL]) ).
fof(nnf_11,plain,
? [X,Y,Re,C,P,P1,P2,C1,C2,Ta,Tb,Tc] :
( ~ greater(P1,P2)
& greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,Ta)
& survival_chance(Y,P2,Tc)
& survival_chance(X,P1,Tc)
& reorganization_free(X,Tb,Tc)
& reorganization_type(Y,Re,Ta)
& reorganization_type(X,Re,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& survival_chance(Y,P,Ta)
& survival_chance(X,P,Ta)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(X,Tc)
& organization(Y,Ta)
& organization(X,Ta) ),
inference(fof_nnf,[status(thm)],[t5_FOL_neg]) ).
fof(sk_t5_FOL_neg,plain,
( ~ greater(sK3,sK4)
& greater(sK5,sK6)
& complexity(sK7,sK5,sK8)
& complexity(sK0,sK6,sK8)
& survival_chance(sK7,sK4,sK2)
& survival_chance(sK0,sK3,sK2)
& reorganization_free(sK0,sK1,sK2)
& reorganization_type(sK7,sK9,sK8)
& reorganization_type(sK0,sK9,sK8)
& reorganization(sK7,sK8,sK2)
& reorganization(sK0,sK8,sK1)
& survival_chance(sK7,sK10,sK8)
& survival_chance(sK0,sK10,sK8)
& class(sK7,sK11,sK8)
& class(sK0,sK11,sK8)
& organization(sK7,sK2)
& organization(sK0,sK2)
& organization(sK7,sK8)
& organization(sK0,sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK8,sK7,sK2,sK11,sK10,sK1,sK9,sK3,sK4,sK6,sK5]),skolemize(X,sK0),skolemize(Y,sK7),skolemize(Re,sK9),skolemize(C,sK11),skolemize(P,sK10),skolemize(P1,sK3),skolemize(P2,sK4),skolemize(C1,sK6),skolemize(C2,sK5),skolemize(Ta,sK8),skolemize(Tb,sK1),skolemize(Tc,sK2)],[nnf_11]) ).
cnf(c_12,negated_conjecture,
reorganization_free(sK0,sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_13,plain,
( greater(E,D)
| ~ greater(C,B)
| ~ survival_chance(A,E,C)
| ~ survival_chance(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t3_FOL]) ).
cnf(c_14,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ survival_chance(sK0,B,sK2)
| ~ survival_chance(sK0,A,sK1)
| ~ organization(sK0,sK2)
| ~ organization(sK0,sK1) ),
inference(resolve,[status(thm)],[c_12,c_13]) ).
cnf(c_15,negated_conjecture,
~ greater(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_16,negated_conjecture,
greater(sK5,sK6),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_17,negated_conjecture,
complexity(sK7,sK5,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_18,negated_conjecture,
complexity(sK0,sK6,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_19,negated_conjecture,
survival_chance(sK7,sK4,sK2),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_20,negated_conjecture,
survival_chance(sK0,sK3,sK2),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_21,negated_conjecture,
reorganization_type(sK7,sK9,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_22,negated_conjecture,
reorganization_type(sK0,sK9,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_23,negated_conjecture,
reorganization(sK7,sK8,sK2),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_24,negated_conjecture,
reorganization(sK0,sK8,sK1),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_25,negated_conjecture,
survival_chance(sK7,sK10,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_26,negated_conjecture,
survival_chance(sK0,sK10,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_27,negated_conjecture,
class(sK7,sK11,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_28,negated_conjecture,
class(sK0,sK11,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_29,negated_conjecture,
organization(sK7,sK2),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_30,negated_conjecture,
organization(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_31,negated_conjecture,
organization(sK7,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_32,negated_conjecture,
organization(sK0,sK8),
inference(split_conjunct,[status(thm)],[sk_t5_FOL_neg]) ).
cnf(c_33,plain,
( V9 = V8
| greater(V8,V9)
| ~ greater(V11,V10)
| ~ complexity(C,V11,B)
| ~ complexity(A,V10,B)
| ~ survival_chance(C,V9,D)
| ~ survival_chance(A,V8,D)
| ~ reorganization_type(C,V7,B)
| ~ reorganization_type(A,V7,B)
| ~ reorganization(C,B,V6)
| ~ reorganization(A,B,D)
| ~ survival_chance(C,F,B)
| ~ survival_chance(A,F,B)
| ~ class(C,E,B)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,D)
| ~ organization(C,B)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a11_FOL]) ).
cnf(c_34,plain,
( greater(D,F)
| ~ greater(V8,V7)
| ~ complexity(C,V8,B)
| ~ complexity(A,V7,B)
| ~ reorganization_type(C,V6,B)
| ~ reorganization_type(A,V6,B)
| ~ reorganization(C,B,D)
| ~ reorganization(A,B,F)
| ~ class(C,E,B)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(C,B)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a10_FOL]) ).
cnf(c_35,plain,
( greater(F,V6)
| greater(C,E)
| ~ greater(C,B)
| greater(D,B)
| ~ survival_chance(A,V6,C)
| ~ survival_chance(A,F,B)
| ~ reorganization(A,D,E)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t4_FOL]) ).
cnf(c_36,plain,
( greater(C,B)
| ~ reorganization(A,B,C) ),
inference(clausify,[status(thm)],[mp7]) ).
cnf(c_37,plain,
( organization(A,D)
| ~ greater(C,D)
| ~ greater(D,B)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp13]) ).
fof(nnf_4,plain,
! [X,T] :
( ? [P] : survival_chance(X,P,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp12]) ).
fof(sk_mp12,plain,
! [X,T] :
( survival_chance(X,sK12(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(P,sK12(X,T))],[nnf_4]) ).
cnf(c_38,plain,
( survival_chance(A,sK12(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp12]) ).
cnf(c_39,plain,
( greater(A,C)
| ~ greater(B,C)
| ~ greater(A,B) ),
inference(clausify,[status(thm)],[mp11]) ).
cnf(c_40,plain,
( ~ greater(B,A)
| ~ greater(A,B) ),
inference(clausify,[status(thm)],[mp6_2]) ).
cnf(c_42,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ survival_chance(sK0,B,sK2)
| ~ survival_chance(sK0,A,sK1)
| ~ organization(sK0,sK1) ),
inference(resolve,[status(thm)],[c_30,c_14]) ).
cnf(c_60,plain,
~ greater(A,A),
inference(factor,[status(thm)],[c_40]) ).
cnf(c_265,negated_conjecture,
( V6 = F
| greater(F,V6)
| ~ greater(V8,V7)
| ~ complexity(sK7,V8,sK8)
| ~ complexity(A,V7,sK8)
| ~ survival_chance(sK7,V6,B)
| ~ survival_chance(A,F,B)
| ~ reorganization_type(A,sK9,sK8)
| ~ reorganization(sK7,sK8,E)
| ~ reorganization(A,sK8,B)
| ~ survival_chance(sK7,D,sK8)
| ~ survival_chance(A,D,sK8)
| ~ class(sK7,C,sK8)
| ~ class(A,C,sK8)
| ~ organization(sK7,B)
| ~ organization(A,B)
| ~ organization(sK7,sK8)
| ~ organization(A,sK8) ),
inference(resolve,[status(thm)],[c_33,c_21]) ).
cnf(c_68,negated_conjecture,
( V6 = F
| greater(F,V6)
| ~ greater(V8,V7)
| ~ complexity(sK7,V8,sK8)
| ~ complexity(A,V7,sK8)
| ~ survival_chance(sK7,V6,B)
| ~ survival_chance(A,F,B)
| ~ reorganization_type(A,sK9,sK8)
| ~ reorganization(sK7,sK8,E)
| ~ reorganization(A,sK8,B)
| ~ survival_chance(sK7,D,sK8)
| ~ survival_chance(A,D,sK8)
| ~ class(sK7,C,sK8)
| ~ class(A,C,sK8)
| ~ organization(sK7,B)
| ~ organization(A,B)
| ~ organization(A,sK8) ),
inference(resolve,[status(thm)],[c_31,c_265]) ).
cnf(c_266,negated_conjecture,
( greater(B,D)
| ~ greater(V6,F)
| ~ complexity(A,V6,sK8)
| ~ complexity(sK0,F,sK8)
| ~ reorganization_type(A,E,sK8)
| ~ reorganization_type(sK0,E,sK8)
| ~ reorganization(A,sK8,B)
| ~ reorganization(sK0,sK8,D)
| ~ class(A,C,sK8)
| ~ class(sK0,C,sK8)
| ~ organization(A,B)
| ~ organization(A,sK8) ),
inference(resolve,[status(thm)],[c_34,c_32]) ).
cnf(c_267,negated_conjecture,
( greater(A,C)
| ~ greater(F,E)
| ~ complexity(sK7,F,sK8)
| ~ complexity(sK0,E,sK8)
| ~ reorganization_type(sK7,D,sK8)
| ~ reorganization_type(sK0,D,sK8)
| ~ reorganization(sK7,sK8,A)
| ~ reorganization(sK0,sK8,C)
| ~ class(sK7,B,sK8)
| ~ class(sK0,B,sK8)
| ~ organization(sK7,A) ),
inference(resolve,[status(thm)],[c_266,c_31]) ).
cnf(c_268,negated_conjecture,
( greater(sK2,B)
| ~ greater(E,D)
| ~ complexity(sK7,E,sK8)
| ~ complexity(sK0,D,sK8)
| ~ reorganization_type(sK7,C,sK8)
| ~ reorganization_type(sK0,C,sK8)
| ~ reorganization(sK7,sK8,sK2)
| ~ reorganization(sK0,sK8,B)
| ~ class(sK7,A,sK8)
| ~ class(sK0,A,sK8) ),
inference(resolve,[status(thm)],[c_267,c_29]) ).
cnf(c_269,negated_conjecture,
( greater(sK2,A)
| ~ greater(D,C)
| ~ complexity(sK7,D,sK8)
| ~ complexity(sK0,C,sK8)
| ~ reorganization_type(sK7,B,sK8)
| ~ reorganization_type(sK0,B,sK8)
| ~ reorganization(sK7,sK8,sK2)
| ~ reorganization(sK0,sK8,A)
| ~ class(sK7,sK11,sK8) ),
inference(resolve,[status(thm)],[c_268,c_28]) ).
cnf(c_270,negated_conjecture,
( greater(sK2,A)
| ~ greater(D,C)
| ~ complexity(sK7,D,sK8)
| ~ complexity(sK0,C,sK8)
| ~ reorganization_type(sK7,B,sK8)
| ~ reorganization_type(sK0,B,sK8)
| ~ reorganization(sK7,sK8,sK2)
| ~ reorganization(sK0,sK8,A) ),
inference(resolve,[status(thm)],[c_269,c_27]) ).
cnf(c_271,negated_conjecture,
( greater(sK2,sK1)
| ~ greater(C,B)
| ~ complexity(sK7,C,sK8)
| ~ complexity(sK0,B,sK8)
| ~ reorganization_type(sK7,A,sK8)
| ~ reorganization_type(sK0,A,sK8)
| ~ reorganization(sK7,sK8,sK2) ),
inference(resolve,[status(thm)],[c_270,c_24]) ).
cnf(c_272,negated_conjecture,
( greater(sK2,sK1)
| ~ greater(C,B)
| ~ complexity(sK7,C,sK8)
| ~ complexity(sK0,B,sK8)
| ~ reorganization_type(sK7,A,sK8)
| ~ reorganization_type(sK0,A,sK8) ),
inference(resolve,[status(thm)],[c_271,c_23]) ).
cnf(c_273,negated_conjecture,
( greater(sK2,sK1)
| ~ greater(B,A)
| ~ complexity(sK7,B,sK8)
| ~ complexity(sK0,A,sK8)
| ~ reorganization_type(sK7,sK9,sK8) ),
inference(resolve,[status(thm)],[c_272,c_22]) ).
cnf(c_274,negated_conjecture,
( greater(sK2,sK1)
| ~ greater(B,A)
| ~ complexity(sK7,B,sK8)
| ~ complexity(sK0,A,sK8) ),
inference(resolve,[status(thm)],[c_273,c_21]) ).
cnf(c_275,negated_conjecture,
( greater(sK2,sK1)
| ~ greater(A,sK6)
| ~ complexity(sK7,A,sK8) ),
inference(resolve,[status(thm)],[c_274,c_18]) ).
cnf(c_276,negated_conjecture,
( greater(sK2,sK1)
| ~ greater(sK5,sK6) ),
inference(resolve,[status(thm)],[c_275,c_17]) ).
cnf(c_97,negated_conjecture,
greater(sK2,sK1),
inference(resolve,[status(thm)],[c_276,c_16]) ).
cnf(c_106,negated_conjecture,
( greater(B,A)
| ~ survival_chance(sK0,B,sK2)
| ~ survival_chance(sK0,A,sK1)
| ~ organization(sK0,sK1) ),
inference(resolve,[status(thm)],[c_97,c_42]) ).
cnf(c_115,plain,
greater(sK1,sK8),
inference(resolve,[status(thm)],[c_36,c_24]) ).
cnf(c_144,plain,
~ greater(sK8,sK1),
inference(resolve,[status(thm)],[c_115,c_40]) ).
cnf(c_277,negated_conjecture,
( organization(sK0,B)
| ~ greater(A,B)
| ~ greater(B,sK8)
| ~ organization(sK0,A) ),
inference(resolve,[status(thm)],[c_37,c_32]) ).
cnf(c_278,negated_conjecture,
( organization(sK0,A)
| ~ greater(sK2,A)
| ~ greater(A,sK8) ),
inference(resolve,[status(thm)],[c_277,c_30]) ).
cnf(c_279,negated_conjecture,
( organization(sK0,sK1)
| ~ greater(sK2,sK1) ),
inference(resolve,[status(thm)],[c_278,c_115]) ).
cnf(c_149,negated_conjecture,
organization(sK0,sK1),
inference(resolve,[status(thm)],[c_279,c_97]) ).
cnf(c_280,negated_conjecture,
( organization(sK7,B)
| ~ greater(A,B)
| ~ greater(B,sK8)
| ~ organization(sK7,A) ),
inference(resolve,[status(thm)],[c_37,c_31]) ).
cnf(c_281,negated_conjecture,
( organization(sK7,A)
| ~ greater(sK2,A)
| ~ greater(A,sK8) ),
inference(resolve,[status(thm)],[c_280,c_29]) ).
cnf(c_282,negated_conjecture,
( organization(sK7,sK1)
| ~ greater(sK2,sK1) ),
inference(resolve,[status(thm)],[c_281,c_115]) ).
cnf(c_150,negated_conjecture,
organization(sK7,sK1),
inference(resolve,[status(thm)],[c_282,c_97]) ).
cnf(c_151,negated_conjecture,
( greater(B,A)
| ~ survival_chance(sK0,B,sK2)
| ~ survival_chance(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_149,c_106]) ).
cnf(c_162,plain,
survival_chance(sK0,sK12(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_149,c_38]) ).
cnf(c_169,plain,
survival_chance(sK7,sK12(sK7,sK1),sK1),
inference(resolve,[status(thm)],[c_150,c_38]) ).
cnf(c_209,plain,
( greater(sK3,A)
| ~ survival_chance(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_151,c_20]) ).
cnf(c_215,plain,
greater(sK3,sK12(sK0,sK1)),
inference(resolve,[status(thm)],[c_162,c_209]) ).
cnf(c_283,plain,
( greater(sK3,A)
| ~ greater(sK12(sK0,sK1),A) ),
inference(resolve,[status(thm)],[c_39,c_215]) ).
cnf(c_230,negated_conjecture,
~ greater(sK12(sK0,sK1),sK4),
inference(resolve,[status(thm)],[c_283,c_15]) ).
cnf(c_284,negated_conjecture,
( F = E
| greater(E,F)
| ~ greater(V7,V6)
| ~ complexity(sK7,V7,sK8)
| ~ complexity(sK0,V6,sK8)
| ~ survival_chance(sK7,F,A)
| ~ survival_chance(sK0,E,A)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,D)
| ~ reorganization(sK0,sK8,A)
| ~ survival_chance(sK7,C,sK8)
| ~ survival_chance(sK0,C,sK8)
| ~ class(sK7,B,sK8)
| ~ class(sK0,B,sK8)
| ~ organization(sK7,A)
| ~ organization(sK0,A) ),
inference(resolve,[status(thm)],[c_68,c_32]) ).
cnf(c_285,negated_conjecture,
( E = D
| greater(D,E)
| ~ greater(V6,F)
| ~ complexity(sK7,V6,sK8)
| ~ complexity(sK0,F,sK8)
| ~ survival_chance(sK7,E,sK1)
| ~ survival_chance(sK0,D,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,C)
| ~ reorganization(sK0,sK8,sK1)
| ~ survival_chance(sK7,B,sK8)
| ~ survival_chance(sK0,B,sK8)
| ~ class(sK7,A,sK8)
| ~ class(sK0,A,sK8)
| ~ organization(sK7,sK1) ),
inference(resolve,[status(thm)],[c_284,c_149]) ).
cnf(c_286,negated_conjecture,
( E = D
| greater(D,E)
| ~ greater(V6,F)
| ~ complexity(sK7,V6,sK8)
| ~ complexity(sK0,F,sK8)
| ~ survival_chance(sK7,E,sK1)
| ~ survival_chance(sK0,D,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,C)
| ~ reorganization(sK0,sK8,sK1)
| ~ survival_chance(sK7,B,sK8)
| ~ survival_chance(sK0,B,sK8)
| ~ class(sK7,A,sK8)
| ~ class(sK0,A,sK8) ),
inference(resolve,[status(thm)],[c_285,c_150]) ).
cnf(c_287,negated_conjecture,
( D = C
| greater(C,D)
| ~ greater(F,E)
| ~ complexity(sK7,F,sK8)
| ~ complexity(sK0,E,sK8)
| ~ survival_chance(sK7,D,sK1)
| ~ survival_chance(sK0,C,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,B)
| ~ reorganization(sK0,sK8,sK1)
| ~ survival_chance(sK7,A,sK8)
| ~ survival_chance(sK0,A,sK8)
| ~ class(sK7,sK11,sK8) ),
inference(resolve,[status(thm)],[c_286,c_28]) ).
cnf(c_288,negated_conjecture,
( D = C
| greater(C,D)
| ~ greater(F,E)
| ~ complexity(sK7,F,sK8)
| ~ complexity(sK0,E,sK8)
| ~ survival_chance(sK7,D,sK1)
| ~ survival_chance(sK0,C,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,B)
| ~ reorganization(sK0,sK8,sK1)
| ~ survival_chance(sK7,A,sK8)
| ~ survival_chance(sK0,A,sK8) ),
inference(resolve,[status(thm)],[c_287,c_27]) ).
cnf(c_289,negated_conjecture,
( C = B
| greater(B,C)
| ~ greater(E,D)
| ~ complexity(sK7,E,sK8)
| ~ complexity(sK0,D,sK8)
| ~ survival_chance(sK7,C,sK1)
| ~ survival_chance(sK0,B,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,A)
| ~ reorganization(sK0,sK8,sK1)
| ~ survival_chance(sK7,sK10,sK8) ),
inference(resolve,[status(thm)],[c_288,c_26]) ).
cnf(c_290,negated_conjecture,
( C = B
| greater(B,C)
| ~ greater(E,D)
| ~ complexity(sK7,E,sK8)
| ~ complexity(sK0,D,sK8)
| ~ survival_chance(sK7,C,sK1)
| ~ survival_chance(sK0,B,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,A)
| ~ reorganization(sK0,sK8,sK1) ),
inference(resolve,[status(thm)],[c_289,c_25]) ).
cnf(c_291,negated_conjecture,
( C = B
| greater(B,C)
| ~ greater(E,D)
| ~ complexity(sK7,E,sK8)
| ~ complexity(sK0,D,sK8)
| ~ survival_chance(sK7,C,sK1)
| ~ survival_chance(sK0,B,sK1)
| ~ reorganization_type(sK0,sK9,sK8)
| ~ reorganization(sK7,sK8,A) ),
inference(resolve,[status(thm)],[c_290,c_24]) ).
cnf(c_292,negated_conjecture,
( B = A
| greater(A,B)
| ~ greater(D,C)
| ~ complexity(sK7,D,sK8)
| ~ complexity(sK0,C,sK8)
| ~ survival_chance(sK7,B,sK1)
| ~ survival_chance(sK0,A,sK1)
| ~ reorganization_type(sK0,sK9,sK8) ),
inference(resolve,[status(thm)],[c_291,c_23]) ).
cnf(c_293,negated_conjecture,
( B = A
| greater(A,B)
| ~ greater(D,C)
| ~ complexity(sK7,D,sK8)
| ~ complexity(sK0,C,sK8)
| ~ survival_chance(sK7,B,sK1)
| ~ survival_chance(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_292,c_22]) ).
cnf(c_294,negated_conjecture,
( A = sK12(sK0,sK1)
| greater(sK12(sK0,sK1),A)
| ~ greater(C,B)
| ~ complexity(sK7,C,sK8)
| ~ complexity(sK0,B,sK8)
| ~ survival_chance(sK7,A,sK1) ),
inference(resolve,[status(thm)],[c_293,c_162]) ).
cnf(c_295,negated_conjecture,
( sK12(sK7,sK1) = sK12(sK0,sK1)
| greater(sK12(sK0,sK1),sK12(sK7,sK1))
| ~ greater(B,A)
| ~ complexity(sK7,B,sK8)
| ~ complexity(sK0,A,sK8) ),
inference(resolve,[status(thm)],[c_294,c_169]) ).
cnf(c_296,negated_conjecture,
( sK12(sK7,sK1) = sK12(sK0,sK1)
| greater(sK12(sK0,sK1),sK12(sK7,sK1))
| ~ greater(A,sK6)
| ~ complexity(sK7,A,sK8) ),
inference(resolve,[status(thm)],[c_295,c_18]) ).
cnf(c_297,negated_conjecture,
( sK12(sK7,sK1) = sK12(sK0,sK1)
| greater(sK12(sK0,sK1),sK12(sK7,sK1))
| ~ greater(sK5,sK6) ),
inference(resolve,[status(thm)],[c_296,c_17]) ).
cnf(c_236,negated_conjecture,
( sK12(sK7,sK1) = sK12(sK0,sK1)
| greater(sK12(sK0,sK1),sK12(sK7,sK1)) ),
inference(resolve,[status(thm)],[c_297,c_16]) ).
cnf(c_298,plain,
( greater(D,E)
| greater(A,C)
| ~ greater(A,sK1)
| greater(B,sK1)
| ~ survival_chance(sK7,E,A)
| ~ survival_chance(sK7,D,sK1)
| ~ reorganization(sK7,B,C)
| ~ organization(sK7,A) ),
inference(resolve,[status(thm)],[c_35,c_150]) ).
cnf(c_299,negated_conjecture,
( greater(C,D)
| greater(sK2,B)
| ~ greater(sK2,sK1)
| greater(A,sK1)
| ~ survival_chance(sK7,D,sK2)
| ~ survival_chance(sK7,C,sK1)
| ~ reorganization(sK7,A,B) ),
inference(resolve,[status(thm)],[c_298,c_29]) ).
cnf(c_300,negated_conjecture,
( greater(A,B)
| greater(sK2,sK2)
| ~ greater(sK2,sK1)
| greater(sK8,sK1)
| ~ survival_chance(sK7,B,sK2)
| ~ survival_chance(sK7,A,sK1) ),
inference(resolve,[status(thm)],[c_299,c_23]) ).
cnf(c_301,negated_conjecture,
( greater(sK12(sK7,sK1),A)
| greater(sK2,sK2)
| ~ greater(sK2,sK1)
| greater(sK8,sK1)
| ~ survival_chance(sK7,A,sK2) ),
inference(resolve,[status(thm)],[c_300,c_169]) ).
cnf(c_302,negated_conjecture,
( greater(sK12(sK7,sK1),sK4)
| greater(sK2,sK2)
| ~ greater(sK2,sK1)
| greater(sK8,sK1) ),
inference(resolve,[status(thm)],[c_301,c_19]) ).
cnf(c_303,negated_conjecture,
( greater(sK12(sK7,sK1),sK4)
| greater(sK2,sK2)
| greater(sK8,sK1) ),
inference(resolve,[status(thm)],[c_302,c_97]) ).
cnf(c_304,negated_conjecture,
( greater(sK12(sK7,sK1),sK4)
| greater(sK2,sK2) ),
inference(resolve,[status(thm)],[c_144,c_303]) ).
cnf(c_240,negated_conjecture,
greater(sK12(sK7,sK1),sK4),
inference(resolve,[status(thm)],[c_60,c_304]) ).
cnf(c_305,plain,
( greater(A,sK4)
| ~ greater(A,sK12(sK7,sK1)) ),
inference(resolve,[status(thm)],[c_39,c_240]) ).
cnf(c_261,plain,
~ greater(sK12(sK0,sK1),sK12(sK7,sK1)),
inference(resolve,[status(thm)],[c_305,c_230]) ).
cnf(c_306,plain,
( greater(A,sK4)
| ~ greater(A,sK12(sK7,sK1)) ),
inference(resolve,[status(thm)],[c_39,c_240]) ).
cnf(c_262,negated_conjecture,
~ greater(sK3,sK12(sK7,sK1)),
inference(resolve,[status(thm)],[c_306,c_15]) ).
cnf(c_263,negated_conjecture,
sK12(sK7,sK1) = sK12(sK0,sK1),
inference(resolve,[status(thm)],[c_261,c_236]) ).
cnf(c_307,negated_conjecture,
~ greater(sK3,sK12(sK0,sK1)),
inference(paramod,[status(thm)],[c_263,c_262]) ).
cnf(c_264,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_215,c_307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT005+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 00:08:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 386806 was started by sandbox on n001,
% 0.10/0.37 % Sat Sep 26 00:08:26 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 4.01/0.99
% 4.01/0.99 % SZS status Theorem for theBenchmark
% 4.01/0.99
% 4.01/0.99 % Proof 1 at 0.60 (+ 0.01) seconds.
% 4.01/0.99 % Length of proof is 60.
% 4.01/0.99 % Level of proof is 11.
% 4.01/0.99 % Maximum clause weight is 74.000.
% 4.01/0.99 % Given clauses 119.
% 4.01/0.99
% 4.01/0.99 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------