%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU430+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 : Thu Sep 24 02:29:24 PM UTC 2026
% Result : Theorem 0.07s 0.36s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 15 unt; 0 def)
% Number of atoms : 156 ( 56 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 155 ( 61 ~; 71 |; 11 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 83 ( 6 sgn 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relset_2) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = k3_tarski(X1)
<=> ! [X3] :
( r2_hidden(X3,X2)
<=> ? [X4] :
( r2_hidden(X4,X1)
& r2_hidden(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( v1_xboole_0(X2)
& r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( r2_hidden(X1,X2)
| v1_xboole_0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[t30_relset_2]) ).
fof(c_0_8,plain,
! [X16,X17,X18,X20,X21,X22,X23,X25] :
( ( X23 = k3_tarski(X22)
| r2_hidden(esk6_2(X22,X23),X23)
| r2_hidden(esk7_2(X22,X23),X22) )
& ( X23 = k3_tarski(X22)
| r2_hidden(esk6_2(X22,X23),X23)
| r2_hidden(esk6_2(X22,X23),esk7_2(X22,X23)) )
& ( X23 = k3_tarski(X22)
| ~ r2_hidden(X25,X22)
| ~ r2_hidden(esk6_2(X22,X23),X25)
| ~ r2_hidden(esk6_2(X22,X23),X23) )
& ( X17 != k3_tarski(X16)
| r2_hidden(X20,X17)
| ~ r2_hidden(X21,X16)
| ~ r2_hidden(X20,X21) )
& ( X17 != k3_tarski(X16)
| ~ r2_hidden(X18,X17)
| r2_hidden(esk5_3(X16,X17,X18),X16) )
& ( X17 != k3_tarski(X16)
| ~ r2_hidden(X18,X17)
| r2_hidden(X18,esk5_3(X16,X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_tarski])])])])])])]) ).
fof(c_0_9,plain,
! [X39,X40] :
( k5_setfam_1(X39,X40) = k3_tarski(X40)
| ~ m1_subset_1(X40,k1_zfmisc_1(k1_zfmisc_1(X39))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])])]) ).
fof(c_0_10,negated_conjecture,
! [X8] :
( ( X8 = k1_xboole_0
| ~ r2_hidden(X8,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) )
& m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_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_7])])])])])]) ).
fof(c_0_11,plain,
! [X55,X56] :
( ~ v1_xboole_0(X56)
| ~ r2_hidden(X55,X56) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_12,plain,
( X2 != k3_tarski(X1)
| ~ r2_hidden(X3,X2)
| r2_hidden(esk5_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
cnf(c_0_14,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2)))
| k5_setfam_1(X2,X1) = k3_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ v1_xboole_0(X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ r2_hidden(X2,k3_tarski(X1))
| r2_hidden(esk5_3(X1,k3_tarski(X1),X2),X1) ),
inference(er,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X12,X13,X14] :
( ( X14 = k1_xboole_0
| r2_hidden(esk4_1(X14),X14) )
& ( ~ r2_hidden(X13,X12)
| X12 != k1_xboole_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])]) ).
fof(c_0_19,plain,
! [X44,X45] :
( r2_hidden(X44,X45)
| v1_xboole_0(X45)
| ~ m1_subset_1(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_20,plain,
! [X29] : m1_subset_1(esk8_1(X29),X29),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_21,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( ~ r2_hidden(X2,k3_tarski(X1))
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( X1 = k1_xboole_0
| r2_hidden(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( ~ m1_subset_1(X1,X2)
| r2_hidden(X1,X2)
| v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
m1_subset_1(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( k3_tarski(esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ v1_xboole_0(X1)
| k3_tarski(X1) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_31,plain,
( r2_hidden(esk8_1(X1),X1)
| v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ v1_xboole_0(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( k3_tarski(esk2_0) = k1_xboole_0
| esk8_1(esk2_0) = k1_xboole_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,plain,
( X4 != k3_tarski(X3)
| ~ r2_hidden(X2,X3)
| ~ r2_hidden(X1,X2)
| r2_hidden(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
( r2_hidden(k1_xboole_0,esk2_0)
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( esk3_0 != k1_xboole_0
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( m1_subset_1(k1_xboole_0,esk2_0)
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_39,plain,
( ~ r2_hidden(X1,X3)
| ~ r2_hidden(X3,X2)
| r2_hidden(X1,k3_tarski(X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| r2_hidden(k1_xboole_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( esk3_0 != k1_xboole_0
| m1_subset_1(k1_xboole_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( ~ r2_hidden(X1,esk3_0)
| r2_hidden(k1_xboole_0,esk2_0)
| r2_hidden(X1,k3_tarski(esk2_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( esk3_0 != k1_xboole_0
| r2_hidden(k1_xboole_0,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_41]),c_0_32]) ).
cnf(c_0_44,plain,
( ~ r2_hidden(X2,X1)
| X1 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_45,plain,
( ~ r2_hidden(X3,X1)
| ~ r2_hidden(esk6_2(X1,X2),X3)
| ~ r2_hidden(esk6_2(X1,X2),X2)
| X2 = k3_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_46,plain,
( X2 = k3_tarski(X1)
| r2_hidden(esk6_2(X1,X2),X2)
| r2_hidden(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_47,negated_conjecture,
( r2_hidden(k1_xboole_0,esk2_0)
| r2_hidden(esk4_1(esk3_0),k3_tarski(esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_24]),c_0_43]) ).
cnf(c_0_48,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( ~ r2_hidden(X1,X2)
| r2_hidden(esk7_2(X2,X1),X2)
| X1 = k3_tarski(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
r2_hidden(k1_xboole_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_36]),c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( r2_hidden(esk7_2(esk2_0,k1_xboole_0),esk2_0)
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
( X2 = k3_tarski(X1)
| r2_hidden(esk6_2(X1,X2),X2)
| r2_hidden(esk6_2(X1,X2),esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_53,negated_conjecture,
( k3_tarski(esk2_0) = k1_xboole_0
| esk7_2(esk2_0,k1_xboole_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
k3_tarski(esk2_0) = k1_xboole_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_48]) ).
cnf(c_0_55,plain,
~ r2_hidden(X1,k3_tarski(k1_xboole_0)),
inference(spm,[status(thm)],[c_0_48,c_0_17]) ).
cnf(c_0_56,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_54])]) ).
cnf(c_0_57,plain,
k3_tarski(k1_xboole_0) = k1_xboole_0,
inference(spm,[status(thm)],[c_0_55,c_0_24]) ).
cnf(c_0_58,negated_conjecture,
~ r2_hidden(X1,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_56]),c_0_54]),c_0_48]) ).
cnf(c_0_59,plain,
( r2_hidden(esk6_2(k1_xboole_0,X1),X1)
| X1 = k1_xboole_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_54])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU430+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 06:28:08 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 % Version: 3.5.1
% 0.07/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.36 % Starting sh5l with 300s (1) cores
% 0.07/0.36 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1768394 completed with status 0
% 0.07/0.36 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.36 % No SInE strategy applied
% 0.07/0.36 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.07/0.36 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.36 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.07/0.36 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.07/0.36 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.07/0.36 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1768401 completed with status 0
% 0.07/0.36 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.36 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.36 % No SInE strategy applied
% 0.07/0.36 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.07/0.36 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.36 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.36 % Preprocessing time : 0.001 s
% 0.07/0.36 % Presaturation interreduction done
% 0.07/0.36
% 0.07/0.36 % Proof found!
% 0.07/0.36 % SZS status Theorem
% 0.07/0.36 % SZS output start CNFRefutation
% See solution above
% 0.07/0.36 % Parsed axioms : 29
% 0.07/0.36 % Removed by relevancy pruning/SinE : 0
% 0.07/0.36 % Initial clauses : 47
% 0.07/0.36 % Removed in clause preprocessing : 4
% 0.07/0.36 % Initial clauses in saturation : 43
% 0.07/0.36 % Processed clauses : 482
% 0.07/0.36 % ...of these trivial : 2
% 0.07/0.36 % ...subsumed : 250
% 0.07/0.36 % ...remaining for further processing : 230
% 0.07/0.36 % Other redundant clauses eliminated : 4
% 0.07/0.36 % Clauses deleted for lack of memory : 0
% 0.07/0.36 % Backward-subsumed : 11
% 0.07/0.36 % Backward-rewritten : 43
% 0.07/0.36 % Generated clauses : 852
% 0.07/0.36 % ...of the previous two non-redundant : 764
% 0.07/0.36 % ...aggressively subsumed : 0
% 0.07/0.36 % Contextual simplify-reflections : 4
% 0.07/0.36 % Paramodulations : 848
% 0.07/0.36 % Factorizations : 0
% 0.07/0.36 % NegExts : 0
% 0.07/0.36 % Equation resolutions : 4
% 0.07/0.36 % Disequality decompositions : 0
% 0.07/0.36 % Total rewrite steps : 328
% 0.07/0.36 % ...of those cached : 296
% 0.07/0.36 % Propositional unsat checks : 0
% 0.07/0.36 % Propositional check models : 0
% 0.07/0.36 % Propositional check unsatisfiable : 0
% 0.07/0.36 % Propositional clauses : 0
% 0.07/0.36 % Propositional clauses after purity: 0
% 0.07/0.36 % Propositional unsat core size : 0
% 0.07/0.36 % Propositional preprocessing time : 0.000
% 0.07/0.36 % Propositional encoding time : 0.000
% 0.07/0.36 % Propositional solver time : 0.000
% 0.07/0.36 % Success case prop preproc time : 0.000
% 0.07/0.36 % Success case prop encoding time : 0.000
% 0.07/0.36 % Success case prop solver time : 0.000
% 0.07/0.36 % Current number of processed clauses : 131
% 0.07/0.36 % Positive orientable unit clauses : 26
% 0.07/0.36 % Positive unorientable unit clauses: 0
% 0.07/0.36 % Negative unit clauses : 13
% 0.07/0.36 % Non-unit-clauses : 92
% 0.07/0.36 % Current number of unprocessed clauses: 349
% 0.07/0.36 % ...number of literals in the above : 1037
% 0.07/0.36 % Current number of archived formulas : 0
% 0.07/0.36 % Current number of archived clauses : 95
% 0.07/0.36 % Clause-clause subsumption calls (NU) : 1234
% 0.07/0.36 % Rec. Clause-clause subsumption calls : 898
% 0.07/0.36 % Non-unit clause-clause subsumptions : 52
% 0.07/0.36 % Unit Clause-clause subsumption calls : 219
% 0.07/0.36 % Rewrite failures with RHS unbound : 0
% 0.07/0.36 % BW rewrite match attempts : 15
% 0.07/0.36 % BW rewrite match successes : 7
% 0.07/0.36 % Condensation attempts : 0
% 0.07/0.36 % Condensation successes : 0
% 0.07/0.36 % Termbank termtop insertions : 11706
% 0.07/0.36 % Search garbage collected termcells : 530
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.015 s
% 0.07/0.36 % System time : 0.002 s
% 0.07/0.36 % Total time : 0.017 s
% 0.07/0.36 % Maximum resident set size: 3652 pages
% 0.07/0.36
% 0.07/0.36 % -------------------------------------------------
% 0.07/0.36 % User time : 0.061 s
% 0.07/0.36 % System time : 0.008 s
% 0.07/0.36 % Total time : 0.068 s
% 0.07/0.36 % Maximum resident set size: 4864 pages
% 0.07/0.36 % E exiting
%------------------------------------------------------------------------------