%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU707^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 : n005.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:17 AM UTC 2026
% Result : Theorem 2.23s 0.60s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 187 ( 82 equ; 0 cnn)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 523 ( 84 ~; 63 |; 51 &; 282 @)
% ( 5 <=>; 37 =>; 0 <=; 1 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 9 con; 0-4 aty)
% Number of variables : 137 ( 37 ^; 100 !; 0 ?; 137 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
setunion: $i > $i ).
thf(decl_25,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_26,type,
singleton: $i > $o ).
thf(decl_27,type,
iftrueProp1: $o ).
thf(decl_28,type,
ifSingleton: $o ).
thf(decl_29,type,
if: $i > $o > $i > $i > $i ).
thf(decl_30,type,
theeq: $o ).
thf(decl_31,type,
esk1_0: $i ).
thf(decl_32,type,
epred1_0: $o ).
thf(decl_33,type,
esk2_0: $i ).
thf(decl_34,type,
esk3_0: $i ).
thf(decl_36,type,
esk3_3: $o > $i > $i > $i ).
thf(iftrue,conjecture,
( iftrueProp1
=> ( ifSingleton
=> ( theeq
=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( X2
=> ( ( if @ X1 @ X2 @ X3 @ X4 )
= X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKAJjBix3F/E---3.1_1727055.p',iftrue) ).
thf(iftrueProp1,axiom,
( iftrueProp1
<=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( X2
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [X5: $i] :
( ( X2
& ( X5 = X3 ) )
| ( ~ X2
& ( X5 = X4 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKAJjBix3F/E---3.1_1727055.p',iftrueProp1) ).
thf(ifSingleton,axiom,
( ifSingleton
<=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [X5: $i] :
( ( X2
& ( X5 = X3 ) )
| ( ~ X2
& ( X5 = X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKAJjBix3F/E---3.1_1727055.p',ifSingleton) ).
thf(theeq,axiom,
( theeq
<=> ! [X6: $i] :
( ( singleton @ X6 )
=> ! [X3: $i] :
( ( in @ X3 @ X6 )
=> ( ( setunion @ X6 )
= X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKAJjBix3F/E---3.1_1727055.p',theeq) ).
thf(if,axiom,
( if
= ( ^ [X1: $i,X2: $o,X3: $i,X4: $i] :
( setunion
@ ( dsetconstr @ X1
@ ^ [X5: $i] :
( ( X2
& ( X5 = X3 ) )
| ( ~ X2
& ( X5 = X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GKAJjBix3F/E---3.1_1727055.p',if) ).
thf(c_0_5,negated_conjecture,
~ ( iftrueProp1
=> ( ifSingleton
=> ( theeq
=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( X2
=> ( ( if @ X1 @ X2 @ X3 @ X4 )
= X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[iftrue]) ).
thf(c_0_6,plain,
( iftrueProp1
<=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( X2
=> ( in @ X3
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X3 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iftrueProp1]) ).
thf(c_0_7,plain,
( ifSingleton
<=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X3 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ifSingleton]) ).
thf(c_0_8,negated_conjecture,
~ ( ! [X21: $i,X22: $o,X23: $i] :
( ( in @ X23 @ X21 )
=> ! [X24: $i] :
( ( in @ X24 @ X21 )
=> ( X22
=> ( in @ X23
@ ( dsetconstr @ X21
@ ^ [Z0: $i] :
( ( X22
& ( Z0 = X23 ) )
| ( ~ X22
& ( Z0 = X24 ) ) ) ) ) ) ) )
=> ( ! [X25: $i,X26: $o,X27: $i] :
( ( in @ X27 @ X25 )
=> ! [X28: $i] :
( ( in @ X28 @ X25 )
=> ( singleton
@ ( dsetconstr @ X25
@ ^ [Z0: $i] :
( ( X26
& ( Z0 = X27 ) )
| ( ~ X26
& ( Z0 = X28 ) ) ) ) ) ) )
=> ( ! [X29: $i] :
( ( singleton @ X29 )
=> ! [X30: $i] :
( ( in @ X30 @ X29 )
=> ( ( setunion @ X29 )
= X30 ) ) )
=> ! [X1: $i,X2: $o,X3: $i] :
( ( in @ X3 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( X2
=> ( ( if @ X1 @ X2 @ X3 @ X4 )
= X3 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]),theeq]) ).
thf(c_0_9,plain,
( if
= ( ^ [Z0: $i,Z1: $o,Z2: $i,Z3: $i] :
( setunion
@ ( dsetconstr @ Z0
@ ^ [Z4: $i] :
( ( Z1
& ( Z4 = Z2 ) )
| ( ~ Z1
& Z4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[if]) ).
thf(c_0_10,negated_conjecture,
! [X31: $i,X32: $o,X33: $i,X34: $i,X35: $i,X36: $o,X37: $i,X38: $i,X39: $i,X40: $i] :
( ( ~ ( in @ X33 @ X31 )
| ~ ( in @ X34 @ X31 )
| ~ X32
| ( in @ X33
@ ( dsetconstr @ X31
@ ^ [Z0: $i] :
( ( X32
& ( Z0 = X33 ) )
| ( ~ X32
& ( Z0 = X34 ) ) ) ) ) )
& ( ~ ( in @ X37 @ X35 )
| ~ ( in @ X38 @ X35 )
| ( singleton
@ ( dsetconstr @ X35
@ ^ [Z0: $i] :
( ( X36
& ( Z0 = X37 ) )
| ( ~ X36
& ( Z0 = X38 ) ) ) ) ) )
& ( ~ ( singleton @ X39 )
| ~ ( in @ X40 @ X39 )
| ( ( setunion @ X39 )
= X40 ) )
& ( in @ esk2_0 @ esk1_0 )
& ( in @ esk3_0 @ esk1_0 )
& epred1_0
& ( ~ epred1_0
| epred1_0 )
& ( ( ( if @ esk1_0 @ $false @ esk2_0 @ esk3_0 )
!= esk2_0 )
| epred1_0 )
& ( ~ epred1_0
| ( ( if @ esk1_0 @ $true @ esk2_0 @ esk3_0 )
!= esk2_0 ) )
& ( ( ( if @ esk1_0 @ $false @ esk2_0 @ esk3_0 )
!= esk2_0 )
| ( ( if @ esk1_0 @ $true @ esk2_0 @ esk3_0 )
!= esk2_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[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_11,plain,
( if
= ( ^ [Z0: $i,Z1: $o,Z2: $i,Z3: $i] :
( setunion
@ ( dsetconstr @ Z0
@ ^ [Z4: $i] :
( ( Z1
& ( Z4 = Z2 ) )
| ( ~ Z1
& Z4 ) ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
( ~ epred1_0
| ( ( if @ esk1_0 @ $true @ esk2_0 @ esk3_0 )
!= esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_13,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X1: $i,X2: $o,X3: $i,X4: $i] :
( ( setunion
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X3 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) )
= ( if @ X1 @ X2 @ X3 @ X4 ) ),
inference(arg_cong,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ( if @ esk1_0 @ $true @ esk2_0 @ esk3_0 )
!= esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,plain,
! [X1: $i,X2: $o,X3: $i,X8: $o,X6: $i,X5: $i,X4: $i] :
( ( ( if @ X1 @ X2 @ X3 @ X4 )
= ( if @ X1 @ X8 @ X5 @ X6 ) )
| ( ( ^ [Z0: $i] :
( ( X8
& ( Z0 = X5 ) )
| ( ~ X8
& ( Z0 = X6 ) ) ) )
!= ( ^ [Z0: $i] :
( ( X2
& ( Z0 = X3 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) ) ),
inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14,c_0_14])]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $o,X3: $i] :
( ( ( ^ [Z0: $i] : ( Z0 = esk2_0 ) )
!= ( ^ [Z0: $i] :
( ( X2
& ( Z0 = X1 ) )
| ( ~ X2
& ( Z0 = X3 ) ) ) ) )
| ( ( if @ esk1_0 @ X2 @ X1 @ X3 )
!= esk2_0 ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $o,X3: $i] :
( ( ( ( X2
& ( ( esk3_3 @ X2 @ X3 @ X1 )
= X1 ) )
| ( ~ X2
& ( ( esk3_3 @ X2 @ X3 @ X1 )
= X3 ) ) )
<~> ( ( esk3_3 @ X2 @ X3 @ X1 )
= esk2_0 ) )
| ( ( if @ esk1_0 @ X2 @ X1 @ X3 )
!= esk2_0 ) ),
inference(neg_ext,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i,X1: $i] :
( ( ( setunion @ X1 )
= X3 )
| ~ ( singleton @ X1 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_20,negated_conjecture,
! [X2: $o,X1: $i,X4: $i,X3: $i] :
( ( singleton
@ ( dsetconstr @ X3
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X1 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) )
| ~ ( in @ X1 @ X3 )
| ~ ( in @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i,X1: $i] :
( ( ( esk3_3 @ ~ $true @ X1 @ X3 )
= esk2_0 )
| ( ( esk3_3 @ ~ $true @ X1 @ X3 )
= X1 )
| ( ( if @ esk1_0 @ ~ $true @ X3 @ X1 )
!= esk2_0 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_18]) ).
thf(c_0_22,negated_conjecture,
! [X2: $o,X5: $i,X4: $i,X3: $i,X1: $i] :
( ( ( setunion
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X3 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) )
= X5 )
| ~ ( in @ X5
@ ( dsetconstr @ X1
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X3 ) )
| ( ~ X2
& ( Z0 = X4 ) ) ) ) )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Z0: $i] :
( ( $true
& ( Z0 = X1 ) )
| ( ~ $true
& ( Z0 = X4 ) ) ) ) )
| ~ ( in @ X1 @ X3 )
| ~ ( in @ X4 @ X3 ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10])])]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
( ( ( esk3_3 @ ~ $true @ esk2_0 @ X1 )
= esk2_0 )
| ( ( if @ esk1_0 @ ~ $true @ X1 @ esk2_0 )
!= esk2_0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_21])]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i,X2: $o,X5: $i,X4: $i,X3: $i] :
( ( X1
= ( if @ X3 @ X2 @ X4 @ X5 ) )
| ~ ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Z0: $i] :
( ( X2
& ( Z0 = X4 ) )
| ( ~ X2
& ( Z0 = X5 ) ) ) ) )
| ~ ( in @ X5 @ X3 )
| ~ ( in @ X4 @ X3 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
thf(c_0_26,negated_conjecture,
in @ esk2_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X4: $i,X3: $i] :
( ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Z0: $i] : ( Z0 = X1 ) ) )
| ~ ( in @ X4 @ X3 )
| ~ ( in @ X1 @ X3 ) ),
inference(cn,[status(thm)],[c_0_23]) ).
thf(c_0_28,negated_conjecture,
in @ esk3_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i,X3: $i] :
( ( ( if @ esk1_0 @ ~ $true @ X1 @ X3 )
!= esk2_0 )
| ( ( esk3_3 @ ~ $true @ X3 @ X1 )
!= esk2_0 )
| ( ( esk3_3 @ ~ $true @ X3 @ X1 )
!= X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_18]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i] :
( ( ( esk3_3 @ ~ $true @ esk2_0 @ X1 )
= esk2_0 )
| ~ ( in @ esk2_0
@ ( dsetconstr @ esk1_0
@ ^ [Z0: $i] : ( Z0 = esk2_0 ) ) )
| ~ ( in @ X1 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])])])]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] :
( ( in @ X1
@ ( dsetconstr @ esk1_0
@ ^ [Z0: $i] : ( Z0 = X1 ) ) )
| ~ ( in @ X1 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i,X3: $i] :
( ( ( esk3_3 @ ~ $true @ X1 @ X3 )
!= esk2_0 )
| ( ( esk3_3 @ ~ $true @ X1 @ X3 )
!= X1 )
| ~ ( in @ esk2_0
@ ( dsetconstr @ esk1_0
@ ^ [Z0: $i] : ( Z0 = X1 ) ) )
| ~ ( in @ X1 @ esk1_0 )
| ~ ( in @ X3 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25])])]) ).
thf(c_0_33,negated_conjecture,
! [X1: $i] :
( ( ( esk3_3 @ ~ $true @ esk2_0 @ X1 )
= esk2_0 )
| ~ ( in @ X1 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i] :
~ ( in @ X1 @ esk1_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_26])]),c_0_33]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_26,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU707^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n005.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 14:13:00 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.23 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.GKAJjBix3F/E---3.1_1727055.p
% 2.23/0.60 % Version: 3.5.1-ho
% 2.23/0.60 % Preprocessing class: HSSSSLSSSLMNSFN.
% 2.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.60 % Starting ho_unfolding_6 with 1500s (5) cores
% 2.23/0.60 % Starting pre_casc_5 with 300s (1) cores
% 2.23/0.60 % Starting sh4l with 300s (1) cores
% 2.23/0.60 % Starting full_lambda_3 with 300s (1) cores
% 2.23/0.60 % ho_unfolding_6 with pid 1727068 completed with status 0
% 2.23/0.60 % Result found by ho_unfolding_6
% 2.23/0.60 % Preprocessing class: HSSSSLSSSLMNSFN.
% 2.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.60 % Starting ho_unfolding_6 with 1500s (5) cores
% 2.23/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 2.23/0.60 % No SInE strategy applied
% 2.23/0.60 % Search class: HHHSF-FFSS32-DSFFMFBN
% 2.23/0.60 % partial match(3): HHUSF-FFSS32-SSFFMSBN
% 2.23/0.60 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 2.23/0.60 % Starting SubtermCWHack with 151s (1) cores
% 2.23/0.60 % Starting new_ho_10 with 901s (1) cores
% 2.23/0.60 % Starting full_lambda_3 with 151s (1) cores
% 2.23/0.60 % Starting ho_unfolding_6 with 151s (1) cores
% 2.23/0.60 % Starting sh4l with 146s (1) cores
% 2.23/0.60 % new_ho_10 with pid 1727073 completed with status 10
% 2.23/0.60 % ho_unfolding_6 with pid 1727075 completed with status 0
% 2.23/0.60 % Result found by ho_unfolding_6
% 2.23/0.60 % Preprocessing class: HSSSSLSSSLMNSFN.
% 2.23/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.60 % Starting ho_unfolding_6 with 1500s (5) cores
% 2.23/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 2.23/0.60 % No SInE strategy applied
% 2.23/0.60 % Search class: HHHSF-FFSS32-DSFFMFBN
% 2.23/0.60 % partial match(3): HHUSF-FFSS32-SSFFMSBN
% 2.23/0.60 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 2.23/0.60 % Starting SubtermCWHack with 151s (1) cores
% 2.23/0.60 % Starting new_ho_10 with 901s (1) cores
% 2.23/0.60 % Starting full_lambda_3 with 151s (1) cores
% 2.23/0.60 % Starting ho_unfolding_6 with 151s (1) cores
% 2.23/0.60 % Preprocessing time : 0.001 s
% 2.23/0.60
% 2.23/0.60 % Proof found!
% 2.23/0.60 % SZS status Theorem
% 2.23/0.60 % SZS output start CNFRefutation
% See solution above
% 2.23/0.60 % Parsed axioms : 13
% 2.23/0.60 % Removed by relevancy pruning/SinE : 0
% 2.23/0.60 % Initial clauses : 19
% 2.23/0.60 % Removed in clause preprocessing : 9
% 2.23/0.60 % Initial clauses in saturation : 10
% 2.23/0.60 % Processed clauses : 324
% 2.23/0.60 % ...of these trivial : 1
% 2.23/0.60 % ...subsumed : 93
% 2.23/0.60 % ...remaining for further processing : 230
% 2.23/0.60 % Other redundant clauses eliminated : 259
% 2.23/0.60 % Clauses deleted for lack of memory : 0
% 2.23/0.60 % Backward-subsumed : 183
% 2.23/0.60 % Backward-rewritten : 0
% 2.23/0.60 % Generated clauses : 6715
% 2.23/0.60 % ...of the previous two non-redundant : 6452
% 2.23/0.60 % ...aggressively subsumed : 0
% 2.23/0.60 % Contextual simplify-reflections : 5
% 2.23/0.60 % Paramodulations : 6416
% 2.23/0.60 % Factorizations : 18
% 2.23/0.60 % NegExts : 2
% 2.23/0.60 % Equation resolutions : 260
% 2.23/0.60 % Disequality decompositions : 0
% 2.23/0.60 % Total rewrite steps : 165
% 2.23/0.60 % ...of those cached : 163
% 2.23/0.60 % Propositional unsat checks : 0
% 2.23/0.60 % Propositional check models : 0
% 2.23/0.60 % Propositional check unsatisfiable : 0
% 2.23/0.60 % Propositional clauses : 0
% 2.23/0.60 % Propositional clauses after purity: 0
% 2.23/0.60 % Propositional unsat core size : 0
% 2.23/0.60 % Propositional preprocessing time : 0.000
% 2.23/0.60 % Propositional encoding time : 0.000
% 2.23/0.60 % Propositional solver time : 0.000
% 2.23/0.60 % Success case prop preproc time : 0.000
% 2.23/0.60 % Success case prop encoding time : 0.000
% 2.23/0.60 % Success case prop solver time : 0.000
% 2.23/0.60 % Current number of processed clauses : 44
% 2.23/0.60 % Positive orientable unit clauses : 6
% 2.23/0.60 % Positive unorientable unit clauses: 4
% 2.23/0.60 % Negative unit clauses : 3
% 2.23/0.60 % Non-unit-clauses : 31
% 2.23/0.60 % Current number of unprocessed clauses: 6133
% 2.23/0.60 % ...number of literals in the above : 58217
% 2.23/0.60 % Current number of archived formulas : 0
% 2.23/0.60 % Current number of archived clauses : 186
% 2.23/0.60 % Clause-clause subsumption calls (NU) : 19667
% 2.23/0.60 % Rec. Clause-clause subsumption calls : 2233
% 2.23/0.60 % Non-unit clause-clause subsumptions : 144
% 2.23/0.60 % Unit Clause-clause subsumption calls : 324
% 2.23/0.60 % Rewrite failures with RHS unbound : 0
% 2.23/0.60 % BW rewrite match attempts : 23
% 2.23/0.60 % BW rewrite match successes : 1
% 2.23/0.60 % Condensation attempts : 324
% 2.23/0.60 % Condensation successes : 3
% 2.23/0.60 % Termbank termtop insertions : 1654183
% 2.23/0.60 % Search garbage collected termcells : 449
% 2.23/0.60
% 2.23/0.60 % -------------------------------------------------
% 2.23/0.60 % User time : 0.324 s
% 2.23/0.60 % System time : 0.008 s
% 2.23/0.60 % Total time : 0.332 s
% 2.23/0.60 % Maximum resident set size: 3640 pages
% 2.23/0.60
% 2.23/0.60 % -------------------------------------------------
% 2.23/0.60 % User time : 1.270 s
% 2.23/0.60 % System time : 0.023 s
% 2.23/0.60 % Total time : 1.292 s
% 2.23/0.60 % Maximum resident set size: 4608 pages
% 2.23/0.60 % E exiting
%------------------------------------------------------------------------------