%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926^1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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.09s 0.25s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 58 ( 39 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 439 ( 23 ~; 12 |; 4 &; 396 @)
% ( 2 <=>; 2 =>; 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 : 19 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 48 ( 0 ^; 40 !; 8 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_23,type,
one_one_int: int ).
thf(decl_25,type,
plus_plus_int: int > int > int ).
thf(decl_27,type,
times_times_int: int > int > int ).
thf(decl_30,type,
bit0: int > int ).
thf(decl_31,type,
bit1: int > int ).
thf(decl_32,type,
pls: int ).
thf(decl_33,type,
number_number_of_int: int > int ).
thf(decl_34,type,
number_number_of_nat: int > nat ).
thf(decl_35,type,
ord_less_int: int > int > $o ).
thf(decl_37,type,
ord_less_eq_int: int > int > $o ).
thf(decl_39,type,
power_power_int: int > nat > int ).
thf(decl_42,type,
m: int ).
thf(decl_44,type,
t: int ).
thf(decl_45,type,
esk1_0: int ).
thf(decl_46,type,
esk2_0: int ).
thf(decl_47,type,
esk3_0: int ).
thf(decl_48,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/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',conj_0) ).
thf(fact_111_number__of__is__id,axiom,
! [X24: int] :
( ( number_number_of_int @ X24 )
= X24 ),
file('/export/starexec/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',fact_111_number__of__is__id) ).
thf(fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X140: int,X141: int] :
( ( plus_plus_int @ X140 @ X141 )
= ( plus_plus_int @ X141 @ X140 ) ),
file('/export/starexec/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
thf(fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J,axiom,
! [X104: int,X105: int] :
( ( times_times_int @ X104 @ X105 )
= ( times_times_int @ X105 @ X104 ) ),
file('/export/starexec/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
thf(fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X10: int] :
( ( times_times_int @ X10 @ X10 )
= ( power_power_int @ X10 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
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/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.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/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.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_28_zless__le,axiom,
! [X21: int,X20: int] :
( ( ord_less_int @ X21 @ X20 )
<=> ( ( ord_less_eq_int @ X21 @ X20 )
& ( X21 != X20 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',fact_28_zless__le) ).
thf(fact_0_tpos,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p',fact_0_tpos) ).
thf(c_0_9,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_10,negated_conjecture,
! [X638: int,X639: int] :
( ( plus_plus_int @ ( power_power_int @ X638 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X639 @ ( 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_9])])]) ).
thf(c_0_11,plain,
! [X617: int] :
( ( number_number_of_int @ X617 )
= X617 ),
inference(variable_rename,[status(thm)],[fact_111_number__of__is__id]) ).
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(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X1: int] :
( ( number_number_of_int @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X598: int,X599: int] :
( ( plus_plus_int @ X598 @ X599 )
= ( plus_plus_int @ X599 @ X598 ) ),
inference(variable_rename,[status(thm)],[fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
thf(c_0_15,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 ) @ one_one_int ) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
! [X2: int,X1: int] :
( ( plus_plus_int @ X1 @ X2 )
= ( plus_plus_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,plain,
! [X562: int,X563: int] :
( ( times_times_int @ X562 @ X563 )
= ( times_times_int @ X563 @ X562 ) ),
inference(variable_rename,[status(thm)],[fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_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 @ one_one_int @ ( times_times_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) @ m ) ) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,plain,
! [X2: int,X1: int] :
( ( times_times_int @ X1 @ X2 )
= ( times_times_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,plain,
! [X411: int] :
( ( times_times_int @ X411 @ X411 )
= ( power_power_int @ X411 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
inference(variable_rename,[status(thm)],[fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
thf(c_0_21,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 @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,plain,
! [X1: int] :
( ( times_times_int @ X1 @ X1 )
= ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,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_24,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_25,plain,
! [X21: int,X20: int] :
( ( ord_less_int @ X21 @ X20 )
<=> ( ( ord_less_eq_int @ X21 @ X20 )
& ( X21 != X20 ) ) ),
inference(fof_simplification,[status(thm)],[fact_28_zless__le]) ).
thf(c_0_26,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( times_times_int @ X1 @ X1 ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,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_23]) ).
thf(c_0_28,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_24]) ).
thf(c_0_29,plain,
! [X425: int,X426: int] :
( ( ( ord_less_eq_int @ X425 @ X426 )
| ~ ( ord_less_int @ X425 @ X426 ) )
& ( ( X425 != X426 )
| ~ ( ord_less_int @ X425 @ X426 ) )
& ( ~ ( ord_less_eq_int @ X425 @ X426 )
| ( X425 = X426 )
| ( ord_less_int @ X425 @ X426 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
thf(c_0_30,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( times_times_int @ X1 @ X1 ) @ ( times_times_int @ X2 @ X2 ) )
!= ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
thf(c_0_31,plain,
( ( ( plus_plus_int @ ( times_times_int @ esk1_0 @ esk1_0 ) @ ( times_times_int @ esk2_0 @ esk2_0 ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22]),c_0_22]),c_0_13]),c_0_19]),c_0_16]) ).
thf(c_0_32,plain,
( ( ( plus_plus_int @ ( times_times_int @ esk3_0 @ esk3_0 ) @ ( times_times_int @ esk4_0 @ esk4_0 ) )
= ( plus_plus_int @ one_one_int @ ( times_times_int @ m @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ~ ( ord_less_int @ one_one_int @ t ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_22]),c_0_22]),c_0_13]),c_0_19]),c_0_16]) ).
thf(c_0_33,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_29]) ).
thf(c_0_34,plain,
ord_less_eq_int @ one_one_int @ t,
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
thf(c_0_35,negated_conjecture,
t != one_one_int,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_36,plain,
~ ( ord_less_int @ one_one_int @ t ),
inference(sr,[status(thm)],[c_0_32,c_0_30]) ).
thf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926^1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.15 % Computer : n016.cluster.edu
% 0.09/0.15 % Model : x86_64 x86_64
% 0.09/0.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.15 % Memory : 8046.5625MB
% 0.09/0.15 % OS : Linux 6.8.0-71-generic
% 0.09/0.15 % CPULimit : 300
% 0.09/0.15 % WCLimit : 300
% 0.09/0.15 % DateTime : Tue Sep 29 13:10:34 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.21 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ahFxQaJHFD/E---3.1_314442.p
% 0.09/0.25 % Version: 3.5.1-ho
% 0.09/0.25 % Preprocessing class: HSLSSMSSSSSNFFN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % Starting sh5l with 300s (1) cores
% 0.09/0.25 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.25 % Starting new_bool_2 with 300s (1) cores
% 0.09/0.25 % new_ho_10 with pid 314455 completed with status 0
% 0.09/0.25 % Result found by new_ho_10
% 0.09/0.25 % Preprocessing class: HSLSSMSSSSSNFFN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHSM-FFLM21-DFFFFFNN
% 0.09/0.25 % partial match(1): FGHSM-FFLM21-DFFFFFNN
% 0.09/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.25 % Starting new_ho_10 with 151s (1) cores
% 0.09/0.25 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.09/0.25 % Starting new_bool_3 with 169s (1) cores
% 0.09/0.25 % Starting new_bool_1 with 169s (1) cores
% 0.09/0.25 % new_ho_10 with pid 314463 completed with status 0
% 0.09/0.25 % Result found by new_ho_10
% 0.09/0.25 % Preprocessing class: HSLSSMSSSSSNFFN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHSM-FFLM21-DFFFFFNN
% 0.09/0.25 % partial match(1): FGHSM-FFLM21-DFFFFFNN
% 0.09/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.25 % Starting new_ho_10 with 151s (1) cores
% 0.09/0.25 % Preprocessing time : 0.002 s
% 0.09/0.25 % Presaturation interreduction done
% 0.09/0.25
% 0.09/0.25 % Proof found!
% 0.09/0.25 % SZS status Theorem
% 0.09/0.25 % SZS output start CNFRefutation
% See solution above
% 0.09/0.25 % Parsed axioms : 148
% 0.09/0.25 % Removed by relevancy pruning/SinE : 0
% 0.09/0.25 % Initial clauses : 187
% 0.09/0.25 % Removed in clause preprocessing : 31
% 0.09/0.25 % Initial clauses in saturation : 156
% 0.09/0.25 % Processed clauses : 292
% 0.09/0.25 % ...of these trivial : 27
% 0.09/0.25 % ...subsumed : 45
% 0.09/0.25 % ...remaining for further processing : 220
% 0.09/0.25 % Other redundant clauses eliminated : 1
% 0.09/0.25 % Clauses deleted for lack of memory : 0
% 0.09/0.25 % Backward-subsumed : 3
% 0.09/0.25 % Backward-rewritten : 14
% 0.09/0.25 % Generated clauses : 339
% 0.09/0.25 % ...of the previous two non-redundant : 285
% 0.09/0.25 % ...aggressively subsumed : 0
% 0.09/0.25 % Contextual simplify-reflections : 0
% 0.09/0.25 % Paramodulations : 334
% 0.09/0.25 % Factorizations : 0
% 0.09/0.25 % NegExts : 0
% 0.09/0.25 % Equation resolutions : 3
% 0.09/0.25 % Disequality decompositions : 0
% 0.09/0.25 % Total rewrite steps : 252
% 0.09/0.25 % ...of those cached : 132
% 0.09/0.25 % Propositional unsat checks : 0
% 0.09/0.25 % Propositional check models : 0
% 0.09/0.25 % Propositional check unsatisfiable : 0
% 0.09/0.25 % Propositional clauses : 0
% 0.09/0.25 % Propositional clauses after purity: 0
% 0.09/0.25 % Propositional unsat core size : 0
% 0.09/0.25 % Propositional preprocessing time : 0.000
% 0.09/0.25 % Propositional encoding time : 0.000
% 0.09/0.25 % Propositional solver time : 0.000
% 0.09/0.25 % Success case prop preproc time : 0.000
% 0.09/0.25 % Success case prop encoding time : 0.000
% 0.09/0.25 % Success case prop solver time : 0.000
% 0.09/0.25 % Current number of processed clauses : 104
% 0.09/0.25 % Positive orientable unit clauses : 36
% 0.09/0.25 % Positive unorientable unit clauses: 8
% 0.09/0.25 % Negative unit clauses : 12
% 0.09/0.25 % Non-unit-clauses : 48
% 0.09/0.25 % Current number of unprocessed clauses: 239
% 0.09/0.25 % ...number of literals in the above : 347
% 0.09/0.25 % Current number of archived formulas : 0
% 0.09/0.25 % Current number of archived clauses : 115
% 0.09/0.25 % Clause-clause subsumption calls (NU) : 1128
% 0.09/0.25 % Rec. Clause-clause subsumption calls : 867
% 0.09/0.25 % Non-unit clause-clause subsumptions : 20
% 0.09/0.25 % Unit Clause-clause subsumption calls : 165
% 0.09/0.25 % Rewrite failures with RHS unbound : 0
% 0.09/0.25 % BW rewrite match attempts : 172
% 0.09/0.25 % BW rewrite match successes : 134
% 0.09/0.25 % Condensation attempts : 293
% 0.09/0.25 % Condensation successes : 0
% 0.09/0.25 % Termbank termtop insertions : 17191
% 0.09/0.25 % Search garbage collected termcells : 1818
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.019 s
% 0.09/0.25 % System time : 0.005 s
% 0.09/0.25 % Total time : 0.024 s
% 0.09/0.25 % Maximum resident set size: 4364 pages
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.070 s
% 0.09/0.25 % System time : 0.019 s
% 0.09/0.25 % Total time : 0.089 s
% 0.09/0.25 % Maximum resident set size: 5120 pages
% 0.09/0.25 % E exiting
%------------------------------------------------------------------------------