↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MGT003+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 : 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 : Fri Sep 25 02:11:13 PM UTC 2026

% Result   : Theorem 9.36s 6.73s
% Output   : Proof 9.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   31
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   85 (  64 unt;   0 def)
%            Number of atoms       :  181 (  56 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  154 (  58   ~;  52   |;  38   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   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,I1,I2,P1,P2] :
      ( ( greater(I2,I1)
        & survival_chance(Y,P2,T2)
        & survival_chance(X,P1,T1)
        & inertia(Y,I2,T2)
        & inertia(X,I1,T1)
        & reorganization_free(Y,T2,T2)
        & reorganization_free(X,T1,T1)
        & organization(Y,T2)
        & organization(X,T1) )
     => greater(P2,P1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).

fof(f2_nnf,plain,
    ! [X,Y,T1,T2,I1,I2,P1,P2] :
      ( greater(P2,P1)
      | ~ greater(I2,I1)
      | ~ survival_chance(Y,P2,T2)
      | ~ survival_chance(X,P1,T1)
      | ~ inertia(Y,I2,T2)
      | ~ inertia(X,I1,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,I1,I2,P1,P2] :
      ( greater(P2,P1)
      | ~ greater(I2,I1)
      | ~ survival_chance(Y,P2,T2)
      | ~ survival_chance(X,P1,T1)
      | ~ inertia(Y,I2,T2)
      | ~ inertia(X,I1,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)
    | ~ survival_chance(X1,X7,X3)
    | ~ survival_chance(X0,X6,X2)
    | ~ inertia(X1,X5,X3)
    | ~ inertia(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(inertia(X1,X5,X2),true,ifeq(inertia(X3,X6,X4),true,ifeq(survival_chance(X1,X7,X2),true,ifeq(survival_chance(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(t20,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(inertia(X1,X5,X2),true,ifeq(inertia(X3,X6,X4),true,ifeq(survival_chance(X1,X7,X2),true,ifeq(survival_chance(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(f0,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(f0_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)],[f0]) ).

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

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

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

fof(f4,conjecture,
    ! [X,P1,P2,T1,T2] :
      ( ( greater(T2,T1)
        & survival_chance(X,P2,T2)
        & survival_chance(X,P1,T1)
        & reorganization_free(X,T1,T2)
        & organization(X,T2)
        & organization(X,T1) )
     => greater(P2,P1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL) ).

fof(f4_neg,negated_conjecture,
    ~ ! [X,P1,P2,T1,T2] :
        ( ( greater(T2,T1)
          & survival_chance(X,P2,T2)
          & survival_chance(X,P1,T1)
          & reorganization_free(X,T1,T2)
          & organization(X,T2)
          & organization(X,T1) )
       => greater(P2,P1) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f4_nnf,plain,
    ? [X,P1,P2,T1,T2] :
      ( ~ greater(P2,P1)
      & greater(T2,T1)
      & survival_chance(X,P2,T2)
      & survival_chance(X,P1,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)
    & survival_chance(sk1,sk3,sk5)
    & survival_chance(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(c7,plain,
    reorganization_free(sk1,sk4,sk5),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

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

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

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

cnf(t28,plain,
    true = ifeq(organization(X1,X2),true,ifeq(organization(sk1,sk5),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(true,true,ifeq(inertia(X1,X3,X2),true,ifeq(inertia(sk1,X4,sk5),true,ifeq(survival_chance(X1,X5,X2),true,ifeq(survival_chance(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)],[t20,t23]) ).

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

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

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

cnf(t482,plain,
    true = ifeq(organization(X1,X2),true,ifeq(true,true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(true,true,ifeq(inertia(X1,X3,X2),true,ifeq(inertia(sk1,X4,sk5),true,ifeq(survival_chance(X1,X5,X2),true,ifeq(survival_chance(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)],[t28,t38]) ).

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

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

cnf(t483,plain,
    true = ifeq(organization(X1,X2),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(true,true,ifeq(inertia(X1,X3,X2),true,ifeq(inertia(sk1,X4,sk5),true,ifeq(survival_chance(X1,X5,X2),true,ifeq(survival_chance(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t482,t17]) ).

cnf(t484,plain,
    true = ifeq(organization(X1,X2),true,ifeq(reorganization_free(X1,X2,X2),true,ifeq(inertia(X1,X3,X2),true,ifeq(inertia(sk1,X4,sk5),true,ifeq(survival_chance(X1,X5,X2),true,ifeq(survival_chance(sk1,X6,sk5),true,ifeq(greater(X4,X3),true,greater(X6,X5),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t483,t17]) ).

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

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

cnf(t6,plain,
    survival_chance(sk1,sk2,sk4) = true,
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t73,plain,
    survival_chance(sk1,sk2,sk4) = true,
    inference(orient,[status(thm)],[t6]) ).

cnf(t281,plain,
    true = ifeq(organization(sk1,sk4),true,ifeq(reorganization_free(sk1,sk4,sk4),true,ifeq(inertia(sk1,X1,sk4),true,ifeq(inertia(sk1,X2,sk5),true,ifeq(true,true,ifeq(survival_chance(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),true),
    inference(cp,[status(thm)],[t275,t73]) ).

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

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

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

cnf(t485,plain,
    true = ifeq(true,true,ifeq(reorganization_free(sk1,sk4,sk4),true,ifeq(inertia(sk1,X1,sk4),true,ifeq(inertia(sk1,X2,sk5),true,ifeq(true,true,ifeq(survival_chance(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),true),
    inference(step,[status(thm)],[t281,t44]) ).

cnf(t486,plain,
    true = ifeq(reorganization_free(sk1,sk4,sk4),true,ifeq(inertia(sk1,X1,sk4),true,ifeq(inertia(sk1,X2,sk5),true,ifeq(true,true,ifeq(survival_chance(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),
    inference(step,[status(thm)],[t485,t17]) ).

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

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

cnf(t3,plain,
    reorganization_free(sk1,sk4,sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi7]) ).

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

cnf(t487,plain,
    true = ifeq(true,true,ifeq(inertia(sk1,X1,sk4),true,ifeq(inertia(sk1,X2,sk5),true,ifeq(true,true,ifeq(survival_chance(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),true),
    inference(step,[status(thm)],[t486,t32]) ).

cnf(t488,plain,
    true = ifeq(inertia(sk1,X1,sk4),true,ifeq(inertia(sk1,X2,sk5),true,ifeq(true,true,ifeq(survival_chance(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),true),
    inference(step,[status(thm)],[t487,t17]) ).

cnf(t489,plain,
    true = ifeq(inertia(sk1,X1,sk4),true,ifeq(inertia(sk1,X2,sk5),true,ifeq(survival_chance(sk1,X3,sk5),true,ifeq(greater(X2,X1),true,greater(X3,sk2),true),true),true),true),
    inference(step,[status(thm)],[t488,t17]) ).

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

fof(f1,axiom,
    ! [X,T] :
      ( organization(X,T)
     => ? [I] : inertia(X,I,T) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).

fof(f1_nnf,plain,
    ! [X,T] :
      ( ? [I] : inertia(X,I,T)
      | ~ organization(X,T) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,T] :
      ( inertia(X,sk0(X,T),T)
      | ~ organization(X,T) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).

cnf(c2,plain,
    ( inertia(X0,sk0(X0,X1),X1)
    | ~ organization(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi2,axiom,
    ifeq(organization(X0,X1),true,inertia(X0,sk0(X0,X1),X1),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

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

cnf(h1,plain,
    inertia(sk1,sk0(sk1,sk5),sk5) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi6]) ).

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

cnf(h0,plain,
    inertia(sk1,sk0(sk1,sk4),sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi5]) ).

fof(f3,hypothesis,
    ! [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(f3_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)],[f3]) ).

fof(f3_sk,plain,
    ! [X,T1,T2,I1,I2] :
      ( 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(skolemisation,[status(esa)],[f3_nnf]) ).

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

cnf(hi4,axiom,
    ifeq(organization(X0,X1),true,ifeq(organization(X0,X2),true,ifeq(reorganization_free(X0,X1,X2),true,ifeq(inertia(X0,X3,X1),true,ifeq(inertia(X0,X4,X2),true,ifeq(greater(X2,X1),true,greater(X4,X3),true),true),true),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

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

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

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

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

cnf(t300,plain,
    true = ifeq(inertia(sk1,sk0(sk1,sk4),sk4),true,ifeq(inertia(sk1,sk0(sk1,sk5),sk5),true,ifeq(survival_chance(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),true),
    inference(cp,[status(thm)],[t294,t65]) ).

cnf(t9,plain,
    inertia(sk1,sk0(sk1,sk4),sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi5]) ).

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

cnf(t490,plain,
    true = ifeq(true,true,ifeq(inertia(sk1,sk0(sk1,sk5),sk5),true,ifeq(survival_chance(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),true),
    inference(step,[status(thm)],[t300,t55]) ).

cnf(t491,plain,
    true = ifeq(inertia(sk1,sk0(sk1,sk5),sk5),true,ifeq(survival_chance(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),
    inference(step,[status(thm)],[t490,t17]) ).

cnf(t10,plain,
    inertia(sk1,sk0(sk1,sk5),sk5) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi6]) ).

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

cnf(t492,plain,
    true = ifeq(true,true,ifeq(survival_chance(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),true),
    inference(step,[status(thm)],[t491,t50]) ).

cnf(t493,plain,
    true = ifeq(survival_chance(sk1,X1,sk5),true,ifeq(true,true,greater(X1,sk2),true),true),
    inference(step,[status(thm)],[t492,t17]) ).

cnf(t494,plain,
    true = ifeq(survival_chance(sk1,X1,sk5),true,greater(X1,sk2),true),
    inference(step,[status(thm)],[t493,t17]) ).

cnf(t301,plain,
    ifeq(survival_chance(sk1,X1,sk5),true,greater(X1,sk2),true) = true,
    inference(orient,[status(thm)],[t494]) ).

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

cnf(t7,plain,
    survival_chance(sk1,sk3,sk5) = true,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(t70,plain,
    survival_chance(sk1,sk3,sk5) = true,
    inference(orient,[status(thm)],[t7]) ).

cnf(t302,plain,
    true = ifeq(true,true,greater(sk3,sk2),true),
    inference(cp,[status(thm)],[t301,t70]) ).

cnf(t495,plain,
    true = greater(sk3,sk2),
    inference(step,[status(thm)],[t302,t17]) ).

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

cnf(c11,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)],[c11]) ).

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

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

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