%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT001+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:02 AM UTC 2026
% Result : Theorem 0.04s 15.36s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 77 ( 21 unt; 0 def)
% Number of atoms : 344 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 471 ( 204 ~; 199 |; 58 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 231 ( 18 sgn 62 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp1,axiom,
! [X,T] :
( organization(X,T)
=> ? [R] : reliability(X,R,T) ),
file('theBenchmark.p',mp1) ).
fof(mp2,axiom,
! [X,T] :
( organization(X,T)
=> ? [A] : accountability(X,A,T) ),
file('theBenchmark.p',mp2) ).
fof(mp3,axiom,
! [X,T] :
( organization(X,T)
=> ? [Rp] : reproducibility(X,Rp,T) ),
file('theBenchmark.p',mp3) ).
fof(a1_FOL,axiom,
! [X,Y,R1,R2,A1,A2,P1,P2,T1,T2] :
( ( greater(A2,A1)
& greater(R2,R1)
& survival_chance(Y,P2,T2)
& survival_chance(X,P1,T1)
& accountability(Y,A2,T2)
& accountability(X,A1,T1)
& reliability(Y,R2,T2)
& reliability(X,R1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
file('theBenchmark.p',a1_FOL) ).
fof(a2_FOL,axiom,
! [X,Y,T1,T2,R1,R2,A1,A2,Rp1,Rp2] :
( ( reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& accountability(Y,A2,T2)
& accountability(X,A1,T1)
& reliability(Y,R2,T2)
& reliability(X,R1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> ( greater(Rp2,Rp1)
<=> ( greater(A2,A1)
& greater(R2,R1) ) ) ),
file('theBenchmark.p',a2_FOL) ).
fof(a3_FOL,axiom,
! [X,Y,T1,T2,Rp1,Rp2,I1,I2] :
( ( inertia(Y,I2,T2)
& inertia(X,I1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> ( greater(Rp2,Rp1)
<=> greater(I2,I1) ) ),
file('theBenchmark.p',a3_FOL) ).
fof(t1_FOL,conjecture,
! [X,Y,T1,T2,I1,I2,P1,P2] :
( ( greater(I2,I1)
& survival_chance(Y,P2,T2)
& survival_chance(X,P1,T1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
file('theBenchmark.p',t1_FOL) ).
fof(t1_FOL_neg,negated_conjecture,
~ ! [X,Y,T1,T2,I1,I2,P1,P2] :
( ( greater(I2,I1)
& survival_chance(Y,P2,T2)
& survival_chance(X,P1,T1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(P2,P1) ),
inference(assume_negation,[status(cth)],[t1_FOL]) ).
fof(nnf_1,plain,
! [X,T] :
( ? [R] : reliability(X,R,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp1]) ).
fof(sk_mp1,plain,
! [X,T] :
( reliability(X,sK0(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(R,sK0(X,T))],[nnf_1]) ).
cnf(c_8,plain,
( reliability(A,sK0(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp1]) ).
fof(nnf_2,plain,
! [X,T] :
( ? [A] : accountability(X,A,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp2]) ).
fof(sk_mp2,plain,
! [X,T] :
( accountability(X,sK1(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(A,sK1(X,T))],[nnf_2]) ).
cnf(c_9,plain,
( accountability(A,sK1(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp2]) ).
fof(nnf_3,plain,
! [X,T] :
( ? [Rp] : reproducibility(X,Rp,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp3]) ).
fof(sk_mp3,plain,
! [X,T] :
( reproducibility(X,sK2(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(Rp,sK2(X,T))],[nnf_3]) ).
cnf(c_10,plain,
( reproducibility(A,sK2(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp3]) ).
cnf(c_11,plain,
( greater(V9,V8)
| ~ greater(V7,V6)
| ~ greater(F,E)
| ~ survival_chance(C,V9,D)
| ~ survival_chance(A,V8,B)
| ~ accountability(C,V7,D)
| ~ accountability(A,V6,B)
| ~ reliability(C,F,D)
| ~ reliability(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a1_FOL]) ).
cnf(c_12,plain,
( greater(F,E)
| ~ greater(V9,V8)
| ~ reproducibility(C,V9,D)
| ~ reproducibility(A,V8,B)
| ~ accountability(C,V7,D)
| ~ accountability(A,V6,B)
| ~ reliability(C,F,D)
| ~ reliability(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a2_FOL]) ).
cnf(c_13,plain,
( greater(V7,V6)
| ~ greater(V9,V8)
| ~ reproducibility(C,V9,D)
| ~ reproducibility(A,V8,B)
| ~ accountability(C,V7,D)
| ~ accountability(A,V6,B)
| ~ reliability(C,F,D)
| ~ reliability(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a2_FOL]) ).
cnf(c_16,plain,
( ~ greater(V7,V6)
| greater(F,E)
| ~ inertia(C,V7,D)
| ~ inertia(A,V6,B)
| ~ reproducibility(C,F,D)
| ~ reproducibility(A,E,B)
| ~ reorganization_free(C,D,D)
| ~ reorganization_free(A,B,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a3_FOL]) ).
fof(nnf_7,plain,
? [X,Y,T1,T2,I1,I2,P1,P2] :
( ~ greater(P2,P1)
& greater(I2,I1)
& survival_chance(Y,P2,T2)
& survival_chance(X,P1,T1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t1_FOL_neg]) ).
fof(sk_t1_FOL_neg,plain,
( ~ greater(sK10,sK9)
& greater(sK8,sK7)
& survival_chance(sK5,sK10,sK6)
& survival_chance(sK3,sK9,sK4)
& inertia(sK5,sK8,sK6)
& inertia(sK3,sK7,sK4)
& reorganization_free(sK5,sK6,sK6)
& reorganization_free(sK3,sK4,sK4)
& organization(sK5,sK6)
& organization(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10]),skolemize(X,sK3),skolemize(Y,sK5),skolemize(T1,sK4),skolemize(T2,sK6),skolemize(I1,sK7),skolemize(I2,sK8),skolemize(P1,sK9),skolemize(P2,sK10)],[nnf_7]) ).
cnf(c_17,negated_conjecture,
organization(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_18,negated_conjecture,
organization(sK5,sK6),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_19,negated_conjecture,
reorganization_free(sK3,sK4,sK4),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_20,negated_conjecture,
reorganization_free(sK5,sK6,sK6),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_21,negated_conjecture,
inertia(sK3,sK7,sK4),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_22,negated_conjecture,
inertia(sK5,sK8,sK6),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_23,negated_conjecture,
survival_chance(sK3,sK9,sK4),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_24,negated_conjecture,
survival_chance(sK5,sK10,sK6),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_25,negated_conjecture,
greater(sK8,sK7),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_26,negated_conjecture,
~ greater(sK10,sK9),
inference(split_conjunct,[status(thm)],[sk_t1_FOL_neg]) ).
cnf(c_27,negated_conjecture,
reproducibility(sK3,sK2(sK3,sK4),sK4),
inference(resolve,[status(thm)],[c_10,c_17]) ).
cnf(c_28,negated_conjecture,
accountability(sK3,sK1(sK3,sK4),sK4),
inference(resolve,[status(thm)],[c_9,c_17]) ).
cnf(c_29,negated_conjecture,
reliability(sK3,sK0(sK3,sK4),sK4),
inference(resolve,[status(thm)],[c_8,c_17]) ).
cnf(c_30,negated_conjecture,
reproducibility(sK5,sK2(sK5,sK6),sK6),
inference(resolve,[status(thm)],[c_10,c_18]) ).
cnf(c_31,negated_conjecture,
accountability(sK5,sK1(sK5,sK6),sK6),
inference(resolve,[status(thm)],[c_9,c_18]) ).
cnf(c_32,negated_conjecture,
reliability(sK5,sK0(sK5,sK6),sK6),
inference(resolve,[status(thm)],[c_8,c_18]) ).
cnf(c_97,negated_conjecture,
( ~ greater(F,E)
| greater(D,C)
| ~ inertia(A,F,B)
| ~ inertia(sK3,E,sK4)
| ~ reproducibility(A,D,B)
| ~ reproducibility(sK3,C,sK4)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(sK3,sK4,sK4)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_16,c_17]) ).
cnf(c_98,negated_conjecture,
( ~ greater(D,C)
| greater(B,A)
| ~ inertia(sK5,D,sK6)
| ~ inertia(sK3,C,sK4)
| ~ reproducibility(sK5,B,sK6)
| ~ reproducibility(sK3,A,sK4)
| ~ reorganization_free(sK5,sK6,sK6)
| ~ reorganization_free(sK3,sK4,sK4) ),
inference(resolve,[status(thm)],[c_97,c_18]) ).
cnf(c_99,negated_conjecture,
( ~ greater(D,C)
| greater(B,A)
| ~ inertia(sK5,D,sK6)
| ~ inertia(sK3,C,sK4)
| ~ reproducibility(sK5,B,sK6)
| ~ reproducibility(sK3,A,sK4)
| ~ reorganization_free(sK5,sK6,sK6) ),
inference(resolve,[status(thm)],[c_98,c_19]) ).
cnf(c_100,negated_conjecture,
( ~ greater(D,C)
| greater(B,A)
| ~ inertia(sK5,D,sK6)
| ~ inertia(sK3,C,sK4)
| ~ reproducibility(sK5,B,sK6)
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_99,c_20]) ).
cnf(c_101,negated_conjecture,
( ~ greater(C,B)
| greater(A,sK2(sK3,sK4))
| ~ inertia(sK5,C,sK6)
| ~ inertia(sK3,B,sK4)
| ~ reproducibility(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_100,c_27]) ).
cnf(c_102,negated_conjecture,
( ~ greater(B,A)
| greater(sK2(sK5,sK6),sK2(sK3,sK4))
| ~ inertia(sK5,B,sK6)
| ~ inertia(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_101,c_30]) ).
cnf(c_103,negated_conjecture,
( ~ greater(A,sK7)
| greater(sK2(sK5,sK6),sK2(sK3,sK4))
| ~ inertia(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_102,c_21]) ).
cnf(c_104,negated_conjecture,
( ~ greater(sK8,sK7)
| greater(sK2(sK5,sK6),sK2(sK3,sK4)) ),
inference(resolve,[status(thm)],[c_103,c_22]) ).
cnf(c_90,negated_conjecture,
greater(sK2(sK5,sK6),sK2(sK3,sK4)),
inference(resolve,[status(thm)],[c_104,c_25]) ).
cnf(c_105,negated_conjecture,
( greater(F,E)
| ~ greater(V7,V6)
| ~ reproducibility(A,V7,B)
| ~ reproducibility(sK3,V6,sK4)
| ~ accountability(A,F,B)
| ~ accountability(sK3,E,sK4)
| ~ reliability(A,D,B)
| ~ reliability(sK3,C,sK4)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_13,c_17]) ).
cnf(c_106,negated_conjecture,
( greater(D,C)
| ~ greater(F,E)
| ~ reproducibility(sK5,F,sK6)
| ~ reproducibility(sK3,E,sK4)
| ~ accountability(sK5,D,sK6)
| ~ accountability(sK3,C,sK4)
| ~ reliability(sK5,B,sK6)
| ~ reliability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_105,c_18]) ).
cnf(c_107,negated_conjecture,
( greater(C,B)
| ~ greater(E,D)
| ~ reproducibility(sK5,E,sK6)
| ~ reproducibility(sK3,D,sK4)
| ~ accountability(sK5,C,sK6)
| ~ accountability(sK3,B,sK4)
| ~ reliability(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_106,c_29]) ).
cnf(c_108,negated_conjecture,
( greater(B,A)
| ~ greater(D,C)
| ~ reproducibility(sK5,D,sK6)
| ~ reproducibility(sK3,C,sK4)
| ~ accountability(sK5,B,sK6)
| ~ accountability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_107,c_32]) ).
cnf(c_109,negated_conjecture,
( greater(A,sK1(sK3,sK4))
| ~ greater(C,B)
| ~ reproducibility(sK5,C,sK6)
| ~ reproducibility(sK3,B,sK4)
| ~ accountability(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_108,c_28]) ).
cnf(c_110,negated_conjecture,
( greater(sK1(sK5,sK6),sK1(sK3,sK4))
| ~ greater(B,A)
| ~ reproducibility(sK5,B,sK6)
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_109,c_31]) ).
cnf(c_111,negated_conjecture,
( greater(sK1(sK5,sK6),sK1(sK3,sK4))
| ~ greater(A,sK2(sK3,sK4))
| ~ reproducibility(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_110,c_27]) ).
cnf(c_112,negated_conjecture,
( greater(sK1(sK5,sK6),sK1(sK3,sK4))
| ~ greater(sK2(sK5,sK6),sK2(sK3,sK4)) ),
inference(resolve,[status(thm)],[c_111,c_30]) ).
cnf(c_92,negated_conjecture,
greater(sK1(sK5,sK6),sK1(sK3,sK4)),
inference(resolve,[status(thm)],[c_112,c_90]) ).
cnf(c_113,negated_conjecture,
( greater(D,C)
| ~ greater(V7,V6)
| ~ reproducibility(A,V7,B)
| ~ reproducibility(sK3,V6,sK4)
| ~ accountability(A,F,B)
| ~ accountability(sK3,E,sK4)
| ~ reliability(A,D,B)
| ~ reliability(sK3,C,sK4)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_12,c_17]) ).
cnf(c_114,negated_conjecture,
( greater(B,A)
| ~ greater(F,E)
| ~ reproducibility(sK5,F,sK6)
| ~ reproducibility(sK3,E,sK4)
| ~ accountability(sK5,D,sK6)
| ~ accountability(sK3,C,sK4)
| ~ reliability(sK5,B,sK6)
| ~ reliability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_113,c_18]) ).
cnf(c_115,negated_conjecture,
( greater(A,sK0(sK3,sK4))
| ~ greater(E,D)
| ~ reproducibility(sK5,E,sK6)
| ~ reproducibility(sK3,D,sK4)
| ~ accountability(sK5,C,sK6)
| ~ accountability(sK3,B,sK4)
| ~ reliability(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_114,c_29]) ).
cnf(c_116,negated_conjecture,
( greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ greater(D,C)
| ~ reproducibility(sK5,D,sK6)
| ~ reproducibility(sK3,C,sK4)
| ~ accountability(sK5,B,sK6)
| ~ accountability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_115,c_32]) ).
cnf(c_117,negated_conjecture,
( greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ greater(C,B)
| ~ reproducibility(sK5,C,sK6)
| ~ reproducibility(sK3,B,sK4)
| ~ accountability(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_116,c_28]) ).
cnf(c_118,negated_conjecture,
( greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ greater(B,A)
| ~ reproducibility(sK5,B,sK6)
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_117,c_31]) ).
cnf(c_119,negated_conjecture,
( greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ greater(A,sK2(sK3,sK4))
| ~ reproducibility(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_118,c_27]) ).
cnf(c_120,negated_conjecture,
( greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ greater(sK2(sK5,sK6),sK2(sK3,sK4)) ),
inference(resolve,[status(thm)],[c_119,c_30]) ).
cnf(c_93,negated_conjecture,
greater(sK0(sK5,sK6),sK0(sK3,sK4)),
inference(resolve,[status(thm)],[c_120,c_90]) ).
cnf(c_121,negated_conjecture,
( greater(V7,V6)
| ~ greater(F,E)
| ~ greater(D,C)
| ~ survival_chance(A,V7,B)
| ~ survival_chance(sK3,V6,sK4)
| ~ accountability(A,F,B)
| ~ accountability(sK3,E,sK4)
| ~ reliability(A,D,B)
| ~ reliability(sK3,C,sK4)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_11,c_17]) ).
cnf(c_122,negated_conjecture,
( greater(F,E)
| ~ greater(D,C)
| ~ greater(B,A)
| ~ survival_chance(sK5,F,sK6)
| ~ survival_chance(sK3,E,sK4)
| ~ accountability(sK5,D,sK6)
| ~ accountability(sK3,C,sK4)
| ~ reliability(sK5,B,sK6)
| ~ reliability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_121,c_18]) ).
cnf(c_123,negated_conjecture,
( greater(E,D)
| ~ greater(C,B)
| ~ greater(A,sK0(sK3,sK4))
| ~ survival_chance(sK5,E,sK6)
| ~ survival_chance(sK3,D,sK4)
| ~ accountability(sK5,C,sK6)
| ~ accountability(sK3,B,sK4)
| ~ reliability(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_122,c_29]) ).
cnf(c_124,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ survival_chance(sK5,D,sK6)
| ~ survival_chance(sK3,C,sK4)
| ~ accountability(sK5,B,sK6)
| ~ accountability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_123,c_32]) ).
cnf(c_125,negated_conjecture,
( greater(C,B)
| ~ greater(A,sK1(sK3,sK4))
| ~ greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ survival_chance(sK5,C,sK6)
| ~ survival_chance(sK3,B,sK4)
| ~ accountability(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_124,c_28]) ).
cnf(c_126,negated_conjecture,
( greater(B,A)
| ~ greater(sK1(sK5,sK6),sK1(sK3,sK4))
| ~ greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ survival_chance(sK5,B,sK6)
| ~ survival_chance(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_125,c_31]) ).
cnf(c_127,negated_conjecture,
( greater(A,sK9)
| ~ greater(sK1(sK5,sK6),sK1(sK3,sK4))
| ~ greater(sK0(sK5,sK6),sK0(sK3,sK4))
| ~ survival_chance(sK5,A,sK6) ),
inference(resolve,[status(thm)],[c_126,c_23]) ).
cnf(c_128,negated_conjecture,
( greater(sK10,sK9)
| ~ greater(sK1(sK5,sK6),sK1(sK3,sK4))
| ~ greater(sK0(sK5,sK6),sK0(sK3,sK4)) ),
inference(resolve,[status(thm)],[c_127,c_24]) ).
cnf(c_129,negated_conjecture,
( greater(sK10,sK9)
| ~ greater(sK0(sK5,sK6),sK0(sK3,sK4)) ),
inference(resolve,[status(thm)],[c_128,c_92]) ).
cnf(c_95,negated_conjecture,
~ greater(sK0(sK5,sK6),sK0(sK3,sK4)),
inference(resolve,[status(thm)],[c_129,c_26]) ).
cnf(c_96,plain,
$false,
inference(resolve,[status(thm)],[c_95,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT001+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/15.33 % Computer : n012.cluster.edu
% 0.04/15.33 % Model : x86_64 x86_64
% 0.04/15.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/15.33 % Memory : 8046.5625MB
% 0.04/15.33 % OS : Linux 6.8.0-71-generic
% 0.04/15.33 % CPULimit : 300
% 0.04/15.33 % WCLimit : 300
% 0.04/15.33 % DateTime : Sat Sep 26 00:02:14 UTC 2026
% 0.04/15.33 % CPUTime :
% 0.04/15.33 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.04/15.33 % Process 3379367 was started by sandbox2 on n012,
% 0.04/15.33 % Sat Sep 26 00:02:14 2026
% 0.04/15.33 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.04/15.34
% 0.04/15.34 % From the command line: assign(max_seconds, 300).
% 0.04/15.36
% 0.04/15.36 % SZS status Theorem for theBenchmark
% 0.04/15.36
% 0.04/15.36 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.04/15.36 % Length of proof is 35.
% 0.04/15.36 % Level of proof is 6.
% 0.04/15.36 % Maximum clause weight is 44.000.
% 0.04/15.36 % Given clauses 31.
% 0.04/15.36
% 0.04/15.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------