↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n009.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 : Fri Sep 25 02:11:11 PM UTC 2026

% Result   : Theorem 15.25s 2.47s
% Output   : Proof 15.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   85 (  64 unt;   0 def)
%            Number of atoms       :  185 (  56 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  160 (  60   ~;  54   |;  39   &)
%                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   3 avg)
%            Maximal term depth    :   10 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-4 aty)
%            Number of variables   :  185 (   6 sgn  64   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,hypothesis,
    ! [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('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3_FOL) ).

fof(f2_nnf,plain,
    ! [X,Y,T1,T2,Rp1,Rp2,I1,I2] :
      ( ( ( ~ greater(I2,I1)
          | greater(Rp2,Rp1) )
        & ( greater(I2,I1)
          | ~ greater(Rp2,Rp1) ) )
      | ~ 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) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,T1,Y,T2,Rp1,Rp2,I1,I2] :
      ( ( ( ~ greater(I2,I1)
          | greater(Rp2,Rp1) )
        & ( greater(I2,I1)
          | ~ greater(Rp2,Rp1) ) )
      | ~ 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) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c3,plain,
    ( greater(X7,X6)
    | ~ greater(X5,X4)
    | ~ inertia(X1,X7,X3)
    | ~ inertia(X0,X6,X2)
    | ~ reproducibility(X1,X5,X3)
    | ~ reproducibility(X0,X4,X2)
    | ~ reorganization_free(X1,X3,X3)
    | ~ reorganization_free(X0,X2,X2)
    | ~ organization(X1,X3)
    | ~ organization(X0,X2) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(t16,plain,
    ifeq(organization(X1,X2),true,ifeq(organization(X3,X4),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(reorganization_free(X3,X4,X4),true,ifeq(reproducibility(X1,X5,X2),true,ifeq(reproducibility(X3,X6,X4),true,ifeq(inertia(X1,X7,X2),true,ifeq(inertia(X3,X8,X4),true,ifeq(greater(X6,X5),true,greater(X8,X7),true),true),true),true),true),true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t22,plain,
    ifeq(organization(X1,X2),true,ifeq(organization(X3,X4),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(reorganization_free(X3,X4,X4),true,ifeq(reproducibility(X1,X5,X2),true,ifeq(reproducibility(X3,X6,X4),true,ifeq(inertia(X1,X7,X2),true,ifeq(inertia(X3,X8,X4),true,ifeq(greater(X6,X5),true,greater(X8,X7),true),true),true),true),true),true),true),true),true) = true,
    inference(orient,[status(thm)],[t16]) ).

fof(f1,axiom,
    ! [X,T1,T2] :
      ( reorganization_free(X,T1,T2)
     => ( reorganization_free(X,T2,T2)
        & reorganization_free(X,T1,T1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4) ).

fof(f1_nnf,plain,
    ! [X,T1,T2] :
      ( ( reorganization_free(X,T2,T2)
        & reorganization_free(X,T1,T1) )
      | ~ reorganization_free(X,T1,T2) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,T1,T2] :
      ( ( reorganization_free(X,T2,T2)
        & reorganization_free(X,T1,T1) )
      | ~ reorganization_free(X,T1,T2) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c2,plain,
    ( reorganization_free(X0,X2,X2)
    | ~ reorganization_free(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi2,axiom,
    ifeq(reorganization_free(X0,X1,X2),true,reorganization_free(X0,X2,X2),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

fof(f4,conjecture,
    ! [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('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).

fof(f4_neg,negated_conjecture,
    ~ ! [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) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f4_nnf,plain,
    ? [X,I1,I2,T1,T2] :
      ( ~ greater(I2,I1)
      & greater(T2,T1)
      & inertia(X,I2,T2)
      & inertia(X,I1,T1)
      & reorganization_free(X,T1,T2)
      & organization(X,T2)
      & organization(X,T1) ),
    inference(nnf_transformation,[status(thm)],[f4_neg]) ).

fof(f4_sk,plain,
    ( ~ greater(sk3,sk2)
    & greater(sk5,sk4)
    & inertia(sk1,sk3,sk5)
    & inertia(sk1,sk2,sk4)
    & reorganization_free(sk1,sk4,sk5)
    & organization(sk1,sk5)
    & organization(sk1,sk4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2,sk3,sk4,sk5])],[f4_nnf]) ).

cnf(c8,plain,
    reorganization_free(sk1,sk4,sk5),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi8,negated_conjecture,
    reorganization_free(sk1,sk4,sk5) = true,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t7,plain,
    reorganization_free(sk1,sk5,sk5) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi8]) ).

cnf(t25,plain,
    reorganization_free(sk1,sk5,sk5) = true,
    inference(orient,[status(thm)],[t7]) ).

cnf(t32,plain,
    true = ifeq(organization(X1,X2),true,ifeq(organization(sk1,sk5),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(true,true,ifeq(reproducibility(X1,X3,X2),true,ifeq(reproducibility(sk1,X4,sk5),true,ifeq(inertia(X1,X5,X2),true,ifeq(inertia(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true),true),true),
    inference(cp,[status(thm)],[t22,t25]) ).

cnf(c7,plain,
    organization(sk1,sk5),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t2,plain,
    organization(sk1,sk5) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t44,plain,
    organization(sk1,sk5) = true,
    inference(orient,[status(thm)],[t2]) ).

cnf(t929,plain,
    true = ifeq(organization(X1,X2),true,ifeq(true,true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(true,true,ifeq(reproducibility(X1,X3,X2),true,ifeq(reproducibility(sk1,X4,sk5),true,ifeq(inertia(X1,X5,X2),true,ifeq(inertia(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t32,t44]) ).

cnf(t8,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t18,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t8]) ).

cnf(t930,plain,
    true = ifeq(organization(X1,X2),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(true,true,ifeq(reproducibility(X1,X3,X2),true,ifeq(reproducibility(sk1,X4,sk5),true,ifeq(inertia(X1,X5,X2),true,ifeq(inertia(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t929,t18]) ).

cnf(t931,plain,
    true = ifeq(organization(X1,X2),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(reproducibility(X1,X3,X2),true,ifeq(reproducibility(sk1,X4,sk5),true,ifeq(inertia(X1,X5,X2),true,ifeq(inertia(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t930,t18]) ).

cnf(t549,plain,
    ifeq(organization(X1,X2),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(reproducibility(X1,X3,X2),true,ifeq(reproducibility(sk1,X4,sk5),true,ifeq(inertia(X1,X5,X2),true,ifeq(inertia(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true) = true,
    inference(orient,[status(thm)],[t931]) ).

cnf(c9,plain,
    inertia(sk1,sk2,sk4),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t3,plain,
    inertia(sk1,sk2,sk4) = true,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(t93,plain,
    inertia(sk1,sk2,sk4) = true,
    inference(orient,[status(thm)],[t3]) ).

cnf(t558,plain,
    true = ifeq(organization(sk1,sk4),true,ifeq(reorganization_free(sk1,sk4,sk4),true,ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(true,true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),true),
    inference(cp,[status(thm)],[t549,t93]) ).

cnf(c6,plain,
    organization(sk1,sk4),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t1,plain,
    organization(sk1,sk4) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(t52,plain,
    organization(sk1,sk4) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(t944,plain,
    true = ifeq(true,true,ifeq(reorganization_free(sk1,sk4,sk4),true,ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(true,true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t558,t52]) ).

cnf(t945,plain,
    true = ifeq(reorganization_free(sk1,sk4,sk4),true,ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(true,true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),
    inference(step,[status(thm)],[t944,t18]) ).

cnf(c1,plain,
    ( reorganization_free(X0,X1,X1)
    | ~ reorganization_free(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    ifeq(reorganization_free(X0,X1,X2),true,reorganization_free(X0,X1,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t5,plain,
    reorganization_free(sk1,sk4,sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi8]) ).

cnf(t36,plain,
    reorganization_free(sk1,sk4,sk4) = true,
    inference(orient,[status(thm)],[t5]) ).

cnf(t946,plain,
    true = ifeq(true,true,ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(true,true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),
    inference(step,[status(thm)],[t945,t36]) ).

cnf(t947,plain,
    true = ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(true,true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),
    inference(step,[status(thm)],[t946,t18]) ).

cnf(t948,plain,
    true = ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),
    inference(step,[status(thm)],[t947,t18]) ).

cnf(t590,plain,
    ifeq(reproducibility(sk1,X1,sk4),true,ifeq(reproducibility(sk1,X2,sk5),true,ifeq(inertia(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true) = true,
    inference(orient,[status(thm)],[t948]) ).

fof(f0,axiom,
    ! [X,T] :
      ( organization(X,T)
     => ? [Rp] : reproducibility(X,Rp,T) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp3) ).

fof(f0_nnf,plain,
    ! [X,T] :
      ( ? [Rp] : reproducibility(X,Rp,T)
      | ~ organization(X,T) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,T] :
      ( reproducibility(X,sk0(X,T),T)
      | ~ organization(X,T) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

cnf(c0,plain,
    ( reproducibility(X0,sk0(X0,X1),X1)
    | ~ organization(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,axiom,
    ifeq(organization(X0,X1),true,reproducibility(X0,sk0(X0,X1),X1),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(hi7,negated_conjecture,
    organization(sk1,sk5) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(h1,plain,
    reproducibility(sk1,sk0(sk1,sk5),sk5) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi7]) ).

cnf(hi6,negated_conjecture,
    organization(sk1,sk4) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(h0,plain,
    reproducibility(sk1,sk0(sk1,sk4),sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi6]) ).

fof(f3,hypothesis,
    ! [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('/export/starexec/sandbox2/benchmark/theBenchmark.p',a4_FOL) ).

fof(f3_nnf,plain,
    ! [X,Rp1,Rp2,T1,T2] :
      ( greater(Rp2,Rp1)
      | ~ greater(T2,T1)
      | ~ reproducibility(X,Rp2,T2)
      | ~ reproducibility(X,Rp1,T1)
      | ~ reorganization_free(X,T1,T2)
      | ~ organization(X,T2)
      | ~ organization(X,T1) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X,T1,T2,Rp1,Rp2] :
      ( greater(Rp2,Rp1)
      | ~ greater(T2,T1)
      | ~ reproducibility(X,Rp2,T2)
      | ~ reproducibility(X,Rp1,T1)
      | ~ reorganization_free(X,T1,T2)
      | ~ organization(X,T2)
      | ~ organization(X,T1) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c5,plain,
    ( greater(X2,X1)
    | ~ greater(X4,X3)
    | ~ reproducibility(X0,X2,X4)
    | ~ reproducibility(X0,X1,X3)
    | ~ reorganization_free(X0,X3,X4)
    | ~ organization(X0,X4)
    | ~ organization(X0,X3) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi5,axiom,
    ifeq(organization(X0,X1),true,ifeq(organization(X0,X2),true,ifeq(reorganization_free(X0,X1,X2),true,ifeq(reproducibility(X0,X3,X1),true,ifeq(reproducibility(X0,X4,X2),true,ifeq(greater(X2,X1),true,greater(X4,X3),true),true),true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(c11,plain,
    greater(sk5,sk4),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi11,negated_conjecture,
    greater(sk5,sk4) = true,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(t11,plain,
    greater(sk0(sk1,sk5),sk0(sk1,sk4)) = true,
    inference(hyper_resolution,[status(thm)],[hi5,hi6,hi7,hi8,h0,h1,hi11]) ).

cnf(t81,plain,
    greater(sk0(sk1,sk5),sk0(sk1,sk4)) = true,
    inference(orient,[status(thm)],[t11]) ).

cnf(t595,plain,
    true = ifeq(reproducibility(sk1,sk0(sk1,sk4),sk4),true,ifeq(reproducibility(sk1,sk0(sk1,sk5),sk5),true,ifeq(inertia(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),true),
    inference(cp,[status(thm)],[t590,t81]) ).

cnf(t9,plain,
    reproducibility(sk1,sk0(sk1,sk4),sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi6]) ).

cnf(t67,plain,
    reproducibility(sk1,sk0(sk1,sk4),sk4) = true,
    inference(orient,[status(thm)],[t9]) ).

cnf(t949,plain,
    true = ifeq(true,true,ifeq(reproducibility(sk1,sk0(sk1,sk5),sk5),true,ifeq(inertia(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),true),
    inference(step,[status(thm)],[t595,t67]) ).

cnf(t950,plain,
    true = ifeq(reproducibility(sk1,sk0(sk1,sk5),sk5),true,ifeq(inertia(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),
    inference(step,[status(thm)],[t949,t18]) ).

cnf(t10,plain,
    reproducibility(sk1,sk0(sk1,sk5),sk5) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi7]) ).

cnf(t60,plain,
    reproducibility(sk1,sk0(sk1,sk5),sk5) = true,
    inference(orient,[status(thm)],[t10]) ).

cnf(t951,plain,
    true = ifeq(true,true,ifeq(inertia(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),
    inference(step,[status(thm)],[t950,t60]) ).

cnf(t952,plain,
    true = ifeq(inertia(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),
    inference(step,[status(thm)],[t951,t18]) ).

cnf(t953,plain,
    true = ifeq(inertia(sk1,X1,sk5),true,greater(X1,sk2),true),
    inference(step,[status(thm)],[t952,t18]) ).

cnf(t596,plain,
    ifeq(inertia(sk1,X1,sk5),true,greater(X1,sk2),true) = true,
    inference(orient,[status(thm)],[t953]) ).

cnf(c10,plain,
    inertia(sk1,sk3,sk5),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t4,plain,
    inertia(sk1,sk3,sk5) = true,
    inference(equality_encoding,[status(esa)],[c10]) ).

cnf(t88,plain,
    inertia(sk1,sk3,sk5) = true,
    inference(orient,[status(thm)],[t4]) ).

cnf(t597,plain,
    true = ifeq(true,true,greater(sk3,sk2),true),
    inference(cp,[status(thm)],[t596,t88]) ).

cnf(t954,plain,
    true = greater(sk3,sk2),
    inference(step,[status(thm)],[t597,t18]) ).

cnf(t603,plain,
    greater(sk3,sk2) = true,
    inference(orient,[status(thm)],[t954]) ).

cnf(c12,plain,
    ~ greater(sk3,sk2),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(goal_0,negated_conjecture,
    greater(sk3,sk2) != true,
    inference(equality_encoding,[status(esa)],[c12]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t603]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT002+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.48  % Computer : n009.cluster.edu
% 0.17/0.48  % Model    : x86_64 x86_64
% 0.17/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.48  % Memory   : 8046.5625MB
% 0.17/0.48  % OS       : Linux 6.8.0-71-generic
% 0.17/0.48  % CPULimit : 300
% 0.17/0.48  % WCLimit  : 300
% 0.17/0.48  % DateTime : Thu Sep 24 00:55:29 UTC 2026
% 0.17/0.48  % CPUTime  : 
% 0.17/0.48  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 15.25/2.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.25/2.47  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------