TSTP Solution File: TOP024+2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : TOP024+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 09:16:49 EDT 2024

% Result   : Theorem 12.82s 2.39s
% Output   : CNFRefutation 12.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   54 (  21 unt;   0 def)
%            Number of atoms       :  203 (  30 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  243 (  94   ~;  78   |;  40   &)
%                                         (   8 <=>;  23  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   72 (   1 sgn  51   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d5_tsp_2,axiom,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
          <=> ( v1_tsp_1(X2,X1)
              & k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tsp_2) ).

fof(t2_tsp_2,conjecture,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
           => v1_tops_1(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tsp_2) ).

fof(t64_tex_4,axiom,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+405.ax',t64_tex_4) ).

fof(d2_tops_3,axiom,
    ! [X1] :
      ( l1_pre_topc(X1)
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tops_1(X2,X1)
          <=> k6_pre_topc(X1,X2) = u1_struct_0(X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+370.ax',d2_tops_3) ).

fof(t5_tex_2,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(X1))
     => ( v1_tex_2(X2,k1_zfmisc_1(X1))
      <=> X2 != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+387.ax',t5_tex_2) ).

fof(d2_tex_2,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X2,X1)
     => ( v1_tex_2(X2,X1)
      <=> X2 != k3_tarski(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+387.ax',d2_tex_2) ).

fof(dt_k6_pre_topc,axiom,
    ! [X1,X2] :
      ( ( l1_pre_topc(X1)
        & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
     => m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_k6_pre_topc) ).

fof(t3_subset,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X1,k1_zfmisc_1(X2))
    <=> r1_tarski(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t3_subset) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : r1_tarski(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+1.ax',reflexivity_r1_tarski) ).

fof(fc3_tex_4,axiom,
    ! [X1,X2] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1)
        & ~ v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
        & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
     => ( ~ v1_xboole_0(k6_pre_topc(X1,X2))
        & v4_pre_topc(k6_pre_topc(X1,X2),X1)
        & ~ v1_tex_2(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+405.ax',fc3_tex_4) ).

fof(t99_zfmisc_1,axiom,
    ! [X1] : k3_tarski(k1_zfmisc_1(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t99_zfmisc_1) ).

fof(c_0_11,plain,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => ( v1_tsp_2(X2,X1)
          <=> ( v1_tsp_1(X2,X1)
              & k3_tex_4(X1,X2) = u1_struct_0(X1) ) ) ) ),
    inference(fof_simplification,[status(thm)],[d5_tsp_2]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X1] :
        ( ( ~ v3_struct_0(X1)
          & v2_pre_topc(X1)
          & l1_pre_topc(X1) )
       => ! [X2] :
            ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
           => ( v1_tsp_2(X2,X1)
             => v1_tops_1(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_tsp_2])]) ).

fof(c_0_13,plain,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
         => k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[t64_tex_4]) ).

fof(c_0_14,plain,
    ! [X133,X134] :
      ( ( v1_tsp_1(X134,X133)
        | ~ v1_tsp_2(X134,X133)
        | ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
        | v3_struct_0(X133)
        | ~ v2_pre_topc(X133)
        | ~ l1_pre_topc(X133) )
      & ( k3_tex_4(X133,X134) = u1_struct_0(X133)
        | ~ v1_tsp_2(X134,X133)
        | ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
        | v3_struct_0(X133)
        | ~ v2_pre_topc(X133)
        | ~ l1_pre_topc(X133) )
      & ( ~ v1_tsp_1(X134,X133)
        | k3_tex_4(X133,X134) != u1_struct_0(X133)
        | v1_tsp_2(X134,X133)
        | ~ m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
        | v3_struct_0(X133)
        | ~ v2_pre_topc(X133)
        | ~ l1_pre_topc(X133) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).

fof(c_0_15,negated_conjecture,
    ( ~ v3_struct_0(esk1_0)
    & v2_pre_topc(esk1_0)
    & l1_pre_topc(esk1_0)
    & m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
    & v1_tsp_2(esk2_0,esk1_0)
    & ~ v1_tops_1(esk2_0,esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

fof(c_0_16,plain,
    ! [X1445,X1446] :
      ( v3_struct_0(X1445)
      | ~ v2_pre_topc(X1445)
      | ~ l1_pre_topc(X1445)
      | ~ m1_subset_1(X1446,k1_zfmisc_1(u1_struct_0(X1445)))
      | k6_pre_topc(X1445,k3_tex_4(X1445,X1446)) = k6_pre_topc(X1445,X1446) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).

cnf(c_0_17,plain,
    ( k3_tex_4(X1,X2) = u1_struct_0(X1)
    | v3_struct_0(X1)
    | ~ v1_tsp_2(X2,X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v2_pre_topc(X1)
    | ~ l1_pre_topc(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    v1_tsp_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    v2_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    l1_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_23,plain,
    ! [X34,X35] :
      ( ( ~ v1_tops_1(X35,X34)
        | k6_pre_topc(X34,X35) = u1_struct_0(X34)
        | ~ m1_subset_1(X35,k1_zfmisc_1(u1_struct_0(X34)))
        | ~ l1_pre_topc(X34) )
      & ( k6_pre_topc(X34,X35) != u1_struct_0(X34)
        | v1_tops_1(X35,X34)
        | ~ m1_subset_1(X35,k1_zfmisc_1(u1_struct_0(X34)))
        | ~ l1_pre_topc(X34) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tops_3])])])])]) ).

fof(c_0_24,plain,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(X1))
     => ( v1_tex_2(X2,k1_zfmisc_1(X1))
      <=> X2 != X1 ) ),
    inference(fof_simplification,[status(thm)],[t5_tex_2]) ).

fof(c_0_25,plain,
    ! [X1,X2] :
      ( m1_subset_1(X2,X1)
     => ( v1_tex_2(X2,X1)
      <=> X2 != k3_tarski(X1) ) ),
    inference(fof_simplification,[status(thm)],[d2_tex_2]) ).

fof(c_0_26,plain,
    ! [X402,X403] :
      ( ~ l1_pre_topc(X402)
      | ~ m1_subset_1(X403,k1_zfmisc_1(u1_struct_0(X402)))
      | m1_subset_1(k6_pre_topc(X402,X403),k1_zfmisc_1(u1_struct_0(X402))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])])]) ).

cnf(c_0_27,plain,
    ( v3_struct_0(X1)
    | k6_pre_topc(X1,k3_tex_4(X1,X2)) = k6_pre_topc(X1,X2)
    | ~ v2_pre_topc(X1)
    | ~ l1_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    k3_tex_4(esk1_0,esk2_0) = u1_struct_0(esk1_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).

cnf(c_0_29,negated_conjecture,
    ~ v1_tops_1(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_30,plain,
    ( v1_tops_1(X2,X1)
    | k6_pre_topc(X1,X2) != u1_struct_0(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_31,plain,
    ! [X1294,X1295] :
      ( ( ~ v1_tex_2(X1295,k1_zfmisc_1(X1294))
        | X1295 != X1294
        | ~ m1_subset_1(X1295,k1_zfmisc_1(X1294)) )
      & ( X1295 = X1294
        | v1_tex_2(X1295,k1_zfmisc_1(X1294))
        | ~ m1_subset_1(X1295,k1_zfmisc_1(X1294)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).

fof(c_0_32,plain,
    ! [X474,X475] :
      ( ( ~ m1_subset_1(X474,k1_zfmisc_1(X475))
        | r1_tarski(X474,X475) )
      & ( ~ r1_tarski(X474,X475)
        | m1_subset_1(X474,k1_zfmisc_1(X475)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).

fof(c_0_33,plain,
    ! [X451] : r1_tarski(X451,X451),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).

fof(c_0_34,plain,
    ! [X1,X2] :
      ( ( ~ v3_struct_0(X1)
        & v2_pre_topc(X1)
        & l1_pre_topc(X1)
        & ~ v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
        & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
     => ( ~ v1_xboole_0(k6_pre_topc(X1,X2))
        & v4_pre_topc(k6_pre_topc(X1,X2),X1)
        & ~ v1_tex_2(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ) ),
    inference(fof_simplification,[status(thm)],[fc3_tex_4]) ).

fof(c_0_35,plain,
    ! [X1292,X1293] :
      ( ( ~ v1_tex_2(X1293,X1292)
        | X1293 != k3_tarski(X1292)
        | ~ m1_subset_1(X1293,X1292) )
      & ( X1293 = k3_tarski(X1292)
        | v1_tex_2(X1293,X1292)
        | ~ m1_subset_1(X1293,X1292) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).

cnf(c_0_36,plain,
    ( m1_subset_1(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
    | ~ l1_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_37,negated_conjecture,
    k6_pre_topc(esk1_0,esk2_0) = k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).

fof(c_0_38,plain,
    ! [X1900] : k3_tarski(k1_zfmisc_1(X1900)) = X1900,
    inference(variable_rename,[status(thm)],[t99_zfmisc_1]) ).

cnf(c_0_39,negated_conjecture,
    k6_pre_topc(esk1_0,esk2_0) != u1_struct_0(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_20]),c_0_21])]) ).

cnf(c_0_40,plain,
    ( ~ v1_tex_2(X1,k1_zfmisc_1(X2))
    | X1 != X2
    | ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_41,plain,
    ( m1_subset_1(X1,k1_zfmisc_1(X2))
    | ~ r1_tarski(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_42,plain,
    r1_tarski(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

fof(c_0_43,plain,
    ! [X1310,X1311] :
      ( ( ~ v1_xboole_0(k6_pre_topc(X1310,X1311))
        | v3_struct_0(X1310)
        | ~ v2_pre_topc(X1310)
        | ~ l1_pre_topc(X1310)
        | v1_tex_2(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
        | ~ m1_subset_1(X1311,k1_zfmisc_1(u1_struct_0(X1310))) )
      & ( v4_pre_topc(k6_pre_topc(X1310,X1311),X1310)
        | v3_struct_0(X1310)
        | ~ v2_pre_topc(X1310)
        | ~ l1_pre_topc(X1310)
        | v1_tex_2(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
        | ~ m1_subset_1(X1311,k1_zfmisc_1(u1_struct_0(X1310))) )
      & ( ~ v1_tex_2(k6_pre_topc(X1310,X1311),k1_zfmisc_1(u1_struct_0(X1310)))
        | v3_struct_0(X1310)
        | ~ v2_pre_topc(X1310)
        | ~ l1_pre_topc(X1310)
        | v1_tex_2(X1311,k1_zfmisc_1(u1_struct_0(X1310)))
        | ~ m1_subset_1(X1311,k1_zfmisc_1(u1_struct_0(X1310))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).

cnf(c_0_44,plain,
    ( X1 = k3_tarski(X2)
    | v1_tex_2(X1,X2)
    | ~ m1_subset_1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_45,negated_conjecture,
    m1_subset_1(k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_20]),c_0_21])]) ).

cnf(c_0_46,plain,
    k3_tarski(k1_zfmisc_1(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_47,negated_conjecture,
    k6_pre_topc(esk1_0,u1_struct_0(esk1_0)) != u1_struct_0(esk1_0),
    inference(rw,[status(thm)],[c_0_39,c_0_37]) ).

cnf(c_0_48,plain,
    ( ~ v1_tex_2(X1,k1_zfmisc_1(X1))
    | ~ m1_subset_1(X1,k1_zfmisc_1(X1)) ),
    inference(er,[status(thm)],[c_0_40]) ).

cnf(c_0_49,plain,
    m1_subset_1(X1,k1_zfmisc_1(X1)),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_50,plain,
    ( v3_struct_0(X1)
    | v1_tex_2(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v1_tex_2(k6_pre_topc(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v2_pre_topc(X1)
    | ~ l1_pre_topc(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_51,negated_conjecture,
    v1_tex_2(k6_pre_topc(esk1_0,u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk1_0))),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]) ).

cnf(c_0_52,plain,
    ~ v1_tex_2(X1,k1_zfmisc_1(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_19]),c_0_20]),c_0_49])]),c_0_52]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : TOP024+2 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n008.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat May 18 11:08:38 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.21/0.47  Running first-order model finding
% 0.21/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.82/2.39  # Version: 3.1.0
% 12.82/2.39  # Preprocessing class: FMLMSMSLSSSNFFN.
% 12.82/2.39  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.82/2.39  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 12.82/2.39  # Starting new_bool_3 with 600s (2) cores
% 12.82/2.39  # Starting new_bool_1 with 600s (2) cores
% 12.82/2.39  # Starting sh5l with 300s (1) cores
% 12.82/2.39  # new_bool_1 with pid 20993 completed with status 0
% 12.82/2.39  # Result found by new_bool_1
% 12.82/2.39  # Preprocessing class: FMLMSMSLSSSNFFN.
% 12.82/2.39  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.82/2.39  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 12.82/2.39  # Starting new_bool_3 with 600s (2) cores
% 12.82/2.39  # Starting new_bool_1 with 600s (2) cores
% 12.82/2.39  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.82/2.39  # Search class: FGHSM-SMLM31-MFFFFFNN
% 12.82/2.39  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 12.82/2.39  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 12.82/2.39  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 61s (1) cores
% 12.82/2.39  # C07_19_nc_SAT001_MinMin_p005000_rr with pid 20997 completed with status 0
% 12.82/2.39  # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 12.82/2.39  # Preprocessing class: FMLMSMSLSSSNFFN.
% 12.82/2.39  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.82/2.39  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 12.82/2.39  # Starting new_bool_3 with 600s (2) cores
% 12.82/2.39  # Starting new_bool_1 with 600s (2) cores
% 12.82/2.39  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.82/2.39  # Search class: FGHSM-SMLM31-MFFFFFNN
% 12.82/2.39  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 12.82/2.39  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 361s (1) cores
% 12.82/2.39  # Preprocessing time       : 0.046 s
% 12.82/2.39  # Presaturation interreduction done
% 12.82/2.39  
% 12.82/2.39  # Proof found!
% 12.82/2.39  # SZS status Theorem
% 12.82/2.39  # SZS output start CNFRefutation
% See solution above
% 12.82/2.39  # Parsed axioms                        : 3583
% 12.82/2.39  # Removed by relevancy pruning/SinE    : 2545
% 12.82/2.39  # Initial clauses                      : 2493
% 12.82/2.39  # Removed in clause preprocessing      : 100
% 12.82/2.39  # Initial clauses in saturation        : 2393
% 12.82/2.39  # Processed clauses                    : 15352
% 12.82/2.39  # ...of these trivial                  : 50
% 12.82/2.39  # ...subsumed                          : 9551
% 12.82/2.39  # ...remaining for further processing  : 5751
% 12.82/2.39  # Other redundant clauses eliminated   : 281
% 12.82/2.39  # Clauses deleted for lack of memory   : 0
% 12.82/2.39  # Backward-subsumed                    : 183
% 12.82/2.39  # Backward-rewritten                   : 66
% 12.82/2.39  # Generated clauses                    : 43228
% 12.82/2.39  # ...of the previous two non-redundant : 38778
% 12.82/2.39  # ...aggressively subsumed             : 0
% 12.82/2.39  # Contextual simplify-reflections      : 377
% 12.82/2.39  # Paramodulations                      : 42937
% 12.82/2.39  # Factorizations                       : 3
% 12.82/2.39  # NegExts                              : 0
% 12.82/2.39  # Equation resolutions                 : 291
% 12.82/2.39  # Disequality decompositions           : 0
% 12.82/2.39  # Total rewrite steps                  : 7235
% 12.82/2.39  # ...of those cached                   : 6267
% 12.82/2.39  # Propositional unsat checks           : 1
% 12.82/2.39  #    Propositional check models        : 1
% 12.82/2.39  #    Propositional check unsatisfiable : 0
% 12.82/2.39  #    Propositional clauses             : 0
% 12.82/2.39  #    Propositional clauses after purity: 0
% 12.82/2.39  #    Propositional unsat core size     : 0
% 12.82/2.39  #    Propositional preprocessing time  : 0.000
% 12.82/2.39  #    Propositional encoding time       : 0.026
% 12.82/2.39  #    Propositional solver time         : 0.018
% 12.82/2.39  #    Success case prop preproc time    : 0.000
% 12.82/2.39  #    Success case prop encoding time   : 0.000
% 12.82/2.39  #    Success case prop solver time     : 0.000
% 12.82/2.39  # Current number of processed clauses  : 3170
% 12.82/2.39  #    Positive orientable unit clauses  : 238
% 12.82/2.39  #    Positive unorientable unit clauses: 2
% 12.82/2.39  #    Negative unit clauses             : 461
% 12.82/2.39  #    Non-unit-clauses                  : 2469
% 12.82/2.39  # Current number of unprocessed clauses: 27480
% 12.82/2.39  # ...number of literals in the above   : 105274
% 12.82/2.39  # Current number of archived formulas  : 0
% 12.82/2.39  # Current number of archived clauses   : 2410
% 12.82/2.39  # Clause-clause subsumption calls (NU) : 4257051
% 12.82/2.39  # Rec. Clause-clause subsumption calls : 710334
% 12.82/2.39  # Non-unit clause-clause subsumptions  : 4872
% 12.82/2.39  # Unit Clause-clause subsumption calls : 33156
% 12.82/2.39  # Rewrite failures with RHS unbound    : 0
% 12.82/2.39  # BW rewrite match attempts            : 288
% 12.82/2.39  # BW rewrite match successes           : 186
% 12.82/2.39  # Condensation attempts                : 0
% 12.82/2.39  # Condensation successes               : 0
% 12.82/2.39  # Termbank termtop insertions          : 881536
% 12.82/2.39  # Search garbage collected termcells   : 67655
% 12.82/2.39  
% 12.82/2.39  # -------------------------------------------------
% 12.82/2.39  # User time                : 1.676 s
% 12.82/2.39  # System time              : 0.054 s
% 12.82/2.39  # Total time               : 1.730 s
% 12.82/2.39  # Maximum resident set size: 13120 pages
% 12.82/2.39  
% 12.82/2.39  # -------------------------------------------------
% 12.82/2.39  # User time                : 3.303 s
% 12.82/2.39  # System time              : 0.106 s
% 12.82/2.39  # Total time               : 3.409 s
% 12.82/2.39  # Maximum resident set size: 6172 pages
% 12.82/2.39  % E---3.1 exiting
%------------------------------------------------------------------------------