%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU236+3 : TPTP v9.3.1. Released v3.2.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 : Thu Sep 24 02:28:40 PM UTC 2026
% Result : Theorem 0.23s 0.61s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 13 unt; 0 def)
% Number of atoms : 171 ( 17 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 186 ( 72 ~; 72 |; 24 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ordinal(succ(X1))
& epsilon_connected(succ(X1))
& epsilon_transitive(succ(X1))
& ~ empty(succ(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X2)
& ordinal(X1) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
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(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(t8_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X3,X2)
& subset(X1,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t33_ordinal1]) ).
fof(c_0_11,negated_conjecture,
( ( ordinal_subset(succ(esk18_0),esk19_0)
| in(esk18_0,esk19_0) )
& ( ~ ordinal_subset(succ(esk18_0),esk19_0)
| ~ in(esk18_0,esk19_0) )
& ordinal(esk19_0)
& ordinal(esk18_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,plain,
! [X16] : succ(X16) = set_union2(X16,singleton(X16)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_13,plain,
! [X1] :
( ordinal(X1)
=> ( ordinal(succ(X1))
& epsilon_connected(succ(X1))
& epsilon_transitive(succ(X1))
& ~ empty(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
fof(c_0_14,plain,
! [X58,X59] :
( ( ~ ordinal(X59)
| ~ ordinal(X58)
| ordinal_subset(X58,X59)
| ~ subset(X58,X59) )
& ( ~ ordinal(X59)
| ~ ordinal(X58)
| subset(X58,X59)
| ~ ordinal_subset(X58,X59) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])])]) ).
cnf(c_0_15,negated_conjecture,
( ordinal_subset(succ(esk18_0),esk19_0)
| in(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X41] :
( ( ~ ordinal(X41)
| ordinal(succ(X41)) )
& ( ~ ordinal(X41)
| epsilon_connected(succ(X41)) )
& ( ~ ordinal(X41)
| epsilon_transitive(succ(X41)) )
& ( ~ ordinal(X41)
| ~ empty(succ(X41)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_18,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| in(esk18_0,esk19_0) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ~ ordinal(X1)
| ordinal(succ(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ ordinal_subset(succ(esk18_0),esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X28,X29,X30,X31,X32] :
( ( subset(X31,X32)
| ~ in(esk3_2(X31,X32),X32) )
& ( subset(X31,X32)
| in(esk3_2(X31,X32),X31) )
& ( in(X30,X29)
| ~ in(X30,X28)
| ~ subset(X28,X29) ) ),
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])])])])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| in(esk18_0,esk19_0)
| subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( ~ ordinal(X1)
| ordinal(set_union2(X1,singleton(X1))) ),
inference(rw,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_27,plain,
! [X63] : in(X63,succ(X63)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
cnf(c_0_28,negated_conjecture,
( ~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_29,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2)
| ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X84,X85,X86] :
( subset(set_union2(X84,X86),X85)
| ~ subset(X86,X85)
| ~ subset(X84,X85) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
cnf(c_0_31,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( in(esk18_0,esk19_0)
| subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_33,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20])]) ).
cnf(c_0_35,plain,
( ~ subset(X3,X2)
| ~ subset(X1,X2)
| subset(set_union2(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_36,plain,
! [X24,X25,X26] :
( ( epsilon_transitive(X26)
| ~ subset(esk2_1(X26),X26) )
& ( epsilon_transitive(X26)
| in(esk2_1(X26),X26) )
& ( subset(X25,X24)
| ~ in(X25,X24)
| ~ epsilon_transitive(X24) ) ),
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)],[d2_ordinal1])])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ in(X1,set_union2(esk18_0,singleton(esk18_0)))
| in(X1,esk19_0)
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_33,c_0_16]) ).
fof(c_0_39,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( X22 = singleton(X21)
| esk1_2(X21,X22) = X21
| in(esk1_2(X21,X22),X22) )
& ( X22 = singleton(X21)
| esk1_2(X21,X22) != X21
| ~ in(esk1_2(X21,X22),X22) )
& ( X18 != singleton(X17)
| in(X20,X18)
| X20 != X17 )
& ( X18 != singleton(X17)
| X19 = X17
| ~ in(X19,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)],[d1_tarski])])])])])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ subset(esk18_0,esk19_0)
| ~ subset(singleton(esk18_0),esk19_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
in(esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_43,plain,
! [X7] :
( ( ~ ordinal(X7)
| epsilon_connected(X7) )
& ( ~ ordinal(X7)
| epsilon_transitive(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
cnf(c_0_44,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ subset(esk18_0,esk19_0)
| ~ subset(singleton(esk18_0),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_25]),c_0_26])]) ).
cnf(c_0_46,negated_conjecture,
( ~ epsilon_transitive(esk19_0)
| subset(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_50,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ subset(singleton(esk18_0),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_42])]) ).
cnf(c_0_51,negated_conjecture,
subset(esk18_0,esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_20])]) ).
cnf(c_0_52,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_53,plain,
( subset(singleton(X1),X2)
| esk3_2(singleton(X1),X2) = X1 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
~ subset(singleton(esk18_0),esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_55,plain,
( ~ in(X1,X2)
| subset(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU236+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n015.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 06:05:21 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.23/0.61 % Version: 3.5.1
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.61 % Starting sh5l with 300s (1) cores
% 0.23/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 721578 completed with status 0
% 0.23/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61 % No SInE strategy applied
% 0.23/0.61 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.23/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.61 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.61 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.61 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.23/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 721585 completed with status 0
% 0.23/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61 % No SInE strategy applied
% 0.23/0.61 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.23/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.61 % Preprocessing time : 0.003 s
% 0.23/0.61 % Presaturation interreduction done
% 0.23/0.61
% 0.23/0.61 % Proof found!
% 0.23/0.61 % SZS status Theorem
% 0.23/0.61 % SZS output start CNFRefutation
% See solution above
% 0.23/0.61 % Parsed axioms : 52
% 0.23/0.61 % Removed by relevancy pruning/SinE : 0
% 0.23/0.61 % Initial clauses : 105
% 0.23/0.61 % Removed in clause preprocessing : 3
% 0.23/0.61 % Initial clauses in saturation : 102
% 0.23/0.61 % Processed clauses : 438
% 0.23/0.61 % ...of these trivial : 7
% 0.23/0.61 % ...subsumed : 92
% 0.23/0.61 % ...remaining for further processing : 339
% 0.23/0.61 % Other redundant clauses eliminated : 3
% 0.23/0.61 % Clauses deleted for lack of memory : 0
% 0.23/0.61 % Backward-subsumed : 6
% 0.23/0.61 % Backward-rewritten : 23
% 0.23/0.61 % Generated clauses : 479
% 0.23/0.61 % ...of the previous two non-redundant : 418
% 0.23/0.61 % ...aggressively subsumed : 0
% 0.23/0.61 % Contextual simplify-reflections : 2
% 0.23/0.61 % Paramodulations : 477
% 0.23/0.61 % Factorizations : 0
% 0.23/0.61 % NegExts : 0
% 0.23/0.61 % Equation resolutions : 3
% 0.23/0.61 % Disequality decompositions : 0
% 0.23/0.61 % Total rewrite steps : 152
% 0.23/0.61 % ...of those cached : 115
% 0.23/0.61 % Propositional unsat checks : 0
% 0.23/0.61 % Propositional check models : 0
% 0.23/0.61 % Propositional check unsatisfiable : 0
% 0.23/0.61 % Propositional clauses : 0
% 0.23/0.61 % Propositional clauses after purity: 0
% 0.23/0.61 % Propositional unsat core size : 0
% 0.23/0.61 % Propositional preprocessing time : 0.000
% 0.23/0.61 % Propositional encoding time : 0.000
% 0.23/0.61 % Propositional solver time : 0.000
% 0.23/0.61 % Success case prop preproc time : 0.000
% 0.23/0.61 % Success case prop encoding time : 0.000
% 0.23/0.61 % Success case prop solver time : 0.000
% 0.23/0.61 % Current number of processed clauses : 213
% 0.23/0.61 % Positive orientable unit clauses : 56
% 0.23/0.61 % Positive unorientable unit clauses: 1
% 0.23/0.61 % Negative unit clauses : 20
% 0.23/0.61 % Non-unit-clauses : 136
% 0.23/0.61 % Current number of unprocessed clauses: 156
% 0.23/0.61 % ...number of literals in the above : 458
% 0.23/0.61 % Current number of archived formulas : 0
% 0.23/0.61 % Current number of archived clauses : 125
% 0.23/0.61 % Clause-clause subsumption calls (NU) : 2938
% 0.23/0.61 % Rec. Clause-clause subsumption calls : 2628
% 0.23/0.61 % Non-unit clause-clause subsumptions : 55
% 0.23/0.61 % Unit Clause-clause subsumption calls : 434
% 0.23/0.61 % Rewrite failures with RHS unbound : 0
% 0.23/0.61 % BW rewrite match attempts : 36
% 0.23/0.61 % BW rewrite match successes : 29
% 0.23/0.61 % Condensation attempts : 0
% 0.23/0.61 % Condensation successes : 0
% 0.23/0.61 % Termbank termtop insertions : 9749
% 0.23/0.61 % Search garbage collected termcells : 815
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.044 s
% 0.23/0.61 % System time : 0.006 s
% 0.23/0.61 % Total time : 0.050 s
% 0.23/0.61 % Maximum resident set size: 3676 pages
% 0.23/0.61
% 0.23/0.61 % -------------------------------------------------
% 0.23/0.61 % User time : 0.184 s
% 0.23/0.61 % System time : 0.033 s
% 0.23/0.61 % Total time : 0.217 s
% 0.23/0.61 % Maximum resident set size: 4864 pages
% 0.23/0.61 % E exiting
%------------------------------------------------------------------------------