%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT006+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 : n004.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:04 AM UTC 2026
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 50 ( 15 unt; 0 def)
% Number of atoms : 218 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 290 ( 122 ~; 117 |; 45 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 138 ( 18 sgn 35 !; 9 ?)
% 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(a4_FOL,axiom,
! [X,Rp1,Rp2,T1,T2] :
( ( greater(T2,T1)
& reproducibility(X,Rp2,T2)
& reproducibility(X,Rp1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(Rp2,Rp1) ),
file('theBenchmark.p',a4_FOL) ).
fof(t6_FOL,conjecture,
! [X,R1,R2,A1,A2,T1,T2] :
( ( greater(T2,T1)
& accountability(X,A2,T2)
& accountability(X,A1,T1)
& reliability(X,R2,T2)
& reliability(X,R1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ( greater(A2,A1)
& greater(R2,R1) ) ),
file('theBenchmark.p',t6_FOL) ).
fof(t6_FOL_neg,negated_conjecture,
~ ! [X,R1,R2,A1,A2,T1,T2] :
( ( greater(T2,T1)
& accountability(X,A2,T2)
& accountability(X,A1,T1)
& reliability(X,R2,T2)
& reliability(X,R1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ( greater(A2,A1)
& greater(R2,R1) ) ),
inference(assume_negation,[status(cth)],[t6_FOL]) ).
fof(nnf_4,plain,
? [X,R1,R2,A1,A2,T1,T2] :
( ( ~ greater(A2,A1)
| ~ greater(R2,R1) )
& greater(T2,T1)
& accountability(X,A2,T2)
& accountability(X,A1,T1)
& reliability(X,R2,T2)
& reliability(X,R1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t6_FOL_neg]) ).
fof(sk_t6_FOL_neg,plain,
( ( ~ greater(sK5,sK6)
| ~ greater(sK3,sK4) )
& greater(sK2,sK1)
& accountability(sK0,sK5,sK2)
& accountability(sK0,sK6,sK1)
& reliability(sK0,sK3,sK2)
& reliability(sK0,sK4,sK1)
& reorganization_free(sK0,sK1,sK2)
& organization(sK0,sK2)
& organization(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK4,sK3,sK6,sK5]),skolemize(X,sK0),skolemize(R1,sK4),skolemize(R2,sK3),skolemize(A1,sK6),skolemize(A2,sK5),skolemize(T1,sK1),skolemize(T2,sK2)],[nnf_4]) ).
cnf(c_5,negated_conjecture,
reorganization_free(sK0,sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_6,plain,
( greater(E,D)
| ~ greater(C,B)
| ~ reproducibility(A,E,C)
| ~ reproducibility(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a4_FOL]) ).
cnf(c_7,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ reproducibility(sK0,B,sK2)
| ~ reproducibility(sK0,A,sK1)
| ~ organization(sK0,sK2)
| ~ organization(sK0,sK1) ),
inference(resolve,[status(thm)],[c_5,c_6]) ).
cnf(c_8,negated_conjecture,
( ~ greater(sK5,sK6)
| ~ greater(sK3,sK4) ),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_9,negated_conjecture,
greater(sK2,sK1),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_10,negated_conjecture,
accountability(sK0,sK5,sK2),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_11,negated_conjecture,
accountability(sK0,sK6,sK1),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_12,negated_conjecture,
reliability(sK0,sK3,sK2),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_13,negated_conjecture,
reliability(sK0,sK4,sK1),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_14,negated_conjecture,
organization(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_15,negated_conjecture,
organization(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_t6_FOL_neg]) ).
cnf(c_17,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_18,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]) ).
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,sK7(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(Rp,sK7(X,T))],[nnf_1]) ).
cnf(c_19,plain,
( reproducibility(A,sK7(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp3]) ).
cnf(c_102,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ reproducibility(sK0,B,sK2)
| ~ reproducibility(sK0,A,sK1)
| ~ organization(sK0,sK2) ),
inference(resolve,[status(thm)],[c_15,c_7]) ).
cnf(c_103,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ reproducibility(sK0,B,sK2)
| ~ reproducibility(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_14,c_102]) ).
cnf(c_20,negated_conjecture,
( greater(B,A)
| ~ reproducibility(sK0,B,sK2)
| ~ reproducibility(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_9,c_103]) ).
cnf(c_39,plain,
reproducibility(sK0,sK7(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_19,c_15]) ).
cnf(c_40,plain,
reproducibility(sK0,sK7(sK0,sK2),sK2),
inference(resolve,[status(thm)],[c_19,c_14]) ).
cnf(c_104,negated_conjecture,
( greater(A,sK7(sK0,sK1))
| ~ reproducibility(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_20,c_39]) ).
cnf(c_76,negated_conjecture,
greater(sK7(sK0,sK2),sK7(sK0,sK1)),
inference(resolve,[status(thm)],[c_104,c_40]) ).
cnf(c_105,negated_conjecture,
( greater(D,C)
| ~ greater(V7,V6)
| ~ reproducibility(A,V7,B)
| ~ reproducibility(sK0,V6,sK1)
| ~ accountability(A,F,B)
| ~ accountability(sK0,E,sK1)
| ~ reliability(A,D,B)
| ~ reliability(sK0,C,sK1)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_18,c_15]) ).
cnf(c_106,negated_conjecture,
( greater(B,A)
| ~ greater(F,E)
| ~ reproducibility(sK0,F,sK2)
| ~ reproducibility(sK0,E,sK1)
| ~ accountability(sK0,D,sK2)
| ~ accountability(sK0,C,sK1)
| ~ reliability(sK0,B,sK2)
| ~ reliability(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_105,c_14]) ).
cnf(c_107,negated_conjecture,
( greater(A,sK4)
| ~ greater(E,D)
| ~ reproducibility(sK0,E,sK2)
| ~ reproducibility(sK0,D,sK1)
| ~ accountability(sK0,C,sK2)
| ~ accountability(sK0,B,sK1)
| ~ reliability(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_106,c_13]) ).
cnf(c_108,negated_conjecture,
( greater(sK3,sK4)
| ~ greater(D,C)
| ~ reproducibility(sK0,D,sK2)
| ~ reproducibility(sK0,C,sK1)
| ~ accountability(sK0,B,sK2)
| ~ accountability(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_107,c_12]) ).
cnf(c_109,negated_conjecture,
( greater(sK3,sK4)
| ~ greater(C,B)
| ~ reproducibility(sK0,C,sK2)
| ~ reproducibility(sK0,B,sK1)
| ~ accountability(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_108,c_11]) ).
cnf(c_110,negated_conjecture,
( greater(sK3,sK4)
| ~ greater(B,A)
| ~ reproducibility(sK0,B,sK2)
| ~ reproducibility(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_109,c_10]) ).
cnf(c_111,negated_conjecture,
( greater(sK3,sK4)
| ~ greater(A,sK7(sK0,sK1))
| ~ reproducibility(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_110,c_39]) ).
cnf(c_112,negated_conjecture,
( greater(sK3,sK4)
| ~ greater(sK7(sK0,sK2),sK7(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_111,c_40]) ).
cnf(c_78,negated_conjecture,
greater(sK3,sK4),
inference(resolve,[status(thm)],[c_112,c_76]) ).
cnf(c_113,negated_conjecture,
( greater(F,E)
| ~ greater(V7,V6)
| ~ reproducibility(A,V7,B)
| ~ reproducibility(sK0,V6,sK1)
| ~ accountability(A,F,B)
| ~ accountability(sK0,E,sK1)
| ~ reliability(A,D,B)
| ~ reliability(sK0,C,sK1)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_17,c_15]) ).
cnf(c_114,negated_conjecture,
( greater(D,C)
| ~ greater(F,E)
| ~ reproducibility(sK0,F,sK2)
| ~ reproducibility(sK0,E,sK1)
| ~ accountability(sK0,D,sK2)
| ~ accountability(sK0,C,sK1)
| ~ reliability(sK0,B,sK2)
| ~ reliability(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_113,c_14]) ).
cnf(c_115,negated_conjecture,
( greater(C,B)
| ~ greater(E,D)
| ~ reproducibility(sK0,E,sK2)
| ~ reproducibility(sK0,D,sK1)
| ~ accountability(sK0,C,sK2)
| ~ accountability(sK0,B,sK1)
| ~ reliability(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_114,c_13]) ).
cnf(c_116,negated_conjecture,
( greater(B,A)
| ~ greater(D,C)
| ~ reproducibility(sK0,D,sK2)
| ~ reproducibility(sK0,C,sK1)
| ~ accountability(sK0,B,sK2)
| ~ accountability(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_115,c_12]) ).
cnf(c_117,negated_conjecture,
( greater(A,sK6)
| ~ greater(C,B)
| ~ reproducibility(sK0,C,sK2)
| ~ reproducibility(sK0,B,sK1)
| ~ accountability(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_116,c_11]) ).
cnf(c_118,negated_conjecture,
( greater(sK5,sK6)
| ~ greater(B,A)
| ~ reproducibility(sK0,B,sK2)
| ~ reproducibility(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_117,c_10]) ).
cnf(c_119,negated_conjecture,
( greater(sK5,sK6)
| ~ greater(A,sK7(sK0,sK1))
| ~ reproducibility(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_118,c_39]) ).
cnf(c_120,negated_conjecture,
( greater(sK5,sK6)
| ~ greater(sK7(sK0,sK2),sK7(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_119,c_40]) ).
cnf(c_79,negated_conjecture,
greater(sK5,sK6),
inference(resolve,[status(thm)],[c_120,c_76]) ).
cnf(c_121,negated_conjecture,
~ greater(sK5,sK6),
inference(resolve,[status(thm)],[c_78,c_8]) ).
cnf(c_101,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_79,c_121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT006+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.06/0.35 % Computer : n004.cluster.edu
% 0.06/0.35 % Model : x86_64 x86_64
% 0.06/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.35 % Memory : 8046.5625MB
% 0.06/0.35 % OS : Linux 6.8.0-71-generic
% 0.06/0.35 % CPULimit : 300
% 0.06/0.35 % WCLimit : 300
% 0.06/0.35 % DateTime : Sat Sep 26 00:03:07 UTC 2026
% 0.06/0.35 % CPUTime :
% 0.06/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.06/0.35 % Process 295649 was started by sandbox on n004,
% 0.06/0.35 % Sat Sep 26 00:03:07 2026
% 0.06/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.06/0.36
% 0.06/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.38
% 0.12/0.38 % SZS status Theorem for theBenchmark
% 0.12/0.38
% 0.12/0.38 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.12/0.38 % Length of proof is 25.
% 0.12/0.38 % Level of proof is 6.
% 0.12/0.38 % Maximum clause weight is 41.000.
% 0.12/0.38 % Given clauses 21.
% 0.12/0.38
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------