↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n015.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:17:13 AM UTC 2026

% Result   : Theorem 0.96s 0.73s
% Output   : CNFRefutation 0.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   58 (  37 unt;   0 typ;   0 def)
%            Number of atoms       :   90 (  36 equ;   0 cnn)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :  295 (  29   ~;  19   |;   6   &; 234   @)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   20 (  18 usr;   7 con; 0-2 aty)
%            Number of variables   :   59 (   0   ^;  59   !;   0   ?;  59   :)

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

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

thf(decl_30,type,
    one_one_int: int ).

thf(decl_31,type,
    one_one_nat: nat ).

thf(decl_33,type,
    plus_plus_int: int > int > int ).

thf(decl_34,type,
    plus_plus_nat: nat > nat > nat ).

thf(decl_39,type,
    zero_zero_int: int ).

thf(decl_40,type,
    zero_zero_nat: nat ).

thf(decl_46,type,
    bit0: int > int ).

thf(decl_47,type,
    bit1: int > int ).

thf(decl_49,type,
    pls: int ).

thf(decl_50,type,
    nat_1: int > nat ).

thf(decl_51,type,
    number_number_of_int: int > int ).

thf(decl_52,type,
    number_number_of_nat: int > nat ).

thf(decl_55,type,
    semiri1621563631at_int: nat > int ).

thf(decl_58,type,
    ord_less_int: int > int > $o ).

thf(decl_59,type,
    ord_less_nat: nat > nat > $o ).

thf(decl_61,type,
    ord_less_eq_int: int > int > $o ).

thf(decl_64,type,
    power_power_int: int > nat > int ).

thf(decl_74,type,
    n: nat ).

thf(fact_767_nat__number__of__def,axiom,
    ! [X12: int] :
      ( ( number_number_of_nat @ X12 )
      = ( nat_1 @ ( number_number_of_int @ X12 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_767_nat__number__of__def) ).

thf(fact_177_number__of__is__id,axiom,
    ! [X10: int] :
      ( ( number_number_of_int @ X10 )
      = X10 ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_177_number__of__is__id) ).

thf(fact_815_zero__less__nat__eq,axiom,
    ! [X18: int] :
      ( ( ord_less_nat @ zero_zero_nat @ ( nat_1 @ X18 ) )
    <=> ( ord_less_int @ zero_zero_int @ X18 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_815_zero__less__nat__eq) ).

thf(fact_196_gr0I,axiom,
    ! [X17: nat] :
      ( ( X17 != zero_zero_nat )
     => ( ord_less_nat @ zero_zero_nat @ X17 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_196_gr0I) ).

thf(fact_793_zless__nat__eq__int__zless,axiom,
    ! [X16: nat,X18: int] :
      ( ( ord_less_nat @ X16 @ ( nat_1 @ X18 ) )
    <=> ( ord_less_int @ ( semiri1621563631at_int @ X16 ) @ X18 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_793_zless__nat__eq__int__zless) ).

thf(fact_172_less__zeroE,axiom,
    ! [X17: nat] :
      ~ ( ord_less_nat @ X17 @ zero_zero_nat ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_172_less__zeroE) ).

thf(conj_0,conjecture,
    ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
   != zero_zero_int ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',conj_0) ).

thf(fact_25_semiring__norm_I110_J,axiom,
    ( one_one_int
    = ( number_number_of_int @ ( bit1 @ pls ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_25_semiring__norm_I110_J) ).

thf(fact_98_Pls__def,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_98_Pls__def) ).

thf(fact_103_Bit0__def,axiom,
    ! [X10: int] :
      ( ( bit0 @ X10 )
      = ( plus_plus_int @ X10 @ X10 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_103_Bit0__def) ).

thf(fact_269_less__add__one,axiom,
    ! [X171: int] : ( ord_less_int @ X171 @ ( plus_plus_int @ X171 @ one_one_int ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_269_less__add__one) ).

thf(fact_67_zadd__commute,axiom,
    ! [X18: int,X13: int] :
      ( ( plus_plus_int @ X18 @ X13 )
      = ( plus_plus_int @ X13 @ X18 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_67_zadd__commute) ).

thf(fact_718_zless__le,axiom,
    ! [X18: int,X13: int] :
      ( ( ord_less_int @ X18 @ X13 )
    <=> ( ( ord_less_eq_int @ X18 @ X13 )
        & ( X18 != X13 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_718_zless__le) ).

thf(fact_19_semiring__one__add__one__is__two,axiom,
    ( ( plus_plus_nat @ one_one_nat @ one_one_nat )
    = ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_19_semiring__one__add__one__is__two) ).

thf(fact_266_zero__less__power,axiom,
    ! [X167: nat,X168: int] :
      ( ( ord_less_int @ zero_zero_int @ X168 )
     => ( ord_less_int @ zero_zero_int @ ( power_power_int @ X168 @ X167 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6NvObOOlsF/E---3.1_3485604.p',fact_266_zero__less__power) ).

thf(c_0_15,plain,
    ! [X4528: int] :
      ( ( number_number_of_nat @ X4528 )
      = ( nat_1 @ ( number_number_of_int @ X4528 ) ) ),
    inference(variable_rename,[status(thm)],[fact_767_nat__number__of__def]) ).

thf(c_0_16,plain,
    ! [X5252: int] :
      ( ( number_number_of_int @ X5252 )
      = X5252 ),
    inference(variable_rename,[status(thm)],[fact_177_number__of__is__id]) ).

thf(c_0_17,plain,
    ! [X5152: int] :
      ( ( ~ ( ord_less_nat @ zero_zero_nat @ ( nat_1 @ X5152 ) )
        | ( ord_less_int @ zero_zero_int @ X5152 ) )
      & ( ~ ( ord_less_int @ zero_zero_int @ X5152 )
        | ( ord_less_nat @ zero_zero_nat @ ( nat_1 @ X5152 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_815_zero__less__nat__eq])])]) ).

thf(c_0_18,plain,
    ! [X1: int] :
      ( ( number_number_of_nat @ X1 )
      = ( nat_1 @ ( number_number_of_int @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_19,plain,
    ! [X1: int] :
      ( ( number_number_of_int @ X1 )
      = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_20,plain,
    ! [X17: nat] :
      ( ( X17 != zero_zero_nat )
     => ( ord_less_nat @ zero_zero_nat @ X17 ) ),
    inference(fof_simplification,[status(thm)],[fact_196_gr0I]) ).

thf(c_0_21,plain,
    ! [X4935: nat,X4936: int] :
      ( ( ~ ( ord_less_nat @ X4935 @ ( nat_1 @ X4936 ) )
        | ( ord_less_int @ ( semiri1621563631at_int @ X4935 ) @ X4936 ) )
      & ( ~ ( ord_less_int @ ( semiri1621563631at_int @ X4935 ) @ X4936 )
        | ( ord_less_nat @ X4935 @ ( nat_1 @ X4936 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_793_zless__nat__eq__int__zless])])]) ).

thf(c_0_22,plain,
    ! [X1: int] :
      ( ( ord_less_int @ zero_zero_int @ X1 )
      | ~ ( ord_less_nat @ zero_zero_nat @ ( nat_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_23,plain,
    ! [X1: int] :
      ( ( nat_1 @ X1 )
      = ( number_number_of_nat @ X1 ) ),
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_24,plain,
    ! [X4999: nat] :
      ( ( X4999 = zero_zero_nat )
      | ( ord_less_nat @ zero_zero_nat @ X4999 ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])]) ).

thf(c_0_25,plain,
    ! [X17: nat] :
      ~ ( ord_less_nat @ X17 @ zero_zero_nat ),
    inference(fof_simplification,[status(thm)],[fact_172_less__zeroE]) ).

thf(c_0_26,negated_conjecture,
    ~ ( ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
       != zero_zero_int ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_27,plain,
    ( one_one_int
    = ( number_number_of_int @ ( bit1 @ pls ) ) ),
    inference(split_conjunct,[status(thm)],[fact_25_semiring__norm_I110_J]) ).

thf(c_0_28,plain,
    pls = zero_zero_int,
    inference(split_conjunct,[status(thm)],[fact_98_Pls__def]) ).

thf(c_0_29,plain,
    ! [X4568: int] :
      ( ( bit0 @ X4568 )
      = ( plus_plus_int @ X4568 @ X4568 ) ),
    inference(variable_rename,[status(thm)],[fact_103_Bit0__def]) ).

thf(c_0_30,plain,
    ! [X16: nat,X1: int] :
      ( ( ord_less_nat @ X16 @ ( nat_1 @ X1 ) )
      | ~ ( ord_less_int @ ( semiri1621563631at_int @ X16 ) @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

thf(c_0_31,plain,
    ! [X1: int] :
      ( ( ord_less_int @ zero_zero_int @ X1 )
      | ~ ( ord_less_nat @ zero_zero_nat @ ( number_number_of_nat @ X1 ) ) ),
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

thf(c_0_32,plain,
    ! [X16: nat] :
      ( ( X16 = zero_zero_nat )
      | ( ord_less_nat @ zero_zero_nat @ X16 ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_33,plain,
    ! [X4998: nat] :
      ~ ( ord_less_nat @ X4998 @ zero_zero_nat ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_25])]) ).

thf(c_0_34,plain,
    ! [X4697: int] : ( ord_less_int @ X4697 @ ( plus_plus_int @ X4697 @ one_one_int ) ),
    inference(variable_rename,[status(thm)],[fact_269_less__add__one]) ).

thf(c_0_35,plain,
    ! [X4678: int,X4679: int] :
      ( ( plus_plus_int @ X4678 @ X4679 )
      = ( plus_plus_int @ X4679 @ X4678 ) ),
    inference(variable_rename,[status(thm)],[fact_67_zadd__commute]) ).

thf(c_0_36,plain,
    ! [X18: int,X13: int] :
      ( ( ord_less_int @ X18 @ X13 )
    <=> ( ( ord_less_eq_int @ X18 @ X13 )
        & ( X18 != X13 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_718_zless__le]) ).

thf(c_0_37,negated_conjecture,
    ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
    = zero_zero_int ),
    inference(fof_simplification,[status(thm)],[c_0_26]) ).

thf(c_0_38,plain,
    ( ( plus_plus_nat @ one_one_nat @ one_one_nat )
    = ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_19_semiring__one__add__one__is__two]) ).

thf(c_0_39,plain,
    ( ( bit1 @ zero_zero_int )
    = one_one_int ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_19]) ).

thf(c_0_40,plain,
    ! [X1: int] :
      ( ( bit0 @ X1 )
      = ( plus_plus_int @ X1 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_41,plain,
    ! [X16: nat,X1: int] :
      ( ( ord_less_nat @ X16 @ ( number_number_of_nat @ X1 ) )
      | ~ ( ord_less_int @ ( semiri1621563631at_int @ X16 ) @ X1 ) ),
    inference(rw,[status(thm)],[c_0_30,c_0_23]) ).

thf(c_0_42,plain,
    ! [X1: int] :
      ( ( ( number_number_of_nat @ X1 )
        = zero_zero_nat )
      | ( ord_less_int @ zero_zero_int @ X1 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

thf(c_0_43,plain,
    ! [X16: nat] :
      ~ ( ord_less_nat @ X16 @ zero_zero_nat ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

thf(c_0_44,plain,
    ! [X1: int] : ( ord_less_int @ X1 @ ( plus_plus_int @ X1 @ one_one_int ) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

thf(c_0_45,plain,
    ! [X2: int,X1: int] :
      ( ( plus_plus_int @ X1 @ X2 )
      = ( plus_plus_int @ X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

thf(c_0_46,plain,
    ! [X5282: int,X5283: int] :
      ( ( ( ord_less_eq_int @ X5282 @ X5283 )
        | ~ ( ord_less_int @ X5282 @ X5283 ) )
      & ( ( X5282 != X5283 )
        | ~ ( ord_less_int @ X5282 @ X5283 ) )
      & ( ~ ( ord_less_eq_int @ X5282 @ X5283 )
        | ( X5282 = X5283 )
        | ( ord_less_int @ X5282 @ X5283 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).

thf(c_0_47,plain,
    ! [X4158: nat,X4159: int] :
      ( ~ ( ord_less_int @ zero_zero_int @ X4159 )
      | ( ord_less_int @ zero_zero_int @ ( power_power_int @ X4159 @ X4158 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_266_zero__less__power])])]) ).

thf(c_0_48,negated_conjecture,
    ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) )
    = zero_zero_int ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

thf(c_0_49,plain,
    ( ( number_number_of_nat @ ( plus_plus_int @ one_one_int @ one_one_int ) )
    = ( plus_plus_nat @ one_one_nat @ one_one_nat ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_28]),c_0_39]),c_0_40]) ).

thf(c_0_50,plain,
    ! [X16: nat,X1: int] :
      ( ( ord_less_int @ zero_zero_int @ X1 )
      | ~ ( ord_less_int @ ( semiri1621563631at_int @ X16 ) @ X1 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).

thf(c_0_51,plain,
    ! [X1: int] : ( ord_less_int @ X1 @ ( plus_plus_int @ one_one_int @ X1 ) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

thf(c_0_52,plain,
    ! [X1: int,X2: int] :
      ( ( X1 != X2 )
      | ~ ( ord_less_int @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

thf(c_0_53,plain,
    ! [X16: nat,X1: int] :
      ( ( ord_less_int @ zero_zero_int @ ( power_power_int @ X1 @ X16 ) )
      | ~ ( ord_less_int @ zero_zero_int @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

thf(c_0_54,negated_conjecture,
    ( ( power_power_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ n ) ) @ ( plus_plus_nat @ one_one_nat @ one_one_nat ) )
    = zero_zero_int ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_28]),c_0_39]),c_0_40]),c_0_49]) ).

thf(c_0_55,plain,
    ! [X16: nat] : ( ord_less_int @ zero_zero_int @ ( plus_plus_int @ one_one_int @ ( semiri1621563631at_int @ X16 ) ) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

thf(c_0_56,plain,
    ! [X1: int] :
      ~ ( ord_less_int @ X1 @ X1 ),
    inference(er,[status(thm)],[c_0_52]) ).

thf(c_0_57,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),c_0_56]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM925^3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.17  % Computer : n015.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.17  % CPULimit : 300
% 0.11/0.17  % WCLimit  : 300
% 0.11/0.17  % DateTime : Tue Sep 29 13:09:02 UTC 2026
% 0.11/0.17  % CPUTime  : 
% 0.11/0.17  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.20  Running higher-order theorem proving
% 0.22/0.35  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.6NvObOOlsF/E---3.1_3485604.p
% 0.96/0.73  % Version: 3.5.1-ho
% 0.96/0.73  % Preprocessing class: HMLSSMSMSSSNSFA.
% 0.96/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.73  % Starting sh3 with 1500s (5) cores
% 0.96/0.73  % Starting lpo1_def_fix with 300s (1) cores
% 0.96/0.73  % Starting lpo8_s with 300s (1) cores
% 0.96/0.73  % Starting lpo1_lambda_fix with 300s (1) cores
% 0.96/0.73  % lpo8_s with pid 3485654 completed with status 0
% 0.96/0.73  % Result found by lpo8_s
% 0.96/0.73  % Preprocessing class: HMLSSMSMSSSNSFA.
% 0.96/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.73  % Starting sh3 with 1500s (5) cores
% 0.96/0.73  % Starting lpo1_def_fix with 300s (1) cores
% 0.96/0.73  % Starting lpo8_s with 300s (1) cores
% 0.96/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
% 0.96/0.73  % SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.96/0.73  % Search class: HGHSM-SSLM31-DSFFFFBN
% 0.96/0.73  % partial match(1): HGHSM-FSLM31-DSFFFFBN
% 0.96/0.73  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.96/0.73  % Starting SubtermCWHack with 28s (1) cores
% 0.96/0.73  % SubtermCWHack with pid 3485691 completed with status 0
% 0.96/0.73  % Result found by SubtermCWHack
% 0.96/0.73  % Preprocessing class: HMLSSMSMSSSNSFA.
% 0.96/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.73  % Starting sh3 with 1500s (5) cores
% 0.96/0.73  % Starting lpo1_def_fix with 300s (1) cores
% 0.96/0.73  % Starting lpo8_s with 300s (1) cores
% 0.96/0.73  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
% 0.96/0.73  % SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.96/0.73  % Search class: HGHSM-SSLM31-DSFFFFBN
% 0.96/0.73  % partial match(1): HGHSM-FSLM31-DSFFFFBN
% 0.96/0.73  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.96/0.73  % Starting SubtermCWHack with 28s (1) cores
% 0.96/0.73  % Preprocessing time       : 0.012 s
% 0.96/0.73  
% 0.96/0.73  % Proof found!
% 0.96/0.73  % SZS status Theorem
% 0.96/0.73  % SZS output start CNFRefutation
% See solution above
% 0.96/0.73  % Parsed axioms                        : 1266
% 0.96/0.73  % Removed by relevancy pruning/SinE    : 93
% 0.96/0.73  % Initial clauses                      : 1713
% 0.96/0.73  % Removed in clause preprocessing      : 114
% 0.96/0.73  % Initial clauses in saturation        : 1599
% 0.96/0.73  % Processed clauses                    : 4048
% 0.96/0.73  % ...of these trivial                  : 273
% 0.96/0.73  % ...subsumed                          : 2402
% 0.96/0.73  % ...remaining for further processing  : 1373
% 0.96/0.73  % Other redundant clauses eliminated   : 199
% 0.96/0.73  % Clauses deleted for lack of memory   : 0
% 0.96/0.73  % Backward-subsumed                    : 52
% 0.96/0.73  % Backward-rewritten                   : 59
% 0.96/0.73  % Generated clauses                    : 10852
% 0.96/0.73  % ...of the previous two non-redundant : 7530
% 0.96/0.73  % ...aggressively subsumed             : 0
% 0.96/0.73  % Contextual simplify-reflections      : 2
% 0.96/0.73  % Paramodulations                      : 10628
% 0.96/0.73  % Factorizations                       : 15
% 0.96/0.73  % NegExts                              : 0
% 0.96/0.73  % Equation resolutions                 : 219
% 0.96/0.73  % Disequality decompositions           : 0
% 0.96/0.73  % Total rewrite steps                  : 5433
% 0.96/0.73  % ...of those cached                   : 4773
% 0.96/0.73  % Propositional unsat checks           : 0
% 0.96/0.73  %    Propositional check models        : 0
% 0.96/0.73  %    Propositional check unsatisfiable : 0
% 0.96/0.73  %    Propositional clauses             : 0
% 0.96/0.73  %    Propositional clauses after purity: 0
% 0.96/0.73  %    Propositional unsat core size     : 0
% 0.96/0.73  %    Propositional preprocessing time  : 0.000
% 0.96/0.73  %    Propositional encoding time       : 0.000
% 0.96/0.73  %    Propositional solver time         : 0.000
% 0.96/0.73  %    Success case prop preproc time    : 0.000
% 0.96/0.73  %    Success case prop encoding time   : 0.000
% 0.96/0.73  %    Success case prop solver time     : 0.000
% 0.96/0.73  % Current number of processed clauses  : 1146
% 0.96/0.73  %    Positive orientable unit clauses  : 343
% 0.96/0.73  %    Positive unorientable unit clauses: 9
% 0.96/0.73  %    Negative unit clauses             : 199
% 0.96/0.73  %    Non-unit-clauses                  : 595
% 0.96/0.73  % Current number of unprocessed clauses: 5058
% 0.96/0.73  % ...number of literals in the above   : 12046
% 0.96/0.73  % Current number of archived formulas  : 0
% 0.96/0.73  % Current number of archived clauses   : 111
% 0.96/0.73  % Clause-clause subsumption calls (NU) : 96764
% 0.96/0.73  % Rec. Clause-clause subsumption calls : 87254
% 0.96/0.73  % Non-unit clause-clause subsumptions  : 996
% 0.96/0.73  % Unit Clause-clause subsumption calls : 24299
% 0.96/0.73  % Rewrite failures with RHS unbound    : 0
% 0.96/0.73  % BW rewrite match attempts            : 243
% 0.96/0.73  % BW rewrite match successes           : 127
% 0.96/0.73  % Condensation attempts                : 0
% 0.96/0.73  % Condensation successes               : 0
% 0.96/0.73  % Termbank termtop insertions          : 211684
% 0.96/0.73  % Search garbage collected termcells   : 28401
% 0.96/0.73  
% 0.96/0.73  % -------------------------------------------------
% 0.96/0.73  % User time                : 0.275 s
% 0.96/0.73  % System time              : 0.027 s
% 0.96/0.73  % Total time               : 0.302 s
% 0.96/0.73  % Maximum resident set size: 11052 pages
% 0.96/0.73  
% 0.96/0.73  % -------------------------------------------------
% 0.96/0.73  % User time                : 0.317 s
% 0.96/0.73  % System time              : 0.034 s
% 0.96/0.73  % Total time               : 0.351 s
% 0.96/0.73  % Maximum resident set size: 7168 pages
% 0.96/0.73  % E exiting
%------------------------------------------------------------------------------