↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ALG251^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n002.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 07:44:44 AM UTC 2026

% Result   : Theorem 0.30s 0.41s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   98 (  20 equ;   0 cnn)
%            Maximal formula atoms :   15 (   2 avg)
%            Number of connectives :  457 (  33   ~;  32   |;  12   &; 322   @)
%                                         (  13 <=>;  45  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   34 (   7 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   27 (  27   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   23 (  21 usr;  14 con; 0-4 aty)
%            Number of variables   :  129 (   8   ^; 117   !;   4   ?; 129   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    term: $tType ).

thf(decl_sort2,type,
    subst: $tType ).

thf(decl_23,type,
    one: term ).

thf(decl_26,type,
    sub: term > subst > term ).

thf(decl_28,type,
    sh: subst ).

thf(decl_29,type,
    push: term > subst > subst ).

thf(decl_30,type,
    comp: subst > subst > subst ).

thf(decl_31,type,
    var: term > $o ).

thf(decl_46,type,
    ulamvar1: $o ).

thf(decl_72,type,
    ulamvarind: $o ).

thf(decl_83,type,
    axclos: $o ).

thf(decl_86,type,
    pushprop_lthm: $o ).

thf(decl_93,type,
    axvarcons: $o ).

thf(decl_101,type,
    pushprop_lem0: $o ).

thf(decl_117,type,
    pushprop: $o ).

thf(decl_137,type,
    axshiftcons: $o ).

thf(decl_142,type,
    pushprop_p_and_p_prime: term > subst > ( term > $o ) > ( term > $o ) > $o ).

thf(decl_145,type,
    epred1_3: ( term > $o ) > term > subst > term > $o ).

thf(decl_146,type,
    esk1_1: ( term > $o ) > term ).

thf(decl_147,type,
    epred2_0: term > $o ).

thf(decl_148,type,
    esk2_0: term ).

thf(decl_149,type,
    esk3_0: subst ).

thf(decl_150,type,
    esk4_0: term ).

thf(pushprop_p_and_p_prime,axiom,
    ( pushprop_p_and_p_prime
    = ( ^ [X1: term,X3: subst,X6: term > $o,X9: term > $o] :
        ! [X10: term] :
          ( ( X9 @ X10 )
        <=> ( X6 @ ( sub @ X10 @ ( push @ X1 @ X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',pushprop_p_and_p_prime) ).

thf(pushprop_lem0,axiom,
    ( pushprop_lem0
  <=> ! [X6: term > $o,X1: term,X3: subst] :
      ? [X9: term > $o] : ( pushprop_p_and_p_prime @ X1 @ X3 @ X6 @ X9 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',pushprop_lem0) ).

thf(thm,conjecture,
    pushprop_lthm,
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',thm) ).

thf(pushprop_lthm,axiom,
    ( pushprop_lthm
  <=> ( pushprop_lem0
     => ( ulamvar1
       => ( axvarcons
         => ( axclos
           => ( axshiftcons
             => ( ulamvarind
               => pushprop ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',pushprop_lthm) ).

thf(axvarcons,axiom,
    ( axvarcons
  <=> ! [X1: term,X3: subst] :
        ( ( sub @ one @ ( push @ X1 @ X3 ) )
        = X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',axvarcons) ).

thf(axclos,axiom,
    ( axclos
  <=> ! [X1: term,X3: subst,X4: subst] :
        ( ( sub @ ( sub @ X1 @ X3 ) @ X4 )
        = ( sub @ X1 @ ( comp @ X3 @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',axclos) ).

thf(axshiftcons,axiom,
    ( axshiftcons
  <=> ! [X1: term,X3: subst] :
        ( ( comp @ sh @ ( push @ X1 @ X3 ) )
        = X3 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',axshiftcons) ).

thf(ulamvar1,axiom,
    ( ulamvar1
  <=> ( var @ one ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',ulamvar1) ).

thf(ulamvarind,axiom,
    ( ulamvarind
  <=> ! [X6: term > $o] :
        ( ( X6 @ one )
       => ( ! [X1: term] :
              ( ( var @ X1 )
             => ( ( X6 @ X1 )
               => ( X6 @ ( sub @ X1 @ sh ) ) ) )
         => ! [X1: term] :
              ( ( var @ X1 )
             => ( X6 @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',ulamvarind) ).

thf(pushprop,axiom,
    ( pushprop
  <=> ! [X6: term > $o,X1: term,X3: subst] :
        ( ! [X2: term] :
            ( ( var @ X2 )
           => ( X6 @ ( sub @ X2 @ X3 ) ) )
       => ( ( X6 @ X1 )
         => ! [X2: term] :
              ( ( var @ X2 )
             => ( X6 @ ( sub @ X2 @ ( push @ X1 @ X3 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p',pushprop) ).

thf(c_0_10,plain,
    ( pushprop_p_and_p_prime
    = ( ^ [Z0: term,Z1: subst,Z2: term > $o,Z3: term > $o] :
        ! [X10: term] :
          ( ( Z3 @ X10 )
        <=> ( Z2 @ ( sub @ X10 @ ( push @ Z0 @ Z1 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[pushprop_p_and_p_prime]) ).

thf(c_0_11,axiom,
    ( pushprop_lem0
    = ( ! [X6: term > $o,X1: term,X3: subst] :
        ? [X9: term > $o] :
        ! [X2062: term] :
          ( ( X9 @ X2062 )
        <=> ( X6 @ ( sub @ X2062 @ ( push @ X1 @ X3 ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[pushprop_lem0,c_0_10]) ).

thf(c_0_12,negated_conjecture,
    ~ pushprop_lthm,
    inference(assume_negation,[status(cth)],[thm]) ).

thf(c_0_13,axiom,
    ( pushprop_lthm
    = ( ! [X1859: term > $o,X1860: term,X1861: subst] :
        ? [X1862: term > $o] :
        ! [X1863: term] :
          ( ( X1862 @ X1863 )
        <=> ( X1859 @ ( sub @ X1863 @ ( push @ X1860 @ X1861 ) ) ) )
     => ( ( var @ one )
       => ( ! [X1864: term,X1865: subst] :
              ( ( sub @ one @ ( push @ X1864 @ X1865 ) )
              = X1864 )
         => ( ! [X1866: term,X1867: subst,X1868: subst] :
                ( ( sub @ ( sub @ X1866 @ X1867 ) @ X1868 )
                = ( sub @ X1866 @ ( comp @ X1867 @ X1868 ) ) )
           => ( ! [X1869: term,X1870: subst] :
                  ( ( comp @ sh @ ( push @ X1869 @ X1870 ) )
                  = X1870 )
             => ( ! [X1871: term > $o] :
                    ( ( X1871 @ one )
                   => ( ! [X1872: term] :
                          ( ( var @ X1872 )
                         => ( ( X1871 @ X1872 )
                           => ( X1871 @ ( sub @ X1872 @ sh ) ) ) )
                     => ! [X1873: term] :
                          ( ( var @ X1873 )
                         => ( X1871 @ X1873 ) ) ) )
               => ! [X1874: term > $o,X1875: term,X1876: subst] :
                    ( ! [X1877: term] :
                        ( ( var @ X1877 )
                       => ( X1874 @ ( sub @ X1877 @ X1876 ) ) )
                   => ( ( X1874 @ X1875 )
                     => ! [X1878: term] :
                          ( ( var @ X1878 )
                         => ( X1874 @ ( sub @ X1878 @ ( push @ X1875 @ X1876 ) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pushprop_lthm,axvarcons]),axclos]),axshiftcons]),ulamvar1]),ulamvarind]),c_0_10]),c_0_11]),pushprop]) ).

thf(c_0_14,negated_conjecture,
    ~ ( ! [X3373: term > $o,X3374: term,X3375: subst] :
        ? [X3376: term > $o] :
        ! [X3377: term] :
          ( ( X3376 @ X3377 )
        <=> ( X3373 @ ( sub @ X3377 @ ( push @ X3374 @ X3375 ) ) ) )
     => ( ( var @ one )
       => ( ! [X3378: term,X3379: subst] :
              ( ( sub @ one @ ( push @ X3378 @ X3379 ) )
              = X3378 )
         => ( ! [X3380: term,X3381: subst,X3382: subst] :
                ( ( sub @ ( sub @ X3380 @ X3381 ) @ X3382 )
                = ( sub @ X3380 @ ( comp @ X3381 @ X3382 ) ) )
           => ( ! [X3383: term,X3384: subst] :
                  ( ( comp @ sh @ ( push @ X3383 @ X3384 ) )
                  = X3384 )
             => ( ! [X3385: term > $o] :
                    ( ( X3385 @ one )
                   => ( ! [X3386: term] :
                          ( ( var @ X3386 )
                         => ( ( X3385 @ X3386 )
                           => ( X3385 @ ( sub @ X3386 @ sh ) ) ) )
                     => ! [X3387: term] :
                          ( ( var @ X3387 )
                         => ( X3385 @ X3387 ) ) ) )
               => ! [X3388: term > $o,X3389: term,X3390: subst] :
                    ( ! [X3391: term] :
                        ( ( var @ X3391 )
                       => ( X3388 @ ( sub @ X3391 @ X3390 ) ) )
                   => ( ( X3388 @ X3389 )
                     => ! [X3392: term] :
                          ( ( var @ X3392 )
                         => ( X3388 @ ( sub @ X3392 @ ( push @ X3389 @ X3390 ) ) ) ) ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).

thf(c_0_15,negated_conjecture,
    ! [X3405: term > $o,X3406: term,X3407: subst,X3409: term,X3410: term,X3411: term,X3412: subst,X3413: term,X3414: subst,X3415: subst,X3416: term,X3417: subst,X3418: term > $o,X3420: term,X3424: term] :
      ( ( ~ ( epred1_3 @ X3405 @ X3406 @ X3407 @ X3409 )
        | ( X3405 @ ( sub @ X3409 @ ( push @ X3406 @ X3407 ) ) ) )
      & ( ~ ( X3405 @ ( sub @ X3410 @ ( push @ X3406 @ X3407 ) ) )
        | ( epred1_3 @ X3405 @ X3406 @ X3407 @ X3410 ) )
      & ( var @ one )
      & ( ( sub @ one @ ( push @ X3411 @ X3412 ) )
        = X3411 )
      & ( ( sub @ ( sub @ X3413 @ X3414 ) @ X3415 )
        = ( sub @ X3413 @ ( comp @ X3414 @ X3415 ) ) )
      & ( ( comp @ sh @ ( push @ X3416 @ X3417 ) )
        = X3417 )
      & ( ( var @ ( esk1_1 @ X3418 ) )
        | ~ ( var @ X3420 )
        | ( X3418 @ X3420 )
        | ~ ( X3418 @ one ) )
      & ( ( X3418 @ ( esk1_1 @ X3418 ) )
        | ~ ( var @ X3420 )
        | ( X3418 @ X3420 )
        | ~ ( X3418 @ one ) )
      & ( ~ ( X3418 @ ( sub @ ( esk1_1 @ X3418 ) @ sh ) )
        | ~ ( var @ X3420 )
        | ( X3418 @ X3420 )
        | ~ ( X3418 @ one ) )
      & ( ~ ( var @ X3424 )
        | ( epred2_0 @ ( sub @ X3424 @ esk3_0 ) ) )
      & ( epred2_0 @ esk2_0 )
      & ( var @ esk4_0 )
      & ~ ( epred2_0 @ ( sub @ esk4_0 @ ( push @ esk2_0 @ esk3_0 ) ) ) ),
    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)],[c_0_14])])])])])])]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: term,X3: subst,X4: subst] :
      ( ( sub @ ( sub @ X1 @ X3 ) @ X4 )
      = ( sub @ X1 @ ( comp @ X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_17,negated_conjecture,
    ! [X1: term,X3: subst] :
      ( ( comp @ sh @ ( push @ X1 @ X3 ) )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_18,negated_conjecture,
    ! [X6: term > $o,X1: term,X2: term,X3: subst] :
      ( ( epred1_3 @ X6 @ X2 @ X3 @ X1 )
      | ~ ( X6 @ ( sub @ X1 @ ( push @ X2 @ X3 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_19,negated_conjecture,
    ! [X1: term,X2: term,X3: subst] :
      ( ( sub @ ( sub @ X1 @ sh ) @ ( push @ X2 @ X3 ) )
      = ( sub @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

thf(c_0_20,negated_conjecture,
    ! [X1: term,X6: term > $o] :
      ( ( X6 @ X1 )
      | ~ ( X6 @ ( sub @ ( esk1_1 @ X6 ) @ sh ) )
      | ~ ( var @ X1 )
      | ~ ( X6 @ one ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_21,negated_conjecture,
    ! [X6: term > $o,X1: term,X2: term,X3: subst] :
      ( ( epred1_3 @ X6 @ X1 @ X3 @ ( sub @ X2 @ sh ) )
      | ~ ( X6 @ ( sub @ X2 @ X3 ) ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_22,negated_conjecture,
    ! [X6: term > $o,X1: term,X3: subst,X2: term] :
      ( ( epred1_3 @ X6 @ X1 @ X3 @ X2 )
      | ~ ( X6 @ ( sub @ ( esk1_1 @ ( epred1_3 @ X6 @ X1 @ X3 ) ) @ X3 ) )
      | ~ ( epred1_3 @ X6 @ X1 @ X3 @ one )
      | ~ ( var @ X2 ) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

thf(c_0_23,negated_conjecture,
    ! [X1: term] :
      ( ( epred2_0 @ ( sub @ X1 @ esk3_0 ) )
      | ~ ( var @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_24,negated_conjecture,
    ! [X1: term,X6: term > $o] :
      ( ( var @ ( esk1_1 @ X6 ) )
      | ( X6 @ X1 )
      | ~ ( var @ X1 )
      | ~ ( X6 @ one ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_25,negated_conjecture,
    ! [X3: subst,X1: term] :
      ( ( sub @ one @ ( push @ X1 @ X3 ) )
      = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_26,negated_conjecture,
    ! [X1: term,X2: term] :
      ( ( epred1_3 @ epred2_0 @ X1 @ esk3_0 @ X2 )
      | ~ ( epred1_3 @ epred2_0 @ X1 @ esk3_0 @ one )
      | ~ ( var @ X2 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

thf(c_0_27,negated_conjecture,
    ! [X6: term > $o,X3: subst,X1: term] :
      ( ( epred1_3 @ X6 @ X1 @ X3 @ one )
      | ~ ( X6 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_25]) ).

thf(c_0_28,negated_conjecture,
    ! [X6: term > $o,X1: term,X3: subst,X2: term] :
      ( ( X6 @ ( sub @ X2 @ ( push @ X1 @ X3 ) ) )
      | ~ ( epred1_3 @ X6 @ X1 @ X3 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_29,negated_conjecture,
    ! [X2: term,X1: term] :
      ( ( epred1_3 @ epred2_0 @ X1 @ esk3_0 @ X2 )
      | ~ ( var @ X2 )
      | ~ ( epred2_0 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

thf(c_0_30,negated_conjecture,
    ~ ( epred2_0 @ ( sub @ esk4_0 @ ( push @ esk2_0 @ esk3_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_31,negated_conjecture,
    ! [X1: term,X2: term] :
      ( ( epred2_0 @ ( sub @ X1 @ ( push @ X2 @ esk3_0 ) ) )
      | ~ ( var @ X1 )
      | ~ ( epred2_0 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

thf(c_0_32,negated_conjecture,
    var @ esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_33,negated_conjecture,
    epred2_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG251^2 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  % Computer : n002.cluster.edu
% 0.08/0.22  % Model    : x86_64 x86_64
% 0.08/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22  % Memory   : 8046.5625MB
% 0.08/0.22  % OS       : Linux 6.8.0-71-generic
% 0.08/0.22  % CPULimit : 300
% 0.08/0.22  % WCLimit  : 300
% 0.08/0.22  % DateTime : Tue Sep 29 17:35:07 UTC 2026
% 0.08/0.22  % CPUTime  : 
% 0.08/0.22  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.29  Running higher-order theorem proving
% 0.22/0.32  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.FHi72GNhvB/E---3.1_1611621.p
% 0.30/0.41  % Version: 3.5.1-ho
% 0.30/0.41  % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.30/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.41  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.30/0.41  % Starting post_as_ho1 with 300s (1) cores
% 0.30/0.41  % Starting post_as_ho5 with 300s (1) cores
% 0.30/0.41  % Starting post_as_ho10 with 300s (1) cores
% 0.30/0.41  % new_ho_10_cnf2 with pid 1611634 completed with status 0
% 0.30/0.41  % Result found by new_ho_10_cnf2
% 0.30/0.41  % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.30/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.41  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.30/0.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.41  % No SInE strategy applied
% 0.30/0.41  % Search class: HGUSM-FFSS32-SHFMMSBN
% 0.30/0.41  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.41  % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.41  % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.30/0.41  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.30/0.41  % Starting sh5l with 136s (1) cores
% 0.30/0.41  % Starting ehoh_best_sine with 136s (1) cores
% 0.30/0.41  % SubtermCWHack with pid 1611640 completed with status 0
% 0.30/0.41  % Result found by SubtermCWHack
% 0.30/0.41  % Preprocessing class: HSMMSLSSLLLNHFA.
% 0.30/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.41  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.30/0.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.41  % No SInE strategy applied
% 0.30/0.41  % Search class: HGUSM-FFSS32-SHFMMSBN
% 0.30/0.41  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.41  % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.41  % Preprocessing time       : 0.002 s
% 0.30/0.41  
% 0.30/0.41  % Proof found!
% 0.30/0.41  % SZS status Theorem
% 0.30/0.41  % SZS output start CNFRefutation
% See solution above
% 0.30/0.41  % Parsed axioms                        : 238
% 0.30/0.41  % Removed by relevancy pruning/SinE    : 0
% 0.30/0.41  % Initial clauses                      : 139
% 0.30/0.41  % Removed in clause preprocessing      : 124
% 0.30/0.41  % Initial clauses in saturation        : 15
% 0.30/0.41  % Processed clauses                    : 81
% 0.30/0.41  % ...of these trivial                  : 0
% 0.30/0.41  % ...subsumed                          : 45
% 0.30/0.41  % ...remaining for further processing  : 36
% 0.30/0.41  % Other redundant clauses eliminated   : 0
% 0.30/0.41  % Clauses deleted for lack of memory   : 0
% 0.30/0.41  % Backward-subsumed                    : 0
% 0.30/0.41  % Backward-rewritten                   : 0
% 0.30/0.41  % Generated clauses                    : 101
% 0.30/0.41  % ...of the previous two non-redundant : 82
% 0.30/0.41  % ...aggressively subsumed             : 0
% 0.30/0.41  % Contextual simplify-reflections      : 1
% 0.30/0.41  % Paramodulations                      : 101
% 0.30/0.41  % Factorizations                       : 0
% 0.30/0.41  % NegExts                              : 0
% 0.30/0.41  % Equation resolutions                 : 0
% 0.30/0.41  % Disequality decompositions           : 0
% 0.30/0.41  % Total rewrite steps                  : 23
% 0.30/0.41  % ...of those cached                   : 9
% 0.30/0.41  % Propositional unsat checks           : 0
% 0.30/0.41  %    Propositional check models        : 0
% 0.30/0.41  %    Propositional check unsatisfiable : 0
% 0.30/0.41  %    Propositional clauses             : 0
% 0.30/0.41  %    Propositional clauses after purity: 0
% 0.30/0.41  %    Propositional unsat core size     : 0
% 0.30/0.41  %    Propositional preprocessing time  : 0.000
% 0.30/0.41  %    Propositional encoding time       : 0.000
% 0.30/0.41  %    Propositional solver time         : 0.000
% 0.30/0.41  %    Success case prop preproc time    : 0.000
% 0.30/0.41  %    Success case prop encoding time   : 0.000
% 0.30/0.41  %    Success case prop solver time     : 0.000
% 0.30/0.41  % Current number of processed clauses  : 36
% 0.30/0.41  %    Positive orientable unit clauses  : 10
% 0.30/0.41  %    Positive unorientable unit clauses: 7
% 0.30/0.41  %    Negative unit clauses             : 1
% 0.30/0.41  %    Non-unit-clauses                  : 18
% 0.30/0.41  % Current number of unprocessed clauses: 14
% 0.30/0.41  % ...number of literals in the above   : 62
% 0.30/0.41  % Current number of archived formulas  : 0
% 0.30/0.41  % Current number of archived clauses   : 0
% 0.30/0.41  % Clause-clause subsumption calls (NU) : 67
% 0.30/0.41  % Rec. Clause-clause subsumption calls : 42
% 0.30/0.41  % Non-unit clause-clause subsumptions  : 4
% 0.30/0.41  % Unit Clause-clause subsumption calls : 0
% 0.30/0.41  % Rewrite failures with RHS unbound    : 140
% 0.30/0.41  % BW rewrite match attempts            : 13
% 0.30/0.41  % BW rewrite match successes           : 8
% 0.30/0.41  % Condensation attempts                : 0
% 0.30/0.41  % Condensation successes               : 0
% 0.30/0.41  % Termbank termtop insertions          : 28899
% 0.30/0.41  % Search garbage collected termcells   : 2108
% 0.30/0.41  
% 0.30/0.41  % -------------------------------------------------
% 0.30/0.41  % User time                : 0.047 s
% 0.30/0.41  % System time              : 0.014 s
% 0.30/0.41  % Total time               : 0.061 s
% 0.30/0.41  % Maximum resident set size: 7820 pages
% 0.30/0.41  
% 0.30/0.41  % -------------------------------------------------
% 0.30/0.41  % User time                : 0.098 s
% 0.30/0.41  % System time              : 0.037 s
% 0.30/0.41  % Total time               : 0.135 s
% 0.30/0.41  % Maximum resident set size: 5120 pages
% 0.30/0.41  % E exiting
%------------------------------------------------------------------------------