↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET646+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 02:14:52 PM UTC 2026

% Result   : Theorem 0.12s 0.46s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   48 (   9 unt;   0 def)
%            Number of atoms       :  237 (  15 equ)
%            Maximal formula atoms :   31 (   4 avg)
%            Number of connectives :  309 ( 120   ~; 121   |;  27   &)
%                                         (   7 <=>;  34  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   5 con; 0-2 aty)
%            Number of variables   :  103 (   3 sgn  53   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p19,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ilf_type(X2,set_type)
            & ~ empty(X2) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p19) ).

fof(p18,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( ilf_type(power_set(X1),set_type)
        & ~ empty(power_set(X1)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p18) ).

fof(p5,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ( X3 = singleton(X2)
              <=> ! [X4] :
                    ( ilf_type(X4,set_type)
                   => ( member(X4,X3)
                    <=> X4 = X2 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5) ).

fof(p25,axiom,
    ! [X1] : ilf_type(X1,set_type),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p25) ).

fof(p17,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( member(X1,power_set(X2))
          <=> ! [X3] :
                ( ilf_type(X3,set_type)
               => ( member(X3,X1)
                 => member(X3,X2) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17) ).

fof(p12,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ilf_type(X2,subset_type(X1))
          <=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12) ).

fof(p3,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ! [X4] :
                ( ilf_type(X4,relation_type(X1,X2))
               => ilf_type(X4,subset_type(cross_product(X1,X2))) )
            & ! [X3] :
                ( ilf_type(X3,subset_type(cross_product(X1,X2)))
               => ilf_type(X3,relation_type(X1,X2)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3) ).

fof(prove_relset_1_8,conjecture,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ! [X4] :
                  ( ilf_type(X4,set_type)
                 => ( ( member(X4,X2)
                      & member(X3,X1) )
                   => ilf_type(singleton(ordered_pair(X3,X4)),relation_type(X1,X2)) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_8) ).

fof(p2,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,set_type)
             => ! [X4] :
                  ( ilf_type(X4,set_type)
                 => ( member(ordered_pair(X1,X2),cross_product(X3,X4))
                  <=> ( member(X2,X4)
                      & member(X1,X3) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2) ).

fof(c_0_9,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ( ilf_type(X2,set_type)
            & ~ empty(X2) )
         => ( ilf_type(X1,member_type(X2))
          <=> member(X1,X2) ) ) ),
    inference(fof_simplification,[status(thm)],[p19]) ).

fof(c_0_10,plain,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ( ilf_type(power_set(X1),set_type)
        & ~ empty(power_set(X1)) ) ),
    inference(fof_simplification,[status(thm)],[p18]) ).

fof(c_0_11,plain,
    ! [X18,X19,X20,X21] :
      ( ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ~ ilf_type(X20,set_type)
        | X20 = singleton(X19)
        | esk6_2(X19,X20) = X19
        | member(esk6_2(X19,X20),X20) )
      & ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ~ ilf_type(X20,set_type)
        | X20 = singleton(X19)
        | esk6_2(X19,X20) != X19
        | ~ member(esk6_2(X19,X20),X20) )
      & ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ~ ilf_type(X20,set_type)
        | X20 = singleton(X19)
        | ilf_type(esk6_2(X19,X20),set_type) )
      & ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ~ ilf_type(X20,set_type)
        | X20 != singleton(X19)
        | ~ ilf_type(X21,set_type)
        | member(X21,X20)
        | X21 != X19 )
      & ( ~ ilf_type(X18,set_type)
        | ~ ilf_type(X19,set_type)
        | ~ ilf_type(X20,set_type)
        | X20 != singleton(X19)
        | ~ ilf_type(X21,set_type)
        | X21 = X19
        | ~ member(X21,X20) ) ),
    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)],[p5])])])])])])]) ).

fof(c_0_12,plain,
    ! [X10] : ilf_type(X10,set_type),
    inference(variable_rename,[status(thm)],[p25]) ).

fof(c_0_13,plain,
    ! [X47,X48,X49] :
      ( ( ~ ilf_type(X47,set_type)
        | ~ ilf_type(X48,set_type)
        | member(X47,power_set(X48))
        | ~ member(esk10_2(X47,X48),X48) )
      & ( ~ ilf_type(X47,set_type)
        | ~ ilf_type(X48,set_type)
        | member(X47,power_set(X48))
        | member(esk10_2(X47,X48),X47) )
      & ( ~ ilf_type(X47,set_type)
        | ~ ilf_type(X48,set_type)
        | member(X47,power_set(X48))
        | ilf_type(esk10_2(X47,X48),set_type) )
      & ( ~ ilf_type(X47,set_type)
        | ~ ilf_type(X48,set_type)
        | member(X49,X48)
        | ~ member(X49,X47)
        | ~ ilf_type(X49,set_type)
        | ~ member(X47,power_set(X48)) ) ),
    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)],[p17])])])])])]) ).

fof(c_0_14,plain,
    ! [X34,X35] :
      ( ( ~ ilf_type(X34,set_type)
        | ~ ilf_type(X35,set_type)
        | ilf_type(X35,subset_type(X34))
        | ~ ilf_type(X35,member_type(power_set(X34))) )
      & ( ~ ilf_type(X34,set_type)
        | ~ ilf_type(X35,set_type)
        | ilf_type(X35,member_type(power_set(X34)))
        | ~ ilf_type(X35,subset_type(X34)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p12])])])])]) ).

fof(c_0_15,plain,
    ! [X43,X44] :
      ( ( ~ ilf_type(X43,set_type)
        | ~ ilf_type(X44,set_type)
        | empty(X44)
        | ilf_type(X43,member_type(X44))
        | ~ member(X43,X44) )
      & ( ~ ilf_type(X43,set_type)
        | ~ ilf_type(X44,set_type)
        | empty(X44)
        | member(X43,X44)
        | ~ ilf_type(X43,member_type(X44)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

fof(c_0_16,plain,
    ! [X51] :
      ( ( ~ ilf_type(X51,set_type)
        | ilf_type(power_set(X51),set_type) )
      & ( ~ ilf_type(X51,set_type)
        | ~ empty(power_set(X51)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).

cnf(c_0_17,plain,
    ( ~ ilf_type(X4,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | X2 != singleton(X3)
    | ~ ilf_type(X1,set_type)
    | ~ member(X1,X2)
    | X1 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ilf_type(X1,set_type),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | member(X1,power_set(X2))
    | member(esk10_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X1,member_type(power_set(X2)))
    | ilf_type(X1,subset_type(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(X1,X2)
    | empty(X2)
    | ilf_type(X1,member_type(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ empty(power_set(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ member(esk10_2(X1,X2),X2)
    | member(X1,power_set(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_24,plain,
    ( ~ member(X1,singleton(X2))
    | X1 = X2 ),
    inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_18]),c_0_18])])]) ).

cnf(c_0_25,plain,
    ( member(X1,power_set(X2))
    | member(esk10_2(X1,X2),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18]),c_0_18])]) ).

fof(c_0_26,plain,
    ! [X11,X12,X13,X14] :
      ( ( ~ ilf_type(X11,set_type)
        | ~ ilf_type(X12,set_type)
        | ilf_type(X14,subset_type(cross_product(X11,X12)))
        | ~ ilf_type(X14,relation_type(X11,X12)) )
      & ( ~ ilf_type(X11,set_type)
        | ~ ilf_type(X12,set_type)
        | ilf_type(X13,relation_type(X11,X12))
        | ~ ilf_type(X13,subset_type(cross_product(X11,X12))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p3])])])])]) ).

cnf(c_0_27,plain,
    ( ~ ilf_type(X1,member_type(power_set(X2)))
    | ilf_type(X1,subset_type(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18]),c_0_18])]) ).

cnf(c_0_28,plain,
    ( ~ member(X2,X1)
    | ilf_type(X2,member_type(X1))
    | empty(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_18]),c_0_18])]) ).

cnf(c_0_29,plain,
    ~ empty(power_set(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_18])]) ).

cnf(c_0_30,plain,
    ( ~ member(esk10_2(X1,X2),X2)
    | member(X1,power_set(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18]),c_0_18])]) ).

cnf(c_0_31,plain,
    ( member(singleton(X1),power_set(X2))
    | esk10_2(singleton(X1),X2) = X1 ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

fof(c_0_32,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,set_type)
       => ! [X2] :
            ( ilf_type(X2,set_type)
           => ! [X3] :
                ( ilf_type(X3,set_type)
               => ! [X4] :
                    ( ilf_type(X4,set_type)
                   => ( ( member(X4,X2)
                        & member(X3,X1) )
                     => ilf_type(singleton(ordered_pair(X3,X4)),relation_type(X1,X2)) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_8]) ).

cnf(c_0_33,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
    | ilf_type(X1,relation_type(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_34,plain,
    ( ~ member(X1,power_set(X2))
    | ilf_type(X1,subset_type(X2)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_35,plain,
    ( ~ member(X1,X2)
    | member(singleton(X1),power_set(X2)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

fof(c_0_36,negated_conjecture,
    ( ~ ilf_type(singleton(ordered_pair(esk3_0,esk4_0)),relation_type(esk1_0,esk2_0))
    & member(esk4_0,esk2_0)
    & member(esk3_0,esk1_0)
    & ilf_type(esk4_0,set_type)
    & ilf_type(esk3_0,set_type)
    & ilf_type(esk2_0,set_type)
    & ilf_type(esk1_0,set_type) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).

cnf(c_0_37,plain,
    ( ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
    | ilf_type(X1,relation_type(X2,X3)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_18]),c_0_18])]) ).

cnf(c_0_38,plain,
    ( ~ member(X1,X2)
    | ilf_type(singleton(X1),subset_type(X2)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

fof(c_0_39,plain,
    ! [X24,X25,X26,X27] :
      ( ( ~ ilf_type(X24,set_type)
        | ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | ~ ilf_type(X27,set_type)
        | member(ordered_pair(X24,X25),cross_product(X26,X27))
        | ~ member(X25,X27)
        | ~ member(X24,X26) )
      & ( ~ ilf_type(X24,set_type)
        | ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | ~ ilf_type(X27,set_type)
        | ~ member(ordered_pair(X24,X25),cross_product(X26,X27))
        | member(X25,X27) )
      & ( ~ ilf_type(X24,set_type)
        | ~ ilf_type(X25,set_type)
        | ~ ilf_type(X26,set_type)
        | ~ ilf_type(X27,set_type)
        | ~ member(ordered_pair(X24,X25),cross_product(X26,X27))
        | member(X24,X26) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])])])]) ).

cnf(c_0_40,negated_conjecture,
    ~ ilf_type(singleton(ordered_pair(esk3_0,esk4_0)),relation_type(esk1_0,esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_41,plain,
    ( ~ member(X1,cross_product(X2,X3))
    | ilf_type(singleton(X1),relation_type(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    ( ~ ilf_type(X1,set_type)
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X4,set_type)
    | ~ member(X3,X4)
    | ~ member(X1,X2)
    | member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    ~ member(ordered_pair(esk3_0,esk4_0),cross_product(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_44,plain,
    ( ~ member(X1,X3)
    | ~ member(X2,X4)
    | member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_18]),c_0_18]),c_0_18]),c_0_18])]) ).

cnf(c_0_45,negated_conjecture,
    member(esk4_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_46,negated_conjecture,
    member(esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET646+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n003.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 05:32:31 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.46  % Version: 3.5.1
% 0.12/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.46  % Starting sh5l with 300s (1) cores
% 0.12/0.46  % new_bool_3 with pid 3504596 completed with status 0
% 0.12/0.46  % Result found by new_bool_3
% 0.12/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.12/0.46  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.46  % SubtermCWHack with pid 3504600 completed with status 0
% 0.12/0.46  % Result found by SubtermCWHack
% 0.12/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.12/0.46  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.46  % Preprocessing time       : 0.002 s
% 0.12/0.46  
% 0.12/0.46  % Proof found!
% 0.12/0.46  % SZS status Theorem
% 0.12/0.46  % SZS output start CNFRefutation
% See solution above
% 0.12/0.46  % Parsed axioms                        : 26
% 0.12/0.46  % Removed by relevancy pruning/SinE    : 7
% 0.12/0.46  % Initial clauses                      : 47
% 0.12/0.46  % Removed in clause preprocessing      : 2
% 0.12/0.46  % Initial clauses in saturation        : 45
% 0.12/0.46  % Processed clauses                    : 163
% 0.12/0.46  % ...of these trivial                  : 10
% 0.12/0.46  % ...subsumed                          : 28
% 0.12/0.46  % ...remaining for further processing  : 125
% 0.12/0.46  % Other redundant clauses eliminated   : 6
% 0.12/0.46  % Clauses deleted for lack of memory   : 0
% 0.12/0.46  % Backward-subsumed                    : 0
% 0.12/0.46  % Backward-rewritten                   : 4
% 0.12/0.46  % Generated clauses                    : 342
% 0.12/0.46  % ...of the previous two non-redundant : 287
% 0.12/0.46  % ...aggressively subsumed             : 0
% 0.12/0.46  % Contextual simplify-reflections      : 0
% 0.12/0.46  % Paramodulations                      : 335
% 0.12/0.46  % Factorizations                       : 2
% 0.12/0.46  % NegExts                              : 0
% 0.12/0.46  % Equation resolutions                 : 6
% 0.12/0.46  % Disequality decompositions           : 0
% 0.12/0.46  % Total rewrite steps                  : 120
% 0.12/0.46  % ...of those cached                   : 89
% 0.12/0.46  % Propositional unsat checks           : 0
% 0.12/0.46  %    Propositional check models        : 0
% 0.12/0.46  %    Propositional check unsatisfiable : 0
% 0.12/0.46  %    Propositional clauses             : 0
% 0.12/0.46  %    Propositional clauses after purity: 0
% 0.12/0.46  %    Propositional unsat core size     : 0
% 0.12/0.46  %    Propositional preprocessing time  : 0.000
% 0.12/0.46  %    Propositional encoding time       : 0.000
% 0.12/0.46  %    Propositional solver time         : 0.000
% 0.12/0.46  %    Success case prop preproc time    : 0.000
% 0.12/0.46  %    Success case prop encoding time   : 0.000
% 0.12/0.46  %    Success case prop solver time     : 0.000
% 0.12/0.46  % Current number of processed clauses  : 119
% 0.12/0.46  %    Positive orientable unit clauses  : 19
% 0.12/0.46  %    Positive unorientable unit clauses: 0
% 0.12/0.46  %    Negative unit clauses             : 3
% 0.12/0.46  %    Non-unit-clauses                  : 97
% 0.12/0.46  % Current number of unprocessed clauses: 169
% 0.12/0.46  % ...number of literals in the above   : 512
% 0.12/0.46  % Current number of archived formulas  : 0
% 0.12/0.46  % Current number of archived clauses   : 4
% 0.12/0.46  % Clause-clause subsumption calls (NU) : 1123
% 0.12/0.46  % Rec. Clause-clause subsumption calls : 1016
% 0.12/0.46  % Non-unit clause-clause subsumptions  : 28
% 0.12/0.46  % Unit Clause-clause subsumption calls : 37
% 0.12/0.46  % Rewrite failures with RHS unbound    : 0
% 0.12/0.46  % BW rewrite match attempts            : 15
% 0.12/0.46  % BW rewrite match successes           : 4
% 0.12/0.46  % Condensation attempts                : 0
% 0.12/0.46  % Condensation successes               : 0
% 0.12/0.46  % Termbank termtop insertions          : 9360
% 0.12/0.46  % Search garbage collected termcells   : 1139
% 0.12/0.46  
% 0.12/0.46  % -------------------------------------------------
% 0.12/0.46  % User time                : 0.014 s
% 0.12/0.46  % System time              : 0.006 s
% 0.12/0.46  % Total time               : 0.020 s
% 0.12/0.46  % Maximum resident set size: 3616 pages
% 0.12/0.46  
% 0.12/0.46  % -------------------------------------------------
% 0.12/0.46  % User time                : 0.016 s
% 0.12/0.46  % System time              : 0.010 s
% 0.12/0.46  % Total time               : 0.027 s
% 0.12/0.46  % Maximum resident set size: 4864 pages
% 0.12/0.46  % E exiting
%------------------------------------------------------------------------------