%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT015+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 : n014.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:06 AM UTC 2026
% Result : Theorem 0.11s 0.61s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 245 ( 0 equ)
% Maximal formula atoms : 13 ( 5 avg)
% Number of connectives : 327 ( 131 ~; 126 |; 65 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 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 : 136 ( 0 sgn 42 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('theBenchmark.p',mp5) ).
fof(a12_FOL,axiom,
! [X,Y,C,C1,C2,I1,I2,T1,T2] :
( ( greater(C2,C1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& complexity(Y,C2,T2)
& complexity(X,C1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('theBenchmark.p',a12_FOL) ).
fof(a13_FOL,axiom,
! [X,Y,Rt,C,I1,I2,Ta,Tb,Tc] :
( ( greater(I2,I1)
& inertia(Y,I2,Ta)
& inertia(X,I1,Ta)
& reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,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',a13_FOL) ).
fof(t15_FOL,conjecture,
! [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',t15_FOL) ).
fof(t15_FOL_neg,negated_conjecture,
~ ! [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) ),
inference(assume_negation,[status(cth)],[t15_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_6,plain,
( greater(V8,V7)
| ~ greater(V6,F)
| ~ inertia(C,V8,D)
| ~ inertia(A,V7,B)
| ~ complexity(C,V6,D)
| ~ complexity(A,F,B)
| ~ class(C,E,D)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[a12_FOL]) ).
cnf(c_7,plain,
( greater(D,F)
| ~ greater(V8,V7)
| ~ inertia(C,V8,B)
| ~ inertia(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)],[a13_FOL]) ).
fof(nnf_4,plain,
? [X,Y,Re,C,C1,C2,Ta,Tb,Tc] :
( ~ greater(Tc,Tb)
& 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) ),
inference(fof_nnf,[status(thm)],[t15_FOL_neg]) ).
fof(sk_t15_FOL_neg,plain,
( ~ greater(sK4,sK6)
& greater(sK9,sK8)
& complexity(sK3,sK9,sK2)
& complexity(sK1,sK8,sK2)
& reorganization_type(sK3,sK7,sK2)
& reorganization_type(sK1,sK7,sK2)
& reorganization(sK3,sK2,sK4)
& reorganization(sK1,sK2,sK6)
& class(sK3,sK5,sK2)
& class(sK1,sK5,sK2)
& organization(sK3,sK4)
& organization(sK3,sK2)
& 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(Re,sK7),skolemize(C,sK5),skolemize(C1,sK8),skolemize(C2,sK9),skolemize(Ta,sK2),skolemize(Tb,sK6),skolemize(Tc,sK4)],[nnf_4]) ).
cnf(c_8,negated_conjecture,
organization(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_9,negated_conjecture,
organization(sK3,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_10,negated_conjecture,
organization(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_11,negated_conjecture,
class(sK1,sK5,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_12,negated_conjecture,
class(sK3,sK5,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_13,negated_conjecture,
reorganization(sK1,sK2,sK6),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_14,negated_conjecture,
reorganization(sK3,sK2,sK4),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_15,negated_conjecture,
reorganization_type(sK1,sK7,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_16,negated_conjecture,
reorganization_type(sK3,sK7,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_17,negated_conjecture,
complexity(sK1,sK8,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_18,negated_conjecture,
complexity(sK3,sK9,sK2),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_19,negated_conjecture,
greater(sK9,sK8),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_20,negated_conjecture,
~ greater(sK4,sK6),
inference(split_conjunct,[status(thm)],[sk_t15_FOL_neg]) ).
cnf(c_21,negated_conjecture,
inertia(sK1,sK0(sK1,sK2),sK2),
inference(resolve,[status(thm)],[c_5,c_8]) ).
cnf(c_22,negated_conjecture,
inertia(sK3,sK0(sK3,sK2),sK2),
inference(resolve,[status(thm)],[c_5,c_9]) ).
cnf(c_67,negated_conjecture,
( greater(V6,F)
| ~ greater(E,D)
| ~ inertia(A,V6,B)
| ~ inertia(sK1,F,sK2)
| ~ complexity(A,E,B)
| ~ complexity(sK1,D,sK2)
| ~ class(A,C,B)
| ~ class(sK1,C,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_6,c_8]) ).
cnf(c_68,negated_conjecture,
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(sK3,E,sK2)
| ~ inertia(sK1,D,sK2)
| ~ complexity(sK3,C,sK2)
| ~ complexity(sK1,B,sK2)
| ~ class(sK3,A,sK2)
| ~ class(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_67,c_9]) ).
cnf(c_69,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sK3,D,sK2)
| ~ inertia(sK1,C,sK2)
| ~ complexity(sK3,B,sK2)
| ~ complexity(sK1,A,sK2)
| ~ class(sK3,sK5,sK2) ),
inference(resolve,[status(thm)],[c_68,c_11]) ).
cnf(c_70,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sK3,D,sK2)
| ~ inertia(sK1,C,sK2)
| ~ complexity(sK3,B,sK2)
| ~ complexity(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_69,c_12]) ).
cnf(c_71,negated_conjecture,
( greater(C,B)
| ~ greater(A,sK8)
| ~ inertia(sK3,C,sK2)
| ~ inertia(sK1,B,sK2)
| ~ complexity(sK3,A,sK2) ),
inference(resolve,[status(thm)],[c_70,c_17]) ).
cnf(c_72,negated_conjecture,
( greater(B,A)
| ~ greater(sK9,sK8)
| ~ inertia(sK3,B,sK2)
| ~ inertia(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_71,c_18]) ).
cnf(c_73,negated_conjecture,
( greater(A,sK0(sK1,sK2))
| ~ greater(sK9,sK8)
| ~ inertia(sK3,A,sK2) ),
inference(resolve,[status(thm)],[c_72,c_21]) ).
cnf(c_74,negated_conjecture,
( greater(sK0(sK3,sK2),sK0(sK1,sK2))
| ~ greater(sK9,sK8) ),
inference(resolve,[status(thm)],[c_73,c_22]) ).
cnf(c_64,negated_conjecture,
greater(sK0(sK3,sK2),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_74,c_19]) ).
cnf(c_75,negated_conjecture,
( greater(B,D)
| ~ greater(V6,F)
| ~ inertia(A,V6,sK2)
| ~ inertia(sK1,F,sK2)
| ~ reorganization_type(A,E,sK2)
| ~ reorganization_type(sK1,E,sK2)
| ~ reorganization(A,sK2,B)
| ~ reorganization(sK1,sK2,D)
| ~ class(A,C,sK2)
| ~ class(sK1,C,sK2)
| ~ organization(A,B)
| ~ organization(A,sK2) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
cnf(c_76,negated_conjecture,
( greater(A,C)
| ~ greater(F,E)
| ~ inertia(sK3,F,sK2)
| ~ inertia(sK1,E,sK2)
| ~ reorganization_type(sK3,D,sK2)
| ~ reorganization_type(sK1,D,sK2)
| ~ reorganization(sK3,sK2,A)
| ~ reorganization(sK1,sK2,C)
| ~ class(sK3,B,sK2)
| ~ class(sK1,B,sK2)
| ~ organization(sK3,A) ),
inference(resolve,[status(thm)],[c_75,c_9]) ).
cnf(c_77,negated_conjecture,
( greater(sK4,B)
| ~ greater(E,D)
| ~ inertia(sK3,E,sK2)
| ~ inertia(sK1,D,sK2)
| ~ reorganization_type(sK3,C,sK2)
| ~ reorganization_type(sK1,C,sK2)
| ~ reorganization(sK3,sK2,sK4)
| ~ reorganization(sK1,sK2,B)
| ~ class(sK3,A,sK2)
| ~ class(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_76,c_10]) ).
cnf(c_78,negated_conjecture,
( greater(sK4,A)
| ~ greater(D,C)
| ~ inertia(sK3,D,sK2)
| ~ inertia(sK1,C,sK2)
| ~ reorganization_type(sK3,B,sK2)
| ~ reorganization_type(sK1,B,sK2)
| ~ reorganization(sK3,sK2,sK4)
| ~ reorganization(sK1,sK2,A)
| ~ class(sK3,sK5,sK2) ),
inference(resolve,[status(thm)],[c_77,c_11]) ).
cnf(c_79,negated_conjecture,
( greater(sK4,A)
| ~ greater(D,C)
| ~ inertia(sK3,D,sK2)
| ~ inertia(sK1,C,sK2)
| ~ reorganization_type(sK3,B,sK2)
| ~ reorganization_type(sK1,B,sK2)
| ~ reorganization(sK3,sK2,sK4)
| ~ reorganization(sK1,sK2,A) ),
inference(resolve,[status(thm)],[c_78,c_12]) ).
cnf(c_80,negated_conjecture,
( greater(sK4,sK6)
| ~ greater(C,B)
| ~ inertia(sK3,C,sK2)
| ~ inertia(sK1,B,sK2)
| ~ reorganization_type(sK3,A,sK2)
| ~ reorganization_type(sK1,A,sK2)
| ~ reorganization(sK3,sK2,sK4) ),
inference(resolve,[status(thm)],[c_79,c_13]) ).
cnf(c_81,negated_conjecture,
( greater(sK4,sK6)
| ~ greater(C,B)
| ~ inertia(sK3,C,sK2)
| ~ inertia(sK1,B,sK2)
| ~ reorganization_type(sK3,A,sK2)
| ~ reorganization_type(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_80,c_14]) ).
cnf(c_82,negated_conjecture,
( greater(sK4,sK6)
| ~ greater(B,A)
| ~ inertia(sK3,B,sK2)
| ~ inertia(sK1,A,sK2)
| ~ reorganization_type(sK3,sK7,sK2) ),
inference(resolve,[status(thm)],[c_81,c_15]) ).
cnf(c_83,negated_conjecture,
( greater(sK4,sK6)
| ~ greater(B,A)
| ~ inertia(sK3,B,sK2)
| ~ inertia(sK1,A,sK2) ),
inference(resolve,[status(thm)],[c_82,c_16]) ).
cnf(c_84,negated_conjecture,
( greater(sK4,sK6)
| ~ greater(A,sK0(sK1,sK2))
| ~ inertia(sK3,A,sK2) ),
inference(resolve,[status(thm)],[c_83,c_21]) ).
cnf(c_85,negated_conjecture,
( greater(sK4,sK6)
| ~ greater(sK0(sK3,sK2),sK0(sK1,sK2)) ),
inference(resolve,[status(thm)],[c_84,c_22]) ).
cnf(c_65,negated_conjecture,
~ greater(sK0(sK3,sK2),sK0(sK1,sK2)),
inference(resolve,[status(thm)],[c_85,c_20]) ).
cnf(c_66,plain,
$false,
inference(resolve,[status(thm)],[c_65,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT015+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.58 % Computer : n014.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:03:49 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 1451909 was started by sandbox2 on n014,
% 0.11/0.58 % Sat Sep 26 00:03:49 2026
% 0.11/0.58 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/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 25.
% 0.11/0.61 % Level of proof is 4.
% 0.11/0.61 % Maximum clause weight is 47.000.
% 0.11/0.61 % Given clauses 22.
% 0.11/0.61
% 0.11/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------