%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU210+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:28:31 PM UTC 2026
% Result : Theorem 0.17s 0.98s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 60 ( 23 unt; 0 def)
% Number of atoms : 168 ( 33 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 189 ( 81 ~; 71 |; 24 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-3 aty)
% Number of variables : 104 ( 7 sgn 51 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( empty(X2)
& element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( empty(X3)
& element(X2,powerset(X3))
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(t166_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_inverse_image(X3,X2))
<=> ? [X4] :
( in(X4,X2)
& in(ordered_pair(X1,X4),X3)
& in(X4,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t166_relat_1) ).
fof(t174_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> ~ ( relation_inverse_image(X2,X1) = empty_set
& subset(X1,relation_rng(X2))
& X1 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t174_relat_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(fc4_relat_1,axiom,
( relation(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_relat_1) ).
fof(c_0_11,plain,
! [X66] :
( X66 = empty_set
| ~ empty(X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_12,plain,
! [X43] :
( empty(esk10_1(X43))
& element(esk10_1(X43),powerset(X43)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_13,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
empty(esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X63,X64,X65] :
( ~ empty(X65)
| ~ element(X64,powerset(X65))
| ~ in(X63,X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_16,plain,
element(esk10_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
esk10_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
( ~ epred1_0
<=> ! [X1] : ~ empty(X1) ),
introduced(definition) ).
fof(c_0_19,plain,
( ~ epred2_0
<=> ! [X2] : ~ in(X2,empty_set) ),
introduced(definition) ).
cnf(c_0_20,plain,
( ~ empty(X3)
| ~ element(X2,powerset(X3))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ empty(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
fof(c_0_24,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( ~ relation(X16)
| X22 = relation_rng(X16)
| in(ordered_pair(esk4_2(X16,X22),esk3_2(X16,X22)),X16)
| in(esk3_2(X16,X22),X22) )
& ( ~ relation(X16)
| X22 = relation_rng(X16)
| ~ in(ordered_pair(X24,esk3_2(X16,X22)),X16)
| ~ in(esk3_2(X16,X22),X22) )
& ( ~ relation(X16)
| X17 != relation_rng(X16)
| in(X20,X17)
| ~ in(ordered_pair(X21,X20),X16) )
& ( ~ relation(X16)
| X17 != relation_rng(X16)
| in(ordered_pair(esk2_3(X16,X17,X18),X18),X16)
| ~ in(X18,X17) ) ),
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)],[d5_relat_1])])])])])])]) ).
fof(c_0_25,plain,
! [X26,X27] : ordered_pair(X26,X27) = unordered_pair(unordered_pair(X26,X27),singleton(X26)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_26,plain,
! [X47,X48,X49,X51] :
( ( ~ relation(X49)
| in(X47,relation_inverse_image(X49,X48))
| ~ in(X51,X48)
| ~ in(ordered_pair(X47,X51),X49)
| ~ in(X51,relation_rng(X49)) )
& ( ~ relation(X49)
| ~ in(X47,relation_inverse_image(X49,X48))
| in(esk12_3(X47,X48,X49),X48) )
& ( ~ relation(X49)
| ~ in(X47,relation_inverse_image(X49,X48))
| in(ordered_pair(X47,esk12_3(X47,X48,X49)),X49) )
& ( ~ relation(X49)
| ~ in(X47,relation_inverse_image(X49,X48))
| in(esk12_3(X47,X48,X49),relation_rng(X49)) ) ),
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)],[t166_relat_1])])])])])]) ).
fof(c_0_27,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ~ ( relation_inverse_image(X2,X1) = empty_set
& subset(X1,relation_rng(X2))
& X1 != empty_set ) ),
inference(assume_negation,[status(cth)],[t174_relat_1]) ).
cnf(c_0_28,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]),c_0_19]) ).
cnf(c_0_29,plain,
epred1_0,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( ~ relation(X1)
| X2 = relation_rng(X1)
| in(ordered_pair(esk4_2(X1,X2),esk3_2(X1,X2)),X1)
| in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_32,plain,
! [X8,X9] : unordered_pair(X8,X9) = unordered_pair(X9,X8),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_33,plain,
( ~ relation(X2)
| ~ in(X1,X4)
| ~ in(ordered_pair(X3,X1),X2)
| ~ in(X1,relation_rng(X2))
| in(X3,relation_inverse_image(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk2_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_35,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ~ ( relation_inverse_image(X2,X1) = empty_set
& subset(X1,relation_rng(X2))
& X1 != empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_37,plain,
( ~ relation(X1)
| in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk3_2(X1,X2)),singleton(esk4_2(X1,X2))),X1)
| in(esk3_2(X1,X2),X2)
| X2 = relation_rng(X1) ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)
| ~ in(X1,relation_rng(X2))
| ~ in(X1,X4)
| ~ relation(X2)
| in(X3,relation_inverse_image(X2,X4)) ),
inference(rw,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_40,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(unordered_pair(unordered_pair(esk2_3(X3,X2,X1),X1),singleton(esk2_3(X3,X2,X1))),X3) ),
inference(rw,[status(thm)],[c_0_34,c_0_31]) ).
fof(c_0_41,plain,
! [X10,X11,X12,X13,X14] :
( ( subset(X13,X14)
| ~ in(esk1_2(X13,X14),X14) )
& ( subset(X13,X14)
| in(esk1_2(X13,X14),X13) )
& ( in(X12,X11)
| ~ in(X12,X10)
| ~ subset(X10,X11) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_42,negated_conjecture,
( relation_inverse_image(esk14_0,esk13_0) = empty_set
& subset(esk13_0,relation_rng(esk14_0))
& esk13_0 != empty_set
& relation(esk14_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_43,plain,
~ in(X1,empty_set),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_19]),c_0_36]) ).
cnf(c_0_44,plain,
( ~ relation(X2)
| in(esk3_2(X2,X1),X1)
| in(unordered_pair(unordered_pair(esk3_2(X2,X1),esk4_2(X2,X1)),singleton(esk4_2(X2,X1))),X2)
| X1 = relation_rng(X2) ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
relation(empty_set),
inference(split_conjunct,[status(thm)],[fc4_relat_1]) ).
cnf(c_0_46,plain,
( ~ in(X4,X3)
| ~ in(X4,relation_rng(X2))
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X1)),X2)
| ~ relation(X2)
| in(X1,relation_inverse_image(X2,X3)) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_47,plain,
( ~ in(X1,relation_rng(X2))
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X1,esk2_3(X2,relation_rng(X2),X1)),singleton(esk2_3(X2,relation_rng(X2),X1))),X2) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_38])]) ).
cnf(c_0_48,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
subset(esk13_0,relation_rng(esk14_0)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
( in(esk3_2(empty_set,X1),X1)
| X1 = relation_rng(empty_set) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_51,plain,
( ~ in(X2,X3)
| ~ in(X2,relation_rng(X1))
| ~ relation(X1)
| in(esk2_3(X1,relation_rng(X1),X2),relation_inverse_image(X1,X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
relation_inverse_image(esk14_0,esk13_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,negated_conjecture,
relation(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_54,negated_conjecture,
( ~ in(X1,esk13_0)
| in(X1,relation_rng(esk14_0)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
relation_rng(empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
~ in(X1,esk13_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),c_0_43]),c_0_54]) ).
cnf(c_0_57,plain,
( in(esk3_2(empty_set,X1),X1)
| X1 = empty_set ),
inference(rw,[status(thm)],[c_0_50,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
esk13_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU210+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.51 % Computer : n018.cluster.edu
% 0.10/0.51 % Model : x86_64 x86_64
% 0.10/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.51 % Memory : 8046.5625MB
% 0.10/0.51 % OS : Linux 6.8.0-71-generic
% 0.10/0.51 % CPULimit : 300
% 0.10/0.51 % WCLimit : 300
% 0.10/0.51 % DateTime : Mon Sep 21 06:00:29 UTC 2026
% 0.10/0.51 % CPUTime :
% 0.10/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.56 Running first-order theorem proving
% 0.17/0.56 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.17/0.98 % Version: 3.5.1
% 0.17/0.98 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.98 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.98 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.98 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.98 % Starting sh5l with 300s (1) cores
% 0.17/0.98 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1123819 completed with status 0
% 0.17/0.98 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.98 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.98 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.98 % No SInE strategy applied
% 0.17/0.98 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.17/0.98 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.98 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.98 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.98 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.17/0.98 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.17/0.98 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.17/0.98 % G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 1123829 completed with status 0
% 0.17/0.98 % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 0.17/0.98 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.98 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.98 % No SInE strategy applied
% 0.17/0.98 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.17/0.98 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.98 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.98 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.98 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.17/0.98 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.17/0.98 % Preprocessing time : 0.002 s
% 0.17/0.98
% 0.17/0.98 % Proof found!
% 0.17/0.98 % SZS status Theorem
% 0.17/0.98 % SZS output start CNFRefutation
% See solution above
% 0.17/0.98 % Parsed axioms : 40
% 0.17/0.98 % Removed by relevancy pruning/SinE : 0
% 0.17/0.98 % Initial clauses : 58
% 0.17/0.98 % Removed in clause preprocessing : 9
% 0.17/0.98 % Initial clauses in saturation : 49
% 0.17/0.98 % Processed clauses : 2785
% 0.17/0.98 % ...of these trivial : 1
% 0.17/0.98 % ...subsumed : 2219
% 0.17/0.98 % ...remaining for further processing : 565
% 0.17/0.98 % Other redundant clauses eliminated : 2
% 0.17/0.98 % Clauses deleted for lack of memory : 0
% 0.17/0.98 % Backward-subsumed : 29
% 0.17/0.98 % Backward-rewritten : 12
% 0.17/0.98 % Generated clauses : 19202
% 0.17/0.98 % ...of the previous two non-redundant : 16475
% 0.17/0.98 % ...aggressively subsumed : 0
% 0.17/0.98 % Contextual simplify-reflections : 11
% 0.17/0.98 % Paramodulations : 19107
% 0.17/0.98 % Factorizations : 0
% 0.17/0.98 % NegExts : 0
% 0.17/0.98 % Equation resolutions : 2
% 0.17/0.98 % Disequality decompositions : 0
% 0.17/0.98 % Total rewrite steps : 6306
% 0.17/0.98 % ...of those cached : 6246
% 0.17/0.98 % Propositional unsat checks : 0
% 0.17/0.98 % Propositional check models : 0
% 0.17/0.98 % Propositional check unsatisfiable : 0
% 0.17/0.98 % Propositional clauses : 0
% 0.17/0.98 % Propositional clauses after purity: 0
% 0.17/0.98 % Propositional unsat core size : 0
% 0.17/0.98 % Propositional preprocessing time : 0.000
% 0.17/0.98 % Propositional encoding time : 0.000
% 0.17/0.98 % Propositional solver time : 0.000
% 0.17/0.98 % Success case prop preproc time : 0.000
% 0.17/0.98 % Success case prop encoding time : 0.000
% 0.17/0.98 % Success case prop solver time : 0.000
% 0.17/0.98 % Current number of processed clauses : 476
% 0.17/0.98 % Positive orientable unit clauses : 25
% 0.17/0.98 % Positive unorientable unit clauses: 1
% 0.17/0.98 % Negative unit clauses : 58
% 0.17/0.98 % Non-unit-clauses : 392
% 0.17/0.98 % Current number of unprocessed clauses: 13633
% 0.17/0.98 % ...number of literals in the above : 60789
% 0.17/0.98 % Current number of archived formulas : 0
% 0.17/0.98 % Current number of archived clauses : 42
% 0.17/0.98 % Clause-clause subsumption calls (NU) : 101844
% 0.17/0.98 % Rec. Clause-clause subsumption calls : 64458
% 0.17/0.98 % Non-unit clause-clause subsumptions : 1622
% 0.17/0.98 % Unit Clause-clause subsumption calls : 10191
% 0.17/0.98 % Rewrite failures with RHS unbound : 0
% 0.17/0.98 % BW rewrite match attempts : 15
% 0.17/0.98 % BW rewrite match successes : 10
% 0.17/0.98 % Condensation attempts : 0
% 0.17/0.98 % Condensation successes : 0
% 0.17/0.98 % Termbank termtop insertions : 231251
% 0.17/0.98 % Search garbage collected termcells : 617
% 0.17/0.98
% 0.17/0.98 % -------------------------------------------------
% 0.17/0.98 % User time : 0.364 s
% 0.17/0.98 % System time : 0.022 s
% 0.17/0.98 % Total time : 0.386 s
% 0.17/0.98 % Maximum resident set size: 3660 pages
% 0.17/0.98
% 0.17/0.98 % -------------------------------------------------
% 0.17/0.98 % User time : 1.853 s
% 0.17/0.98 % System time : 0.082 s
% 0.17/0.98 % Total time : 1.934 s
% 0.17/0.98 % Maximum resident set size: 4608 pages
% 0.17/0.98 % E exiting
%------------------------------------------------------------------------------