↑ Up

E-SAT---3.5.1.CAX-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : NUM924^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 : n026.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:48 AM UTC 2026

% Result   : ContradictoryAxioms 0.95s 0.83s
% Output   : CNFRefutation 0.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   47 (  47 unt;   0 typ;   0 def)
%            Number of atoms       :   47 (  36 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  341 (   7   ~;   0   |;   0   &; 334   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :   49 (   0   ^;  49   !;   0   ?;  49   :)

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

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

thf(decl_28,type,
    one_one_int: int ).

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

thf(decl_34,type,
    times_times_int: int > int > int ).

thf(decl_37,type,
    zero_zero_int: int ).

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

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

thf(decl_48,type,
    pls: int ).

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

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

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

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

thf(decl_75,type,
    m: int ).

thf(decl_77,type,
    s: int ).

thf(decl_78,type,
    t: int ).

thf(fact_8_not__sum__power2__lt__zero,axiom,
    ! [X3: int,X4: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ X3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ zero_zero_int ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_8_not__sum__power2__lt__zero) ).

thf(fact_415_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J,axiom,
    ! [X481: int] :
      ( ( plus_plus_int @ X481 @ X481 )
      = ( times_times_int @ ( plus_plus_int @ one_one_int @ one_one_int ) @ X481 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_415_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J) ).

thf(fact_182_Bit0__def,axiom,
    ! [X23: int] :
      ( ( bit0 @ X23 )
      = ( plus_plus_int @ X23 @ X23 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_182_Bit0__def) ).

thf(fact_160_one__is__num__one,axiom,
    ( one_one_int
    = ( number_number_of_int @ ( bit1 @ pls ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_160_one__is__num__one) ).

thf(fact_172_Pls__def,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_172_Pls__def) ).

thf(fact_34_number__of__is__id,axiom,
    ! [X23: int] :
      ( ( number_number_of_int @ X23 )
      = X23 ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_34_number__of__is__id) ).

thf(fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
    ! [X201: int] :
      ( ( times_times_int @ X201 @ X201 )
      = ( power_power_int @ X201 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).

thf(fact_134_zadd__commute,axiom,
    ! [X24: int,X22: int] :
      ( ( plus_plus_int @ X24 @ X22 )
      = ( plus_plus_int @ X22 @ X24 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_134_zadd__commute) ).

thf(fact_91_zmult__1__right,axiom,
    ! [X24: int] :
      ( ( times_times_int @ X24 @ one_one_int )
      = X24 ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_91_zmult__1__right) ).

thf(fact_324_comm__semiring__1__class_Onormalizing__semiring__rules_I18_J,axiom,
    ! [X285: int,X286: int,X287: int] :
      ( ( times_times_int @ X285 @ ( times_times_int @ X286 @ X287 ) )
      = ( times_times_int @ ( times_times_int @ X285 @ X286 ) @ X287 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_324_comm__semiring__1__class_Onormalizing__semiring__rules_I18_J) ).

thf(fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
    ! [X376: int] :
      ( ( times_times_int @ X376 @ zero_zero_int )
      = zero_zero_int ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).

thf(fact_3_t,axiom,
    ( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
    = ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_3_t) ).

thf(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
    ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
    file('/export/starexec/sandbox2/tmp/tmp.pP9xB19FBu/E---3.1_557011.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).

thf(c_0_13,plain,
    ! [X3: int,X4: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ X3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ zero_zero_int ),
    inference(fof_simplification,[status(thm)],[fact_8_not__sum__power2__lt__zero]) ).

thf(c_0_14,plain,
    ! [X5096: int] :
      ( ( plus_plus_int @ X5096 @ X5096 )
      = ( times_times_int @ ( plus_plus_int @ one_one_int @ one_one_int ) @ X5096 ) ),
    inference(variable_rename,[status(thm)],[fact_415_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J]) ).

thf(c_0_15,plain,
    ! [X4667: int] :
      ( ( bit0 @ X4667 )
      = ( plus_plus_int @ X4667 @ X4667 ) ),
    inference(variable_rename,[status(thm)],[fact_182_Bit0__def]) ).

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

thf(c_0_17,plain,
    pls = zero_zero_int,
    inference(split_conjunct,[status(thm)],[fact_172_Pls__def]) ).

thf(c_0_18,plain,
    ! [X4413: int] :
      ( ( number_number_of_int @ X4413 )
      = X4413 ),
    inference(variable_rename,[status(thm)],[fact_34_number__of__is__id]) ).

thf(c_0_19,plain,
    ! [X4775: int] :
      ( ( times_times_int @ X4775 @ X4775 )
      = ( power_power_int @ X4775 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
    inference(variable_rename,[status(thm)],[fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).

thf(c_0_20,plain,
    ! [X4391: int,X4392: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ X4391 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X4392 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ zero_zero_int ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).

thf(c_0_21,plain,
    ! [X3: int] :
      ( ( plus_plus_int @ X3 @ X3 )
      = ( times_times_int @ ( plus_plus_int @ one_one_int @ one_one_int ) @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_22,plain,
    ! [X3: int] :
      ( ( bit0 @ X3 )
      = ( plus_plus_int @ X3 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_23,plain,
    ( one_one_int
    = ( number_number_of_int @ ( bit1 @ zero_zero_int ) ) ),
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

thf(c_0_24,plain,
    ! [X3: int] :
      ( ( number_number_of_int @ X3 )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_25,plain,
    ! [X4596: int,X4597: int] :
      ( ( plus_plus_int @ X4596 @ X4597 )
      = ( plus_plus_int @ X4597 @ X4596 ) ),
    inference(variable_rename,[status(thm)],[fact_134_zadd__commute]) ).

thf(c_0_26,plain,
    ! [X3: int] :
      ( ( times_times_int @ X3 @ X3 )
      = ( power_power_int @ X3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_27,plain,
    ! [X3: int,X4: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ X3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) @ zero_zero_int ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_28,plain,
    ! [X4511: int] :
      ( ( times_times_int @ X4511 @ one_one_int )
      = X4511 ),
    inference(variable_rename,[status(thm)],[fact_91_zmult__1__right]) ).

thf(c_0_29,plain,
    ! [X4885: int,X4886: int,X4887: int] :
      ( ( times_times_int @ X4885 @ ( times_times_int @ X4886 @ X4887 ) )
      = ( times_times_int @ ( times_times_int @ X4885 @ X4886 ) @ X4887 ) ),
    inference(variable_rename,[status(thm)],[fact_324_comm__semiring__1__class_Onormalizing__semiring__rules_I18_J]) ).

thf(c_0_30,plain,
    ! [X4984: int] :
      ( ( times_times_int @ X4984 @ zero_zero_int )
      = zero_zero_int ),
    inference(variable_rename,[status(thm)],[fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).

thf(c_0_31,plain,
    ( ( plus_plus_int @ ( power_power_int @ s @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ one_one_int )
    = ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) ),
    inference(split_conjunct,[status(thm)],[fact_3_t]) ).

thf(c_0_32,plain,
    ! [X3: int] :
      ( ( bit0 @ X3 )
      = ( times_times_int @ ( bit0 @ ( bit1 @ zero_zero_int ) ) @ X3 ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_23]),c_0_24]) ).

thf(c_0_33,plain,
    ! [X4: int,X3: int] :
      ( ( plus_plus_int @ X3 @ X4 )
      = ( plus_plus_int @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

thf(c_0_34,plain,
    ! [X3: int] :
      ( ( power_power_int @ X3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) )
      = ( times_times_int @ X3 @ X3 ) ),
    inference(rw,[status(thm)],[c_0_26,c_0_17]) ).

thf(c_0_35,plain,
    ! [X3: int,X4: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( power_power_int @ X3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ X4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) ) @ zero_zero_int ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_17]),c_0_17]) ).

thf(c_0_36,plain,
    ! [X3: int] :
      ( ( times_times_int @ X3 @ one_one_int )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

thf(c_0_37,plain,
    ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ t ) @ ( times_times_int @ ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) @ zero_zero_int ),
    inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).

thf(c_0_38,plain,
    ! [X3: int,X4: int,X7: int] :
      ( ( times_times_int @ X3 @ ( times_times_int @ X4 @ X7 ) )
      = ( times_times_int @ ( times_times_int @ X3 @ X4 ) @ X7 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_39,plain,
    ! [X3: int] :
      ( ( times_times_int @ X3 @ zero_zero_int )
      = zero_zero_int ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

thf(c_0_40,plain,
    ( ( times_times_int @ ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ ( times_times_int @ ( bit0 @ ( bit1 @ zero_zero_int ) ) @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) @ m ) ) @ t )
    = ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ s @ s ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_17]),c_0_32]),c_0_24]),c_0_23]),c_0_24]),c_0_33]),c_0_17]),c_0_34]),c_0_23]),c_0_24]),c_0_33]) ).

thf(c_0_41,plain,
    ! [X3: int,X4: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( times_times_int @ X3 @ X3 ) @ ( times_times_int @ X4 @ X4 ) ) @ zero_zero_int ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34]),c_0_34]) ).

thf(c_0_42,plain,
    ! [X3: int] :
      ( ( times_times_int @ X3 @ ( bit1 @ zero_zero_int ) )
      = X3 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_23]),c_0_24]) ).

thf(c_0_43,plain,
    ord_less_int @ ( times_times_int @ ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ ( bit0 @ ( bit1 @ zero_zero_int ) ) @ ( times_times_int @ ( bit0 @ ( bit1 @ zero_zero_int ) ) @ m ) ) ) @ t ) @ zero_zero_int,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_17]),c_0_32]),c_0_24]),c_0_38]),c_0_23]),c_0_24]),c_0_33]),c_0_17]),c_0_32]),c_0_24]),c_0_38]),c_0_23]),c_0_24]),c_0_33]),c_0_39]) ).

thf(c_0_44,plain,
    ( ( times_times_int @ ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ ( bit0 @ ( bit1 @ zero_zero_int ) ) @ ( times_times_int @ ( bit0 @ ( bit1 @ zero_zero_int ) ) @ m ) ) ) @ t )
    = ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ s @ s ) ) ),
    inference(rw,[status(thm)],[c_0_40,c_0_38]) ).

thf(c_0_45,plain,
    ! [X3: int] :
      ~ ( ord_less_int @ ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ X3 @ X3 ) ) @ zero_zero_int ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

thf(c_0_46,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM924^3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n026.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 13:08:12 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running higher-order theorem proving
% 0.31/0.40  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.pP9xB19FBu/E---3.1_557011.p
% 0.95/0.83  % Version: 3.5.1-ho
% 0.95/0.83  % Preprocessing class: HMLSSMSMSSSNSFA.
% 0.95/0.83  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.83  % Starting sh3 with 1500s (5) cores
% 0.95/0.83  % Starting lpo1_def_fix with 300s (1) cores
% 0.95/0.83  % Starting lpo8_s with 300s (1) cores
% 0.95/0.83  % Starting lpo1_lambda_fix with 300s (1) cores
% 0.95/0.83  % sh3 with pid 557024 completed with status 0
% 0.95/0.83  % Result found by sh3
% 0.95/0.83  % Preprocessing class: HMLSSMSMSSSNSFA.
% 0.95/0.83  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.83  % Starting sh3 with 1500s (5) cores
% 0.95/0.83  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.95/0.83  % No SInE strategy applied
% 0.95/0.83  % Search class: HGHSM-SSLM32-DSFFFFBN
% 0.95/0.83  % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.95/0.83  % Starting SubtermCWHack with 151s (1) cores
% 0.95/0.83  % Starting sh3 with 750s (1) cores
% 0.95/0.83  % Starting lpo1_def_fix with 188s (1) cores
% 0.95/0.83  % Starting lpo8_s with 188s (1) cores
% 0.95/0.83  % Starting lpo1_lambda_fix with 188s (1) cores
% 0.95/0.83  % lpo8_s with pid 557077 completed with status 0
% 0.95/0.83  % Result found by lpo8_s
% 0.95/0.83  % Preprocessing class: HMLSSMSMSSSNSFA.
% 0.95/0.83  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.83  % Starting sh3 with 1500s (5) cores
% 0.95/0.83  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.95/0.83  % No SInE strategy applied
% 0.95/0.83  % Search class: HGHSM-SSLM32-DSFFFFBN
% 0.95/0.83  % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.95/0.83  % Starting SubtermCWHack with 151s (1) cores
% 0.95/0.83  % Starting sh3 with 750s (1) cores
% 0.95/0.83  % Starting lpo1_def_fix with 188s (1) cores
% 0.95/0.83  % Starting lpo8_s with 188s (1) cores
% 0.95/0.83  % Preprocessing time       : 0.016 s
% 0.95/0.83  % Presaturation interreduction done
% 0.95/0.83  
% 0.95/0.83  % Proof found!
% 0.95/0.83  % SZS status ContradictoryAxioms
% 0.95/0.83  % SZS output start CNFRefutation
% See solution above
% 0.95/0.83  % Parsed axioms                        : 1259
% 0.95/0.83  % Removed by relevancy pruning/SinE    : 0
% 0.95/0.83  % Initial clauses                      : 1788
% 0.95/0.83  % Removed in clause preprocessing      : 150
% 0.95/0.83  % Initial clauses in saturation        : 1638
% 0.95/0.83  % Processed clauses                    : 3372
% 0.95/0.83  % ...of these trivial                  : 202
% 0.95/0.83  % ...subsumed                          : 1193
% 0.95/0.83  % ...remaining for further processing  : 1976
% 0.95/0.83  % Other redundant clauses eliminated   : 197
% 0.95/0.83  % Clauses deleted for lack of memory   : 0
% 0.95/0.83  % Backward-subsumed                    : 22
% 0.95/0.83  % Backward-rewritten                   : 70
% 0.95/0.83  % Generated clauses                    : 4172
% 0.95/0.83  % ...of the previous two non-redundant : 3311
% 0.95/0.83  % ...aggressively subsumed             : 0
% 0.95/0.83  % Contextual simplify-reflections      : 3
% 0.95/0.83  % Paramodulations                      : 3790
% 0.95/0.83  % Factorizations                       : 0
% 0.95/0.83  % NegExts                              : 93
% 0.95/0.83  % Equation resolutions                 : 204
% 0.95/0.83  % Disequality decompositions           : 0
% 0.95/0.83  % Total rewrite steps                  : 4787
% 0.95/0.83  % ...of those cached                   : 3855
% 0.95/0.83  % Propositional unsat checks           : 0
% 0.95/0.83  %    Propositional check models        : 0
% 0.95/0.83  %    Propositional check unsatisfiable : 0
% 0.95/0.83  %    Propositional clauses             : 0
% 0.95/0.83  %    Propositional clauses after purity: 0
% 0.95/0.83  %    Propositional unsat core size     : 0
% 0.95/0.83  %    Propositional preprocessing time  : 0.000
% 0.95/0.83  %    Propositional encoding time       : 0.000
% 0.95/0.83  %    Propositional solver time         : 0.000
% 0.95/0.83  %    Success case prop preproc time    : 0.000
% 0.95/0.83  %    Success case prop encoding time   : 0.000
% 0.95/0.83  %    Success case prop solver time     : 0.000
% 0.95/0.83  % Current number of processed clauses  : 705
% 0.95/0.83  %    Positive orientable unit clauses  : 271
% 0.95/0.83  %    Positive unorientable unit clauses: 1
% 0.95/0.83  %    Negative unit clauses             : 143
% 0.95/0.83  %    Non-unit-clauses                  : 290
% 0.95/0.83  % Current number of unprocessed clauses: 2410
% 0.95/0.83  % ...number of literals in the above   : 4780
% 0.95/0.83  % Current number of archived formulas  : 0
% 0.95/0.83  % Current number of archived clauses   : 1141
% 0.95/0.83  % Clause-clause subsumption calls (NU) : 161971
% 0.95/0.83  % Rec. Clause-clause subsumption calls : 100597
% 0.95/0.83  % Non-unit clause-clause subsumptions  : 409
% 0.95/0.83  % Unit Clause-clause subsumption calls : 12096
% 0.95/0.83  % Rewrite failures with RHS unbound    : 0
% 0.95/0.83  % BW rewrite match attempts            : 456
% 0.95/0.83  % BW rewrite match successes           : 256
% 0.95/0.83  % Condensation attempts                : 3372
% 0.95/0.83  % Condensation successes               : 18
% 0.95/0.83  % Termbank termtop insertions          : 218970
% 0.95/0.83  % Search garbage collected termcells   : 30002
% 0.95/0.83  
% 0.95/0.83  % -------------------------------------------------
% 0.95/0.83  % User time                : 0.319 s
% 0.95/0.83  % System time              : 0.029 s
% 0.95/0.83  % Total time               : 0.348 s
% 0.95/0.83  % Maximum resident set size: 11712 pages
% 0.95/0.83  
% 0.95/0.83  % -------------------------------------------------
% 0.95/0.83  % User time                : 1.072 s
% 0.95/0.83  % System time              : 0.103 s
% 0.95/0.83  % Total time               : 1.175 s
% 0.95/0.83  % Maximum resident set size: 7168 pages
% 0.95/0.83  % E exiting
%------------------------------------------------------------------------------