%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU696^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:15 AM UTC 2026
% Result : Theorem 0.13s 0.26s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 120 ( 26 equ; 0 cnn)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 674 ( 29 ~; 34 |; 8 &; 555 @)
% ( 6 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 8 con; 0-4 aty)
% Number of variables : 109 ( 6 ^; 103 !; 0 ?; 109 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_25,type,
func: $i > $i > $i > $o ).
thf(decl_26,type,
ap: $i > $i > $i > $i > $i ).
thf(decl_27,type,
app: $o ).
thf(decl_28,type,
lam: $i > $i > ( $i > $i ) > $i ).
thf(decl_29,type,
lamp: $o ).
thf(decl_30,type,
funcext: $o ).
thf(decl_31,type,
beta1: $o ).
thf(decl_32,type,
esk1_3: $i > $i > ( $i > $i ) > $i ).
thf(decl_33,type,
esk2_4: $i > $i > $i > $i > $i ).
thf(decl_34,type,
esk3_3: $i > $i > ( $i > $i ) > $i ).
thf(decl_35,type,
esk4_0: $i ).
thf(decl_36,type,
esk5_0: $i ).
thf(decl_37,type,
esk6_0: $i ).
thf(eta1,conjecture,
( app
=> ( lamp
=> ( funcext
=> ( beta1
=> ! [X1: $i,X2: $i,X3: $i] :
( ( func @ X1 @ X2 @ X3 )
=> ( ( lam @ X1 @ X2
@ ^ [X4: $i] : ( ap @ X1 @ X2 @ X3 @ X4 ) )
= X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N0wqjkD7nr/E---3.1_1724983.p',eta1) ).
thf(lamp,axiom,
( lamp
<=> ! [X1: $i,X2: $i,X7: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X7 @ X4 ) @ X2 ) )
=> ( func @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [X4: $i] : ( X7 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N0wqjkD7nr/E---3.1_1724983.p',lamp) ).
thf(beta1,axiom,
( beta1
<=> ! [X1: $i,X2: $i,X9: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X9 @ X4 ) @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [X6: $i] : ( X9 @ X6 ) )
@ X4 )
= ( X9 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N0wqjkD7nr/E---3.1_1724983.p',beta1) ).
thf(app,axiom,
( app
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( func @ X1 @ X2 @ X3 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( ap @ X1 @ X2 @ X3 @ X4 ) @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N0wqjkD7nr/E---3.1_1724983.p',app) ).
thf(funcext,axiom,
( funcext
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( func @ X1 @ X2 @ X3 )
=> ! [X8: $i] :
( ( func @ X1 @ X2 @ X8 )
=> ( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2 @ X3 @ X4 )
= ( ap @ X1 @ X2 @ X8 @ X4 ) ) )
=> ( X3 = X8 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.N0wqjkD7nr/E---3.1_1724983.p',funcext) ).
thf(c_0_5,negated_conjecture,
~ ( app
=> ( lamp
=> ( funcext
=> ( beta1
=> ! [X1: $i,X2: $i,X3: $i] :
( ( func @ X1 @ X2 @ X3 )
=> ( ( lam @ X1 @ X2
@ ^ [X4: $i] : ( ap @ X1 @ X2 @ X3 @ X4 ) )
= X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[eta1]) ).
thf(c_0_6,plain,
( lamp
<=> ! [X1: $i,X2: $i,X7: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X7 @ X4 ) @ X2 ) )
=> ( func @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [Z0: $i] : ( X7 @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[lamp]) ).
thf(c_0_7,plain,
( beta1
<=> ! [X1: $i,X2: $i,X9: $i > $i] :
( ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( in @ ( X9 @ X4 ) @ X2 ) )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( ap @ X1 @ X2
@ ( lam @ X1 @ X2
@ ^ [Z0: $i] : ( X9 @ Z0 ) )
@ X4 )
= ( X9 @ X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[beta1]) ).
thf(c_0_8,negated_conjecture,
~ ( ! [X31: $i,X32: $i,X33: $i] :
( ( func @ X31 @ X32 @ X33 )
=> ! [X34: $i] :
( ( in @ X34 @ X31 )
=> ( in @ ( ap @ X31 @ X32 @ X33 @ X34 ) @ X32 ) ) )
=> ( ! [X35: $i,X36: $i,X37: $i > $i] :
( ! [X38: $i] :
( ( in @ X38 @ X35 )
=> ( in @ ( X37 @ X38 ) @ X36 ) )
=> ( func @ X35 @ X36 @ ( lam @ X35 @ X36 @ X37 ) ) )
=> ( ! [X39: $i,X40: $i,X41: $i] :
( ( func @ X39 @ X40 @ X41 )
=> ! [X42: $i] :
( ( func @ X39 @ X40 @ X42 )
=> ( ! [X43: $i] :
( ( in @ X43 @ X39 )
=> ( ( ap @ X39 @ X40 @ X41 @ X43 )
= ( ap @ X39 @ X40 @ X42 @ X43 ) ) )
=> ( X41 = X42 ) ) ) )
=> ( ! [X44: $i,X45: $i,X46: $i > $i] :
( ! [X47: $i] :
( ( in @ X47 @ X44 )
=> ( in @ ( X46 @ X47 ) @ X45 ) )
=> ! [X48: $i] :
( ( in @ X48 @ X44 )
=> ( ( ap @ X44 @ X45 @ ( lam @ X44 @ X45 @ X46 ) @ X48 )
= ( X46 @ X48 ) ) ) )
=> ! [X1: $i,X2: $i,X3: $i] :
( ( func @ X1 @ X2 @ X3 )
=> ( ( 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]),app]),c_0_6]),funcext]),c_0_7])]) ).
thf(c_0_9,negated_conjecture,
! [X55: $i,X56: $i,X57: $i,X58: $i,X59: $i,X60: $i,X61: $i > $i,X63: $i,X64: $i,X65: $i,X66: $i,X68: $i,X69: $i,X70: $i > $i,X72: $i] :
( ( ~ ( func @ X55 @ X56 @ X57 )
| ~ ( in @ X58 @ X55 )
| ( in @ ( ap @ X55 @ X56 @ X57 @ X58 ) @ X56 ) )
& ( ( in @ ( esk1_3 @ X59 @ X60 @ X61 ) @ X59 )
| ( func @ X59 @ X60 @ ( lam @ X59 @ X60 @ X61 ) ) )
& ( ~ ( in @ ( X61 @ ( esk1_3 @ X59 @ X60 @ X61 ) ) @ X60 )
| ( func @ X59 @ X60 @ ( lam @ X59 @ X60 @ X61 ) ) )
& ( ( in @ ( esk2_4 @ X63 @ X64 @ X65 @ X66 ) @ X63 )
| ( X65 = X66 )
| ~ ( func @ X63 @ X64 @ X66 )
| ~ ( func @ X63 @ X64 @ X65 ) )
& ( ( ( ap @ X63 @ X64 @ X65 @ ( esk2_4 @ X63 @ X64 @ X65 @ X66 ) )
!= ( ap @ X63 @ X64 @ X66 @ ( esk2_4 @ X63 @ X64 @ X65 @ X66 ) ) )
| ( X65 = X66 )
| ~ ( func @ X63 @ X64 @ X66 )
| ~ ( func @ X63 @ X64 @ X65 ) )
& ( ( in @ ( esk3_3 @ X68 @ X69 @ X70 ) @ X68 )
| ~ ( in @ X72 @ X68 )
| ( ( ap @ X68 @ X69 @ ( lam @ X68 @ X69 @ X70 ) @ X72 )
= ( X70 @ X72 ) ) )
& ( ~ ( in @ ( X70 @ ( esk3_3 @ X68 @ X69 @ X70 ) ) @ X69 )
| ~ ( in @ X72 @ X68 )
| ( ( ap @ X68 @ X69 @ ( lam @ X68 @ X69 @ X70 ) @ X72 )
= ( X70 @ X72 ) ) )
& ( func @ esk4_0 @ esk5_0 @ esk6_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,
! [X2: $i,X4: $i,X3: $i,X1: $i] :
( ( in @ ( ap @ X1 @ X2 @ X3 @ X4 ) @ X2 )
| ~ ( func @ X1 @ X2 @ X3 )
| ~ ( in @ X4 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
func @ esk4_0 @ esk5_0 @ esk6_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( in @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 @ X1 ) @ esk5_0 )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i,X5: $i > $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X5 ) @ X1 )
| ( func @ X1 @ X2 @ ( lam @ X1 @ X2 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) @ X1 )
| ( X3 = X4 )
| ~ ( func @ X1 @ X2 @ X4 )
| ~ ( func @ X1 @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X5: $i > $i,X2: $i] :
( ( func @ X1 @ X2 @ ( lam @ X1 @ X2 @ X5 ) )
| ~ ( in @ ( X5 @ ( esk1_3 @ X1 @ X2 @ X5 ) ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X5: $i > $i] :
( ( in @ ( ap @ esk4_0 @ esk5_0 @ esk6_0 @ ( esk1_3 @ esk4_0 @ X1 @ X5 ) ) @ esk5_0 )
| ( func @ esk4_0 @ X1 @ ( lam @ esk4_0 @ X1 @ X5 ) ) ),
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 )
| ~ ( func @ esk4_0 @ esk5_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
thf(c_0_18,negated_conjecture,
func @ esk4_0 @ esk5_0 @ ( lam @ esk4_0 @ esk5_0 @ ( ap @ esk4_0 @ esk5_0 @ esk6_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,X2: $i,X4: $i,X3: $i] :
( ( X3 = X4 )
| ( ( ap @ X1 @ X2 @ X3 @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) )
!= ( ap @ X1 @ X2 @ X4 @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) ) )
| ~ ( func @ X1 @ X2 @ X4 )
| ~ ( func @ X1 @ X2 @ X3 ) ),
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,
! [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_25,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_11]),c_0_18])]),c_0_19]) ).
thf(c_0_26,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_24,c_0_21]) ).
thf(c_0_27,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_12,c_0_25]) ).
thf(c_0_28,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_26,c_0_27]) ).
thf(c_0_29,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_28]),c_0_11]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU696^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.13/0.16 % Computer : n005.cluster.edu
% 0.13/0.16 % Model : x86_64 x86_64
% 0.13/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.16 % Memory : 8046.5625MB
% 0.13/0.16 % OS : Linux 6.8.0-71-generic
% 0.13/0.16 % CPULimit : 300
% 0.13/0.16 % WCLimit : 300
% 0.13/0.16 % DateTime : Tue Sep 29 14:11:15 UTC 2026
% 0.13/0.17 % CPUTime :
% 0.13/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.21 Running higher-order theorem proving
% 0.13/0.22 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.N0wqjkD7nr/E---3.1_1724983.p
% 0.13/0.26 % Version: 3.5.1-ho
% 0.13/0.26 % Preprocessing class: HSSSSLSSSLMNHSA.
% 0.13/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.13/0.26 % Starting new_ho_7 with 300s (1) cores
% 0.13/0.26 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.13/0.26 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.13/0.26 % new_ho_10 with pid 1724996 completed with status 0
% 0.13/0.26 % Result found by new_ho_10
% 0.13/0.26 % Preprocessing class: HSSSSLSSSLMNHSA.
% 0.13/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.13/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.26 % No SInE strategy applied
% 0.13/0.26 % Search class: HGUSS-FFSF33-SHSFMSNN
% 0.13/0.26 % partial match(3): HGUSM-FFSF32-SHSFMSBN
% 0.13/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.26 % Starting new_ho_10 with 151s (1) cores
% 0.13/0.26 % Starting sh5l with 136s (1) cores
% 0.13/0.26 % Starting lpo1_def_fix with 136s (1) cores
% 0.13/0.26 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.13/0.26 % ehoh_best8_lambda with pid 1725007 completed with status 0
% 0.13/0.26 % Result found by ehoh_best8_lambda
% 0.13/0.26 % Preprocessing class: HSSSSLSSSLMNHSA.
% 0.13/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.13/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.26 % No SInE strategy applied
% 0.13/0.26 % Search class: HGUSS-FFSF33-SHSFMSNN
% 0.13/0.26 % partial match(3): HGUSM-FFSF32-SHSFMSBN
% 0.13/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.26 % Starting new_ho_10 with 151s (1) cores
% 0.13/0.26 % Starting sh5l with 136s (1) cores
% 0.13/0.26 % Starting lpo1_def_fix with 136s (1) cores
% 0.13/0.26 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.13/0.26 % Preprocessing time : 0.001 s
% 0.13/0.26 % Presaturation interreduction done
% 0.13/0.26
% 0.13/0.26 % Proof found!
% 0.13/0.26 % SZS status Theorem
% 0.13/0.26 % SZS output start CNFRefutation
% See solution above
% 0.13/0.26 % Parsed axioms : 15
% 0.13/0.26 % Removed by relevancy pruning/SinE : 0
% 0.13/0.26 % Initial clauses : 20
% 0.13/0.26 % Removed in clause preprocessing : 9
% 0.13/0.26 % Initial clauses in saturation : 11
% 0.13/0.26 % Processed clauses : 46
% 0.13/0.26 % ...of these trivial : 0
% 0.13/0.26 % ...subsumed : 0
% 0.13/0.26 % ...remaining for further processing : 46
% 0.13/0.26 % Other redundant clauses eliminated : 1
% 0.13/0.26 % Clauses deleted for lack of memory : 0
% 0.13/0.26 % Backward-subsumed : 0
% 0.13/0.26 % Backward-rewritten : 2
% 0.13/0.26 % Generated clauses : 77
% 0.13/0.26 % ...of the previous two non-redundant : 71
% 0.13/0.26 % ...aggressively subsumed : 0
% 0.13/0.26 % Contextual simplify-reflections : 0
% 0.13/0.26 % Paramodulations : 72
% 0.13/0.26 % Factorizations : 0
% 0.13/0.26 % NegExts : 0
% 0.13/0.26 % Equation resolutions : 2
% 0.13/0.26 % Disequality decompositions : 0
% 0.13/0.26 % Total rewrite steps : 11
% 0.13/0.26 % ...of those cached : 4
% 0.13/0.26 % Propositional unsat checks : 0
% 0.13/0.26 % Propositional check models : 0
% 0.13/0.26 % Propositional check unsatisfiable : 0
% 0.13/0.26 % Propositional clauses : 0
% 0.13/0.26 % Propositional clauses after purity: 0
% 0.13/0.26 % Propositional unsat core size : 0
% 0.13/0.26 % Propositional preprocessing time : 0.000
% 0.13/0.26 % Propositional encoding time : 0.000
% 0.13/0.26 % Propositional solver time : 0.000
% 0.13/0.26 % Success case prop preproc time : 0.000
% 0.13/0.26 % Success case prop encoding time : 0.000
% 0.13/0.26 % Success case prop solver time : 0.000
% 0.13/0.26 % Current number of processed clauses : 32
% 0.13/0.26 % Positive orientable unit clauses : 10
% 0.13/0.26 % Positive unorientable unit clauses: 1
% 0.13/0.26 % Negative unit clauses : 1
% 0.13/0.26 % Non-unit-clauses : 20
% 0.13/0.26 % Current number of unprocessed clauses: 45
% 0.13/0.26 % ...number of literals in the above : 111
% 0.13/0.26 % Current number of archived formulas : 0
% 0.13/0.26 % Current number of archived clauses : 14
% 0.13/0.26 % Clause-clause subsumption calls (NU) : 32
% 0.13/0.26 % Rec. Clause-clause subsumption calls : 29
% 0.13/0.26 % Non-unit clause-clause subsumptions : 0
% 0.13/0.26 % Unit Clause-clause subsumption calls : 5
% 0.13/0.26 % Rewrite failures with RHS unbound : 0
% 0.13/0.26 % BW rewrite match attempts : 37
% 0.13/0.26 % BW rewrite match successes : 2
% 0.13/0.26 % Condensation attempts : 0
% 0.13/0.26 % Condensation successes : 0
% 0.13/0.26 % Termbank termtop insertions : 6208
% 0.13/0.26 % Search garbage collected termcells : 603
% 0.13/0.26
% 0.13/0.26 % -------------------------------------------------
% 0.13/0.26 % User time : 0.008 s
% 0.13/0.26 % System time : 0.006 s
% 0.13/0.26 % Total time : 0.014 s
% 0.13/0.26 % Maximum resident set size: 3648 pages
% 0.13/0.26
% 0.13/0.26 % -------------------------------------------------
% 0.13/0.26 % User time : 0.063 s
% 0.13/0.26 % System time : 0.023 s
% 0.13/0.26 % Total time : 0.085 s
% 0.13/0.26 % Maximum resident set size: 4864 pages
% 0.13/0.26 % E exiting
%------------------------------------------------------------------------------