↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n007.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 01:49:53 PM UTC 2026

% Result   : Theorem 206.98s 30.43s
% Output   : CNFRefutation 206.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   64 (  31 unt;   0 def)
%            Number of atoms       :  125 (  27 equ)
%            Maximal formula atoms :   10 (   1 avg)
%            Number of connectives :  106 (  45   ~;  46   |;   7   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   21 (  21 usr;  12 con; 0-2 aty)
%            Number of variables   :   72 (   5 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_ATP_Olambda__3,axiom,
    ! [X25] :
      ( pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X25))
    <=> pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X25),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X25))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_ATP_Olambda__3) ).

fof(fact_def__n__pl,axiom,
    ! [X4] : scratc1289955817d_n_pl(X4) = aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_def__n__pl) ).

fof(fact_def__e__is,axiom,
    ! [X4] : scratc1770836270d_e_is(X4) = fequal_TPTP_ind,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_def__e__is) ).

fof(fact_ATP_Olambda__7,axiom,
    ! [X25] :
      ( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X25))
    <=> pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X25)),aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X25),scratc214542084nd_n_1))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_ATP_Olambda__7) ).

fof(help_fequal_1_1_fequal_001t__TPTP____Interpret__Oind_T,axiom,
    ! [X34,X35] :
      ( ( gg_TPTP_ind(X35)
        & gg_TPTP_ind(X34) )
     => ( X34 = X35
        | ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X34),X35)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fequal_1_1_fequal_001t__TPTP____Interpret__Oind_T) ).

fof(fact_def__n__is,axiom,
    scratc1289496631d_n_is = scratc1770836270d_e_is(scratc1472361728nd_nat),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_def__n__is) ).

fof(help_fequal_2_1_fequal_001t__TPTP____Interpret__Oind_T,axiom,
    ! [X34,X35] :
      ( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X34),X35))
      | X34 != X35 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fequal_2_1_fequal_001t__TPTP____Interpret__Oind_T) ).

fof(gsy_c_aa_001t__TPTP____Interpret__Oind_001t__TPTP____Interpret__Oind,axiom,
    ! [X1,X2] : gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gsy_c_aa_001t__TPTP____Interpret__Oind_001t__TPTP____Interpret__Oind) ).

fof(conj_0,conjecture,
    pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

fof(fact_def__all__of,axiom,
    ! [X4,X5] :
      ( pp(aa_fun171081125l_bool(scratc1153622423all_of(X4),X5))
    <=> ! [X12] :
          ( gg_TPTP_ind(X12)
         => ( scratc1829621698_is_of(X12,X4)
           => pp(aa_TPTP_ind_bool(X5,X12)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_def__all__of) ).

fof(help_fFalse_1_1_T,axiom,
    ! [X32] :
      ( gg_bool(X32)
     => ( X32 = fFalse
        | X32 = fTrue ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fFalse_1_1_T) ).

fof(gsy_c_aa_001t__fun_It__TPTP____Interpret__Oind_Mt__HOL__Obool_J_001t__HOL__Obool,hypothesis,
    ! [X1,X2] : gg_bool(aa_fun171081125l_bool(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gsy_c_aa_001t__fun_It__TPTP____Interpret__Oind_Mt__HOL__Obool_J_001t__HOL__Obool) ).

fof(fact_satz4a,axiom,
    pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_bu)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_satz4a) ).

fof(help_fFalse_1_1_U,axiom,
    ~ pp(fFalse),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).

fof(help_pp_2_1_U,axiom,
    pp(fTrue),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_pp_2_1_U) ).

fof(c_0_15,plain,
    ! [X489] :
      ( ( pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X489))
        | ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X489),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X489))) )
      & ( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X489),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X489)))
        | ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X489)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_ATP_Olambda__3])])]) ).

fof(c_0_16,plain,
    ! [X68] : scratc1289955817d_n_pl(X68) = aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X68)),
    inference(variable_rename,[status(thm)],[fact_def__n__pl]) ).

fof(c_0_17,plain,
    ! [X228] : scratc1770836270d_e_is(X228) = fequal_TPTP_ind,
    inference(variable_rename,[status(thm)],[fact_def__e__is]) ).

fof(c_0_18,plain,
    ! [X493] :
      ( ( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X493))
        | ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X493)),aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X493),scratc214542084nd_n_1))) )
      & ( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X493)),aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X493),scratc214542084nd_n_1)))
        | ~ pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X493)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_ATP_Olambda__7])])]) ).

fof(c_0_19,plain,
    ! [X34,X35] :
      ( ( gg_TPTP_ind(X35)
        & gg_TPTP_ind(X34) )
     => ( X34 = X35
        | ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X34),X35)) ) ),
    inference(fof_simplification,[status(thm)],[help_fequal_1_1_fequal_001t__TPTP____Interpret__Oind_T]) ).

cnf(c_0_20,plain,
    ( ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
    | pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X1),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    scratc1289955817d_n_pl(X1) = aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    scratc1289496631d_n_is = scratc1770836270d_e_is(scratc1472361728nd_nat),
    inference(split_conjunct,[status(thm)],[fact_def__n__is]) ).

cnf(c_0_23,plain,
    scratc1770836270d_e_is(X1) = fequal_TPTP_ind,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_24,plain,
    ! [X34,X35] :
      ( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X34),X35))
      | X34 != X35 ),
    inference(fof_simplification,[status(thm)],[help_fequal_2_1_fequal_001t__TPTP____Interpret__Oind_T]) ).

cnf(c_0_25,plain,
    ( ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)),aa_TPTP_ind_TPTP_ind(scratc1289955817d_n_pl(X1),scratc214542084nd_n_1)))
    | pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_26,plain,
    ! [X753,X754] :
      ( X753 = X754
      | ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X753),X754))
      | ~ gg_TPTP_ind(X754)
      | ~ gg_TPTP_ind(X753) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).

cnf(c_0_27,plain,
    ( ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
    | pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1))) ),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_28,plain,
    fequal_TPTP_ind = scratc1289496631d_n_is,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

fof(c_0_29,plain,
    ! [X59,X60] : gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X59,X60)),
    inference(variable_rename,[status(thm)],[gsy_c_aa_001t__TPTP____Interpret__Oind_001t__TPTP____Interpret__Oind]) ).

fof(c_0_30,plain,
    ! [X751,X752] :
      ( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X751),X752))
      | X751 != X752 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).

fof(c_0_31,negated_conjecture,
    ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
    inference(assume_negation,[status(cth)],[conj_0]) ).

cnf(c_0_32,plain,
    ( ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)))
    | pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1)) ),
    inference(rw,[status(thm)],[c_0_25,c_0_21]) ).

cnf(c_0_33,plain,
    ( ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2))
    | ~ gg_TPTP_ind(X2)
    | ~ gg_TPTP_ind(X1)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_34,plain,
    ( ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
    | pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1))) ),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,plain,
    gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_36,plain,
    ( X1 != X2
    | pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_37,plain,
    ! [X336,X337,X338,X339,X340] :
      ( ( pp(aa_fun171081125l_bool(scratc1153622423all_of(X339),X340))
        | ~ pp(aa_TPTP_ind_bool(X340,esk13_2(X339,X340))) )
      & ( pp(aa_fun171081125l_bool(scratc1153622423all_of(X339),X340))
        | scratc1829621698_is_of(esk13_2(X339,X340),X339) )
      & ( pp(aa_fun171081125l_bool(scratc1153622423all_of(X339),X340))
        | gg_TPTP_ind(esk13_2(X339,X340)) )
      & ( pp(aa_TPTP_ind_bool(X337,X338))
        | ~ scratc1829621698_is_of(X338,X336)
        | ~ gg_TPTP_ind(X338)
        | ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(X336),X337)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[fact_def__all__of])])])])])])]) ).

fof(c_0_38,negated_conjecture,
    ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
    inference(fof_simplification,[status(thm)],[c_0_31]) ).

fof(c_0_39,plain,
    ! [X742] :
      ( X742 = fFalse
      | X742 = fTrue
      | ~ gg_bool(X742) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[help_fFalse_1_1_T])])]) ).

fof(c_0_40,hypothesis,
    ! [X61,X62] : gg_bool(aa_fun171081125l_bool(X61,X62)),
    inference(variable_rename,[status(thm)],[gsy_c_aa_001t__fun_It__TPTP____Interpret__Oind_Mt__HOL__Obool_J_001t__HOL__Obool]) ).

cnf(c_0_41,plain,
    ( ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)))
    | pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1)) ),
    inference(rw,[status(thm)],[c_0_32,c_0_28]) ).

cnf(c_0_42,plain,
    ( ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
    | aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1) = aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_35])]) ).

cnf(c_0_43,plain,
    pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X1)),
    inference(er,[status(thm)],[c_0_36]) ).

cnf(c_0_44,plain,
    ( ~ scratc1829621698_is_of(X3,X1)
    | ~ gg_TPTP_ind(X3)
    | ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2))
    | pp(aa_TPTP_ind_bool(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_45,plain,
    pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_bu)),
    inference(split_conjunct,[status(thm)],[fact_satz4a]) ).

fof(c_0_46,negated_conjecture,
    ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
    inference(fof_nnf,[status(thm)],[c_0_38]) ).

cnf(c_0_47,plain,
    ( ~ gg_bool(X1)
    | X1 = fFalse
    | X1 = fTrue ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_48,hypothesis,
    gg_bool(aa_fun171081125l_bool(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

fof(c_0_49,plain,
    ~ pp(fFalse),
    inference(fof_simplification,[status(thm)],[help_fFalse_1_1_U]) ).

cnf(c_0_50,plain,
    ( ~ pp(aa_TPTP_ind_bool(X1,esk13_2(X2,X1)))
    | pp(aa_fun171081125l_bool(scratc1153622423all_of(X2),X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_51,plain,
    ( ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
    | pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).

cnf(c_0_52,plain,
    ( ~ gg_TPTP_ind(X1)
    | ~ scratc1829621698_is_of(X1,aTP_Lamm_a)
    | pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_53,plain,
    ( pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2))
    | scratc1829621698_is_of(esk13_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_54,plain,
    ( pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2))
    | gg_TPTP_ind(esk13_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_55,negated_conjecture,
    ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_56,hypothesis,
    ( aa_fun171081125l_bool(X1,X2) = fFalse
    | aa_fun171081125l_bool(X1,X2) = fTrue ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_57,plain,
    pp(fTrue),
    inference(split_conjunct,[status(thm)],[help_pp_2_1_U]) ).

fof(c_0_58,plain,
    ~ pp(fFalse),
    inference(fof_nnf,[status(thm)],[c_0_49]) ).

cnf(c_0_59,plain,
    ( ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,esk13_2(X1,aTP_Lamm_aa)))
    | pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),aTP_Lamm_aa)) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_60,plain,
    ( pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),X1))
    | pp(aa_TPTP_ind_bool(aTP_Lamm_bu,esk13_2(aTP_Lamm_a,X1))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).

cnf(c_0_61,negated_conjecture,
    aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa) = fFalse,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).

cnf(c_0_62,plain,
    ~ pp(fFalse),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_63,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM639+4 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n007.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 02:44:36 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  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
% 206.98/30.43  % Version: 3.5.1
% 206.98/30.43  % Preprocessing class: FSLMSMSMSSSNFFN.
% 206.98/30.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.98/30.43  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 206.98/30.43  % Starting new_bool_3 with 600s (2) cores
% 206.98/30.43  % Starting new_bool_1 with 300s (1) cores
% 206.98/30.43  % Starting sh5l with 300s (1) cores
% 206.98/30.43  % G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 3709 completed with status 0
% 206.98/30.43  % Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 206.98/30.43  % Preprocessing class: FSLMSMSMSSSNFFN.
% 206.98/30.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.98/30.43  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 206.98/30.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 206.98/30.43  % No SInE strategy applied
% 206.98/30.43  % Search class: FGHSM-FSLM31-DFFFFFNN
% 206.98/30.43  % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 206.98/30.43  % Starting SubtermCWHack with 109s (1) cores
% 206.98/30.43  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 206.98/30.43  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 283s (1) cores
% 206.98/30.43  % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 109s (1) cores
% 206.98/30.43  % C07_19_nc_SAT001_MinMin_p005000_rr with pid 3731 completed with status 0
% 206.98/30.43  % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 206.98/30.43  % Preprocessing class: FSLMSMSMSSSNFFN.
% 206.98/30.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 206.98/30.43  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 206.98/30.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 206.98/30.43  % No SInE strategy applied
% 206.98/30.43  % Search class: FGHSM-FSLM31-DFFFFFNN
% 206.98/30.43  % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 206.98/30.43  % Starting SubtermCWHack with 109s (1) cores
% 206.98/30.43  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 206.98/30.43  % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 283s (1) cores
% 206.98/30.43  % Preprocessing time       : 0.010 s
% 206.98/30.43  % Presaturation interreduction done
% 206.98/30.43  
% 206.98/30.43  % Proof found!
% 206.98/30.43  % SZS status Theorem
% 206.98/30.43  % SZS output start CNFRefutation
% See solution above
% 206.98/30.43  % Parsed axioms                        : 317
% 206.98/30.43  % Removed by relevancy pruning/SinE    : 0
% 206.98/30.43  % Initial clauses                      : 524
% 206.98/30.43  % Removed in clause preprocessing      : 18
% 206.98/30.43  % Initial clauses in saturation        : 506
% 206.98/30.43  % Processed clauses                    : 49195
% 206.98/30.43  % ...of these trivial                  : 271
% 206.98/30.43  % ...subsumed                          : 42721
% 206.98/30.43  % ...remaining for further processing  : 6203
% 206.98/30.43  % Other redundant clauses eliminated   : 71
% 206.98/30.43  % Clauses deleted for lack of memory   : 0
% 206.98/30.43  % Backward-subsumed                    : 334
% 206.98/30.43  % Backward-rewritten                   : 522
% 206.98/30.43  % Generated clauses                    : 1480324
% 206.98/30.43  % ...of the previous two non-redundant : 1175437
% 206.98/30.43  % ...aggressively subsumed             : 0
% 206.98/30.43  % Contextual simplify-reflections      : 121
% 206.98/30.43  % Paramodulations                      : 1479998
% 206.98/30.43  % Factorizations                       : 251
% 206.98/30.43  % NegExts                              : 0
% 206.98/30.43  % Equation resolutions                 : 75
% 206.98/30.43  % Disequality decompositions           : 0
% 206.98/30.43  % Total rewrite steps                  : 403976
% 206.98/30.43  % ...of those cached                   : 397948
% 206.98/30.43  % Propositional unsat checks           : 1
% 206.98/30.43  %    Propositional check models        : 0
% 206.98/30.43  %    Propositional check unsatisfiable : 0
% 206.98/30.43  %    Propositional clauses             : 0
% 206.98/30.43  %    Propositional clauses after purity: 0
% 206.98/30.43  %    Propositional unsat core size     : 0
% 206.98/30.43  %    Propositional preprocessing time  : 0.000
% 206.98/30.43  %    Propositional encoding time       : 1.548
% 206.98/30.43  %    Propositional solver time         : 0.869
% 206.98/30.43  %    Success case prop preproc time    : 0.000
% 206.98/30.43  %    Success case prop encoding time   : 0.000
% 206.98/30.43  %    Success case prop solver time     : 0.000
% 206.98/30.43  % Current number of processed clauses  : 4845
% 206.98/30.43  %    Positive orientable unit clauses  : 671
% 206.98/30.43  %    Positive unorientable unit clauses: 23
% 206.98/30.43  %    Negative unit clauses             : 112
% 206.98/30.43  %    Non-unit-clauses                  : 4039
% 206.98/30.43  % Current number of unprocessed clauses: 1096749
% 206.98/30.43  % ...number of literals in the above   : 4018136
% 206.98/30.43  % Current number of archived formulas  : 0
% 206.98/30.43  % Current number of archived clauses   : 1366
% 206.98/30.43  % Clause-clause subsumption calls (NU) : 4708644
% 206.98/30.43  % Rec. Clause-clause subsumption calls : 2975051
% 206.98/30.43  % Non-unit clause-clause subsumptions  : 25650
% 206.98/30.43  % Unit Clause-clause subsumption calls : 420943
% 206.98/30.43  % Rewrite failures with RHS unbound    : 89
% 206.98/30.43  % BW rewrite match attempts            : 6675
% 206.98/30.43  % BW rewrite match successes           : 230
% 206.98/30.43  % Condensation attempts                : 0
% 206.98/30.43  % Condensation successes               : 0
% 206.98/30.43  % Termbank termtop insertions          : 32207163
% 206.98/30.43  % Search garbage collected termcells   : 5554
% 206.98/30.43  
% 206.98/30.43  % -------------------------------------------------
% 206.98/30.43  % User time                : 28.541 s
% 206.98/30.43  % System time              : 0.888 s
% 206.98/30.43  % Total time               : 29.430 s
% 206.98/30.43  % Maximum resident set size: 5688 pages
% 206.98/30.43  
% 206.98/30.43  % -------------------------------------------------
% 206.98/30.43  % User time                : 114.498 s
% 206.98/30.43  % System time              : 2.839 s
% 206.98/30.43  % Total time               : 117.337 s
% 206.98/30.43  % Maximum resident set size: 5376 pages
% 206.98/30.43  % E exiting
%------------------------------------------------------------------------------