%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU699^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:25:15 AM UTC 2026
% Result : Theorem 0.53s 0.40s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 123 ( 26 equ; 0 cnn)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 736 ( 30 ~; 36 |; 8 &; 614 @)
% ( 6 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 8 con; 0-4 aty)
% Number of variables : 115 ( 6 ^; 109 !; 0 ?; 115 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
funcSet: $i > $i > $i ).
thf(decl_25,type,
ap: $i > $i > $i > $i > $i ).
thf(decl_26,type,
ap2p: $o ).
thf(decl_27,type,
lam: $i > $i > ( $i > $i ) > $i ).
thf(decl_28,type,
lam2p: $o ).
thf(decl_29,type,
funcext2: $o ).
thf(decl_30,type,
beta2: $o ).
thf(decl_31,type,
esk1_3: $i > $i > ( $i > $i ) > $i ).
thf(decl_32,type,
esk2_4: $i > $i > $i > $i > $i ).
thf(decl_33,type,
esk3_3: $i > $i > ( $i > $i ) > $i ).
thf(decl_34,type,
esk4_0: $i ).
thf(decl_35,type,
esk5_0: $i ).
thf(decl_36,type,
esk6_0: $i ).
thf(eta2,conjecture,
( ap2p
=> ( lam2p
=> ( funcext2
=> ( beta2
=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( funcSet @ X1 @ X2 ) )
=> ( ( lam @ X1 @ X2
@ ^ [X4: $i] : ( ap @ X1 @ X2 @ X3 @ X4 ) )
= X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.09sgdtvkS7/E---3.1_2566588.p',eta2) ).
thf(lam2p,axiom,
( lam2p
<=> ! [X1: $i,X2: $i,X5: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X5 @ X4 ) @ X2 ) )
=> ( in
@ ( lam @ X1 @ X2
@ ^ [X4: $i] : ( X5 @ X4 ) )
@ ( funcSet @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.09sgdtvkS7/E---3.1_2566588.p',lam2p) ).
thf(beta2,axiom,
( beta2
<=> ! [X1: $i,X2: $i,X7: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X7 @ X4 ) @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [X8: $i] : ( X7 @ X8 ) )
@ X4 )
= ( X7 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.09sgdtvkS7/E---3.1_2566588.p',beta2) ).
thf(ap2p,axiom,
( ap2p
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( funcSet @ X1 @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( ap @ X1 @ X2 @ X3 @ X4 ) @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.09sgdtvkS7/E---3.1_2566588.p',ap2p) ).
thf(funcext2,axiom,
( funcext2
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( funcSet @ X1 @ X2 ) )
=> ! [X6: $i] :
( ( in @ X6 @ ( funcSet @ X1 @ X2 ) )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2 @ X3 @ X4 )
= ( ap @ X1 @ X2 @ X6 @ X4 ) ) )
=> ( X3 = X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.09sgdtvkS7/E---3.1_2566588.p',funcext2) ).
thf(c_0_5,negated_conjecture,
~ ( ap2p
=> ( lam2p
=> ( funcext2
=> ( beta2
=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( funcSet @ X1 @ X2 ) )
=> ( ( lam @ X1 @ X2
@ ^ [X4: $i] : ( ap @ X1 @ X2 @ X3 @ X4 ) )
= X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[eta2]) ).
thf(c_0_6,plain,
( lam2p
<=> ! [X1: $i,X2: $i,X5: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X5 @ X4 ) @ X2 ) )
=> ( in
@ ( lam @ X1 @ X2
@ ^ [Z0: $i] : ( X5 @ Z0 ) )
@ ( funcSet @ X1 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[lam2p]) ).
thf(c_0_7,plain,
( beta2
<=> ! [X1: $i,X2: $i,X7: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X7 @ X4 ) @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [Z0: $i] : ( X7 @ Z0 ) )
@ X4 )
= ( X7 @ X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[beta2]) ).
thf(c_0_8,negated_conjecture,
~ ( ! [X30: $i,X31: $i,X32: $i] :
( ( in @ X32 @ ( funcSet @ X30 @ X31 ) )
=> ! [X33: $i] :
( ( in @ X33 @ X30 )
=> ( in @ ( ap @ X30 @ X31 @ X32 @ X33 ) @ X31 ) ) )
=> ( ! [X34: $i,X35: $i,X36: $i > $i] :
( ! [X37: $i] :
( ( in @ X37 @ X34 )
=> ( in @ ( X36 @ X37 ) @ X35 ) )
=> ( in @ ( lam @ X34 @ X35 @ X36 ) @ ( funcSet @ X34 @ X35 ) ) )
=> ( ! [X38: $i,X39: $i,X40: $i] :
( ( in @ X40 @ ( funcSet @ X38 @ X39 ) )
=> ! [X41: $i] :
( ( in @ X41 @ ( funcSet @ X38 @ X39 ) )
=> ( ! [X42: $i] :
( ( in @ X42 @ X38 )
=> ( ( ap @ X38 @ X39 @ X40 @ X42 )
= ( ap @ X38 @ X39 @ X41 @ X42 ) ) )
=> ( X40 = X41 ) ) ) )
=> ( ! [X43: $i,X44: $i,X45: $i > $i] :
( ! [X46: $i] :
( ( in @ X46 @ X43 )
=> ( in @ ( X45 @ X46 ) @ X44 ) )
=> ! [X47: $i] :
( ( in @ X47 @ X43 )
=> ( ( ap @ X43 @ X44 @ ( lam @ X43 @ X44 @ X45 ) @ X47 )
= ( X45 @ X47 ) ) ) )
=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X3 @ ( funcSet @ X1 @ X2 ) )
=> ( ( lam @ X1 @ X2 @ ( ap @ X1 @ X2 @ X3 ) )
= X3 ) ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5]),ap2p]),c_0_6]),funcext2]),c_0_7])]) ).
thf(c_0_9,negated_conjecture,
! [X48: $i,X49: $i,X50: $i,X51: $i,X52: $i,X53: $i,X54: $i > $i,X56: $i,X57: $i,X58: $i,X59: $i,X61: $i,X62: $i,X63: $i > $i,X65: $i] :
( ( ~ ( in @ X50 @ ( funcSet @ X48 @ X49 ) )
| ~ ( in @ X51 @ X48 )
| ( in @ ( ap @ X48 @ X49 @ X50 @ X51 ) @ X49 ) )
& ( ( in @ ( esk1_3 @ X52 @ X53 @ X54 ) @ X52 )
| ( in @ ( lam @ X52 @ X53 @ X54 ) @ ( funcSet @ X52 @ X53 ) ) )
& ( ~ ( in @ ( X54 @ ( esk1_3 @ X52 @ X53 @ X54 ) ) @ X53 )
| ( in @ ( lam @ X52 @ X53 @ X54 ) @ ( funcSet @ X52 @ X53 ) ) )
& ( ( in @ ( esk2_4 @ X56 @ X57 @ X58 @ X59 ) @ X56 )
| ( X58 = X59 )
| ~ ( in @ X59 @ ( funcSet @ X56 @ X57 ) )
| ~ ( in @ X58 @ ( funcSet @ X56 @ X57 ) ) )
& ( ( ( ap @ X56 @ X57 @ X58 @ ( esk2_4 @ X56 @ X57 @ X58 @ X59 ) )
!= ( ap @ X56 @ X57 @ X59 @ ( esk2_4 @ X56 @ X57 @ X58 @ X59 ) ) )
| ( X58 = X59 )
| ~ ( in @ X59 @ ( funcSet @ X56 @ X57 ) )
| ~ ( in @ X58 @ ( funcSet @ X56 @ X57 ) ) )
& ( ( in @ ( esk3_3 @ X61 @ X62 @ X63 ) @ X61 )
| ~ ( in @ X65 @ X61 )
| ( ( ap @ X61 @ X62 @ ( lam @ X61 @ X62 @ X63 ) @ X65 )
= ( X63 @ X65 ) ) )
& ( ~ ( in @ ( X63 @ ( esk3_3 @ X61 @ X62 @ X63 ) ) @ X62 )
| ~ ( in @ X65 @ X61 )
| ( ( ap @ X61 @ X62 @ ( lam @ X61 @ X62 @ X63 ) @ X65 )
= ( X63 @ X65 ) ) )
& ( in @ esk6_0 @ ( funcSet @ esk4_0 @ esk5_0 ) )
& ( ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) )
!= esk6_0 ) ),
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_8])])])])])]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( in @ ( ap @ X2 @ X3 @ X1 @ X4 ) @ X3 )
| ~ ( in @ X1 @ ( funcSet @ X2 @ X3 ) )
| ~ ( in @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X5: $i > $i,X2: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X5 ) @ X1 )
| ( in @ ( lam @ X1 @ X2 @ X5 ) @ ( funcSet @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X5: $i > $i,X4: $i,X3: $i,X2: $i] :
( ( in @ ( ap @ X1 @ X2 @ X3 @ ( esk1_3 @ X1 @ X4 @ X5 ) ) @ X2 )
| ( in @ ( lam @ X1 @ X4 @ X5 ) @ ( funcSet @ X1 @ X4 ) )
| ~ ( in @ X3 @ ( funcSet @ X1 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
in @ esk6_0 @ ( funcSet @ esk4_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) @ X1 )
| ( X3 = X4 )
| ~ ( in @ X4 @ ( funcSet @ X1 @ X2 ) )
| ~ ( in @ X3 @ ( funcSet @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X5: $i > $i,X2: $i] :
( ( in @ ( lam @ X1 @ X2 @ X5 ) @ ( funcSet @ X1 @ X2 ) )
| ~ ( in @ ( X5 @ ( esk1_3 @ X1 @ X2 @ X5 ) ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,negated_conjecture,
! [X5: $i > $i,X1: $i] :
( ( in @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 @ ( esk1_3 @ esk4_0 @ X1 @ X5 ) ) @ esk5_0 )
| ( in @ ( lam @ esk4_0 @ X1 @ X5 ) @ ( funcSet @ esk4_0 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( ( X1 = esk6_0 )
| ( in @ ( esk2_4 @ esk4_0 @ esk5_0 @ X1 @ esk6_0 ) @ esk4_0 )
| ~ ( in @ X1 @ ( funcSet @ esk4_0 @ esk5_0 ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
thf(c_0_18,negated_conjecture,
in @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ ( funcSet @ esk4_0 @ esk5_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,negated_conjecture,
( ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) )
!= esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_20,negated_conjecture,
! [X5: $i > $i,X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk3_3 @ X1 @ X2 @ X5 ) @ X1 )
| ( ( ap @ X1 @ X2 @ ( lam @ X1 @ X2 @ X5 ) @ X3 )
= ( X5 @ X3 ) )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_21,negated_conjecture,
in @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) @ esk4_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X4: $i,X3: $i,X2: $i] :
( ( X3 = X4 )
| ( ( ap @ X1 @ X2 @ X3 @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) )
!= ( ap @ X1 @ X2 @ X4 @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) ) )
| ~ ( in @ X4 @ ( funcSet @ X1 @ X2 ) )
| ~ ( in @ X3 @ ( funcSet @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X5: $i > $i] :
( ( ( ap @ esk4_0 @ X1 @ ( lam @ esk4_0 @ X1 @ X5 ) @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) )
= ( X5 @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) ) )
| ( in @ ( esk3_3 @ esk4_0 @ X1 @ X5 ) @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
in @ ( esk3_3 @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13]),c_0_18])]),c_0_19]) ).
thf(c_0_25,negated_conjecture,
! [X5: $i > $i,X3: $i,X2: $i,X1: $i] :
( ( ( ap @ X1 @ X2 @ ( lam @ X1 @ X2 @ X5 ) @ X3 )
= ( X5 @ X3 ) )
| ~ ( in @ ( X5 @ ( esk3_3 @ X1 @ X2 @ X5 ) ) @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_26,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( ap @ esk4_0 @ X1 @ X2 @ ( esk3_3 @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) ) @ X1 )
| ~ ( in @ X2 @ ( funcSet @ esk4_0 @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
thf(c_0_27,negated_conjecture,
! [X5: $i > $i,X1: $i] :
( ( ( ap @ esk4_0 @ X1 @ ( lam @ esk4_0 @ X1 @ X5 ) @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) )
= ( X5 @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) ) )
| ~ ( in @ ( X5 @ ( esk3_3 @ esk4_0 @ X1 @ X5 ) ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
thf(c_0_28,negated_conjecture,
in @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 @ ( esk3_3 @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) ) @ esk5_0,
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
thf(c_0_29,negated_conjecture,
( ( ap @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) )
= ( ap @ esk4_0 @ esk5_0 @ esk6_0 @ ( esk2_4 @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk6_0 ) ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_13]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU699^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 % Computer : n003.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 14:13:44 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.27 Running higher-order theorem proving
% 0.21/0.28 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.09sgdtvkS7/E---3.1_2566588.p
% 0.53/0.40 % Version: 3.5.1-ho
% 0.53/0.40 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.53/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.40 % Starting new_ho_10 with 1500s (5) cores
% 0.53/0.40 % Starting new_bool_2 with 300s (1) cores
% 0.53/0.40 % Starting new_bool_9 with 300s (1) cores
% 0.53/0.40 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.53/0.40 % new_ho_10 with pid 2566601 completed with status 0
% 0.53/0.40 % Result found by new_ho_10
% 0.53/0.40 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.53/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.40 % Starting new_ho_10 with 1500s (5) cores
% 0.53/0.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.40 % No SInE strategy applied
% 0.53/0.40 % Search class: HGUSF-FFSF33-SSSFMSNN
% 0.53/0.40 % partial match(3): HGUSF-FFSF22-SSSFMSBN
% 0.53/0.40 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.40 % Starting SubtermCWHack with 151s (1) cores
% 0.53/0.40 % Starting new_ho_10 with 901s (1) cores
% 0.53/0.40 % Starting new_bool_2 with 151s (1) cores
% 0.53/0.40 % Starting new_bool_9 with 151s (1) cores
% 0.53/0.40 % Starting ehoh_best8_lambda with 146s (1) cores
% 0.53/0.40 % ehoh_best8_lambda with pid 2566610 completed with status 0
% 0.53/0.40 % Result found by ehoh_best8_lambda
% 0.53/0.40 % Preprocessing class: HSSSSLSSSLMNSSA.
% 0.53/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.40 % Starting new_ho_10 with 1500s (5) cores
% 0.53/0.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.40 % No SInE strategy applied
% 0.53/0.40 % Search class: HGUSF-FFSF33-SSSFMSNN
% 0.53/0.40 % partial match(3): HGUSF-FFSF22-SSSFMSBN
% 0.53/0.40 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.40 % Starting SubtermCWHack with 151s (1) cores
% 0.53/0.40 % Starting new_ho_10 with 901s (1) cores
% 0.53/0.40 % Starting new_bool_2 with 151s (1) cores
% 0.53/0.40 % Starting new_bool_9 with 151s (1) cores
% 0.53/0.40 % Starting ehoh_best8_lambda with 146s (1) cores
% 0.53/0.40 % Preprocessing time : 0.001 s
% 0.53/0.40 % Presaturation interreduction done
% 0.53/0.40
% 0.53/0.40 % Proof found!
% 0.53/0.40 % SZS status Theorem
% 0.53/0.40 % SZS output start CNFRefutation
% See solution above
% 0.53/0.40 % Parsed axioms : 13
% 0.53/0.40 % Removed by relevancy pruning/SinE : 0
% 0.53/0.40 % Initial clauses : 17
% 0.53/0.40 % Removed in clause preprocessing : 8
% 0.53/0.40 % Initial clauses in saturation : 9
% 0.53/0.40 % Processed clauses : 146
% 0.53/0.40 % ...of these trivial : 0
% 0.53/0.40 % ...subsumed : 1
% 0.53/0.40 % ...remaining for further processing : 145
% 0.53/0.40 % Other redundant clauses eliminated : 0
% 0.53/0.40 % Clauses deleted for lack of memory : 0
% 0.53/0.40 % Backward-subsumed : 0
% 0.53/0.40 % Backward-rewritten : 2
% 0.53/0.40 % Generated clauses : 1287
% 0.53/0.40 % ...of the previous two non-redundant : 1279
% 0.53/0.40 % ...aggressively subsumed : 0
% 0.53/0.40 % Contextual simplify-reflections : 0
% 0.53/0.40 % Paramodulations : 1286
% 0.53/0.40 % Factorizations : 0
% 0.53/0.40 % NegExts : 0
% 0.53/0.40 % Equation resolutions : 1
% 0.53/0.40 % Disequality decompositions : 0
% 0.53/0.40 % Total rewrite steps : 11
% 0.53/0.40 % ...of those cached : 4
% 0.53/0.40 % Propositional unsat checks : 0
% 0.53/0.40 % Propositional check models : 0
% 0.53/0.40 % Propositional check unsatisfiable : 0
% 0.53/0.40 % Propositional clauses : 0
% 0.53/0.40 % Propositional clauses after purity: 0
% 0.53/0.40 % Propositional unsat core size : 0
% 0.53/0.40 % Propositional preprocessing time : 0.000
% 0.53/0.40 % Propositional encoding time : 0.000
% 0.53/0.40 % Propositional solver time : 0.000
% 0.53/0.40 % Success case prop preproc time : 0.000
% 0.53/0.40 % Success case prop encoding time : 0.000
% 0.53/0.40 % Success case prop solver time : 0.000
% 0.53/0.40 % Current number of processed clauses : 134
% 0.53/0.40 % Positive orientable unit clauses : 15
% 0.53/0.40 % Positive unorientable unit clauses: 0
% 0.53/0.40 % Negative unit clauses : 1
% 0.53/0.40 % Non-unit-clauses : 118
% 0.53/0.40 % Current number of unprocessed clauses: 1151
% 0.53/0.40 % ...number of literals in the above : 3529
% 0.53/0.40 % Current number of archived formulas : 0
% 0.53/0.40 % Current number of archived clauses : 11
% 0.53/0.40 % Clause-clause subsumption calls (NU) : 1542
% 0.53/0.40 % Rec. Clause-clause subsumption calls : 1179
% 0.53/0.40 % Non-unit clause-clause subsumptions : 1
% 0.53/0.40 % Unit Clause-clause subsumption calls : 287
% 0.53/0.40 % Rewrite failures with RHS unbound : 0
% 0.53/0.40 % BW rewrite match attempts : 202
% 0.53/0.40 % BW rewrite match successes : 2
% 0.53/0.40 % Condensation attempts : 0
% 0.53/0.40 % Condensation successes : 0
% 0.53/0.40 % Termbank termtop insertions : 112239
% 0.53/0.40 % Search garbage collected termcells : 578
% 0.53/0.40
% 0.53/0.40 % -------------------------------------------------
% 0.53/0.40 % User time : 0.063 s
% 0.53/0.40 % System time : 0.007 s
% 0.53/0.40 % Total time : 0.070 s
% 0.53/0.40 % Maximum resident set size: 3644 pages
% 0.53/0.40
% 0.53/0.40 % -------------------------------------------------
% 0.53/0.40 % User time : 0.313 s
% 0.53/0.40 % System time : 0.032 s
% 0.53/0.40 % Total time : 0.344 s
% 0.53/0.40 % Maximum resident set size: 4608 pages
% 0.53/0.40 % E exiting
%------------------------------------------------------------------------------