↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : CAT033+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n003.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 : Thu Sep 24 12:08:22 PM UTC 2026

% Result   : Theorem 45.61s 12.62s
% Output   : CNFRefutation 45.61s
% 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] :
          ( ( l1_cat_1(X2)
            & v2_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] :
      ( ( l1_cat_1(X1)
        & v2_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] :
      ( ( l1_cat_1(X1)
        & v2_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] :
      ( ( l1_cat_1(X1)
        & v2_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] :
          ( ( l1_cat_1(X2)
            & v2_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] :
      ( ( l1_cat_1(X1)
        & v2_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] :
        ( ( l1_cat_1(X1)
          & v2_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,
    ! [X72,X73,X74] :
      ( m2_cat_1(k20_ens_1(X73,X74),X73,k12_ens_1(X72))
      | ~ r1_tarski(k17_ens_1(X73),X72)
      | ~ m1_subset_1(X74,u1_cat_1(X73))
      | ~ l1_cat_1(X73)
      | ~ v2_cat_1(X73)
      | v1_xboole_0(X72) ),
    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,
    ! [X61] :
      ( k1_yoneda_1(X61) = k12_ens_1(k17_ens_1(X61))
      | ~ l1_cat_1(X61)
      | ~ v2_cat_1(X61) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_yoneda_1])])]) ).

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

fof(c_0_11,negated_conjecture,
    ( ~ m2_cat_1(k20_ens_1(esk1_0,esk2_0),esk1_0,k1_yoneda_1(esk1_0))
    & m1_subset_1(esk2_0,u1_cat_1(esk1_0))
    & l1_cat_1(esk1_0)
    & v2_cat_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,
    ( ~ r1_tarski(k17_ens_1(X2),X1)
    | ~ m1_subset_1(X3,u1_cat_1(X2))
    | ~ l1_cat_1(X2)
    | ~ v2_cat_1(X2)
    | m2_cat_1(k20_ens_1(X2,X3),X2,k12_ens_1(X1))
    | v1_xboole_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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

fof(c_0_15,plain,
    ! [X844] : r1_tarski(X844,X844),
    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,
    ( ~ r1_tarski(k17_ens_1(X1),k17_ens_1(X3))
    | ~ m1_subset_1(X2,u1_cat_1(X1))
    | ~ l1_cat_1(X3)
    | ~ l1_cat_1(X1)
    | ~ v2_cat_1(X3)
    | ~ v2_cat_1(X1)
    | m2_cat_1(k20_ens_1(X1,X2),X1,k1_yoneda_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.00/0.05  % Problem  : CAT033+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.49  % Computer : n003.cluster.edu
% 0.19/0.49  % Model    : x86_64 x86_64
% 0.19/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.49  % Memory   : 8046.5625MB
% 0.19/0.49  % OS       : Linux 6.8.0-71-generic
% 0.19/0.49  % CPULimit : 300
% 0.19/0.49  % WCLimit  : 300
% 0.19/0.49  % DateTime : Mon Sep 21 14:02:52 UTC 2026
% 0.19/0.49  % CPUTime  : 
% 0.19/0.49  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55  Running first-order theorem proving
% 0.24/0.55  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
% 45.61/12.62  % Version: 3.5.1
% 45.61/12.62  % Preprocessing class: FMLLMLLLSSSNFFN.
% 45.61/12.62  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 45.61/12.62  % Starting new_bool_3 with 894s (3) cores
% 45.61/12.62  % Starting new_bool_1 with 894s (3) cores
% 45.61/12.62  % Starting sh5l with 298s (1) cores
% 45.61/12.62  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 45.61/12.62  % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 289891 completed with status 0
% 45.61/12.62  % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 45.61/12.62  % Preprocessing class: FMLLMLLLSSSNFFN.
% 45.61/12.62  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 45.61/12.62  % Starting new_bool_3 with 894s (3) cores
% 45.61/12.62  % Starting new_bool_1 with 894s (3) cores
% 45.61/12.62  % Starting sh5l with 298s (1) cores
% 45.61/12.62  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 45.61/12.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 45.61/12.62  % SinE strategy is gf120_h_gu_R02_F100_L20000
% 45.61/12.62  % Search class: FGHSM-FSLM32-DFFFFFNN
% 45.61/12.62  % Scheduled 13 strats onto 1 cores with 298 seconds (298 total)
% 45.61/12.62  % Starting SubtermCWHack with 27s (1) cores
% 45.61/12.62  % SubtermCWHack with pid 289895 completed with status 0
% 45.61/12.62  % Result found by SubtermCWHack
% 45.61/12.62  % Preprocessing class: FMLLMLLLSSSNFFN.
% 45.61/12.62  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 45.61/12.62  % Starting new_bool_3 with 894s (3) cores
% 45.61/12.62  % Starting new_bool_1 with 894s (3) cores
% 45.61/12.62  % Starting sh5l with 298s (1) cores
% 45.61/12.62  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 45.61/12.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 45.61/12.62  % SinE strategy is gf120_h_gu_R02_F100_L20000
% 45.61/12.62  % Search class: FGHSM-FSLM32-DFFFFFNN
% 45.61/12.62  % Scheduled 13 strats onto 1 cores with 298 seconds (298 total)
% 45.61/12.62  % Starting SubtermCWHack with 27s (1) cores
% 45.61/12.62  % Preprocessing time       : 0.042 s
% 45.61/12.62  
% 45.61/12.62  % Proof found!
% 45.61/12.62  % SZS status Theorem
% 45.61/12.62  % SZS output start CNFRefutation
% See solution above
% 45.61/12.62  % Parsed axioms                        : 42648
% 45.61/12.62  % Removed by relevancy pruning/SinE    : 42348
% 45.61/12.62  % Initial clauses                      : 650
% 45.61/12.62  % Removed in clause preprocessing      : 12
% 45.61/12.62  % Initial clauses in saturation        : 638
% 45.61/12.62  % Processed clauses                    : 33682
% 45.61/12.62  % ...of these trivial                  : 141
% 45.61/12.62  % ...subsumed                          : 28125
% 45.61/12.62  % ...remaining for further processing  : 5416
% 45.61/12.62  % Other redundant clauses eliminated   : 370
% 45.61/12.62  % Clauses deleted for lack of memory   : 0
% 45.61/12.62  % Backward-subsumed                    : 397
% 45.61/12.62  % Backward-rewritten                   : 138
% 45.61/12.62  % Generated clauses                    : 368948
% 45.61/12.62  % ...of the previous two non-redundant : 311183
% 45.61/12.62  % ...aggressively subsumed             : 0
% 45.61/12.62  % Contextual simplify-reflections      : 411
% 45.61/12.62  % Paramodulations                      : 368521
% 45.61/12.62  % Factorizations                       : 10
% 45.61/12.62  % NegExts                              : 0
% 45.61/12.62  % Equation resolutions                 : 391
% 45.61/12.62  % Disequality decompositions           : 0
% 45.61/12.62  % Total rewrite steps                  : 146465
% 45.61/12.62  % ...of those cached                   : 144449
% 45.61/12.62  % Propositional unsat checks           : 0
% 45.61/12.62  %    Propositional check models        : 0
% 45.61/12.62  %    Propositional check unsatisfiable : 0
% 45.61/12.62  %    Propositional clauses             : 0
% 45.61/12.62  %    Propositional clauses after purity: 0
% 45.61/12.62  %    Propositional unsat core size     : 0
% 45.61/12.62  %    Propositional preprocessing time  : 0.000
% 45.61/12.62  %    Propositional encoding time       : 0.000
% 45.61/12.62  %    Propositional solver time         : 0.000
% 45.61/12.62  %    Success case prop preproc time    : 0.000
% 45.61/12.62  %    Success case prop encoding time   : 0.000
% 45.61/12.62  %    Success case prop solver time     : 0.000
% 45.61/12.62  % Current number of processed clauses  : 4802
% 45.61/12.62  %    Positive orientable unit clauses  : 271
% 45.61/12.62  %    Positive unorientable unit clauses: 2
% 45.61/12.62  %    Negative unit clauses             : 253
% 45.61/12.62  %    Non-unit-clauses                  : 4276
% 45.61/12.62  % Current number of unprocessed clauses: 275155
% 45.61/12.62  % ...number of literals in the above   : 1187010
% 45.61/12.62  % Current number of archived formulas  : 0
% 45.61/12.62  % Current number of archived clauses   : 565
% 45.61/12.62  % Clause-clause subsumption calls (NU) : 5821067
% 45.61/12.62  % Rec. Clause-clause subsumption calls : 3675292
% 45.61/12.62  % Non-unit clause-clause subsumptions  : 18751
% 45.61/12.62  % Unit Clause-clause subsumption calls : 66857
% 45.61/12.62  % Rewrite failures with RHS unbound    : 0
% 45.61/12.62  % BW rewrite match attempts            : 1656
% 45.61/12.62  % BW rewrite match successes           : 38
% 45.61/12.62  % Condensation attempts                : 0
% 45.61/12.62  % Condensation successes               : 0
% 45.61/12.62  % Termbank termtop insertions          : 6458103
% 45.61/12.62  % Search garbage collected termcells   : 444737
% 45.61/12.62  
% 45.61/12.62  % -------------------------------------------------
% 45.61/12.62  % User time                : 8.204 s
% 45.61/12.62  % System time              : 0.461 s
% 45.61/12.62  % Total time               : 8.665 s
% 45.61/12.62  % Maximum resident set size: 87404 pages
% 45.61/12.62  
% 45.61/12.62  % -------------------------------------------------
% 45.61/12.62  % User time                : 10.460 s
% 45.61/12.62  % System time              : 0.558 s
% 45.61/12.62  % Total time               : 11.018 s
% 45.61/12.62  % Maximum resident set size: 70656 pages
% 45.61/12.62  % E exiting
%------------------------------------------------------------------------------