%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT009+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 : n003.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.11s 0.61s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 254 ( 98 ~; 93 |; 57 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 121 ( 0 sgn 41 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('theBenchmark.p',mp5) ).
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(a5_FOL,axiom,
! [X,Y,C,S1,S2,I1,I2,T1,T2] :
( ( greater(S2,S1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& size(Y,S2,T2)
& size(X,S1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('theBenchmark.p',a5_FOL) ).
fof(t9_FOL,conjecture,
! [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(t9_FOL_neg,negated_conjecture,
~ ! [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) ),
inference(assume_negation,[status(cth)],[t9_FOL]) ).
fof(nnf_1,plain,
! [X,T] :
( ? [I] : inertia(X,I,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp5]) ).
fof(sk_mp5,plain,
! [X,T] :
( inertia(X,sK0(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(I,sK0(X,T))],[nnf_1]) ).
cnf(c_5,plain,
( inertia(A,sK0(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp5]) ).
cnf(c_7,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]) ).
cnf(c_8,plain,
( greater(V8,V7)
| ~ greater(V6,F)
| ~ inertia(C,V8,D)
| ~ inertia(A,V7,B)
| ~ size(C,V6,D)
| ~ size(A,F,B)
| ~ class(C,E,D)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a5_FOL]) ).
fof(nnf_4,plain,
? [X,Y,C,Rp1,Rp2,S1,S2,T1,T2] :
( ~ greater(Rp2,Rp1)
& 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) ),
inference(fof_nnf,[status(thm)],[t9_FOL_neg]) ).
fof(sk_t9_FOL_neg,plain,
( ~ greater(sK7,sK6)
& greater(sK9,sK8)
& size(sK3,sK9,sK4)
& size(sK1,sK8,sK2)
& reproducibility(sK3,sK7,sK4)
& reproducibility(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]),skolemize(X,sK1),skolemize(Y,sK3),skolemize(C,sK5),skolemize(Rp1,sK6),skolemize(Rp2,sK7),skolemize(S1,sK8),skolemize(S2,sK9),skolemize(T1,sK2),skolemize(T2,sK4)],[nnf_4]) ).
cnf(c_9,negated_conjecture,
organization(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_10,negated_conjecture,
organization(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_11,negated_conjecture,
reorganization_free(sK1,sK2,sK2),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_12,negated_conjecture,
reorganization_free(sK3,sK4,sK4),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_13,negated_conjecture,
class(sK1,sK5,sK2),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_14,negated_conjecture,
class(sK3,sK5,sK4),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_15,negated_conjecture,
reproducibility(sK1,sK6,sK2),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_16,negated_conjecture,
reproducibility(sK3,sK7,sK4),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_17,negated_conjecture,
size(sK1,sK8,sK2),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_18,negated_conjecture,
size(sK3,sK9,sK4),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_19,negated_conjecture,
greater(sK9,sK8),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_20,negated_conjecture,
~ greater(sK7,sK6),
inference(split_conjunct,[status(thm)],[sk_t9_FOL_neg]) ).
cnf(c_33,negated_conjecture,
inertia(sK1,sK0(sK1,sK2),sK2),
inference(resolve,[status(thm)],[c_5,c_9]) ).
cnf(c_34,negated_conjecture,
inertia(sK3,sK0(sK3,sK4),sK4),
inference(resolve,[status(thm)],[c_5,c_10]) ).
cnf(c_46,negated_conjecture,
( greater(V6,F)
| ~ greater(E,D)
| ~ inertia(A,V6,B)
| ~ inertia(sK1,F,sK2)
| ~ size(A,E,B)
| ~ size(sK1,D,sK2)
| ~ class(A,C,B)
| ~ class(sK1,C,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_8,c_9]) ).
cnf(c_47,negated_conjecture,
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(sK3,E,sK4)
| ~ inertia(sK1,D,sK2)
| ~ size(sK3,C,sK4)
| ~ size(sK1,B,sK2)
| ~ class(sK3,A,sK4)
| ~ class(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_46,c_10]) ).
cnf(c_48,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sK3,D,sK4)
| ~ inertia(sK1,C,sK2)
| ~ size(sK3,B,sK4)
| ~ size(sK1,A,sK2)
| ~ class(sK3,sK5,sK4) ),
inference(resolve,[status(thm)],[c_47,c_13]) ).
cnf(c_49,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sK3,D,sK4)
| ~ inertia(sK1,C,sK2)
| ~ size(sK3,B,sK4)
| ~ size(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_48,c_14]) ).
cnf(c_50,negated_conjecture,
( greater(C,B)
| ~ greater(A,sK8)
| ~ inertia(sK3,C,sK4)
| ~ inertia(sK1,B,sK2)
| ~ size(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_49,c_17]) ).
cnf(c_51,negated_conjecture,
( greater(B,A)
| ~ greater(sK9,sK8)
| ~ inertia(sK3,B,sK4)
| ~ inertia(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_50,c_18]) ).
cnf(c_52,negated_conjecture,
( greater(A,sK0(sK1,sK2))
| ~ greater(sK9,sK8)
| ~ inertia(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_51,c_33]) ).
cnf(c_53,negated_conjecture,
( greater(sK0(sK3,sK4),sK0(sK1,sK2))
| ~ greater(sK9,sK8) ),
inference(resolve,[status(thm)],[c_52,c_34]) ).
cnf(c_44,negated_conjecture,
greater(sK0(sK3,sK4),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_53,c_19]) ).
cnf(c_54,negated_conjecture,
( ~ greater(F,E)
| greater(D,C)
| ~ inertia(A,F,B)
| ~ inertia(sK1,E,sK2)
| ~ reproducibility(A,D,B)
| ~ reproducibility(sK1,C,sK2)
| ~ reorganization_free(A,B,B)
| ~ reorganization_free(sK1,sK2,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_7,c_9]) ).
cnf(c_55,negated_conjecture,
( ~ greater(D,C)
| greater(B,A)
| ~ inertia(sK3,D,sK4)
| ~ inertia(sK1,C,sK2)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2)
| ~ reorganization_free(sK3,sK4,sK4)
| ~ reorganization_free(sK1,sK2,sK2) ),
inference(resolve,[status(thm)],[c_54,c_10]) ).
cnf(c_56,negated_conjecture,
( ~ greater(D,C)
| greater(B,A)
| ~ inertia(sK3,D,sK4)
| ~ inertia(sK1,C,sK2)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2)
| ~ reorganization_free(sK3,sK4,sK4) ),
inference(resolve,[status(thm)],[c_55,c_11]) ).
cnf(c_57,negated_conjecture,
( ~ greater(D,C)
| greater(B,A)
| ~ inertia(sK3,D,sK4)
| ~ inertia(sK1,C,sK2)
| ~ reproducibility(sK3,B,sK4)
| ~ reproducibility(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_56,c_12]) ).
cnf(c_58,negated_conjecture,
( ~ greater(C,B)
| greater(A,sK6)
| ~ inertia(sK3,C,sK4)
| ~ inertia(sK1,B,sK2)
| ~ reproducibility(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_57,c_15]) ).
cnf(c_59,negated_conjecture,
( ~ greater(B,A)
| greater(sK7,sK6)
| ~ inertia(sK3,B,sK4)
| ~ inertia(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_58,c_16]) ).
cnf(c_60,negated_conjecture,
( ~ greater(A,sK0(sK1,sK2))
| greater(sK7,sK6)
| ~ inertia(sK3,A,sK4) ),
inference(resolve,[status(thm)],[c_59,c_33]) ).
cnf(c_61,negated_conjecture,
( ~ greater(sK0(sK3,sK4),sK0(sK1,sK2))
| greater(sK7,sK6) ),
inference(resolve,[status(thm)],[c_60,c_34]) ).
cnf(c_62,negated_conjecture,
~ greater(sK0(sK3,sK4),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_61,c_20]) ).
cnf(c_45,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_44,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT009+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.11/0.58 % Computer : n003.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Sat Sep 26 00:04:38 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.58 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.58 % Process 1465799 was started by sandbox on n003,
% 0.11/0.58 % Sat Sep 26 00:04:38 2026
% 0.11/0.58 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.59
% 0.11/0.59 % From the command line: assign(max_seconds, 300).
% 0.11/0.61
% 0.11/0.61 % SZS status Theorem for theBenchmark
% 0.11/0.61
% 0.11/0.61 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.11/0.61 % Length of proof is 23.
% 0.11/0.61 % Level of proof is 4.
% 0.11/0.61 % Maximum clause weight is 41.000.
% 0.11/0.61 % Given clauses 30.
% 0.11/0.61
% 0.11/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------