TSTP Solution File: CAT033+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CAT033+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n017.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 : Thu Jul 14 23:59:50 EDT 2022

% Result   : Theorem 0.21s 1.40s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   8 unt;   0 def)
%            Number of atoms       :   64 (   3 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   71 (  29   ~;  24   |;   8   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   27 (   1 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t49_ens_1,axiom,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_cat_1(X2)
            & l1_cat_1(X2) )
         => ! [X3] :
              ( m1_subset_1(X3,u1_cat_1(X2))
             => ( r1_tarski(k17_ens_1(X2),X1)
               => m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1)) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t49_ens_1) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : r1_tarski(X1,X1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).

fof(fc5_ens_1,axiom,
    ! [X1] :
      ( ( v2_cat_1(X1)
        & l1_cat_1(X1) )
     => ~ v1_xboole_0(k17_ens_1(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc5_ens_1) ).

fof(t2_yoneda_1,conjecture,
    ! [X1] :
      ( ( v2_cat_1(X1)
        & l1_cat_1(X1) )
     => ! [X2] :
          ( m1_subset_1(X2,u1_cat_1(X1))
         => m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1)) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_yoneda_1) ).

fof(d1_yoneda_1,axiom,
    ! [X1] :
      ( ( v2_cat_1(X1)
        & l1_cat_1(X1) )
     => k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_yoneda_1) ).

fof(c_0_5,plain,
    ! [X4,X5,X6] :
      ( v1_xboole_0(X4)
      | ~ v2_cat_1(X5)
      | ~ l1_cat_1(X5)
      | ~ m1_subset_1(X6,u1_cat_1(X5))
      | ~ r1_tarski(k17_ens_1(X5),X4)
      | m2_cat_1(k20_ens_1(X5,X6),X5,k12_ens_1(X4)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t49_ens_1])])])])])]) ).

fof(c_0_6,plain,
    ! [X3] : r1_tarski(X3,X3),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).

fof(c_0_7,plain,
    ! [X2] :
      ( ~ v2_cat_1(X2)
      | ~ l1_cat_1(X2)
      | ~ v1_xboole_0(k17_ens_1(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc5_ens_1])])]) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X1] :
        ( ( v2_cat_1(X1)
          & l1_cat_1(X1) )
       => ! [X2] :
            ( m1_subset_1(X2,u1_cat_1(X1))
           => m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1)) ) ),
    inference(assume_negation,[status(cth)],[t2_yoneda_1]) ).

cnf(c_0_9,plain,
    ( m2_cat_1(k20_ens_1(X1,X2),X1,k12_ens_1(X3))
    | v1_xboole_0(X3)
    | ~ r1_tarski(k17_ens_1(X1),X3)
    | ~ m1_subset_1(X2,u1_cat_1(X1))
    | ~ l1_cat_1(X1)
    | ~ v2_cat_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    r1_tarski(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( ~ v1_xboole_0(k17_ens_1(X1))
    | ~ l1_cat_1(X1)
    | ~ v2_cat_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,plain,
    ! [X2] :
      ( ~ v2_cat_1(X2)
      | ~ l1_cat_1(X2)
      | k1_yoneda_1(X2) = k12_ens_1(k17_ens_1(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_yoneda_1])]) ).

fof(c_0_13,negated_conjecture,
    ( v2_cat_1(esk1_0)
    & l1_cat_1(esk1_0)
    & m1_subset_1(esk2_0,u1_cat_1(esk1_0))
    & ~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).

cnf(c_0_14,plain,
    ( m2_cat_1(k20_ens_1(X1,X2),X1,k12_ens_1(k17_ens_1(X1)))
    | ~ m1_subset_1(X2,u1_cat_1(X1))
    | ~ l1_cat_1(X1)
    | ~ v2_cat_1(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_15,plain,
    ( k1_yoneda_1(X1) = k12_ens_1(k17_ens_1(X1))
    | ~ l1_cat_1(X1)
    | ~ v2_cat_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X1))
    | ~ m1_subset_1(X2,u1_cat_1(X1))
    | ~ l1_cat_1(X1)
    | ~ v2_cat_1(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    m1_subset_1(esk2_0,u1_cat_1(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    l1_cat_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    v2_cat_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CAT033+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun May 29 23:10:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.21/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40  # Preprocessing time       : 0.019 s
% 0.21/1.40  
% 0.21/1.40  # Proof found!
% 0.21/1.40  # SZS status Theorem
% 0.21/1.40  # SZS output start CNFRefutation
% See solution above
% 0.21/1.40  # Proof object total steps             : 22
% 0.21/1.40  # Proof object clause steps            : 11
% 0.21/1.40  # Proof object formula steps           : 11
% 0.21/1.40  # Proof object conjectures             : 8
% 0.21/1.40  # Proof object clause conjectures      : 5
% 0.21/1.40  # Proof object formula conjectures     : 3
% 0.21/1.40  # Proof object initial clauses used    : 8
% 0.21/1.40  # Proof object initial formulas used   : 5
% 0.21/1.40  # Proof object generating inferences   : 3
% 0.21/1.40  # Proof object simplifying inferences  : 5
% 0.21/1.40  # Training examples: 0 positive, 0 negative
% 0.21/1.40  # Parsed axioms                        : 53
% 0.21/1.40  # Removed by relevancy pruning/SinE    : 19
% 0.21/1.40  # Initial clauses                      : 52
% 0.21/1.40  # Removed in clause preprocessing      : 0
% 0.21/1.40  # Initial clauses in saturation        : 52
% 0.21/1.40  # Processed clauses                    : 109
% 0.21/1.40  # ...of these trivial                  : 0
% 0.21/1.40  # ...subsumed                          : 16
% 0.21/1.40  # ...remaining for further processing  : 93
% 0.21/1.40  # Other redundant clauses eliminated   : 0
% 0.21/1.40  # Clauses deleted for lack of memory   : 0
% 0.21/1.40  # Backward-subsumed                    : 2
% 0.21/1.40  # Backward-rewritten                   : 4
% 0.21/1.40  # Generated clauses                    : 125
% 0.21/1.40  # ...of the previous two non-trivial   : 112
% 0.21/1.40  # Contextual simplify-reflections      : 12
% 0.21/1.40  # Paramodulations                      : 125
% 0.21/1.40  # Factorizations                       : 0
% 0.21/1.40  # Equation resolutions                 : 0
% 0.21/1.40  # Current number of processed clauses  : 87
% 0.21/1.40  #    Positive orientable unit clauses  : 21
% 0.21/1.40  #    Positive unorientable unit clauses: 0
% 0.21/1.40  #    Negative unit clauses             : 2
% 0.21/1.40  #    Non-unit-clauses                  : 64
% 0.21/1.40  # Current number of unprocessed clauses: 54
% 0.21/1.40  # ...number of literals in the above   : 372
% 0.21/1.40  # Current number of archived formulas  : 0
% 0.21/1.40  # Current number of archived clauses   : 6
% 0.21/1.40  # Clause-clause subsumption calls (NU) : 1311
% 0.21/1.40  # Rec. Clause-clause subsumption calls : 389
% 0.21/1.40  # Non-unit clause-clause subsumptions  : 30
% 0.21/1.40  # Unit Clause-clause subsumption calls : 88
% 0.21/1.40  # Rewrite failures with RHS unbound    : 0
% 0.21/1.40  # BW rewrite match attempts            : 5
% 0.21/1.40  # BW rewrite match successes           : 1
% 0.21/1.40  # Condensation attempts                : 0
% 0.21/1.40  # Condensation successes               : 0
% 0.21/1.40  # Termbank termtop insertions          : 6405
% 0.21/1.40  
% 0.21/1.40  # -------------------------------------------------
% 0.21/1.40  # User time                : 0.026 s
% 0.21/1.40  # System time              : 0.001 s
% 0.21/1.40  # Total time               : 0.027 s
% 0.21/1.40  # Maximum resident set size: 3392 pages
%------------------------------------------------------------------------------