%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM672^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:16:47 AM UTC 2026
% Result : Theorem 3.45s 0.90s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 190 ( 53 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 407 ( 50 ~; 23 |; 7 &; 283 @)
% ( 0 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 7 con; 0-3 aty)
% Number of variables : 117 ( 82 ^; 35 !; 0 ?; 117 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_24,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_26,type,
in: $i > $i > $o ).
thf(decl_62,type,
imp: $o > $o > $o ).
thf(decl_63,type,
d_not: $o > $o ).
thf(decl_72,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_73,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_78,type,
e_is: $i > $i > $i > $o ).
thf(decl_124,type,
nat: $i ).
thf(decl_125,type,
n_is: $i > $i > $o ).
thf(decl_128,type,
n_some: ( $i > $o ) > $o ).
thf(decl_143,type,
n_pl: $i > $i > $i ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_150,type,
iii: $i > $i > $o ).
thf(decl_222,type,
esk65_0: $i ).
thf(decl_223,type,
esk66_0: $i ).
thf(decl_224,type,
esk67_0: $i ).
thf(decl_225,type,
esk68_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_imp) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_non) ).
thf(def_l_some,axiom,
( l_some
= ( ^ [X1: $i,X2: $i > $o] :
( d_not
@ ( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ( non @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_l_some) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_n_is) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_iii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X445: $i] :
( ( in @ X445 @ nat )
=> ( ( Z0 @ X445 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',def_n_some) ).
thf(satz19c,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X271: $i] : ( in @ X271 @ nat )
@ ^ [X272: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( ( iii @ X1 @ X272 )
=> ( iii @ ( n_pl @ X1 @ X4 ) @ ( n_pl @ X272 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',satz19c) ).
thf(satz5,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X194: $i] : ( in @ X194 @ nat )
@ ^ [X195: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] : ( n_is @ ( n_pl @ ( n_pl @ X1 @ X195 ) @ X4 ) @ ( n_pl @ X1 @ ( n_pl @ X195 @ X4 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',satz5) ).
thf(satz6,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X197: $i] : ( in @ X197 @ nat )
@ ^ [X198: $i] : ( n_is @ ( n_pl @ X1 @ X198 ) @ ( n_pl @ X198 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NF9atgYKNY/E---3.1_991233.p',satz6) ).
thf(c_0_14,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_15,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_16,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_17,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_18,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_19,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X418: $i] :
( ( in @ X418 @ Z0 )
=> ( ( Z1 @ X418 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_21,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_23,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_24,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X418: $i] :
( ( in @ X418 @ Z0 )
=> ( ( Z1 @ X418 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_21]),c_0_19]),c_0_22]) ).
thf(c_0_25,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_26,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_23]) ).
thf(c_0_27,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X457: $i] :
( ( in @ X457 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X457 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_28,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X445: $i] :
( ( in @ X445 @ nat )
=> ( ( Z0 @ X445 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_24]) ).
thf(c_0_29,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_30,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X271: $i] : ( in @ X271 @ nat )
@ ^ [X272: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ nat )
@ ^ [X4: $i] :
( ( iii @ X1 @ X272 )
=> ( iii @ ( n_pl @ X1 @ X4 ) @ ( n_pl @ X272 @ X4 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz19c]) ).
thf(c_0_31,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X457: $i] :
( ( in @ X457 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X457 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
thf(c_0_32,negated_conjecture,
~ ! [X716: $i] :
( ( in @ X716 @ nat )
=> ! [X715: $i] :
( ( in @ X715 @ nat )
=> ! [X714: $i] :
( ( in @ X714 @ nat )
=> ( ( ! [X712: $i] :
( ( in @ X712 @ nat )
=> ( ( X715
= ( n_pl @ X716 @ X712 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ! [X713: $i] :
( ( in @ X713 @ nat )
=> ( ( ( n_pl @ X715 @ X714 )
= ( n_pl @ ( n_pl @ X716 @ X714 ) @ X713 ) )
=> ~ $true ) )
=> ~ $true ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_30]),c_0_21]),c_0_31]) ).
thf(c_0_33,plain,
! [X571: $i] :
( ( in @ X571 @ nat )
=> ! [X570: $i] :
( ( in @ X570 @ nat )
=> ! [X569: $i] :
( ( in @ X569 @ nat )
=> ( ( n_pl @ ( n_pl @ X571 @ X570 ) @ X569 )
= ( n_pl @ X571 @ ( n_pl @ X570 @ X569 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz5]),c_0_21]),c_0_26]) ).
thf(c_0_34,negated_conjecture,
! [X1353: $i] :
( ( in @ esk65_0 @ nat )
& ( in @ esk66_0 @ nat )
& ( in @ esk67_0 @ nat )
& ( ( in @ esk68_0 @ nat )
| ~ $true )
& ( ( esk66_0
= ( n_pl @ esk65_0 @ esk68_0 ) )
| ~ $true )
& ( $true
| ~ $true )
& ( ~ ( in @ X1353 @ nat )
| ( ( n_pl @ esk66_0 @ esk67_0 )
!= ( n_pl @ ( n_pl @ esk65_0 @ esk67_0 ) @ X1353 ) )
| ~ $true )
& $true ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])])])]) ).
thf(c_0_35,plain,
! [X1194: $i,X1195: $i,X1196: $i] :
( ~ ( in @ X1194 @ nat )
| ~ ( in @ X1195 @ nat )
| ~ ( in @ X1196 @ nat )
| ( ( n_pl @ ( n_pl @ X1194 @ X1195 ) @ X1196 )
= ( n_pl @ X1194 @ ( n_pl @ X1195 @ X1196 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
thf(c_0_36,negated_conjecture,
( ( esk66_0
= ( n_pl @ esk65_0 @ esk68_0 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_37,negated_conjecture,
( ( in @ esk68_0 @ nat )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_38,plain,
! [X573: $i] :
( ( in @ X573 @ nat )
=> ! [X572: $i] :
( ( in @ X572 @ nat )
=> ( ( n_pl @ X573 @ X572 )
= ( n_pl @ X572 @ X573 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]),c_0_21]),c_0_26]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i] :
( ~ ( in @ X1 @ nat )
| ( ( n_pl @ esk66_0 @ esk67_0 )
!= ( n_pl @ ( n_pl @ esk65_0 @ esk67_0 ) @ X1 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_40,plain,
! [X1: $i,X4: $i,X5: $i] :
( ( ( n_pl @ ( n_pl @ X1 @ X4 ) @ X5 )
= ( n_pl @ X1 @ ( n_pl @ X4 @ X5 ) ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_41,negated_conjecture,
( esk66_0
= ( n_pl @ esk65_0 @ esk68_0 ) ),
inference(cn,[status(thm)],[c_0_36]) ).
thf(c_0_42,negated_conjecture,
in @ esk68_0 @ nat,
inference(cn,[status(thm)],[c_0_37]) ).
thf(c_0_43,negated_conjecture,
in @ esk65_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_44,plain,
! [X1197: $i,X1198: $i] :
( ~ ( in @ X1197 @ nat )
| ~ ( in @ X1198 @ nat )
| ( ( n_pl @ X1197 @ X1198 )
= ( n_pl @ X1198 @ X1197 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
thf(c_0_45,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk66_0 @ esk67_0 )
!= ( n_pl @ ( n_pl @ esk65_0 @ esk67_0 ) @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_39]) ).
thf(c_0_46,negated_conjecture,
in @ esk67_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_47,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk65_0 @ ( n_pl @ esk68_0 @ X1 ) )
= ( n_pl @ esk66_0 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
thf(c_0_48,plain,
! [X1: $i,X4: $i] :
( ( ( n_pl @ X1 @ X4 )
= ( n_pl @ X4 @ X1 ) )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
thf(c_0_49,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk65_0 @ ( n_pl @ esk67_0 @ X1 ) )
!= ( n_pl @ esk66_0 @ esk67_0 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_46]),c_0_43])]) ).
thf(c_0_50,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk65_0 @ ( n_pl @ X1 @ esk68_0 ) )
= ( n_pl @ esk66_0 @ X1 ) )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_42])]) ).
thf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_42]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM672^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.27 % Computer : n020.cluster.edu
% 0.13/0.27 % Model : x86_64 x86_64
% 0.13/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.27 % Memory : 8046.5625MB
% 0.13/0.27 % OS : Linux 6.8.0-71-generic
% 0.13/0.27 % CPULimit : 300
% 0.13/0.27 % WCLimit : 300
% 0.13/0.27 % DateTime : Tue Sep 29 12:35:34 UTC 2026
% 0.13/0.27 % CPUTime :
% 0.13/0.27 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.34 Running higher-order theorem proving
% 0.26/0.43 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.NF9atgYKNY/E---3.1_991233.p
% 3.45/0.90 % Version: 3.5.1-ho
% 3.45/0.90 % Preprocessing class: HSLMSMSSLLLCHSA.
% 3.45/0.90 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 3.45/0.90 % Starting lpo1_fix with 900s (3) cores
% 3.45/0.90 % Starting full_lambda_9 with 300s (1) cores
% 3.45/0.90 % Starting almost_fo_4 with 300s (1) cores
% 3.45/0.90 % Starting new_ho_9 with 300s (1) cores
% 3.45/0.90 % Starting pre_casc_4 with 300s (1) cores
% 3.45/0.90 % Starting ho_unfolding_6 with 300s (1) cores
% 3.45/0.90 % lpo1_fix with pid 991246 completed with status 0
% 3.45/0.90 % Result found by lpo1_fix
% 3.45/0.90 % Preprocessing class: HSLMSMSSLLLCHSA.
% 3.45/0.90 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 3.45/0.90 % Starting lpo1_fix with 900s (3) cores
% 3.45/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.45/0.90 % No SInE strategy applied
% 3.45/0.90 % Search class: HGHSM-FSLM32-MHSMMSBN
% 3.45/0.90 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 3.45/0.90 % Starting SubtermCWHack with 91s (1) cores
% 3.45/0.90 % Starting full_lambda_5 with 82s (1) cores
% 3.45/0.90 % Starting new_ho_6 with 82s (1) cores
% 3.45/0.90 % new_ho_6 with pid 991257 completed with status 0
% 3.45/0.90 % Result found by new_ho_6
% 3.45/0.90 % Preprocessing class: HSLMSMSSLLLCHSA.
% 3.45/0.90 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 3.45/0.90 % Starting lpo1_fix with 900s (3) cores
% 3.45/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.45/0.90 % No SInE strategy applied
% 3.45/0.90 % Search class: HGHSM-FSLM32-MHSMMSBN
% 3.45/0.90 % Scheduled 11 strats onto 3 cores with 900 seconds (900 total)
% 3.45/0.90 % Starting SubtermCWHack with 91s (1) cores
% 3.45/0.90 % Starting full_lambda_5 with 82s (1) cores
% 3.45/0.90 % Starting new_ho_6 with 82s (1) cores
% 3.45/0.90 % Preprocessing time : 0.010 s
% 3.45/0.90
% 3.45/0.90 % Proof found!
% 3.45/0.90 % SZS status Theorem
% 3.45/0.90 % SZS output start CNFRefutation
% See solution above
% 3.45/0.90 % Parsed axioms : 371
% 3.45/0.90 % Removed by relevancy pruning/SinE : 0
% 3.45/0.90 % Initial clauses : 877
% 3.45/0.90 % Removed in clause preprocessing : 494
% 3.45/0.90 % Initial clauses in saturation : 383
% 3.45/0.90 % Processed clauses : 1518
% 3.45/0.90 % ...of these trivial : 70
% 3.45/0.90 % ...subsumed : 562
% 3.45/0.90 % ...remaining for further processing : 886
% 3.45/0.90 % Other redundant clauses eliminated : 213
% 3.45/0.90 % Clauses deleted for lack of memory : 0
% 3.45/0.90 % Backward-subsumed : 24
% 3.45/0.90 % Backward-rewritten : 52
% 3.45/0.90 % Generated clauses : 11121
% 3.45/0.90 % ...of the previous two non-redundant : 10622
% 3.45/0.90 % ...aggressively subsumed : 0
% 3.45/0.90 % Contextual simplify-reflections : 11
% 3.45/0.90 % Paramodulations : 10834
% 3.45/0.90 % Factorizations : 2
% 3.45/0.90 % NegExts : 0
% 3.45/0.90 % Equation resolutions : 270
% 3.45/0.90 % Disequality decompositions : 0
% 3.45/0.90 % Total rewrite steps : 2311
% 3.45/0.90 % ...of those cached : 2155
% 3.45/0.90 % Propositional unsat checks : 1
% 3.45/0.90 % Propositional check models : 1
% 3.45/0.90 % Propositional check unsatisfiable : 0
% 3.45/0.90 % Propositional clauses : 0
% 3.45/0.90 % Propositional clauses after purity: 0
% 3.45/0.90 % Propositional unsat core size : 0
% 3.45/0.90 % Propositional preprocessing time : 0.000
% 3.45/0.90 % Propositional encoding time : 0.017
% 3.45/0.90 % Propositional solver time : 0.006
% 3.45/0.90 % Success case prop preproc time : 0.000
% 3.45/0.90 % Success case prop encoding time : 0.000
% 3.45/0.90 % Success case prop solver time : 0.000
% 3.45/0.90 % Current number of processed clauses : 793
% 3.45/0.90 % Positive orientable unit clauses : 153
% 3.45/0.90 % Positive unorientable unit clauses: 1
% 3.45/0.90 % Negative unit clauses : 45
% 3.45/0.90 % Non-unit-clauses : 594
% 3.45/0.90 % Current number of unprocessed clauses: 9320
% 3.45/0.90 % ...number of literals in the above : 34402
% 3.45/0.90 % Current number of archived formulas : 0
% 3.45/0.90 % Current number of archived clauses : 76
% 3.45/0.90 % Clause-clause subsumption calls (NU) : 65130
% 3.45/0.90 % Rec. Clause-clause subsumption calls : 29234
% 3.45/0.90 % Non-unit clause-clause subsumptions : 347
% 3.45/0.90 % Unit Clause-clause subsumption calls : 4090
% 3.45/0.90 % Rewrite failures with RHS unbound : 0
% 3.45/0.90 % BW rewrite match attempts : 49
% 3.45/0.90 % BW rewrite match successes : 14
% 3.45/0.90 % Condensation attempts : 1518
% 3.45/0.90 % Condensation successes : 3
% 3.45/0.90 % Termbank termtop insertions : 321084
% 3.45/0.90 % Search garbage collected termcells : 30739
% 3.45/0.90
% 3.45/0.90 % -------------------------------------------------
% 3.45/0.90 % User time : 0.361 s
% 3.45/0.90 % System time : 0.026 s
% 3.45/0.90 % Total time : 0.387 s
% 3.45/0.90 % Maximum resident set size: 8304 pages
% 3.45/0.90
% 3.45/0.90 % -------------------------------------------------
% 3.45/0.90 % User time : 0.882 s
% 3.45/0.90 % System time : 0.074 s
% 3.45/0.90 % Total time : 0.955 s
% 3.45/0.90 % Maximum resident set size: 5120 pages
% 3.45/0.90 % E exiting
%------------------------------------------------------------------------------