TSTP Solution File: CAT033+2 by E---3.1.00

View Problem - Process Solution

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

% Computer : n016.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 : Mon May 20 18:59:23 EDT 2024

% Result   : Theorem 70.37s 9.53s
% Output   : CNFRefutation 70.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   8 unt;   0 def)
%            Number of atoms       :   72 (   3 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   80 (  31   ~;  24   |;  10   &)
%                                         (   0 <=>;  15  =>;   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   :   30 (   1 sgn  21   !;   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/benchmark/Axioms/SET007/SET007+308.ax',t49_ens_1) ).

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/benchmark/Axioms/SET007/SET007+308.ax',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/benchmark/theBenchmark.p',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/benchmark/theBenchmark.p',d1_yoneda_1) ).

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(c_0_5,plain,
    ! [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)) ) ) ) ),
    inference(fof_simplification,[status(thm)],[t49_ens_1]) ).

fof(c_0_6,plain,
    ! [X1] :
      ( ( v2_cat_1(X1)
        & l1_cat_1(X1) )
     => ~ v1_xboole_0(k17_ens_1(X1)) ),
    inference(fof_simplification,[status(thm)],[fc5_ens_1]) ).

fof(c_0_7,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]) ).

fof(c_0_8,plain,
    ! [X34,X35,X36] :
      ( v1_xboole_0(X34)
      | ~ v2_cat_1(X35)
      | ~ l1_cat_1(X35)
      | ~ m1_subset_1(X36,u1_cat_1(X35))
      | ~ r1_tarski(k17_ens_1(X35),X34)
      | m2_cat_1(k20_ens_1(X35,X36),X35,k12_ens_1(X34)) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

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

fof(c_0_10,plain,
    ! [X142] :
      ( ~ v2_cat_1(X142)
      | ~ l1_cat_1(X142)
      | ~ v1_xboole_0(k17_ens_1(X142)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_11,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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

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

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

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

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

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_11]) ).

cnf(c_0_17,plain,
    ( m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_1(X3))
    | ~ v2_cat_1(X1)
    | ~ v2_cat_1(X3)
    | ~ l1_cat_1(X1)
    | ~ l1_cat_1(X3)
    | ~ m1_subset_1(X2,u1_cat_1(X1))
    | ~ r1_tarski(k17_ens_1(X1),k17_ens_1(X3)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    v2_cat_1(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

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

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

cnf(c_0_21,plain,
    r1_tarski(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    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_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : CAT033+2 : TPTP v8.2.0. Released v3.4.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sat May 18 11:39:38 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 70.37/9.53  # Version: 3.1.0
% 70.37/9.53  # Preprocessing class: FMLMSMLLSSSNFFN.
% 70.37/9.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.37/9.53  # Starting new_bool_3 with 900s (3) cores
% 70.37/9.53  # Starting new_bool_1 with 900s (3) cores
% 70.37/9.53  # Starting sh5l with 300s (1) cores
% 70.37/9.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 70.37/9.53  # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 25317 completed with status 0
% 70.37/9.53  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 70.37/9.53  # Preprocessing class: FMLMSMLLSSSNFFN.
% 70.37/9.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.37/9.53  # Starting new_bool_3 with 900s (3) cores
% 70.37/9.53  # Starting new_bool_1 with 900s (3) cores
% 70.37/9.53  # Starting sh5l with 300s (1) cores
% 70.37/9.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 70.37/9.53  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 70.37/9.53  # Search class: FGHSM-SMLM32-DFFFFFNN
% 70.37/9.53  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 70.37/9.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 70.37/9.53  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 25318 completed with status 0
% 70.37/9.53  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 70.37/9.53  # Preprocessing class: FMLMSMLLSSSNFFN.
% 70.37/9.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 70.37/9.53  # Starting new_bool_3 with 900s (3) cores
% 70.37/9.53  # Starting new_bool_1 with 900s (3) cores
% 70.37/9.53  # Starting sh5l with 300s (1) cores
% 70.37/9.53  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 70.37/9.53  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 70.37/9.53  # Search class: FGHSM-SMLM32-DFFFFFNN
% 70.37/9.53  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 70.37/9.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 70.37/9.53  # Preprocessing time       : 0.026 s
% 70.37/9.53  # Presaturation interreduction done
% 70.37/9.53  
% 70.37/9.53  # Proof found!
% 70.37/9.53  # SZS status Theorem
% 70.37/9.53  # SZS output start CNFRefutation
% See solution above
% 70.37/9.53  # Parsed axioms                        : 3802
% 70.37/9.53  # Removed by relevancy pruning/SinE    : 3301
% 70.37/9.53  # Initial clauses                      : 1054
% 70.37/9.53  # Removed in clause preprocessing      : 27
% 70.37/9.53  # Initial clauses in saturation        : 1027
% 70.37/9.53  # Processed clauses                    : 32819
% 70.37/9.53  # ...of these trivial                  : 292
% 70.37/9.53  # ...subsumed                          : 25564
% 70.37/9.53  # ...remaining for further processing  : 6963
% 70.37/9.53  # Other redundant clauses eliminated   : 2952
% 70.37/9.53  # Clauses deleted for lack of memory   : 0
% 70.37/9.53  # Backward-subsumed                    : 141
% 70.37/9.53  # Backward-rewritten                   : 73
% 70.37/9.53  # Generated clauses                    : 490818
% 70.37/9.53  # ...of the previous two non-redundant : 430569
% 70.37/9.53  # ...aggressively subsumed             : 0
% 70.37/9.53  # Contextual simplify-reflections      : 867
% 70.37/9.53  # Paramodulations                      : 487781
% 70.37/9.53  # Factorizations                       : 70
% 70.37/9.53  # NegExts                              : 0
% 70.37/9.53  # Equation resolutions                 : 2974
% 70.37/9.53  # Disequality decompositions           : 0
% 70.37/9.53  # Total rewrite steps                  : 186191
% 70.37/9.53  # ...of those cached                   : 178699
% 70.37/9.53  # Propositional unsat checks           : 1
% 70.37/9.53  #    Propositional check models        : 0
% 70.37/9.53  #    Propositional check unsatisfiable : 0
% 70.37/9.53  #    Propositional clauses             : 0
% 70.37/9.53  #    Propositional clauses after purity: 0
% 70.37/9.53  #    Propositional unsat core size     : 0
% 70.37/9.53  #    Propositional preprocessing time  : 0.000
% 70.37/9.53  #    Propositional encoding time       : 0.437
% 70.37/9.53  #    Propositional solver time         : 0.255
% 70.37/9.53  #    Success case prop preproc time    : 0.000
% 70.37/9.53  #    Success case prop encoding time   : 0.000
% 70.37/9.53  #    Success case prop solver time     : 0.000
% 70.37/9.53  # Current number of processed clauses  : 5660
% 70.37/9.53  #    Positive orientable unit clauses  : 291
% 70.37/9.53  #    Positive unorientable unit clauses: 8
% 70.37/9.53  #    Negative unit clauses             : 253
% 70.37/9.53  #    Non-unit-clauses                  : 5108
% 70.37/9.53  # Current number of unprocessed clauses: 397043
% 70.37/9.53  # ...number of literals in the above   : 1758511
% 70.37/9.53  # Current number of archived formulas  : 0
% 70.37/9.53  # Current number of archived clauses   : 1176
% 70.37/9.53  # Clause-clause subsumption calls (NU) : 5024493
% 70.37/9.53  # Rec. Clause-clause subsumption calls : 1434245
% 70.37/9.53  # Non-unit clause-clause subsumptions  : 12734
% 70.37/9.53  # Unit Clause-clause subsumption calls : 231765
% 70.37/9.53  # Rewrite failures with RHS unbound    : 0
% 70.37/9.53  # BW rewrite match attempts            : 397
% 70.37/9.53  # BW rewrite match successes           : 231
% 70.37/9.53  # Condensation attempts                : 0
% 70.37/9.53  # Condensation successes               : 0
% 70.37/9.53  # Termbank termtop insertions          : 10010570
% 70.37/9.53  # Search garbage collected termcells   : 48171
% 70.37/9.53  
% 70.37/9.53  # -------------------------------------------------
% 70.37/9.53  # User time                : 8.424 s
% 70.37/9.53  # System time              : 0.331 s
% 70.37/9.53  # Total time               : 8.755 s
% 70.37/9.53  # Maximum resident set size: 10992 pages
% 70.37/9.53  
% 70.37/9.53  # -------------------------------------------------
% 70.37/9.53  # User time                : 8.534 s
% 70.37/9.53  # System time              : 0.338 s
% 70.37/9.53  # Total time               : 8.872 s
% 70.37/9.53  # Maximum resident set size: 6752 pages
% 70.37/9.53  % E---3.1 exiting
% 70.37/9.53  % E exiting
%------------------------------------------------------------------------------