↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP302_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n005.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:55:22 PM UTC 2026

% Result   : Theorem 0.15s 0.49s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   19 (  10   ~;   6   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    9 (   8 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    'B_set$': $tType ).

tff(decl_sort2,type,
    'A_b_b_c_LSCategory_ext_Category_ext$': $tType ).

tff(decl_sort3,type,
    'A_set$': $tType ).

tff(decl_sort4,type,
    'A$': $tType ).

tff(decl_sort5,type,
    'B$': $tType ).

tff(decl_sort6,type,
    'B_a_fun$': $tType ).

tff(decl_sort7,type,
    'A_set_bool_fun$': $tType ).

tff(decl_sort8,type,
    'B_set_bool_fun$': $tType ).

tff(decl_37,type,
    'c$': 'A_b_b_c_LSCategory_ext_Category_ext$' ).

tff(decl_64,type,
    'fun_app$bk': ( 'B$' * 'B_a_fun$' ) > 'A$' ).

tff(decl_69,type,
    'lSCategory$': 'A_b_b_c_LSCategory_ext_Category_ext$' > $o ).

tff(decl_71,type,
    'member$c': 'A$' > 'A_set_bool_fun$' ).

tff(decl_103,type,
    'f$': 'B$' ).

tff(decl_135,type,
    'category$': 'A_b_b_c_LSCategory_ext_Category_ext$' > $o ).

tff(decl_270,type,
    'obj$': 'A_b_b_c_LSCategory_ext_Category_ext$' > 'A_set$' ).

tff(decl_426,type,
    'member$b': 'B$' > 'B_set_bool_fun$' ).

tff(decl_448,type,
    'dom$': 'A_b_b_c_LSCategory_ext_Category_ext$' > 'B_a_fun$' ).

tff(decl_569,type,
    'fun_app$m': ( 'B_set$' * 'B_set_bool_fun$' ) > $o ).

tff(decl_590,type,
    'fun_app$p': ( 'A_set$' * 'A_set_bool_fun$' ) > $o ).

tff(decl_634,type,
    'mor$': 'A_b_b_c_LSCategory_ext_Category_ext$' > 'B_set$' ).

tff(conjecture185,conjecture,
    'fun_app$p'('member$c'('fun_app$bk'('dom$'('c$'),'f$')),'obj$'('c$')),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture185) ).

tff(axiom212,axiom,
    ! [X521: 'A_b_b_c_LSCategory_ext_Category_ext$'] :
      ( 'lSCategory$'(X521)
     => 'category$'(X521) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom212) ).

tff(axiom203,axiom,
    ! [X473: 'A_b_b_c_LSCategory_ext_Category_ext$',X474: 'B$'] :
      ( ( 'fun_app$m'('member$b'(X474),'mor$'(X473))
        & 'category$'(X473) )
     => 'fun_app$p'('member$c'('fun_app$bk'('dom$'(X473),X474)),'obj$'(X473)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom203) ).

tff(axiom186,axiom,
    'lSCategory$'('c$'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom186) ).

tff(axiom187,axiom,
    'fun_app$m'('member$b'('f$'),'mor$'('c$')),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom187) ).

tff(c_0_5,negated_conjecture,
    ~ 'fun_app$p'('member$c'('fun_app$bk'('dom$'('c$'),'f$')),'obj$'('c$')),
    inference(assume_negation,[status(cth)],[conjecture185]) ).

tff(c_0_6,negated_conjecture,
    ~ 'fun_app$p'('member$c'('fun_app$bk'('dom$'('c$'),'f$')),'obj$'('c$')),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

tff(c_0_7,plain,
    ! [X2131: 'A_b_b_c_LSCategory_ext_Category_ext$'] :
      ( 'category$'(X2131)
      | ~ 'lSCategory$'(X2131) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom212])])]) ).

tff(c_0_8,negated_conjecture,
    ~ 'fun_app$p'('member$c'('fun_app$bk'('dom$'('c$'),'f$')),'obj$'('c$')),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

tff(c_0_9,plain,
    ! [X2127: 'A_b_b_c_LSCategory_ext_Category_ext$',X2128: 'B$'] :
      ( 'fun_app$p'('member$c'('fun_app$bk'('dom$'(X2127),X2128)),'obj$'(X2127))
      | ~ 'fun_app$m'('member$b'(X2128),'mor$'(X2127))
      | ~ 'category$'(X2127) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom203])])]) ).

tcf(c_0_10,plain,
    ! [X73: 'A_b_b_c_LSCategory_ext_Category_ext$'] :
      ( ~ 'lSCategory$'(X73)
      | 'category$'(X73) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tcf(c_0_11,plain,
    'lSCategory$'('c$'),
    inference(split_conjunct,[status(thm)],[axiom186]) ).

tcf(c_0_12,negated_conjecture,
    ~ 'fun_app$p'('member$c'('fun_app$bk'('dom$'('c$'),'f$')),'obj$'('c$')),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

tcf(c_0_13,plain,
    ! [X10: 'B$',X73: 'A_b_b_c_LSCategory_ext_Category_ext$'] :
      ( ~ 'fun_app$m'('member$b'(X10),'mor$'(X73))
      | ~ 'category$'(X73)
      | 'fun_app$p'('member$c'('fun_app$bk'('dom$'(X73),X10)),'obj$'(X73)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

tcf(c_0_14,plain,
    'fun_app$m'('member$b'('f$'),'mor$'('c$')),
    inference(split_conjunct,[status(thm)],[axiom187]) ).

tcf(c_0_15,plain,
    'category$'('c$'),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP302_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.38  % Computer : n005.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Sun Sep 20 22:33:19 UTC 2026
% 0.09/0.39  % CPUTime  : 
% 0.09/0.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.43  Running first-order theorem proving
% 0.09/0.43  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
% 0.15/0.49  % Version: 3.5.1
% 0.15/0.49  % partial match(1): FMLMSMSMSSSNFFN
% 0.15/0.49  % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.15/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.49  % Starting sh5l with 300s (1) cores
% 0.15/0.49  % new_bool_1 with pid 1896039 completed with status 0
% 0.15/0.49  % Result found by new_bool_1
% 0.15/0.49  % partial match(1): FMLMSMSMSSSNFFN
% 0.15/0.49  % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.15/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.49  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49  % Search class: FHUNF-FFSF21-MFFFFFNN
% 0.15/0.49  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.49  % SubtermCWHack with pid 1896047 completed with status 0
% 0.15/0.49  % Result found by SubtermCWHack
% 0.15/0.49  % partial match(1): FMLMSMSMSSSNFFN
% 0.15/0.49  % Preprocessing class: FMLMSMLMSSSNFFN.
% 0.15/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.49  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49  % Search class: FHUNF-FFSF21-MFFFFFNN
% 0.15/0.49  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.49  % Preprocessing time       : 0.006 s
% 0.15/0.49  
% 0.15/0.49  % Proof found!
% 0.15/0.49  % SZS status Theorem
% 0.15/0.49  % SZS output start CNFRefutation
% See solution above
% 0.15/0.49  % Parsed axioms                        : 1618
% 0.15/0.49  % Removed by relevancy pruning/SinE    : 1612
% 0.15/0.49  % Initial clauses                      : 6
% 0.15/0.49  % Removed in clause preprocessing      : 0
% 0.15/0.49  % Initial clauses in saturation        : 6
% 0.15/0.49  % Processed clauses                    : 7
% 0.15/0.49  % ...of these trivial                  : 0
% 0.15/0.49  % ...subsumed                          : 0
% 0.15/0.49  % ...remaining for further processing  : 7
% 0.15/0.49  % Other redundant clauses eliminated   : 0
% 0.15/0.49  % Clauses deleted for lack of memory   : 0
% 0.15/0.49  % Backward-subsumed                    : 0
% 0.15/0.49  % Backward-rewritten                   : 0
% 0.15/0.49  % Generated clauses                    : 2
% 0.15/0.49  % ...of the previous two non-redundant : 1
% 0.15/0.49  % ...aggressively subsumed             : 0
% 0.15/0.49  % Contextual simplify-reflections      : 0
% 0.15/0.49  % Paramodulations                      : 2
% 0.15/0.49  % Factorizations                       : 0
% 0.15/0.49  % NegExts                              : 0
% 0.15/0.49  % Equation resolutions                 : 0
% 0.15/0.49  % Disequality decompositions           : 0
% 0.15/0.49  % Total rewrite steps                  : 2
% 0.15/0.49  % ...of those cached                   : 0
% 0.15/0.49  % Propositional unsat checks           : 0
% 0.15/0.49  %    Propositional check models        : 0
% 0.15/0.49  %    Propositional check unsatisfiable : 0
% 0.15/0.49  %    Propositional clauses             : 0
% 0.15/0.49  %    Propositional clauses after purity: 0
% 0.15/0.49  %    Propositional unsat core size     : 0
% 0.15/0.49  %    Propositional preprocessing time  : 0.000
% 0.15/0.49  %    Propositional encoding time       : 0.000
% 0.15/0.49  %    Propositional solver time         : 0.000
% 0.15/0.49  %    Success case prop preproc time    : 0.000
% 0.15/0.49  %    Success case prop encoding time   : 0.000
% 0.15/0.49  %    Success case prop solver time     : 0.000
% 0.15/0.49  % Current number of processed clauses  : 7
% 0.15/0.49  %    Positive orientable unit clauses  : 3
% 0.15/0.49  %    Positive unorientable unit clauses: 0
% 0.15/0.49  %    Negative unit clauses             : 1
% 0.15/0.49  %    Non-unit-clauses                  : 3
% 0.15/0.49  % Current number of unprocessed clauses: 0
% 0.15/0.49  % ...number of literals in the above   : 0
% 0.15/0.49  % Current number of archived formulas  : 0
% 0.15/0.49  % Current number of archived clauses   : 0
% 0.15/0.49  % Clause-clause subsumption calls (NU) : 2
% 0.15/0.49  % Rec. Clause-clause subsumption calls : 2
% 0.15/0.49  % Non-unit clause-clause subsumptions  : 0
% 0.15/0.49  % Unit Clause-clause subsumption calls : 0
% 0.15/0.49  % Rewrite failures with RHS unbound    : 0
% 0.15/0.49  % BW rewrite match attempts            : 0
% 0.15/0.49  % BW rewrite match successes           : 0
% 0.15/0.49  % Condensation attempts                : 0
% 0.15/0.49  % Condensation successes               : 0
% 0.15/0.49  % Termbank termtop insertions          : 13913
% 0.15/0.49  % Search garbage collected termcells   : 11440
% 0.15/0.49  
% 0.15/0.49  % -------------------------------------------------
% 0.15/0.49  % User time                : 0.013 s
% 0.15/0.49  % System time              : 0.011 s
% 0.15/0.49  % Total time               : 0.024 s
% 0.15/0.49  % Maximum resident set size: 7552 pages
% 0.15/0.49  
% 0.15/0.49  % -------------------------------------------------
% 0.15/0.49  % User time                : 0.042 s
% 0.15/0.49  % System time              : 0.014 s
% 0.15/0.49  % Total time               : 0.056 s
% 0.15/0.49  % Maximum resident set size: 7680 pages
% 0.15/0.49  % E exiting
%------------------------------------------------------------------------------