TSTP Solution File: NUM926^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM926^1 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:17:54 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of formulae : 60 ( 26 unt; 19 typ; 0 def)
% Number of atoms : 64 ( 45 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 490 ( 26 ~; 15 |; 4 &; 441 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 14 ( 14 >; 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_22,type,
one_one_int: int ).
thf(decl_24,type,
plus_plus_int: int > int > int ).
thf(decl_26,type,
times_times_int: int > int > int ).
thf(decl_29,type,
bit0: int > int ).
thf(decl_30,type,
bit1: int > int ).
thf(decl_31,type,
pls: int ).
thf(decl_32,type,
number_number_of_int: int > int ).
thf(decl_33,type,
number_number_of_nat: int > nat ).
thf(decl_34,type,
ord_less_int: int > int > $o ).
thf(decl_36,type,
ord_less_eq_int: int > int > $o ).
thf(decl_38,type,
power_power_int: int > nat > int ).
thf(decl_41,type,
m: int ).
thf(decl_43,type,
t: int ).
thf(decl_44,type,
esk1_0: int ).
thf(decl_45,type,
esk2_0: int ).
thf(decl_46,type,
esk3_0: int ).
thf(decl_47,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/benchmark/theBenchmark.p',conj_0) ).
thf(fact_111_number__of__is__id,axiom,
! [X24: int] :
( ( number_number_of_int @ X24 )
= X24 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_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/benchmark/theBenchmark.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_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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',fact_28_zless__le) ).
thf(fact_0_tpos,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox/benchmark/theBenchmark.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,
! [X376: int,X377: int] :
( ( plus_plus_int @ ( power_power_int @ X376 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X377 @ ( 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,
! [X478: int] :
( ( number_number_of_int @ X478 )
= X478 ),
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,
! [X404: int,X405: int] :
( ( plus_plus_int @ X404 @ X405 )
= ( plus_plus_int @ X405 @ X404 ) ),
inference(variable_rename,[status(thm)],[fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
thf(c_0_15,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_16,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_17,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_18,plain,
! [X446: int,X447: int] :
( ( times_times_int @ X446 @ X447 )
= ( times_times_int @ X447 @ X446 ) ),
inference(variable_rename,[status(thm)],[fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J]) ).
thf(c_0_19,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_15]) ).
thf(c_0_20,plain,
! [X498: int] :
( ( times_times_int @ X498 @ X498 )
= ( power_power_int @ X498 @ ( 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 @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) @ m ) ) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X2: int,X1: int] :
( ( times_times_int @ X1 @ X2 )
= ( times_times_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,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 @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) @ m ) @ one_one_int ) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
thf(c_0_24,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_25,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_21,c_0_22]) ).
thf(c_0_26,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( times_times_int @ esk1_0 @ esk1_0 ) @ ( times_times_int @ esk2_0 @ esk2_0 ) ) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
thf(c_0_27,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_28,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_29,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_25,c_0_24]) ).
thf(c_0_30,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 @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) @ m ) ) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[c_0_26,c_0_17]) ).
thf(c_0_31,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_27]) ).
thf(c_0_32,plain,
! [X516: int,X517: int] :
( ( ( ord_less_eq_int @ X516 @ X517 )
| ~ ( ord_less_int @ X516 @ X517 ) )
& ( ( X516 != X517 )
| ~ ( ord_less_int @ X516 @ X517 ) )
& ( ~ ( ord_less_eq_int @ X516 @ X517 )
| ( X516 = X517 )
| ( ord_less_int @ X516 @ X517 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
thf(c_0_33,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_29,c_0_24]) ).
thf(c_0_34,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)],[c_0_30,c_0_22]) ).
thf(c_0_35,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_31,c_0_24]),c_0_24]),c_0_13]),c_0_22]),c_0_17]) ).
thf(c_0_36,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_32]) ).
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,negated_conjecture,
t != one_one_int,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_39,negated_conjecture,
~ ( ord_less_int @ one_one_int @ t ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
thf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM926^1 : TPTP v8.2.0. Released v5.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 07:23:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0-ho
% 0.19/0.51 # Preprocessing class: HSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_2 with 300s (1) cores
% 0.19/0.51 # new_bool_1 with pid 21990 completed with status 0
% 0.19/0.51 # Result found by new_bool_1
% 0.19/0.51 # Preprocessing class: HSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: HGHSM-FFMS21-DFFFFFNN
% 0.19/0.51 # partial match(1): FGHSM-FFMS21-DFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting new_ho_10 with 55s (1) cores
% 0.19/0.51 # new_ho_10 with pid 21993 completed with status 0
% 0.19/0.51 # Result found by new_ho_10
% 0.19/0.51 # Preprocessing class: HSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: HGHSM-FFMS21-DFFFFFNN
% 0.19/0.51 # partial match(1): FGHSM-FFMS21-DFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting new_ho_10 with 55s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 148
% 0.19/0.52 # Removed by relevancy pruning/SinE : 44
% 0.19/0.52 # Initial clauses : 142
% 0.19/0.52 # Removed in clause preprocessing : 7
% 0.19/0.52 # Initial clauses in saturation : 135
% 0.19/0.52 # Processed clauses : 245
% 0.19/0.52 # ...of these trivial : 26
% 0.19/0.52 # ...subsumed : 40
% 0.19/0.52 # ...remaining for further processing : 179
% 0.19/0.52 # Other redundant clauses eliminated : 1
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 3
% 0.19/0.52 # Backward-rewritten : 9
% 0.19/0.52 # Generated clauses : 258
% 0.19/0.52 # ...of the previous two non-redundant : 218
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 253
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 3
% 0.19/0.52 # Disequality decompositions : 0
% 0.19/0.52 # Total rewrite steps : 193
% 0.19/0.52 # ...of those cached : 97
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 85
% 0.19/0.52 # Positive orientable unit clauses : 24
% 0.19/0.52 # Positive unorientable unit clauses: 7
% 0.19/0.52 # Negative unit clauses : 11
% 0.19/0.52 # Non-unit-clauses : 43
% 0.19/0.52 # Current number of unprocessed clauses: 182
% 0.19/0.52 # ...number of literals in the above : 267
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 93
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 551
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 523
% 0.19/0.52 # Non-unit clause-clause subsumptions : 20
% 0.19/0.52 # Unit Clause-clause subsumption calls : 85
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 138
% 0.19/0.52 # BW rewrite match successes : 112
% 0.19/0.52 # Condensation attempts : 245
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 13875
% 0.19/0.52 # Search garbage collected termcells : 1771
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.024 s
% 0.19/0.52 # System time : 0.003 s
% 0.19/0.52 # Total time : 0.027 s
% 0.19/0.52 # Maximum resident set size: 2584 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.028 s
% 0.19/0.52 # System time : 0.006 s
% 0.19/0.52 # Total time : 0.034 s
% 0.19/0.52 # Maximum resident set size: 1932 pages
% 0.19/0.52 % E---3.1 exiting
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------