TSTP Solution File: SEU411+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU411+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n004.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  : 600s
% DateTime : Tue Jul 19 08:42:03 EDT 2022

% Result   : Theorem 117.97s 18.66s
% Output   : CNFRefutation 117.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  22 unt;   0 def)
%            Number of atoms       :  135 (  15 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  145 (  43   ~;  33   |;  59   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :   45 (   3 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t20_latsum_1,conjecture,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v2_orders_2(X1)
        & v3_orders_2(X1)
        & v4_orders_2(X1)
        & v1_yellow_0(X1)
        & v1_lattice3(X1)
        & l1_orders_2(X1) )
     => ! [X2] :
          ( ( ~ v3_struct_0(X2)
            & v2_orders_2(X2)
            & v3_orders_2(X2)
            & v4_orders_2(X2)
            & v1_yellow_0(X2)
            & v1_lattice3(X2)
            & l1_orders_2(X2) )
         => ( ( ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)))
              & v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
              & v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
              & m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2))) )
           => r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_latsum_1) ).

fof(t12_setfam_1,axiom,
    ! [X1,X2] : k1_setfam_1(k2_tarski(X1,X2)) = k3_xboole_0(X1,X2),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+8.ax',t12_setfam_1) ).

fof(d3_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = k3_xboole_0(X1,X2)
    <=> ! [X4] :
          ( r2_hidden(X4,X3)
        <=> ( r2_hidden(X4,X1)
            & r2_hidden(X4,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d3_xboole_0) ).

fof(commutativity_k2_tarski,axiom,
    ! [X1,X2] : k2_tarski(X1,X2) = k2_tarski(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+1.ax',commutativity_k2_tarski) ).

fof(t10_waybel12,axiom,
    ! [X1] :
      ( ( ~ v3_struct_0(X1)
        & v4_orders_2(X1)
        & v1_yellow_0(X1)
        & l1_orders_2(X1) )
     => ! [X2] :
          ( ( ~ v1_xboole_0(X2)
            & v12_waybel_0(X2,X1)
            & m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
         => r2_hidden(k3_yellow_0(X1),X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+506.ax',t10_waybel12) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( ~ v3_struct_0(X1)
          & v2_orders_2(X1)
          & v3_orders_2(X1)
          & v4_orders_2(X1)
          & v1_yellow_0(X1)
          & v1_lattice3(X1)
          & l1_orders_2(X1) )
       => ! [X2] :
            ( ( ~ v3_struct_0(X2)
              & v2_orders_2(X2)
              & v3_orders_2(X2)
              & v4_orders_2(X2)
              & v1_yellow_0(X2)
              & v1_lattice3(X2)
              & l1_orders_2(X2) )
           => ( ( ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)))
                & v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
                & v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
                & m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2))) )
             => r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
    inference(assume_negation,[status(cth)],[t20_latsum_1]) ).

fof(c_0_6,negated_conjecture,
    ( ~ v3_struct_0(esk1_0)
    & v2_orders_2(esk1_0)
    & v3_orders_2(esk1_0)
    & v4_orders_2(esk1_0)
    & v1_yellow_0(esk1_0)
    & v1_lattice3(esk1_0)
    & l1_orders_2(esk1_0)
    & ~ v3_struct_0(esk2_0)
    & v2_orders_2(esk2_0)
    & v3_orders_2(esk2_0)
    & v4_orders_2(esk2_0)
    & v1_yellow_0(esk2_0)
    & v1_lattice3(esk2_0)
    & l1_orders_2(esk2_0)
    & ~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)))
    & v1_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
    & v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
    & m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0)))
    & ~ r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])]) ).

fof(c_0_7,plain,
    ! [X3416,X3417] : k1_setfam_1(k2_tarski(X3416,X3417)) = k3_xboole_0(X3416,X3417),
    inference(variable_rename,[status(thm)],[t12_setfam_1]) ).

fof(c_0_8,plain,
    ! [X141,X142,X143,X144,X145,X146,X147,X148] :
      ( ( r2_hidden(X144,X141)
        | ~ r2_hidden(X144,X143)
        | X143 != k3_xboole_0(X141,X142) )
      & ( r2_hidden(X144,X142)
        | ~ r2_hidden(X144,X143)
        | X143 != k3_xboole_0(X141,X142) )
      & ( ~ r2_hidden(X145,X141)
        | ~ r2_hidden(X145,X142)
        | r2_hidden(X145,X143)
        | X143 != k3_xboole_0(X141,X142) )
      & ( ~ r2_hidden(esk15_3(X146,X147,X148),X148)
        | ~ r2_hidden(esk15_3(X146,X147,X148),X146)
        | ~ r2_hidden(esk15_3(X146,X147,X148),X147)
        | X148 = k3_xboole_0(X146,X147) )
      & ( r2_hidden(esk15_3(X146,X147,X148),X146)
        | r2_hidden(esk15_3(X146,X147,X148),X148)
        | X148 = k3_xboole_0(X146,X147) )
      & ( r2_hidden(esk15_3(X146,X147,X148),X147)
        | r2_hidden(esk15_3(X146,X147,X148),X148)
        | X148 = k3_xboole_0(X146,X147) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])]) ).

cnf(c_0_9,negated_conjecture,
    m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    k1_setfam_1(k2_tarski(X1,X2)) = k3_xboole_0(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X2265,X2266] : k2_tarski(X2265,X2266) = k2_tarski(X2266,X2265),
    inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).

cnf(c_0_12,negated_conjecture,
    v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    ~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_14,plain,
    ( r2_hidden(X1,X2)
    | ~ r2_hidden(X1,X3)
    | X3 != k3_xboole_0(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_15,plain,
    ! [X127,X128] :
      ( v3_struct_0(X127)
      | ~ v4_orders_2(X127)
      | ~ v1_yellow_0(X127)
      | ~ l1_orders_2(X127)
      | v1_xboole_0(X128)
      | ~ v12_waybel_0(X128,X127)
      | ~ m1_subset_1(X128,k1_zfmisc_1(u1_struct_0(X127)))
      | r2_hidden(k3_yellow_0(X127),X128) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t10_waybel12])])])]) ).

cnf(c_0_16,negated_conjecture,
    m1_subset_1(k1_setfam_1(k2_tarski(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),k1_zfmisc_1(u1_struct_0(esk2_0))),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_17,plain,
    k2_tarski(X1,X2) = k2_tarski(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    v12_waybel_0(k1_setfam_1(k2_tarski(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),esk2_0),
    inference(rw,[status(thm)],[c_0_12,c_0_10]) ).

cnf(c_0_19,negated_conjecture,
    ~ v1_xboole_0(k1_setfam_1(k2_tarski(u1_struct_0(esk1_0),u1_struct_0(esk2_0)))),
    inference(rw,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_20,plain,
    ( r2_hidden(X1,X2)
    | X3 != k1_setfam_1(k2_tarski(X4,X2))
    | ~ r2_hidden(X1,X3) ),
    inference(rw,[status(thm)],[c_0_14,c_0_10]) ).

cnf(c_0_21,plain,
    ( v3_struct_0(X1)
    | v1_xboole_0(X2)
    | r2_hidden(k3_yellow_0(X1),X2)
    | ~ v4_orders_2(X1)
    | ~ v1_yellow_0(X1)
    | ~ l1_orders_2(X1)
    | ~ v12_waybel_0(X2,X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    m1_subset_1(k1_setfam_1(k2_tarski(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),k1_zfmisc_1(u1_struct_0(esk2_0))),
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    v12_waybel_0(k1_setfam_1(k2_tarski(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),esk2_0),
    inference(rw,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    v1_yellow_0(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_25,negated_conjecture,
    v4_orders_2(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_26,negated_conjecture,
    l1_orders_2(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_27,negated_conjecture,
    ~ v3_struct_0(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_28,negated_conjecture,
    ~ v1_xboole_0(k1_setfam_1(k2_tarski(u1_struct_0(esk2_0),u1_struct_0(esk1_0)))),
    inference(rw,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_29,plain,
    ( r2_hidden(X1,X2)
    | ~ r2_hidden(X1,k1_setfam_1(k2_tarski(X3,X2))) ),
    inference(er,[status(thm)],[c_0_20]) ).

cnf(c_0_30,negated_conjecture,
    r2_hidden(k3_yellow_0(esk2_0),k1_setfam_1(k2_tarski(u1_struct_0(esk2_0),u1_struct_0(esk1_0)))),
    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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]),c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ~ r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SEU411+3 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n004.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jun 18 23:31:58 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.92/1.11  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.92/1.11  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.92/1.11  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.92/1.11  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 117.97/18.66  # ENIGMATIC: Solved by autoschedule:
% 117.97/18.66  # SinE strategy is gf200_h_gu_R03_F100_L20000
% 117.97/18.66  # Trying AutoSched0 for 149 seconds
% 117.97/18.66  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 117.97/18.66  # and selection function SelectComplexExceptUniqMaxHorn.
% 117.97/18.66  #
% 117.97/18.66  # Preprocessing time       : 0.854 s
% 117.97/18.66  # Presaturation interreduction done
% 117.97/18.66  
% 117.97/18.66  # Proof found!
% 117.97/18.66  # SZS status Theorem
% 117.97/18.66  # SZS output start CNFRefutation
% See solution above
% 117.97/18.66  # Training examples: 0 positive, 0 negative
% 117.97/18.66  
% 117.97/18.66  # -------------------------------------------------
% 117.97/18.66  # User time                : 13.036 s
% 117.97/18.66  # System time              : 0.239 s
% 117.97/18.66  # Total time               : 13.275 s
% 117.97/18.66  # Maximum resident set size: 44332 pages
% 117.97/18.66  
%------------------------------------------------------------------------------