%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV089^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:35:56 AM UTC 2026
% Result : Theorem 0.11s 0.25s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 38 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 130 ( 60 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 415 ( 39 ~; 48 |; 26 &; 284 @)
% ( 1 <=>; 15 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 89 ( 20 ^; 57 !; 12 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
epred2_0: a > $o ).
thf(decl_25,type,
esk1_0: a > a ).
thf(decl_26,type,
esk2_1: a > a ).
thf(decl_27,type,
esk3_1: ( a > a ) > a ).
thf(decl_28,type,
esk4_1: ( a > a ) > a ).
thf(decl_29,type,
esk3_2: a > ( a > a ) > a ).
thf(decl_30,type,
esk4_2: a > ( a > a ) > a ).
thf(cEQP_1B_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X6: a] :
( ( ^ [X4: a] :
( ( X1 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X7: a,X8: a] : ( X7 = X8 )
@ X6 ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X9: a] :
( ( ^ [X4: a] :
( ( X2 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X10: a,X11: a] : ( X10 = X11 )
@ X9 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Ns4nElEyRR/E---3.1_3644118.p',cEQP_1B_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X6: a] :
( ( ^ [X4: a] :
( ( X1 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X7: a,X8: a] : ( X7 = X8 )
@ X6 ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X9: a] :
( ( ^ [X4: a] :
( ( X2 @ X4 )
& ( X5
= ( X3 @ X4 ) ) ) )
= ( ^ [X10: a,X11: a] : ( X10 = X11 )
@ X9 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cEQP_1B_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ? [X3: a > a] :
( ! [X4: a] :
( ( X1 @ X4 )
=> ( X2 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X2 @ X5 )
=> ? [X6: a] :
( ( ^ [Z0: a] :
( ( X1 @ Z0 )
& ( X5
= ( X3 @ Z0 ) ) ) )
= ( $eq @ X6 ) ) ) )
=> ? [X3: a > a] :
( ! [X4: a] :
( ( X2 @ X4 )
=> ( X1 @ ( X3 @ X4 ) ) )
& ! [X5: a] :
( ( X1 @ X5 )
=> ? [X9: a] :
( ( ^ [Z0: a] :
( ( X2 @ Z0 )
& ( X5
= ( X3 @ Z0 ) ) ) )
= ( $eq @ X9 ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X25: a,X26: a,X28: a > a,X31: a] :
( ( ~ ( epred1_0 @ X25 )
| ( epred2_0 @ ( esk1_0 @ X25 ) ) )
& ( ~ ( epred2_0 @ X26 )
| ( ( ^ [Z0: a] :
( ( epred1_0 @ Z0 )
& ( X26
= ( esk1_0 @ Z0 ) ) ) )
= ( $eq @ ( esk2_1 @ X26 ) ) ) )
& ( ( epred1_0 @ ( esk4_1 @ X28 ) )
| ( epred2_0 @ ( esk3_1 @ X28 ) ) )
& ( ( ( ^ [Z0: a] :
( ( epred2_0 @ Z0 )
& ( ( esk4_1 @ X28 )
= ( X28 @ Z0 ) ) ) )
!= ( $eq @ X31 ) )
| ( epred2_0 @ ( esk3_1 @ X28 ) ) )
& ( ( epred1_0 @ ( esk4_1 @ X28 ) )
| ~ ( epred1_0 @ ( X28 @ ( esk3_1 @ X28 ) ) ) )
& ( ( ( ^ [Z0: a] :
( ( epred2_0 @ Z0 )
& ( ( esk4_1 @ X28 )
= ( X28 @ Z0 ) ) ) )
!= ( $eq @ X31 ) )
| ~ ( epred1_0 @ ( X28 @ ( esk3_1 @ X28 ) ) ) ) ),
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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X4: a] :
( ( ( ^ [Z0: a] :
( ( epred1_0 @ Z0 )
& ( X4
= ( esk1_0 @ Z0 ) ) ) )
= ( $eq @ ( esk2_1 @ X4 ) ) )
| ~ ( epred2_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X3: a > a,X4: a] :
( ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( ^ [Z0: a] :
( ( epred2_0 @ Z0 )
& ( ( esk4_1 @ X3 )
= ( X3 @ Z0 ) ) ) )
!= ( $eq @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X32: a,X4: a] :
( ( ( ( epred1_0 @ X32 )
& ( X4
= ( esk1_0 @ X32 ) ) )
<=> ( ( esk2_1 @ X4 )
= X32 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(arg_cong,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X4: a,X3: a > a] :
( ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( ( epred2_0 @ ( esk4_2 @ X4 @ X3 ) )
& ( ( esk4_1 @ X3 )
= ( X3 @ ( esk4_2 @ X4 @ X3 ) ) ) )
<~> ( X4
= ( esk4_2 @ X4 @ X3 ) ) ) ),
inference(neg_ext,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X4: a] :
( ( ( esk1_0 @ ( esk2_1 @ X4 ) )
= X4 )
| ~ ( epred2_0 @ X4 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_9,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( X3 @ ( esk4_2 @ X4 @ X3 ) )
= ( esk4_1 @ X3 ) )
| ( ( esk4_2 @ X4 @ X3 )
= X4 )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( esk4_2 @ X4 @ X3 )
= X4 )
| ( epred2_0 @ ( esk4_2 @ X4 @ X3 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X4: a] :
( ( ( esk1_0 @ ( esk4_1 @ esk2_1 ) )
= ( esk4_2 @ X4 @ esk2_1 ) )
| ( ( esk4_2 @ X4 @ esk2_1 )
= X4 )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( ^ [Z0: a] :
( ( epred2_0 @ Z0 )
& ( ( esk4_1 @ X3 )
= ( X3 @ Z0 ) ) ) )
!= ( $eq @ X4 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
! [X4: a,X3: a > a] :
( ( epred2_0 @ ( esk3_1 @ X3 ) )
| ( ( X3 @ ( esk4_2 @ X4 @ X3 ) )
!= ( esk4_1 @ X3 ) )
| ( ( esk4_2 @ X4 @ X3 )
!= X4 )
| ~ ( epred2_0 @ ( esk4_2 @ X4 @ X3 ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
( ( ( esk4_2 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) @ esk2_1 )
= ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]) ).
thf(c_0_15,negated_conjecture,
! [X4: a] :
( ( epred2_0 @ ( esk1_0 @ X4 ) )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
! [X3: a > a] :
( ( epred1_0 @ ( esk4_1 @ X3 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,negated_conjecture,
! [X4: a] :
( ( epred1_0 @ ( esk2_1 @ X4 ) )
| ~ ( epred2_0 @ X4 ) ),
inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]) ).
thf(c_0_18,negated_conjecture,
! [X3: a > a] :
( ( epred1_0 @ ( esk4_1 @ X3 ) )
| ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_19,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( ( epred2_0 @ ( esk3_2 @ X4 @ X3 ) )
& ( ( esk4_1 @ X3 )
= ( X3 @ ( esk3_2 @ X4 @ X3 ) ) ) )
<~> ( X4
= ( esk3_2 @ X4 @ X3 ) ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(neg_ext,[status(thm)],[c_0_12]) ).
thf(c_0_20,negated_conjecture,
( ( epred2_0 @ ( esk3_1 @ esk2_1 ) )
| ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
!= ( esk4_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_21,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk1_0 @ X4 ) )
= X4 )
| ~ ( epred1_0 @ X4 ) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])]),c_0_15]) ).
thf(c_0_22,negated_conjecture,
epred1_0 @ ( esk4_1 @ esk2_1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_23,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( X3 @ ( esk3_2 @ X4 @ X3 ) )
= ( esk4_1 @ X3 ) )
| ( ( esk3_2 @ X4 @ X3 )
= X4 )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_24,negated_conjecture,
( ( epred2_0 @ ( esk3_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
thf(c_0_25,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( esk3_2 @ X4 @ X3 )
= X4 )
| ( epred2_0 @ ( esk3_2 @ X4 @ X3 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_26,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk3_2 @ X4 @ esk2_1 ) )
= ( esk4_1 @ esk2_1 ) )
| ( ( esk3_2 @ X4 @ esk2_1 )
= X4 )
| ~ ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
thf(c_0_27,negated_conjecture,
epred2_0 @ ( esk3_1 @ esk2_1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_22])]) ).
thf(c_0_28,negated_conjecture,
! [X4: a] :
( ( ( esk3_2 @ X4 @ esk2_1 )
= X4 )
| ( epred2_0 @ ( esk3_2 @ X4 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk3_1 @ esk2_1 ) ) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
thf(c_0_29,negated_conjecture,
! [X4: a] :
( ( ( esk2_1 @ ( esk3_2 @ X4 @ esk2_1 ) )
= ( esk4_1 @ esk2_1 ) )
| ( ( esk3_2 @ X4 @ esk2_1 )
= X4 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
thf(c_0_30,negated_conjecture,
! [X4: a] :
( ( ( esk3_2 @ X4 @ esk2_1 )
= X4 )
| ( epred2_0 @ ( esk3_2 @ X4 @ esk2_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_27])]) ).
thf(c_0_31,negated_conjecture,
! [X4: a] :
( ( ( esk1_0 @ ( esk4_1 @ esk2_1 ) )
= ( esk3_2 @ X4 @ esk2_1 ) )
| ( ( esk3_2 @ X4 @ esk2_1 )
= X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_29]),c_0_30]) ).
thf(c_0_32,negated_conjecture,
! [X4: a,X3: a > a] :
( ( ( X3 @ ( esk3_2 @ X4 @ X3 ) )
!= ( esk4_1 @ X3 ) )
| ( ( esk3_2 @ X4 @ X3 )
!= X4 )
| ~ ( epred2_0 @ ( esk3_2 @ X4 @ X3 ) )
| ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
inference(dynamic_cnf,[status(thm)],[c_0_19]) ).
thf(c_0_33,negated_conjecture,
( ( esk3_2 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) @ esk2_1 )
= ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_31])]) ).
thf(c_0_34,negated_conjecture,
( ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
!= ( esk4_1 @ esk2_1 ) )
| ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ~ ( epred1_0 @ ( esk2_1 @ ( esk3_1 @ esk2_1 ) ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_35,negated_conjecture,
( ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
| ~ ( epred1_0 @ ( esk2_1 @ ( esk3_1 @ esk2_1 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_22])]) ).
thf(c_0_36,negated_conjecture,
~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_17]),c_0_27])]) ).
thf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_15]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV089^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 % Computer : n015.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Tue Sep 29 15:13:05 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 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.Ns4nElEyRR/E---3.1_3644118.p
% 0.11/0.25 % Version: 3.5.1-ho
% 0.11/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho4 with 300s (1) cores
% 0.11/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.25 % Starting full_lambda_10 with 300s (1) cores
% 0.11/0.25 % Starting new_ho_8 with 300s (1) cores
% 0.11/0.25 % new_bool_9 with pid 3644150 completed with status 0
% 0.11/0.25 % Result found by new_bool_9
% 0.11/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.11/0.25 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.11/0.25 % Search class: HGHSF-FFSF11-MSSFFFNN
% 0.11/0.25 % partial match(1): HGHSF-FFSF11-SSSFFFNN
% 0.11/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.25 % SubtermCWHack with pid 3644158 completed with status 10
% 0.11/0.25 % Starting new_ho_10 with 181s (1) cores
% 0.11/0.25 % new_ho_10 with pid 3644162 completed with status 0
% 0.11/0.25 % Result found by new_ho_10
% 0.11/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.11/0.25 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.11/0.25 % Search class: HGHSF-FFSF11-MSSFFFNN
% 0.11/0.25 % partial match(1): HGHSF-FFSF11-SSSFFFNN
% 0.11/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.25 % SubtermCWHack with pid 3644158 completed with status 10
% 0.11/0.25 % Starting new_ho_10 with 181s (1) cores
% 0.11/0.25 % Preprocessing time : 0.001 s
% 0.11/0.25 % Presaturation interreduction done
% 0.11/0.25
% 0.11/0.25 % Proof found!
% 0.11/0.25 % SZS status Theorem
% 0.11/0.25 % SZS output start CNFRefutation
% See solution above
% 0.11/0.25 % Parsed axioms : 2
% 0.11/0.25 % Removed by relevancy pruning/SinE : 1
% 0.11/0.25 % Initial clauses : 6
% 0.11/0.25 % Removed in clause preprocessing : 0
% 0.11/0.25 % Initial clauses in saturation : 6
% 0.11/0.25 % Processed clauses : 49
% 0.11/0.25 % ...of these trivial : 0
% 0.11/0.25 % ...subsumed : 4
% 0.11/0.25 % ...remaining for further processing : 45
% 0.11/0.25 % Other redundant clauses eliminated : 10
% 0.11/0.25 % Clauses deleted for lack of memory : 0
% 0.11/0.25 % Backward-subsumed : 3
% 0.11/0.25 % Backward-rewritten : 7
% 0.11/0.25 % Generated clauses : 88
% 0.11/0.25 % ...of the previous two non-redundant : 70
% 0.11/0.25 % ...aggressively subsumed : 0
% 0.11/0.25 % Contextual simplify-reflections : 5
% 0.11/0.25 % Paramodulations : 60
% 0.11/0.25 % Factorizations : 5
% 0.11/0.25 % NegExts : 2
% 0.11/0.25 % Equation resolutions : 10
% 0.11/0.25 % Disequality decompositions : 0
% 0.11/0.25 % Total rewrite steps : 25
% 0.11/0.25 % ...of those cached : 23
% 0.11/0.25 % Propositional unsat checks : 0
% 0.11/0.25 % Propositional check models : 0
% 0.11/0.25 % Propositional check unsatisfiable : 0
% 0.11/0.25 % Propositional clauses : 0
% 0.11/0.25 % Propositional clauses after purity: 0
% 0.11/0.25 % Propositional unsat core size : 0
% 0.11/0.25 % Propositional preprocessing time : 0.000
% 0.11/0.25 % Propositional encoding time : 0.000
% 0.11/0.25 % Propositional solver time : 0.000
% 0.11/0.25 % Success case prop preproc time : 0.000
% 0.11/0.25 % Success case prop encoding time : 0.000
% 0.11/0.25 % Success case prop solver time : 0.000
% 0.11/0.25 % Current number of processed clauses : 25
% 0.11/0.25 % Positive orientable unit clauses : 3
% 0.11/0.25 % Positive unorientable unit clauses: 0
% 0.11/0.25 % Negative unit clauses : 1
% 0.11/0.25 % Non-unit-clauses : 21
% 0.11/0.25 % Current number of unprocessed clauses: 18
% 0.11/0.25 % ...number of literals in the above : 61
% 0.11/0.25 % Current number of archived formulas : 0
% 0.11/0.25 % Current number of archived clauses : 20
% 0.11/0.25 % Clause-clause subsumption calls (NU) : 133
% 0.11/0.25 % Rec. Clause-clause subsumption calls : 83
% 0.11/0.25 % Non-unit clause-clause subsumptions : 11
% 0.11/0.25 % Unit Clause-clause subsumption calls : 12
% 0.11/0.25 % Rewrite failures with RHS unbound : 0
% 0.11/0.25 % BW rewrite match attempts : 1
% 0.11/0.25 % BW rewrite match successes : 1
% 0.11/0.25 % Condensation attempts : 49
% 0.11/0.25 % Condensation successes : 0
% 0.11/0.25 % Termbank termtop insertions : 2928
% 0.11/0.25 % Search garbage collected termcells : 320
% 0.11/0.25
% 0.11/0.25 % -------------------------------------------------
% 0.11/0.25 % User time : 0.005 s
% 0.11/0.25 % System time : 0.002 s
% 0.11/0.25 % Total time : 0.008 s
% 0.11/0.25 % Maximum resident set size: 3636 pages
% 0.11/0.25
% 0.11/0.25 % -------------------------------------------------
% 0.11/0.25 % User time : 0.008 s
% 0.11/0.25 % System time : 0.007 s
% 0.11/0.25 % Total time : 0.015 s
% 0.11/0.25 % Maximum resident set size: 4864 pages
% 0.11/0.25 % E exiting
%------------------------------------------------------------------------------