↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n019.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 : Wed Sep 30 08:16:48 AM UTC 2026

% Result   : Theorem 1.38s 0.55s
% Output   : CNFRefutation 1.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   55 (  36 unt;   0 typ;   0 def)
%            Number of atoms       :  203 (  57 equ;   0 cnn)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  438 (  53   ~;  23   |;   9   &; 305   @)
%                                         (   0 <=>;  48  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   22 (  19 usr;   8 con; 0-3 aty)
%            Number of variables   :  122 (  86   ^;  36   !;   0   ?; 122   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    is_of: $i > ( $i > $o ) > $o ).

thf(decl_24,type,
    all_of: ( $i > $o ) > ( $i > $o ) > $o ).

thf(decl_26,type,
    in: $i > $i > $o ).

thf(decl_62,type,
    imp: $o > $o > $o ).

thf(decl_63,type,
    d_not: $o > $o ).

thf(decl_72,type,
    non: $i > ( $i > $o ) > $i > $o ).

thf(decl_73,type,
    l_some: $i > ( $i > $o ) > $o ).

thf(decl_78,type,
    e_is: $i > $i > $i > $o ).

thf(decl_124,type,
    nat: $i ).

thf(decl_125,type,
    n_is: $i > $i > $o ).

thf(decl_128,type,
    n_some: ( $i > $o ) > $o ).

thf(decl_143,type,
    n_pl: $i > $i > $i ).

thf(decl_148,type,
    diffprop: $i > $i > $i > $o ).

thf(decl_149,type,
    d_29_ii: $i > $i > $o ).

thf(decl_226,type,
    esk69_0: $i ).

thf(decl_227,type,
    esk70_0: $i ).

thf(decl_228,type,
    esk71_0: $i ).

thf(decl_229,type,
    esk72_0: $i ).

thf(decl_230,type,
    esk73_0: $i ).

thf(def_d_not,axiom,
    ( d_not
    = ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_d_not) ).

thf(def_imp,axiom,
    ( imp
    = ( ^ [X74: $o,X75: $o] :
          ( X74
         => X75 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_imp) ).

thf(def_all_of,axiom,
    ( all_of
    = ( ^ [X3: $i > $o,X2: $i > $o] :
        ! [X4: $i] :
          ( ( is_of @ X4 @ X3 )
         => ( X2 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_all_of) ).

thf(def_is_of,axiom,
    ( is_of
    = ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_is_of) ).

thf(def_non,axiom,
    ( non
    = ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_non) ).

thf(def_l_some,axiom,
    ( l_some
    = ( ^ [X1: $i,X2: $i > $o] :
          ( d_not
          @ ( all_of
            @ ^ [X4: $i] : ( in @ X4 @ X1 )
            @ ( non @ X1 @ X2 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_l_some) ).

thf(def_e_is,axiom,
    ( e_is
    = ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_e_is) ).

thf(def_diffprop,axiom,
    ( diffprop
    = ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_diffprop) ).

thf(def_n_is,axiom,
    ( n_is
    = ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_n_is) ).

thf(def_d_29_ii,axiom,
    ( d_29_ii
    = ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_d_29_ii) ).

thf(def_n_some,axiom,
    ( n_some
    = ( ^ [Z0: $i > $o] :
          ( ! [X455: $i] :
              ( ( in @ X455 @ nat )
             => ( ( Z0 @ X455 )
               => ~ $true ) )
         => ~ $true ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',def_n_some) ).

thf(satz19h,conjecture,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ nat )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X281: $i] : ( in @ X281 @ nat )
        @ ^ [X282: $i] :
            ( all_of
            @ ^ [X4: $i] : ( in @ X4 @ nat )
            @ ^ [X4: $i] :
                ( all_of
                @ ^ [X13: $i] : ( in @ X13 @ nat )
                @ ^ [X13: $i] :
                    ( ( n_is @ X1 @ X282 )
                   => ( ( d_29_ii @ X4 @ X13 )
                     => ( d_29_ii @ ( n_pl @ X4 @ X1 ) @ ( n_pl @ X13 @ X282 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',satz19h) ).

thf(satz6,axiom,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ nat )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X197: $i] : ( in @ X197 @ nat )
        @ ^ [X198: $i] : ( n_is @ ( n_pl @ X1 @ X198 ) @ ( n_pl @ X198 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',satz6) ).

thf(satz5,axiom,
    ( all_of
    @ ^ [X1: $i] : ( in @ X1 @ nat )
    @ ^ [X1: $i] :
        ( all_of
        @ ^ [X194: $i] : ( in @ X194 @ nat )
        @ ^ [X195: $i] :
            ( all_of
            @ ^ [X4: $i] : ( in @ X4 @ nat )
            @ ^ [X4: $i] : ( n_is @ ( n_pl @ ( n_pl @ X1 @ X195 ) @ X4 ) @ ( n_pl @ X1 @ ( n_pl @ X195 @ X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p',satz5) ).

thf(c_0_14,plain,
    ( d_not
    = ( ^ [Z0: $o] :
          ( Z0
         => ~ $true ) ) ),
    inference(fof_simplification,[status(thm)],[def_d_not]) ).

thf(c_0_15,plain,
    ( imp
    = ( ^ [Z0: $o,Z1: $o] :
          ( Z0
         => Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[def_imp]) ).

thf(c_0_16,plain,
    ( all_of
    = ( ^ [Z0: $i > $o,Z1: $i > $o] :
        ! [X4: $i] :
          ( ( Z0 @ X4 )
         => ( Z1 @ X4 ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_all_of]) ).

thf(c_0_17,plain,
    ( is_of
    = ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[def_is_of]) ).

thf(c_0_18,plain,
    ( non
    = ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
          ( ( Z1 @ Z2 )
         => ~ $true ) ) ),
    inference(fof_simplification,[status(thm)],[def_non]) ).

thf(c_0_19,plain,
    ( d_not
    = ( ^ [Z0: $o] :
          ( Z0
         => ~ $true ) ) ),
    inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).

thf(c_0_20,plain,
    ( l_some
    = ( ^ [Z0: $i,Z1: $i > $o] :
          ( ! [X428: $i] :
              ( ( in @ X428 @ Z0 )
             => ( ( Z1 @ X428 )
               => ~ $true ) )
         => ~ $true ) ) ),
    inference(fof_simplification,[status(thm)],[def_l_some]) ).

thf(c_0_21,plain,
    ( all_of
    = ( ^ [Z0: $i > $o,Z1: $i > $o] :
        ! [X4: $i] :
          ( ( Z0 @ X4 )
         => ( Z1 @ X4 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_16,c_0_17]) ).

thf(c_0_22,plain,
    ( non
    = ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
          ( ( Z1 @ Z2 )
         => ~ $true ) ) ),
    inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_23,plain,
    ( e_is
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
    inference(fof_simplification,[status(thm)],[def_e_is]) ).

thf(c_0_24,plain,
    ( l_some
    = ( ^ [Z0: $i,Z1: $i > $o] :
          ( ! [X428: $i] :
              ( ( in @ X428 @ Z0 )
             => ( ( Z1 @ X428 )
               => ~ $true ) )
         => ~ $true ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_21]),c_0_19]),c_0_22]) ).

thf(c_0_25,plain,
    ( diffprop
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] :
          ( Z0
          = ( n_pl @ Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[def_diffprop]) ).

thf(c_0_26,axiom,
    ( n_is
    = ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
    inference(apply_def,[status(thm)],[def_n_is,c_0_23]) ).

thf(c_0_27,plain,
    ( d_29_ii
    = ( ^ [Z0: $i,Z1: $i] :
          ( ! [X466: $i] :
              ( ( in @ X466 @ nat )
             => ( ( Z0
                  = ( n_pl @ Z1 @ X466 ) )
               => ~ $true ) )
         => ~ $true ) ) ),
    inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).

thf(c_0_28,axiom,
    ( n_some
    = ( ^ [Z0: $i > $o] :
          ( ! [X455: $i] :
              ( ( in @ X455 @ nat )
             => ( ( Z0 @ X455 )
               => ~ $true ) )
         => ~ $true ) ) ),
    inference(apply_def,[status(thm)],[def_n_some,c_0_24]) ).

thf(c_0_29,plain,
    ( diffprop
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] :
          ( Z0
          = ( n_pl @ Z1 @ Z2 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_25,c_0_26]) ).

thf(c_0_30,negated_conjecture,
    ~ ( all_of
      @ ^ [X1: $i] : ( in @ X1 @ nat )
      @ ^ [X1: $i] :
          ( all_of
          @ ^ [X281: $i] : ( in @ X281 @ nat )
          @ ^ [X282: $i] :
              ( all_of
              @ ^ [X4: $i] : ( in @ X4 @ nat )
              @ ^ [X4: $i] :
                  ( all_of
                  @ ^ [X13: $i] : ( in @ X13 @ nat )
                  @ ^ [X13: $i] :
                      ( ( n_is @ X1 @ X282 )
                     => ( ( d_29_ii @ X4 @ X13 )
                       => ( d_29_ii @ ( n_pl @ X4 @ X1 ) @ ( n_pl @ X13 @ X282 ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[satz19h]) ).

thf(c_0_31,plain,
    ( d_29_ii
    = ( ^ [Z0: $i,Z1: $i] :
          ( ! [X466: $i] :
              ( ( in @ X466 @ nat )
             => ( ( Z0
                  = ( n_pl @ Z1 @ X466 ) )
               => ~ $true ) )
         => ~ $true ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

thf(c_0_32,negated_conjecture,
    ~ ! [X751: $i] :
        ( ( in @ X751 @ nat )
       => ! [X750: $i] :
            ( ( in @ X750 @ nat )
           => ! [X749: $i] :
                ( ( in @ X749 @ nat )
               => ! [X748: $i] :
                    ( ( in @ X748 @ nat )
                   => ( ( X751 = X750 )
                     => ( ( ! [X746: $i] :
                              ( ( in @ X746 @ nat )
                             => ( ( X749
                                  = ( n_pl @ X748 @ X746 ) )
                               => ~ $true ) )
                         => ~ $true )
                       => ( ! [X747: $i] :
                              ( ( in @ X747 @ nat )
                             => ( ( ( n_pl @ X749 @ X751 )
                                  = ( n_pl @ ( n_pl @ X748 @ X750 ) @ X747 ) )
                               => ~ $true ) )
                         => ~ $true ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_30]),c_0_21]),c_0_26]),c_0_31]) ).

thf(c_0_33,negated_conjecture,
    ! [X1413: $i] :
      ( ( in @ esk69_0 @ nat )
      & ( in @ esk70_0 @ nat )
      & ( in @ esk71_0 @ nat )
      & ( in @ esk72_0 @ nat )
      & ( esk69_0 = esk70_0 )
      & ( ( in @ esk73_0 @ nat )
        | ~ $true )
      & ( ( esk71_0
          = ( n_pl @ esk72_0 @ esk73_0 ) )
        | ~ $true )
      & ( $true
        | ~ $true )
      & ( ~ ( in @ X1413 @ nat )
        | ( ( n_pl @ esk71_0 @ esk69_0 )
         != ( n_pl @ ( n_pl @ esk72_0 @ esk70_0 ) @ X1413 ) )
        | ~ $true )
      & $true ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])])])]) ).

thf(c_0_34,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( in @ X1 @ nat )
      | ( ( n_pl @ esk71_0 @ esk69_0 )
       != ( n_pl @ ( n_pl @ esk72_0 @ esk70_0 ) @ X1 ) )
      | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_35,plain,
    ! [X583: $i] :
      ( ( in @ X583 @ nat )
     => ! [X582: $i] :
          ( ( in @ X582 @ nat )
         => ( ( n_pl @ X583 @ X582 )
            = ( n_pl @ X582 @ X583 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]),c_0_21]),c_0_26]) ).

thf(c_0_36,negated_conjecture,
    ! [X1: $i] :
      ( ( ( n_pl @ esk71_0 @ esk69_0 )
       != ( n_pl @ ( n_pl @ esk72_0 @ esk70_0 ) @ X1 ) )
      | ~ ( in @ X1 @ nat ) ),
    inference(cn,[status(thm)],[c_0_34]) ).

thf(c_0_37,negated_conjecture,
    esk69_0 = esk70_0,
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_38,plain,
    ! [X1232: $i,X1233: $i] :
      ( ~ ( in @ X1232 @ nat )
      | ~ ( in @ X1233 @ nat )
      | ( ( n_pl @ X1232 @ X1233 )
        = ( n_pl @ X1233 @ X1232 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).

thf(c_0_39,plain,
    ! [X581: $i] :
      ( ( in @ X581 @ nat )
     => ! [X580: $i] :
          ( ( in @ X580 @ nat )
         => ! [X579: $i] :
              ( ( in @ X579 @ nat )
             => ( ( n_pl @ ( n_pl @ X581 @ X580 ) @ X579 )
                = ( n_pl @ X581 @ ( n_pl @ X580 @ X579 ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]),c_0_21]),c_0_26]) ).

thf(c_0_40,negated_conjecture,
    ! [X1: $i] :
      ( ( ( n_pl @ ( n_pl @ esk72_0 @ esk69_0 ) @ X1 )
       != ( n_pl @ esk71_0 @ esk69_0 ) )
      | ~ ( in @ X1 @ nat ) ),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

thf(c_0_41,plain,
    ! [X1: $i,X4: $i] :
      ( ( ( n_pl @ X1 @ X4 )
        = ( n_pl @ X4 @ X1 ) )
      | ~ ( in @ X1 @ nat )
      | ~ ( in @ X4 @ nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

thf(c_0_42,negated_conjecture,
    in @ esk72_0 @ nat,
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_43,negated_conjecture,
    in @ esk69_0 @ nat,
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_44,plain,
    ! [X1229: $i,X1230: $i,X1231: $i] :
      ( ~ ( in @ X1229 @ nat )
      | ~ ( in @ X1230 @ nat )
      | ~ ( in @ X1231 @ nat )
      | ( ( n_pl @ ( n_pl @ X1229 @ X1230 ) @ X1231 )
        = ( n_pl @ X1229 @ ( n_pl @ X1230 @ X1231 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])]) ).

thf(c_0_45,negated_conjecture,
    ! [X1: $i] :
      ( ( ( n_pl @ ( n_pl @ esk69_0 @ esk72_0 ) @ X1 )
       != ( n_pl @ esk71_0 @ esk69_0 ) )
      | ~ ( in @ X1 @ nat ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).

thf(c_0_46,plain,
    ! [X1: $i,X4: $i,X5: $i] :
      ( ( ( n_pl @ ( n_pl @ X1 @ X4 ) @ X5 )
        = ( n_pl @ X1 @ ( n_pl @ X4 @ X5 ) ) )
      | ~ ( in @ X1 @ nat )
      | ~ ( in @ X4 @ nat )
      | ~ ( in @ X5 @ nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

thf(c_0_47,negated_conjecture,
    ( ( esk71_0
      = ( n_pl @ esk72_0 @ esk73_0 ) )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_48,negated_conjecture,
    ( ( in @ esk73_0 @ nat )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_49,negated_conjecture,
    ! [X1: $i] :
      ( ( ( n_pl @ esk69_0 @ ( n_pl @ esk72_0 @ X1 ) )
       != ( n_pl @ esk71_0 @ esk69_0 ) )
      | ~ ( in @ X1 @ nat ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42]),c_0_43])]) ).

thf(c_0_50,negated_conjecture,
    ( esk71_0
    = ( n_pl @ esk72_0 @ esk73_0 ) ),
    inference(cn,[status(thm)],[c_0_47]) ).

thf(c_0_51,negated_conjecture,
    in @ esk73_0 @ nat,
    inference(cn,[status(thm)],[c_0_48]) ).

thf(c_0_52,negated_conjecture,
    ( ( n_pl @ esk71_0 @ esk69_0 )
   != ( n_pl @ esk69_0 @ esk71_0 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).

thf(c_0_53,negated_conjecture,
    in @ esk71_0 @ nat,
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_43]),c_0_53])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM677^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.18  % Computer : n019.cluster.edu
% 0.06/0.18  % Model    : x86_64 x86_64
% 0.06/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18  % Memory   : 8046.5625MB
% 0.06/0.18  % OS       : Linux 6.8.0-71-generic
% 0.06/0.18  % CPULimit : 300
% 0.06/0.18  % WCLimit  : 300
% 0.06/0.18  % DateTime : Tue Sep 29 12:36:03 UTC 2026
% 0.06/0.18  % CPUTime  : 
% 0.06/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.23  Running higher-order theorem proving
% 0.22/0.27  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.gDEMW7WXll/E---3.1_693692.p
% 1.38/0.55  % Version: 3.5.1-ho
% 1.38/0.55  % Preprocessing class: HSLMSMSSLLLCHSA.
% 1.38/0.55  % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.55  % Starting lpo1_fix with 900s (3) cores
% 1.38/0.55  % Starting full_lambda_9 with 300s (1) cores
% 1.38/0.55  % Starting almost_fo_4 with 300s (1) cores
% 1.38/0.55  % Starting new_ho_9 with 300s (1) cores
% 1.38/0.55  % Starting pre_casc_4 with 300s (1) cores
% 1.38/0.55  % Starting ho_unfolding_6 with 300s (1) cores
% 1.38/0.55  % lpo1_fix with pid 693705 completed with status 0
% 1.38/0.55  % Result found by lpo1_fix
% 1.38/0.55  % Preprocessing class: HSLMSMSSLLLCHSA.
% 1.38/0.55  % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.55  % Starting lpo1_fix with 900s (3) cores
% 1.38/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.38/0.55  % No SInE strategy applied
% 1.38/0.55  % Search class: HGHSM-FSLM32-MHSMMSBN
% 1.38/0.55  % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 1.38/0.55  % Starting SubtermCWHack with 91s (1) cores
% 1.38/0.55  % Starting full_lambda_5 with 82s (1) cores
% 1.38/0.55  % Starting new_ho_6 with 82s (1) cores
% 1.38/0.55  % full_lambda_5 with pid 693715 completed with status 0
% 1.38/0.55  % Result found by full_lambda_5
% 1.38/0.55  % Preprocessing class: HSLMSMSSLLLCHSA.
% 1.38/0.55  % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.55  % Starting lpo1_fix with 900s (3) cores
% 1.38/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.38/0.55  % No SInE strategy applied
% 1.38/0.55  % Search class: HGHSM-FSLM32-MHSMMSBN
% 1.38/0.55  % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 1.38/0.55  % Starting SubtermCWHack with 91s (1) cores
% 1.38/0.55  % Starting full_lambda_5 with 82s (1) cores
% 1.38/0.55  % Preprocessing time       : 0.012 s
% 1.38/0.55  % Presaturation interreduction done
% 1.38/0.55  
% 1.38/0.55  % Proof found!
% 1.38/0.55  % SZS status Theorem
% 1.38/0.55  % SZS output start CNFRefutation
% See solution above
% 1.38/0.55  % Parsed axioms                        : 376
% 1.38/0.55  % Removed by relevancy pruning/SinE    : 0
% 1.38/0.55  % Initial clauses                      : 904
% 1.38/0.55  % Removed in clause preprocessing      : 511
% 1.38/0.55  % Initial clauses in saturation        : 393
% 1.38/0.55  % Processed clauses                    : 816
% 1.38/0.55  % ...of these trivial                  : 6
% 1.38/0.55  % ...subsumed                          : 66
% 1.38/0.55  % ...remaining for further processing  : 744
% 1.38/0.55  % Other redundant clauses eliminated   : 205
% 1.38/0.55  % Clauses deleted for lack of memory   : 0
% 1.38/0.55  % Backward-subsumed                    : 7
% 1.38/0.55  % Backward-rewritten                   : 7
% 1.38/0.55  % Generated clauses                    : 2315
% 1.38/0.55  % ...of the previous two non-redundant : 2160
% 1.38/0.55  % ...aggressively subsumed             : 0
% 1.38/0.55  % Contextual simplify-reflections      : 14
% 1.38/0.55  % Paramodulations                      : 1982
% 1.38/0.55  % Factorizations                       : 2
% 1.38/0.55  % NegExts                              : 8
% 1.38/0.55  % Equation resolutions                 : 208
% 1.38/0.55  % Disequality decompositions           : 0
% 1.38/0.55  % Total rewrite steps                  : 431
% 1.38/0.55  % ...of those cached                   : 313
% 1.38/0.55  % Propositional unsat checks           : 0
% 1.38/0.55  %    Propositional check models        : 0
% 1.38/0.55  %    Propositional check unsatisfiable : 0
% 1.38/0.55  %    Propositional clauses             : 0
% 1.38/0.55  %    Propositional clauses after purity: 0
% 1.38/0.55  %    Propositional unsat core size     : 0
% 1.38/0.55  %    Propositional preprocessing time  : 0.000
% 1.38/0.55  %    Propositional encoding time       : 0.000
% 1.38/0.55  %    Propositional solver time         : 0.000
% 1.38/0.55  %    Success case prop preproc time    : 0.000
% 1.38/0.55  %    Success case prop encoding time   : 0.000
% 1.38/0.55  %    Success case prop solver time     : 0.000
% 1.38/0.55  % Current number of processed clauses  : 296
% 1.38/0.55  %    Positive orientable unit clauses  : 100
% 1.38/0.55  %    Positive unorientable unit clauses: 4
% 1.38/0.55  %    Negative unit clauses             : 22
% 1.38/0.55  %    Non-unit-clauses                  : 170
% 1.38/0.55  % Current number of unprocessed clauses: 2089
% 1.38/0.55  % ...number of literals in the above   : 6230
% 1.38/0.55  % Current number of archived formulas  : 0
% 1.38/0.55  % Current number of archived clauses   : 368
% 1.38/0.55  % Clause-clause subsumption calls (NU) : 51369
% 1.38/0.55  % Rec. Clause-clause subsumption calls : 11614
% 1.38/0.55  % Non-unit clause-clause subsumptions  : 72
% 1.38/0.55  % Unit Clause-clause subsumption calls : 1937
% 1.38/0.55  % Rewrite failures with RHS unbound    : 0
% 1.38/0.55  % BW rewrite match attempts            : 101
% 1.38/0.55  % BW rewrite match successes           : 23
% 1.38/0.55  % Condensation attempts                : 0
% 1.38/0.55  % Condensation successes               : 0
% 1.38/0.55  % Termbank termtop insertions          : 147660
% 1.38/0.55  % Search garbage collected termcells   : 32897
% 1.38/0.55  
% 1.38/0.55  % -------------------------------------------------
% 1.38/0.55  % User time                : 0.202 s
% 1.38/0.55  % System time              : 0.022 s
% 1.38/0.55  % Total time               : 0.225 s
% 1.38/0.55  % Maximum resident set size: 8580 pages
% 1.38/0.55  
% 1.38/0.55  % -------------------------------------------------
% 1.38/0.55  % User time                : 0.496 s
% 1.38/0.55  % System time              : 0.054 s
% 1.38/0.55  % Total time               : 0.550 s
% 1.38/0.55  % Maximum resident set size: 5376 pages
% 1.38/0.55  % E exiting
%------------------------------------------------------------------------------