%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU864^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:28:01 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 48
% Number of leaves : 1
% Syntax : Number of formulae : 65 ( 42 unt; 0 typ; 0 def)
% Number of atoms : 146 ( 70 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 212 ( 83 ~; 28 |; 5 &; 86 @)
% ( 0 <=>; 9 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 23 usr; 24 con; 0-2 aty)
% Number of variables : 65 ( 36 ^; 29 !; 0 ?; 65 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
t: a ).
thf(decl_24,type,
epred1_0: ( a > $o ) > $o ).
thf(decl_25,type,
esk2_0: a ).
thf(decl_26,type,
esk3_0: a ).
thf(decl_27,type,
esk4_0: a ).
thf(decl_28,type,
esk5_0: a ).
thf(decl_29,type,
esk6_0: a ).
thf(decl_30,type,
esk7_0: a ).
thf(decl_31,type,
esk8_0: a ).
thf(decl_32,type,
esk9_0: a ).
thf(decl_33,type,
esk10_1: ( a > $o ) > a ).
thf(decl_34,type,
esk11_0: a ).
thf(decl_36,type,
esk13_0: a ).
thf(decl_38,type,
esk15_0: a ).
thf(decl_40,type,
esk17_0: a ).
thf(decl_42,type,
esk19_0: a ).
thf(decl_44,type,
esk21_0: a ).
thf(decl_46,type,
esk23_0: a ).
thf(decl_48,type,
esk25_0: a ).
thf(decl_49,type,
esk26_0: a ).
thf(decl_51,type,
esk28_0: a ).
thf(decl_53,type,
esk30_0: a ).
thf(decl_55,type,
esk32_0: a ).
thf(cDOMLEMMA1_pme,conjecture,
! [X1: ( a > $o ) > $o] :
( ( ( X1
@ ^ [X2: a] : ~ $true )
& ! [X3: a > $o] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( t = X4 )
=> ( X1
@ ^ [X5: a] :
( ( X3 @ X5 )
| ( X4 = X5 ) ) ) ) ) )
=> ( X1
@ ^ [X2: a] : ( t = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.m4y7NZI1Ce/E---3.1_2208812.p',cDOMLEMMA1_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > $o ) > $o] :
( ( ( X1
@ ^ [X2: a] : ~ $true )
& ! [X3: a > $o] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( t = X4 )
=> ( X1
@ ^ [X5: a] :
( ( X3 @ X5 )
| ( X4 = X5 ) ) ) ) ) )
=> ( X1
@ ^ [X2: a] : ( t = X2 ) ) ),
inference(assume_negation,[status(cth)],[cDOMLEMMA1_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: ( a > $o ) > $o] :
( ( ( X1
@ ^ [Z0: a] : ~ $true )
& ! [X3: a > $o] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( t = X4 )
=> ( X1
@ ^ [Z0: a] :
( ( X3 @ Z0 )
| ( X4 = Z0 ) ) ) ) ) )
=> ( X1
@ ^ [Z0: a] : ( t = Z0 ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X10: a > $o,X11: a] :
( ( epred1_0
@ ^ [Z0: a] : ~ $true )
& ( ~ ( epred1_0 @ X10 )
| ( t != X11 )
| ( epred1_0
@ ^ [Z0: a] :
( ( X10 @ Z0 )
| ( X11 = Z0 ) ) ) )
& ~ ( epred1_0 @ ( $eq @ t ) ) ),
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,
( epred1_0
@ ^ [Z0: a] : ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
~ ( epred1_0 @ ( $eq @ t ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( epred1_0
@ ^ [Z0: a] : ~ $true ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ t ) ),
inference(ext_sup,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,plain,
t = esk2_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_7])]) ).
thf(c_0_9,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk2_0 ) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,plain,
esk2_0 = esk3_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_9])]) ).
thf(c_0_11,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk3_0 ) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,plain,
esk3_0 = esk4_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_11])]) ).
thf(c_0_13,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk4_0 ) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,plain,
esk4_0 = esk5_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_13])]) ).
thf(c_0_15,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk5_0 ) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_16,plain,
esk5_0 = esk6_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_15])]) ).
thf(c_0_17,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk6_0 ) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_18,plain,
esk6_0 = esk7_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_17])]) ).
thf(c_0_19,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk7_0 ) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_20,plain,
esk7_0 = esk8_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_19])]) ).
thf(c_0_21,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk8_0 ) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_22,plain,
esk8_0 = esk9_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_21])]) ).
thf(c_0_23,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk9_0 ) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_24,plain,
esk9_0 = esk11_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_23])]) ).
thf(c_0_25,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk11_0 ) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_26,plain,
esk11_0 = esk13_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_25])]) ).
thf(c_0_27,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk13_0 ) ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_28,plain,
esk13_0 = esk15_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_27])]) ).
thf(c_0_29,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk15_0 ) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_30,plain,
esk15_0 = esk17_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_29])]) ).
thf(c_0_31,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk17_0 ) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_32,negated_conjecture,
! [X3: a > $o,X2: a] :
( ( epred1_0
@ ^ [Z0: a] :
( ( X3 @ Z0 )
| ( X2 = Z0 ) ) )
| ~ ( epred1_0 @ X3 )
| ( t != X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_33,plain,
esk17_0 = esk19_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_31])]) ).
thf(c_0_34,negated_conjecture,
! [X3: a > $o] :
( ( epred1_0
@ ^ [Z0: a] :
( ( X3 @ Z0 )
| ( t = Z0 ) ) )
| ~ ( epred1_0 @ X3 ) ),
inference(er,[status(thm)],[c_0_32]) ).
thf(c_0_35,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk19_0 ) ),
inference(rw,[status(thm)],[c_0_31,c_0_33]) ).
thf(c_0_36,plain,
! [X3: a > $o] :
( ( ( $eq @ esk8_0 )
!= ( ^ [Z0: a] :
( ( X3 @ Z0 )
| ( t = Z0 ) ) ) )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_5,c_0_34]),c_0_8]),c_0_10]),c_0_12]),c_0_14]),c_0_16]),c_0_18]),c_0_20]) ).
thf(c_0_37,plain,
esk19_0 = esk21_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_35])]) ).
thf(c_0_38,plain,
! [X3: a > $o] :
( ( ( ( X3 @ ( esk10_1 @ X3 ) )
| ( esk9_0
= ( esk10_1 @ X3 ) ) )
<~> ( esk9_0
= ( esk10_1 @ X3 ) ) )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_36]),c_0_8]),c_0_10]),c_0_12]),c_0_14]),c_0_16]),c_0_18]),c_0_20]),c_0_22]),c_0_22]) ).
thf(c_0_39,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk21_0 ) ),
inference(rw,[status(thm)],[c_0_35,c_0_37]) ).
thf(c_0_40,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk11_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_38])]),c_0_24]) ).
thf(c_0_41,plain,
esk21_0 = esk23_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_39])]) ).
thf(c_0_42,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk13_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_40,c_0_26]) ).
thf(c_0_43,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk23_0 ) ),
inference(rw,[status(thm)],[c_0_39,c_0_41]) ).
thf(c_0_44,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk15_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_42,c_0_28]) ).
thf(c_0_45,plain,
esk23_0 = esk25_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_43])]) ).
thf(c_0_46,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk17_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_44,c_0_30]) ).
thf(c_0_47,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk25_0 ) ),
inference(rw,[status(thm)],[c_0_43,c_0_45]) ).
thf(c_0_48,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk19_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_46,c_0_33]) ).
thf(c_0_49,plain,
esk25_0 = esk26_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_47])]) ).
thf(c_0_50,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk21_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_48,c_0_37]) ).
thf(c_0_51,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk26_0 ) ),
inference(rw,[status(thm)],[c_0_47,c_0_49]) ).
thf(c_0_52,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk23_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_50,c_0_41]) ).
thf(c_0_53,plain,
esk26_0 = esk28_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_51])]) ).
thf(c_0_54,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk25_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_52,c_0_45]) ).
thf(c_0_55,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk28_0 ) ),
inference(rw,[status(thm)],[c_0_51,c_0_53]) ).
thf(c_0_56,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk26_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_54,c_0_49]) ).
thf(c_0_57,plain,
esk28_0 = esk30_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_55])]) ).
thf(c_0_58,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk28_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_56,c_0_53]) ).
thf(c_0_59,plain,
( ( ^ [Z0: a] : ~ $true )
!= ( $eq @ esk30_0 ) ),
inference(rw,[status(thm)],[c_0_55,c_0_57]) ).
thf(c_0_60,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk30_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_58,c_0_57]) ).
thf(c_0_61,plain,
esk30_0 = esk32_0,
inference(cn,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_59])]) ).
thf(c_0_62,plain,
! [X3: a > $o] :
( ( ( esk10_1 @ X3 )
!= esk32_0 )
| ~ ( epred1_0 @ X3 ) ),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
thf(c_0_63,plain,
! [X3: a > $o] :
( ( X3 @ ( esk10_1 @ X3 ) )
| ~ ( epred1_0 @ X3 ) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_38])]),c_0_24]),c_0_26]),c_0_28]),c_0_30]),c_0_33]),c_0_37]),c_0_41]),c_0_45]),c_0_49]),c_0_53]),c_0_57]),c_0_61]),c_0_62]) ).
thf(c_0_64,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_63,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU864^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n013.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:40:34 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.25 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.m4y7NZI1Ce/E---3.1_2208812.p
% 0.20/0.28 % Version: 3.5.1-ho
% 0.20/0.28 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.28 % Starting sh2lt with 300s (1) cores
% 0.20/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.20/0.28 % post_as_ho5 with pid 2208845 completed with status 0
% 0.20/0.28 % Result found by post_as_ho5
% 0.20/0.28 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.20/0.28 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.28 % Search class: HHUSF-FFSF00-MHHFFFBN
% 0.20/0.28 % partial match(2): HHUPF-FFSF00-SHHFFFBN
% 0.20/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.28 % Starting post_as_ho5 with 151s (1) cores
% 0.20/0.28 % Starting lpo8_s with 136s (1) cores
% 0.20/0.28 % Starting sh5l with 136s (1) cores
% 0.20/0.28 % Starting sh2lt with 136s (1) cores
% 0.20/0.28 % SubtermCWHack with pid 2208850 completed with status 10
% 0.20/0.28 % Starting new_bool_1 with 136s (1) cores
% 0.20/0.28 % post_as_ho5 with pid 2208851 completed with status 0
% 0.20/0.28 % Result found by post_as_ho5
% 0.20/0.28 % Preprocessing class: HSSSSMSSSSMNHHA.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting post_as_ho5 with 1500s (5) cores
% 0.20/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 0.20/0.28 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.20/0.28 % Search class: HHUSF-FFSF00-MHHFFFBN
% 0.20/0.28 % partial match(2): HHUPF-FFSF00-SHHFFFBN
% 0.20/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.28 % Starting post_as_ho5 with 151s (1) cores
% 0.20/0.28 % Preprocessing time : 0.001 s
% 0.20/0.28 % Presaturation interreduction done
% 0.20/0.28
% 0.20/0.28 % Proof found!
% 0.20/0.28 % SZS status Theorem
% 0.20/0.28 % SZS output start CNFRefutation
% See solution above
% 0.20/0.28 % Parsed axioms : 3
% 0.20/0.28 % Removed by relevancy pruning/SinE : 2
% 0.20/0.28 % Initial clauses : 3
% 0.20/0.28 % Removed in clause preprocessing : 0
% 0.20/0.28 % Initial clauses in saturation : 3
% 0.20/0.28 % Processed clauses : 506
% 0.20/0.28 % ...of these trivial : 0
% 0.20/0.28 % ...subsumed : 175
% 0.20/0.28 % ...remaining for further processing : 331
% 0.20/0.28 % Other redundant clauses eliminated : 1
% 0.20/0.28 % Clauses deleted for lack of memory : 0
% 0.20/0.28 % Backward-subsumed : 0
% 0.20/0.28 % Backward-rewritten : 244
% 0.20/0.28 % Generated clauses : 536
% 0.20/0.28 % ...of the previous two non-redundant : 779
% 0.20/0.28 % ...aggressively subsumed : 0
% 0.20/0.28 % Contextual simplify-reflections : 1
% 0.20/0.28 % Paramodulations : 493
% 0.20/0.28 % Factorizations : 0
% 0.20/0.28 % NegExts : 34
% 0.20/0.28 % Equation resolutions : 1
% 0.20/0.28 % Disequality decompositions : 0
% 0.20/0.28 % Total rewrite steps : 5499
% 0.20/0.28 % ...of those cached : 5478
% 0.20/0.28 % Propositional unsat checks : 0
% 0.20/0.28 % Propositional check models : 0
% 0.20/0.28 % Propositional check unsatisfiable : 0
% 0.20/0.28 % Propositional clauses : 0
% 0.20/0.28 % Propositional clauses after purity: 0
% 0.20/0.28 % Propositional unsat core size : 0
% 0.20/0.28 % Propositional preprocessing time : 0.000
% 0.20/0.28 % Propositional encoding time : 0.000
% 0.20/0.28 % Propositional solver time : 0.000
% 0.20/0.28 % Success case prop preproc time : 0.000
% 0.20/0.28 % Success case prop encoding time : 0.000
% 0.20/0.28 % Success case prop solver time : 0.000
% 0.20/0.28 % Current number of processed clauses : 81
% 0.20/0.28 % Positive orientable unit clauses : 53
% 0.20/0.28 % Positive unorientable unit clauses: 0
% 0.20/0.28 % Negative unit clauses : 23
% 0.20/0.28 % Non-unit-clauses : 5
% 0.20/0.28 % Current number of unprocessed clauses: 81
% 0.20/0.28 % ...number of literals in the above : 98
% 0.20/0.28 % Current number of archived formulas : 0
% 0.20/0.28 % Current number of archived clauses : 249
% 0.20/0.28 % Clause-clause subsumption calls (NU) : 17
% 0.20/0.28 % Rec. Clause-clause subsumption calls : 17
% 0.20/0.28 % Non-unit clause-clause subsumptions : 1
% 0.20/0.28 % Unit Clause-clause subsumption calls : 675
% 0.20/0.28 % Rewrite failures with RHS unbound : 0
% 0.20/0.28 % BW rewrite match attempts : 51
% 0.20/0.28 % BW rewrite match successes : 51
% 0.20/0.28 % Condensation attempts : 0
% 0.20/0.28 % Condensation successes : 0
% 0.20/0.28 % Termbank termtop insertions : 8585
% 0.20/0.28 % Search garbage collected termcells : 139
% 0.20/0.28
% 0.20/0.28 % -------------------------------------------------
% 0.20/0.28 % User time : 0.019 s
% 0.20/0.28 % System time : 0.003 s
% 0.20/0.28 % Total time : 0.022 s
% 0.20/0.28 % Maximum resident set size: 3636 pages
% 0.20/0.28
% 0.20/0.28 % -------------------------------------------------
% 0.20/0.28 % User time : 0.073 s
% 0.20/0.28 % System time : 0.018 s
% 0.20/0.28 % Total time : 0.090 s
% 0.20/0.28 % Maximum resident set size: 4864 pages
% 0.20/0.28 % E exiting
%------------------------------------------------------------------------------