%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926^2 : 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 : n020.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 1.44s 0.73s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 36 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 45 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 419 ( 20 ~; 10 |; 4 &; 381 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 56 ( 0 ^; 48 !; 8 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_26,type,
one_one_int: int ).
thf(decl_29,type,
plus_plus_int: int > int > int ).
thf(decl_32,type,
times_times_int: int > int > int ).
thf(decl_40,type,
bit0: int > int ).
thf(decl_41,type,
bit1: int > int ).
thf(decl_43,type,
pls: int ).
thf(decl_44,type,
number_number_of_int: int > int ).
thf(decl_45,type,
number_number_of_nat: int > nat ).
thf(decl_47,type,
ord_less_int: int > int > $o ).
thf(decl_50,type,
ord_less_eq_int: int > int > $o ).
thf(decl_53,type,
power_power_int: int > nat > int ).
thf(decl_64,type,
m: int ).
thf(decl_67,type,
t: int ).
thf(decl_68,type,
esk1_0: int ).
thf(decl_69,type,
esk2_0: int ).
thf(decl_70,type,
esk3_0: int ).
thf(decl_71,type,
esk4_0: int ).
thf(conj_0,conjecture,
? [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',conj_0) ).
thf(fact_142_number__of__is__id,axiom,
! [X29: int] :
( ( number_number_of_int @ X29 )
= X29 ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_142_number__of__is__id) ).
thf(fact_264_semiring__norm_I110_J,axiom,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_264_semiring__norm_I110_J) ).
thf(fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J,axiom,
! [X269: int] :
( ( times_times_int @ one_one_int @ X269 )
= X269 ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J) ).
thf(fact_200_mult__Bit0,axiom,
! [X29: int,X61: int] :
( ( times_times_int @ ( bit0 @ X29 ) @ X61 )
= ( bit0 @ ( times_times_int @ X29 @ X61 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_200_mult__Bit0) ).
thf(fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X194: int,X195: int] :
( ( plus_plus_int @ X194 @ X195 )
= ( plus_plus_int @ X195 @ X194 ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
thf(fact_249_add__Bit1__Bit0,axiom,
! [X29: int,X61: int] :
( ( plus_plus_int @ ( bit1 @ X29 ) @ ( bit0 @ X61 ) )
= ( bit1 @ ( plus_plus_int @ X29 @ X61 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_249_add__Bit1__Bit0) ).
thf(fact_202_add__Pls,axiom,
! [X29: int] :
( ( plus_plus_int @ pls @ X29 )
= X29 ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_202_add__Pls) ).
thf(fact_37_zless__le,axiom,
! [X26: int,X25: int] :
( ( ord_less_int @ X26 @ X25 )
<=> ( ( ord_less_eq_int @ X26 @ X25 )
& ( X26 != X25 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_37_zless__le) ).
thf(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ( t = one_one_int )
=> ? [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
thf(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ( ord_less_int @ one_one_int @ t )
=> ? [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
thf(fact_0_tpos,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox2/tmp/tmp.mOFYNGqkO1/E---3.1_1018056.p',fact_0_tpos) ).
thf(c_0_12,negated_conjecture,
~ ? [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_13,plain,
! [X2437: int] :
( ( number_number_of_int @ X2437 )
= X2437 ),
inference(variable_rename,[status(thm)],[fact_142_number__of__is__id]) ).
thf(c_0_14,negated_conjecture,
! [X3510: int,X3511: int] :
( ( plus_plus_int @ ( power_power_int @ X3510 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X3511 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_15,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
inference(split_conjunct,[status(thm)],[fact_264_semiring__norm_I110_J]) ).
thf(c_0_16,plain,
! [X1: int] :
( ( number_number_of_int @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X2532: int] :
( ( times_times_int @ one_one_int @ X2532 )
= X2532 ),
inference(variable_rename,[status(thm)],[fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J]) ).
thf(c_0_18,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
( one_one_int
= ( bit1 @ pls ) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,plain,
! [X2551: int,X2552: int] :
( ( times_times_int @ ( bit0 @ X2551 ) @ X2552 )
= ( bit0 @ ( times_times_int @ X2551 @ X2552 ) ) ),
inference(variable_rename,[status(thm)],[fact_200_mult__Bit0]) ).
thf(c_0_21,plain,
! [X1: int] :
( ( times_times_int @ one_one_int @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) @ m ) @ ( bit1 @ pls ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_16]),c_0_19]) ).
thf(c_0_23,plain,
! [X1: int,X2: int] :
( ( times_times_int @ ( bit0 @ X1 ) @ X2 )
= ( bit0 @ ( times_times_int @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,plain,
! [X1: int] :
( ( times_times_int @ ( bit1 @ pls ) @ X1 )
= X1 ),
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
thf(c_0_25,plain,
! [X2416: int,X2417: int] :
( ( plus_plus_int @ X2416 @ X2417 )
= ( plus_plus_int @ X2417 @ X2416 ) ),
inference(variable_rename,[status(thm)],[fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
thf(c_0_26,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( bit0 @ ( bit0 @ m ) ) @ ( bit1 @ pls ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_24]) ).
thf(c_0_27,plain,
! [X2: int,X1: int] :
( ( plus_plus_int @ X1 @ X2 )
= ( plus_plus_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_28,plain,
! [X2648: int,X2649: int] :
( ( plus_plus_int @ ( bit1 @ X2648 ) @ ( bit0 @ X2649 ) )
= ( bit1 @ ( plus_plus_int @ X2648 @ X2649 ) ) ),
inference(variable_rename,[status(thm)],[fact_249_add__Bit1__Bit0]) ).
thf(c_0_29,plain,
! [X2554: int] :
( ( plus_plus_int @ pls @ X2554 )
= X2554 ),
inference(variable_rename,[status(thm)],[fact_202_add__Pls]) ).
thf(c_0_30,plain,
! [X26: int,X25: int] :
( ( ord_less_int @ X26 @ X25 )
<=> ( ( ord_less_eq_int @ X26 @ X25 )
& ( X26 != X25 ) ) ),
inference(fof_simplification,[status(thm)],[fact_37_zless__le]) ).
thf(c_0_31,plain,
( ( t != one_one_int )
| ( ( plus_plus_int @ ( power_power_int @ esk1_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ esk2_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
thf(c_0_32,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( bit1 @ pls ) @ ( bit0 @ ( bit0 @ m ) ) ) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_33,plain,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( bit1 @ X1 ) @ ( bit0 @ X2 ) )
= ( bit1 @ ( plus_plus_int @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_34,plain,
! [X1: int] :
( ( plus_plus_int @ pls @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_35,plain,
( ~ ( ord_less_int @ one_one_int @ t )
| ( ( plus_plus_int @ ( power_power_int @ esk3_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ esk4_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
thf(c_0_36,plain,
! [X2184: int,X2185: int] :
( ( ( ord_less_eq_int @ X2184 @ X2185 )
| ~ ( ord_less_int @ X2184 @ X2185 ) )
& ( ( X2184 != X2185 )
| ~ ( ord_less_int @ X2184 @ X2185 ) )
& ( ~ ( ord_less_eq_int @ X2184 @ X2185 )
| ( X2184 = X2185 )
| ( ord_less_int @ X2184 @ X2185 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
thf(c_0_37,plain,
ord_less_eq_int @ one_one_int @ t,
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
thf(c_0_38,plain,
( ( ( plus_plus_int @ ( power_power_int @ esk1_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ esk2_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) )
| ( t != one_one_int ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_39,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( bit1 @ ( bit0 @ m ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
thf(c_0_40,plain,
( ( ( plus_plus_int @ ( power_power_int @ esk3_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ esk4_0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) )
| ~ ( ord_less_int @ one_one_int @ t ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_41,plain,
! [X1: int,X2: int] :
( ( X1 = X2 )
| ( ord_less_int @ X1 @ X2 )
| ~ ( ord_less_eq_int @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_42,plain,
ord_less_eq_int @ ( bit1 @ pls ) @ t,
inference(rw,[status(thm)],[c_0_37,c_0_19]) ).
thf(c_0_43,plain,
( t
!= ( bit1 @ pls ) ),
inference(sr,[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_38,c_0_16]),c_0_23]),c_0_23]),c_0_24]),c_0_19]),c_0_27]),c_0_33]),c_0_34]),c_0_19]),c_0_39]) ).
thf(c_0_44,plain,
~ ( ord_less_int @ ( bit1 @ pls ) @ t ),
inference(sr,[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_40,c_0_16]),c_0_23]),c_0_23]),c_0_24]),c_0_19]),c_0_27]),c_0_33]),c_0_34]),c_0_19]),c_0_39]) ).
thf(c_0_45,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926^2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 % Computer : n020.cluster.edu
% 0.08/0.23 % Model : x86_64 x86_64
% 0.08/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.23 % Memory : 8046.5625MB
% 0.08/0.23 % OS : Linux 6.8.0-71-generic
% 0.08/0.23 % CPULimit : 300
% 0.08/0.23 % WCLimit : 300
% 0.08/0.23 % DateTime : Tue Sep 29 13:06:49 UTC 2026
% 0.08/0.23 % CPUTime :
% 0.08/0.23 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.29 Running higher-order theorem proving
% 0.32/0.42 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.mOFYNGqkO1/E---3.1_1018056.p
% 1.44/0.73 % Version: 3.5.1-ho
% 1.44/0.73 % Preprocessing class: HSLSSMSMSSSNFFN.
% 1.44/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.44/0.73 % Starting sh3 with 1500s (5) cores
% 1.44/0.73 % Starting lpo1_def_fix with 300s (1) cores
% 1.44/0.73 % Starting lpo8_s with 300s (1) cores
% 1.44/0.73 % Starting lpo1_lambda_fix with 300s (1) cores
% 1.44/0.73 % sh3 with pid 1018069 completed with status 0
% 1.44/0.73 % Result found by sh3
% 1.44/0.73 % Preprocessing class: HSLSSMSMSSSNFFN.
% 1.44/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.44/0.73 % Starting sh3 with 1500s (5) cores
% 1.44/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.44/0.73 % No SInE strategy applied
% 1.44/0.73 % Search class: HGHSM-FSLM31-DFFFFFNN
% 1.44/0.73 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.44/0.73 % Starting SubtermCWHack with 151s (1) cores
% 1.44/0.73 % Starting sh3 with 901s (1) cores
% 1.44/0.73 % Starting lpo1_def_fix with 151s (1) cores
% 1.44/0.73 % Starting lpo8_s with 151s (1) cores
% 1.44/0.73 % Starting lpo1_lambda_fix with 146s (1) cores
% 1.44/0.73 % sh3 with pid 1018075 completed with status 0
% 1.44/0.73 % Result found by sh3
% 1.44/0.73 % Preprocessing class: HSLSSMSMSSSNFFN.
% 1.44/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.44/0.73 % Starting sh3 with 1500s (5) cores
% 1.44/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.44/0.73 % No SInE strategy applied
% 1.44/0.73 % Search class: HGHSM-FSLM31-DFFFFFNN
% 1.44/0.73 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.44/0.73 % Starting SubtermCWHack with 151s (1) cores
% 1.44/0.73 % Starting sh3 with 901s (1) cores
% 1.44/0.73 % Preprocessing time : 0.020 s
% 1.44/0.73 % Presaturation interreduction done
% 1.44/0.73
% 1.44/0.73 % Proof found!
% 1.44/0.73 % SZS status Theorem
% 1.44/0.73 % SZS output start CNFRefutation
% See solution above
% 1.44/0.73 % Parsed axioms : 748
% 1.44/0.73 % Removed by relevancy pruning/SinE : 0
% 1.44/0.73 % Initial clauses : 984
% 1.44/0.73 % Removed in clause preprocessing : 71
% 1.44/0.73 % Initial clauses in saturation : 913
% 1.44/0.73 % Processed clauses : 1166
% 1.44/0.73 % ...of these trivial : 142
% 1.44/0.73 % ...subsumed : 171
% 1.44/0.73 % ...remaining for further processing : 853
% 1.44/0.73 % Other redundant clauses eliminated : 95
% 1.44/0.73 % Clauses deleted for lack of memory : 0
% 1.44/0.73 % Backward-subsumed : 7
% 1.44/0.73 % Backward-rewritten : 55
% 1.44/0.73 % Generated clauses : 307
% 1.44/0.73 % ...of the previous two non-redundant : 237
% 1.44/0.73 % ...aggressively subsumed : 0
% 1.44/0.73 % Contextual simplify-reflections : 1
% 1.44/0.73 % Paramodulations : 227
% 1.44/0.73 % Factorizations : 0
% 1.44/0.73 % NegExts : 0
% 1.44/0.73 % Equation resolutions : 98
% 1.44/0.73 % Disequality decompositions : 0
% 1.44/0.73 % Total rewrite steps : 1483
% 1.44/0.73 % ...of those cached : 1249
% 1.44/0.73 % Propositional unsat checks : 0
% 1.44/0.73 % Propositional check models : 0
% 1.44/0.73 % Propositional check unsatisfiable : 0
% 1.44/0.73 % Propositional clauses : 0
% 1.44/0.73 % Propositional clauses after purity: 0
% 1.44/0.73 % Propositional unsat core size : 0
% 1.44/0.73 % Propositional preprocessing time : 0.000
% 1.44/0.73 % Propositional encoding time : 0.000
% 1.44/0.73 % Propositional solver time : 0.000
% 1.44/0.73 % Success case prop preproc time : 0.000
% 1.44/0.73 % Success case prop encoding time : 0.000
% 1.44/0.73 % Success case prop solver time : 0.000
% 1.44/0.73 % Current number of processed clauses : 148
% 1.44/0.73 % Positive orientable unit clauses : 65
% 1.44/0.73 % Positive unorientable unit clauses: 2
% 1.44/0.73 % Negative unit clauses : 24
% 1.44/0.73 % Non-unit-clauses : 57
% 1.44/0.73 % Current number of unprocessed clauses: 546
% 1.44/0.73 % ...number of literals in the above : 1167
% 1.44/0.73 % Current number of archived formulas : 0
% 1.44/0.73 % Current number of archived clauses : 629
% 1.44/0.73 % Clause-clause subsumption calls (NU) : 38220
% 1.44/0.73 % Rec. Clause-clause subsumption calls : 21432
% 1.44/0.73 % Non-unit clause-clause subsumptions : 103
% 1.44/0.73 % Unit Clause-clause subsumption calls : 586
% 1.44/0.73 % Rewrite failures with RHS unbound : 3
% 1.44/0.73 % BW rewrite match attempts : 264
% 1.44/0.73 % BW rewrite match successes : 171
% 1.44/0.73 % Condensation attempts : 0
% 1.44/0.73 % Condensation successes : 0
% 1.44/0.73 % Termbank termtop insertions : 81627
% 1.44/0.73 % Search garbage collected termcells : 13826
% 1.44/0.73
% 1.44/0.73 % -------------------------------------------------
% 1.44/0.73 % User time : 0.203 s
% 1.44/0.73 % System time : 0.028 s
% 1.44/0.73 % Total time : 0.231 s
% 1.44/0.73 % Maximum resident set size: 7704 pages
% 1.44/0.73
% 1.44/0.73 % -------------------------------------------------
% 1.44/0.73 % User time : 0.800 s
% 1.44/0.73 % System time : 0.090 s
% 1.44/0.73 % Total time : 0.890 s
% 1.44/0.73 % Maximum resident set size: 6144 pages
% 1.44/0.73 % E exiting
%------------------------------------------------------------------------------