%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT012+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.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 17 unt; 0 def)
% Number of atoms : 189 ( 7 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 229 ( 94 ~; 88 |; 40 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn 43 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp5,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('theBenchmark.p',mp5) ).
fof(mp6_2,axiom,
! [X,Y] :
~ ( greater(Y,X)
& greater(X,Y) ),
file('theBenchmark.p',mp6_2) ).
fof(mp9,axiom,
! [X,T] :
( organization(X,T)
=> ? [C] : class(X,C,T) ),
file('theBenchmark.p',mp9) ).
fof(mp10,axiom,
! [X,T1,T2,C1,C2] :
( ( class(X,C2,T2)
& class(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> C1 = C2 ),
file('theBenchmark.p',mp10) ).
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(t2_FOL,axiom,
! [X,I1,I2,T1,T2] :
( ( greater(T2,T1)
& inertia(X,I2,T2)
& inertia(X,I1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('theBenchmark.p',t2_FOL) ).
fof(t12_FOL,conjecture,
! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('theBenchmark.p',t12_FOL) ).
fof(t12_FOL_neg,negated_conjecture,
~ ! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
inference(assume_negation,[status(cth)],[t12_FOL]) ).
fof(nnf_8,plain,
? [X,C1,C2,T1,T2] :
( greater(C1,C2)
& greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t12_FOL_neg]) ).
fof(sk_t12_FOL_neg,plain,
( greater(sK3,sK4)
& greater(sK2,sK1)
& complexity(sK0,sK4,sK2)
& complexity(sK0,sK3,sK1)
& reorganization_free(sK0,sK1,sK2)
& organization(sK0,sK2)
& organization(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X,sK0),skolemize(C1,sK3),skolemize(C2,sK4),skolemize(T1,sK1),skolemize(T2,sK2)],[nnf_8]) ).
cnf(c_9,negated_conjecture,
reorganization_free(sK0,sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_10,plain,
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(A,E,C)
| ~ inertia(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[t2_FOL]) ).
cnf(c_11,plain,
( E = D
| ~ class(A,E,C)
| ~ class(A,D,B)
| ~ reorganization_free(A,B,C)
| ~ organization(A,C)
| ~ organization(A,B) ),
inference(clausify,[status(thm)],[mp10]) ).
cnf(c_12,negated_conjecture,
( B = A
| ~ class(sK0,B,sK2)
| ~ class(sK0,A,sK1)
| ~ organization(sK0,sK2)
| ~ organization(sK0,sK1) ),
inference(resolve,[status(thm)],[c_9,c_11]) ).
cnf(c_13,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ inertia(sK0,B,sK2)
| ~ inertia(sK0,A,sK1)
| ~ organization(sK0,sK2)
| ~ organization(sK0,sK1) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_14,negated_conjecture,
greater(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_15,negated_conjecture,
greater(sK2,sK1),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_16,negated_conjecture,
complexity(sK0,sK4,sK2),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_17,negated_conjecture,
complexity(sK0,sK3,sK1),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_18,negated_conjecture,
organization(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_19,negated_conjecture,
organization(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_t12_FOL_neg]) ).
cnf(c_20,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]) ).
fof(nnf_4,plain,
! [X,T] :
( ? [C] : class(X,C,T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp9]) ).
fof(sk_mp9,plain,
! [X,T] :
( class(X,sK5(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(C,sK5(X,T))],[nnf_4]) ).
cnf(c_21,plain,
( class(A,sK5(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp9]) ).
cnf(c_22,plain,
( ~ greater(B,A)
| ~ greater(A,B) ),
inference(clausify,[status(thm)],[mp6_2]) ).
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,sK6(X,T),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(I,sK6(X,T))],[nnf_1]) ).
cnf(c_24,plain,
( inertia(A,sK6(A,B),B)
| ~ organization(A,B) ),
inference(split_conjunct,[status(thm)],[sk_mp5]) ).
cnf(c_46,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ inertia(sK0,B,sK2)
| ~ inertia(sK0,A,sK1)
| ~ organization(sK0,sK2) ),
inference(resolve,[status(thm)],[c_19,c_13]) ).
cnf(c_47,negated_conjecture,
( greater(B,A)
| ~ greater(sK2,sK1)
| ~ inertia(sK0,B,sK2)
| ~ inertia(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_18,c_46]) ).
cnf(c_25,negated_conjecture,
( greater(B,A)
| ~ inertia(sK0,B,sK2)
| ~ inertia(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_15,c_47]) ).
cnf(c_48,negated_conjecture,
( B = A
| ~ class(sK0,B,sK2)
| ~ class(sK0,A,sK1)
| ~ organization(sK0,sK2) ),
inference(resolve,[status(thm)],[c_19,c_12]) ).
cnf(c_26,negated_conjecture,
( B = A
| ~ class(sK0,B,sK2)
| ~ class(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_18,c_48]) ).
cnf(c_27,negated_conjecture,
class(sK0,sK5(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_21,c_19]) ).
cnf(c_28,negated_conjecture,
class(sK0,sK5(sK0,sK2),sK2),
inference(resolve,[status(thm)],[c_21,c_18]) ).
cnf(c_34,negated_conjecture,
inertia(sK0,sK6(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_24,c_19]) ).
cnf(c_35,negated_conjecture,
inertia(sK0,sK6(sK0,sK2),sK2),
inference(resolve,[status(thm)],[c_24,c_18]) ).
cnf(c_49,negated_conjecture,
( A = sK5(sK0,sK1)
| ~ class(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_26,c_27]) ).
cnf(c_36,negated_conjecture,
sK5(sK0,sK2) = sK5(sK0,sK1),
inference(resolve,[status(thm)],[c_49,c_28]) ).
cnf(c_37,negated_conjecture,
class(sK0,sK5(sK0,sK1),sK2),
inference(paramod,[status(thm)],[c_36,c_28]) ).
cnf(c_50,negated_conjecture,
( greater(A,sK6(sK0,sK1))
| ~ inertia(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_25,c_34]) ).
cnf(c_40,negated_conjecture,
greater(sK6(sK0,sK2),sK6(sK0,sK1)),
inference(resolve,[status(thm)],[c_50,c_35]) ).
cnf(c_51,negated_conjecture,
( greater(V6,F)
| ~ greater(E,D)
| ~ inertia(A,V6,B)
| ~ inertia(sK0,F,sK2)
| ~ complexity(A,E,B)
| ~ complexity(sK0,D,sK2)
| ~ class(A,C,B)
| ~ class(sK0,C,sK2)
| ~ organization(A,B) ),
inference(resolve,[status(thm)],[c_20,c_18]) ).
cnf(c_52,negated_conjecture,
( greater(E,D)
| ~ greater(C,B)
| ~ inertia(sK0,E,sK1)
| ~ inertia(sK0,D,sK2)
| ~ complexity(sK0,C,sK1)
| ~ complexity(sK0,B,sK2)
| ~ class(sK0,A,sK1)
| ~ class(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_51,c_19]) ).
cnf(c_53,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sK0,D,sK1)
| ~ inertia(sK0,C,sK2)
| ~ complexity(sK0,B,sK1)
| ~ complexity(sK0,A,sK2)
| ~ class(sK0,sK5(sK0,sK1),sK1) ),
inference(resolve,[status(thm)],[c_52,c_37]) ).
cnf(c_54,negated_conjecture,
( greater(D,C)
| ~ greater(B,A)
| ~ inertia(sK0,D,sK1)
| ~ inertia(sK0,C,sK2)
| ~ complexity(sK0,B,sK1)
| ~ complexity(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_53,c_27]) ).
cnf(c_55,negated_conjecture,
( greater(C,B)
| ~ greater(A,sK4)
| ~ inertia(sK0,C,sK1)
| ~ inertia(sK0,B,sK2)
| ~ complexity(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_54,c_16]) ).
cnf(c_56,negated_conjecture,
( greater(B,A)
| ~ greater(sK3,sK4)
| ~ inertia(sK0,B,sK1)
| ~ inertia(sK0,A,sK2) ),
inference(resolve,[status(thm)],[c_55,c_17]) ).
cnf(c_57,negated_conjecture,
( greater(A,sK6(sK0,sK2))
| ~ greater(sK3,sK4)
| ~ inertia(sK0,A,sK1) ),
inference(resolve,[status(thm)],[c_56,c_35]) ).
cnf(c_58,negated_conjecture,
( greater(sK6(sK0,sK1),sK6(sK0,sK2))
| ~ greater(sK3,sK4) ),
inference(resolve,[status(thm)],[c_57,c_34]) ).
cnf(c_42,negated_conjecture,
greater(sK6(sK0,sK1),sK6(sK0,sK2)),
inference(resolve,[status(thm)],[c_58,c_14]) ).
cnf(c_59,plain,
~ greater(sK6(sK0,sK1),sK6(sK0,sK2)),
inference(resolve,[status(thm)],[c_22,c_40]) ).
cnf(c_45,plain,
$false,
inference(resolve,[status(thm)],[c_42,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT012+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/0.34 % Computer : n003.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 26 00:05:23 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 1466968 was started by sandbox on n003,
% 0.08/0.35 % Sat Sep 26 00:05:23 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 33.
% 0.12/0.37 % Level of proof is 7.
% 0.12/0.37 % Maximum clause weight is 36.000.
% 0.12/0.37 % Given clauses 29.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------