%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT010+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 : n015.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:05 AM UTC 2026
% Result : Theorem 0.12s 5.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 20 unt; 0 def)
% Number of atoms : 298 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 405 ( 167 ~; 162 |; 70 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 185 ( 18 sgn 47 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp3,axiom,
! [X,T] :
( organization(X,T)
=> ? [Rp] : reproducibility(X,Rp,T) ),
file('theBenchmark.p',mp3) ).
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(t9_FOL,axiom,
! [X,Y,C,Rp1,Rp2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(Rp2,Rp1) ),
file('theBenchmark.p',t9_FOL) ).
fof(t10_FOL,conjecture,
! [X,Y,C,R1,R2,A1,A2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& accountability(Y,A2,T2)
& accountability(X,A1,T1)
& reliability(Y,R2,T2)
& reliability(X,R1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> ( greater(A2,A1)
& greater(R2,R1) ) ),
file('theBenchmark.p',t10_FOL) ).
fof(t10_FOL_neg,negated_conjecture,
~ ! [X,Y,C,R1,R2,A1,A2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& accountability(Y,A2,T2)
& accountability(X,A1,T1)
& reliability(Y,R2,T2)
& reliability(X,R1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> ( greater(A2,A1)
& greater(R2,R1) ) ),
inference(assume_negation,[status(cth)],[t10_FOL]) ).
fof(nnf_1,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,sK0(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(Rp,sK0(X,T))],[nnf_1]) ).
cnf(c_5,plain,
( reproducibility(A,sK0(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp3]) ).
cnf(c_6,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_7,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_9,plain,
( greater(V6,F)
| ~ greater(V8,V7)
| ~ size(C,V8,D)
| ~ size(A,V7,B)
| ~ reproducibility(C,V6,D)
| ~ reproducibility(A,F,B)
| ~ class(C,E,D)
| ~ class(A,E,B)
| ~ reorganization_free(C,D,D)
| ~ reorganization_free(A,B,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t9_FOL]) ).
fof(nnf_4,plain,
? [X,Y,C,R1,R2,A1,A2,S1,S2,T1,T2] :
( ( ~ greater(A2,A1)
| ~ greater(R2,R1) )
& greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& accountability(Y,A2,T2)
& accountability(X,A1,T1)
& reliability(Y,R2,T2)
& reliability(X,R1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t10_FOL_neg]) ).
fof(sk_t10_FOL_neg,plain,
( ( ~ greater(sK9,sK8)
| ~ greater(sK7,sK6) )
& greater(sK11,sK10)
& size(sK3,sK11,sK4)
& size(sK1,sK10,sK2)
& accountability(sK3,sK9,sK4)
& accountability(sK1,sK8,sK2)
& reliability(sK3,sK7,sK4)
& reliability(sK1,sK6,sK2)
& class(sK3,sK5,sK4)
& class(sK1,sK5,sK2)
& reorganization_free(sK3,sK4,sK4)
& reorganization_free(sK1,sK2,sK2)
& organization(sK3,sK4)
& organization(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X,sK1),skolemize(Y,sK3),skolemize(C,sK5),skolemize(R1,sK6),skolemize(R2,sK7),skolemize(A1,sK8),skolemize(A2,sK9),skolemize(S1,sK10),skolemize(S2,sK11),skolemize(T1,sK2),skolemize(T2,sK4)],[nnf_4]) ).
cnf(c_10,negated_conjecture,
organization(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_11,negated_conjecture,
organization(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_12,negated_conjecture,
reorganization_free(sK1,sK2,sK2),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_13,negated_conjecture,
reorganization_free(sK3,sK4,sK4),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_14,negated_conjecture,
class(sK1,sK5,sK2),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_15,negated_conjecture,
class(sK3,sK5,sK4),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_16,negated_conjecture,
reliability(sK1,sK6,sK2),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_17,negated_conjecture,
reliability(sK3,sK7,sK4),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_18,negated_conjecture,
accountability(sK1,sK8,sK2),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_19,negated_conjecture,
accountability(sK3,sK9,sK4),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_20,negated_conjecture,
size(sK1,sK10,sK2),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_21,negated_conjecture,
size(sK3,sK11,sK4),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_22,negated_conjecture,
greater(sK11,sK10),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_23,negated_conjecture,
( ~ greater(sK9,sK8)
| ~ greater(sK7,sK6) ),
inference(split_conjunct,[status(thm)],[sk_t10_FOL_neg]) ).
cnf(c_24,plain,
reproducibility(sK1,sK0(sK1,sK2),sK2),
inference(resolve,[status(thm)],[c_10,c_5]) ).
cnf(c_25,plain,
reproducibility(sK3,sK0(sK3,sK4),sK4),
inference(resolve,[status(thm)],[c_11,c_5]) ).
cnf(c_142,negated_conjecture,
( greater(E,D)
| ~ greater(V6,F)
| ~ size(A,V6,B)
| ~ size(sK1,F,sK2)
| ~ reproducibility(A,E,B)
| ~ reproducibility(sK1,D,sK2)
| ~ class(A,C,B)
| ~ class(sK1,C,sK2)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(sK1,sK2,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_143,negated_conjecture,
( greater(C,B)
| ~ greater(E,D)
| ~ size(sK3,E,sK4)
| ~ size(sK1,D,sK2)
| ~ reproducibility(sK3,C,sK4)
| ~ reproducibility(sK1,B,sK2)
| ~ class(sK3,A,sK4)
| ~ class(sK1,A,sK2)
| ~ reorganization_free(sK3,sK4,sK4)
| ~ reorganization_free(sK1,sK2,sK2) ),
inference(resolve,[status(thm)],[c_142,c_11]) ).
cnf(c_144,negated_conjecture,
( greater(C,B)
| ~ greater(E,D)
| ~ size(sK3,E,sK4)
| ~ size(sK1,D,sK2)
| ~ reproducibility(sK3,C,sK4)
| ~ reproducibility(sK1,B,sK2)
| ~ class(sK3,A,sK4)
| ~ class(sK1,A,sK2)
| ~ reorganization_free(sK3,sK4,sK4) ),
inference(resolve,[status(thm)],[c_143,c_12]) ).
cnf(c_145,negated_conjecture,
( greater(C,B)
| ~ greater(E,D)
| ~ size(sK3,E,sK4)
| ~ size(sK1,D,sK2)
| ~ reproducibility(sK3,C,sK4)
| ~ reproducibility(sK1,B,sK2)
| ~ class(sK3,A,sK4)
| ~ class(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_144,c_13]) ).
cnf(c_146,negated_conjecture,
( greater(B,A)
| ~ greater(D,C)
| ~ size(sK3,D,sK4)
| ~ size(sK1,C,sK2)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2)
| ~ class(sK3,sK5,sK4) ),
inference(resolve,[status(thm)],[c_145,c_14]) ).
cnf(c_147,negated_conjecture,
( greater(B,A)
| ~ greater(D,C)
| ~ size(sK3,D,sK4)
| ~ size(sK1,C,sK2)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_146,c_15]) ).
cnf(c_148,negated_conjecture,
( greater(A,sK0(sK1,sK2))
| ~ greater(C,B)
| ~ size(sK3,C,sK4)
| ~ size(sK1,B,sK2)
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_147,c_24]) ).
cnf(c_149,negated_conjecture,
( greater(sK0(sK3,sK4),sK0(sK1,sK2))
| ~ greater(B,A)
| ~ size(sK3,B,sK4)
| ~ size(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_148,c_25]) ).
cnf(c_150,negated_conjecture,
( greater(sK0(sK3,sK4),sK0(sK1,sK2))
| ~ greater(A,sK10)
| ~ size(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_149,c_20]) ).
cnf(c_151,negated_conjecture,
( greater(sK0(sK3,sK4),sK0(sK1,sK2))
| ~ greater(sK11,sK10) ),
inference(resolve,[status(thm)],[c_150,c_21]) ).
cnf(c_97,negated_conjecture,
greater(sK0(sK3,sK4),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_151,c_22]) ).
cnf(c_152,negated_conjecture,
( greater(F,E)
| ~ greater(V7,V6)
| ~ reproducibility(A,V7,B)
| ~ reproducibility(sK1,V6,sK2)
| ~ accountability(A,F,B)
| ~ accountability(sK1,E,sK2)
| ~ reliability(A,D,B)
| ~ reliability(sK1,C,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_7,c_10]) ).
cnf(c_153,negated_conjecture,
( greater(D,C)
| ~ greater(F,E)
| ~ reproducibility(sK3,F,sK4)
| ~ reproducibility(sK1,E,sK2)
| ~ accountability(sK3,D,sK4)
| ~ accountability(sK1,C,sK2)
| ~ reliability(sK3,B,sK4)
| ~ reliability(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_152,c_11]) ).
cnf(c_154,negated_conjecture,
( greater(C,B)
| ~ greater(E,D)
| ~ reproducibility(sK3,E,sK4)
| ~ reproducibility(sK1,D,sK2)
| ~ accountability(sK3,C,sK4)
| ~ accountability(sK1,B,sK2)
| ~ reliability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_153,c_16]) ).
cnf(c_155,negated_conjecture,
( greater(B,A)
| ~ greater(D,C)
| ~ reproducibility(sK3,D,sK4)
| ~ reproducibility(sK1,C,sK2)
| ~ accountability(sK3,B,sK4)
| ~ accountability(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_154,c_17]) ).
cnf(c_156,negated_conjecture,
( greater(A,sK8)
| ~ greater(C,B)
| ~ reproducibility(sK3,C,sK4)
| ~ reproducibility(sK1,B,sK2)
| ~ accountability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_155,c_18]) ).
cnf(c_157,negated_conjecture,
( greater(sK9,sK8)
| ~ greater(B,A)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_156,c_19]) ).
cnf(c_158,negated_conjecture,
( greater(sK9,sK8)
| ~ greater(A,sK0(sK1,sK2))
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_157,c_24]) ).
cnf(c_159,negated_conjecture,
( greater(sK9,sK8)
| ~ greater(sK0(sK3,sK4),sK0(sK1,sK2)) ),
inference(resolve,[status(thm)],[c_158,c_25]) ).
cnf(c_101,negated_conjecture,
greater(sK9,sK8),
inference(resolve,[status(thm)],[c_159,c_97]) ).
cnf(c_160,negated_conjecture,
( greater(D,C)
| ~ greater(V7,V6)
| ~ reproducibility(A,V7,B)
| ~ reproducibility(sK1,V6,sK2)
| ~ accountability(A,F,B)
| ~ accountability(sK1,E,sK2)
| ~ reliability(A,D,B)
| ~ reliability(sK1,C,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_6,c_10]) ).
cnf(c_161,negated_conjecture,
( greater(B,A)
| ~ greater(F,E)
| ~ reproducibility(sK3,F,sK4)
| ~ reproducibility(sK1,E,sK2)
| ~ accountability(sK3,D,sK4)
| ~ accountability(sK1,C,sK2)
| ~ reliability(sK3,B,sK4)
| ~ reliability(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_160,c_11]) ).
cnf(c_162,negated_conjecture,
( greater(A,sK6)
| ~ greater(E,D)
| ~ reproducibility(sK3,E,sK4)
| ~ reproducibility(sK1,D,sK2)
| ~ accountability(sK3,C,sK4)
| ~ accountability(sK1,B,sK2)
| ~ reliability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_161,c_16]) ).
cnf(c_163,negated_conjecture,
( greater(sK7,sK6)
| ~ greater(D,C)
| ~ reproducibility(sK3,D,sK4)
| ~ reproducibility(sK1,C,sK2)
| ~ accountability(sK3,B,sK4)
| ~ accountability(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_162,c_17]) ).
cnf(c_164,negated_conjecture,
( greater(sK7,sK6)
| ~ greater(C,B)
| ~ reproducibility(sK3,C,sK4)
| ~ reproducibility(sK1,B,sK2)
| ~ accountability(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_163,c_18]) ).
cnf(c_165,negated_conjecture,
( greater(sK7,sK6)
| ~ greater(B,A)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_164,c_19]) ).
cnf(c_166,negated_conjecture,
( greater(sK7,sK6)
| ~ greater(A,sK0(sK1,sK2))
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_165,c_24]) ).
cnf(c_167,negated_conjecture,
( greater(sK7,sK6)
| ~ greater(sK0(sK3,sK4),sK0(sK1,sK2)) ),
inference(resolve,[status(thm)],[c_166,c_25]) ).
cnf(c_102,negated_conjecture,
greater(sK7,sK6),
inference(resolve,[status(thm)],[c_167,c_97]) ).
cnf(c_168,negated_conjecture,
~ greater(sK9,sK8),
inference(resolve,[status(thm)],[c_102,c_23]) ).
cnf(c_141,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_101,c_168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT010+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/5.36 % Computer : n015.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Sat Sep 26 00:06:47 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/5.36 % Process 2602367 was started by sandbox on n015,
% 0.08/5.36 % Sat Sep 26 00:06:47 2026
% 0.08/5.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/5.37
% 0.08/5.37 % From the command line: assign(max_seconds, 300).
% 0.12/5.40
% 0.12/5.40 % SZS status Theorem for theBenchmark
% 0.12/5.40
% 0.12/5.40 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.12/5.40 % Length of proof is 28.
% 0.12/5.40 % Level of proof is 5.
% 0.12/5.40 % Maximum clause weight is 49.000.
% 0.12/5.40 % Given clauses 26.
% 0.12/5.40
% 0.12/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------