%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU236+2 : 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 : 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 : Thu Sep 24 02:24:24 PM UTC 2026
% Result : Theorem 3.17s 1.20s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 17 unt; 0 def)
% Number of atoms : 157 ( 7 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 166 ( 65 ~; 60 |; 24 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 71 ( 1 sgn 44 !; 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(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
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(t8_xboole_1,lemma,
! [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(t38_zfmisc_1,lemma,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X2,X3)
& in(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
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,lemma,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_ordinal1) ).
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(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(c_0_11,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_12,plain,
! [X108] : succ(X108) = set_union2(X108,singleton(X108)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_13,lemma,
! [X687] : unordered_pair(X687,X687) = singleton(X687),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_14,negated_conjecture,
( ( ordinal_subset(succ(esk87_0),esk88_0)
| in(esk87_0,esk88_0) )
& ( ~ ordinal_subset(succ(esk87_0),esk88_0)
| ~ in(esk87_0,esk88_0) )
& ordinal(esk88_0)
& ordinal(esk87_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_15,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,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]) ).
cnf(c_0_18,negated_conjecture,
( ~ ordinal_subset(succ(esk87_0),esk88_0)
| ~ in(esk87_0,esk88_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
succ(X1) = set_union2(X1,unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X442,X443] :
( ( ~ ordinal(X443)
| ~ ordinal(X442)
| ordinal_subset(X442,X443)
| ~ subset(X442,X443) )
& ( ~ ordinal(X443)
| ~ ordinal(X442)
| subset(X442,X443)
| ~ ordinal_subset(X442,X443) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])])]) ).
fof(c_0_21,plain,
! [X363] :
( ( ~ ordinal(X363)
| ordinal(succ(X363)) )
& ( ~ ordinal(X363)
| epsilon_connected(succ(X363)) )
& ( ~ ordinal(X363)
| epsilon_transitive(succ(X363)) )
& ( ~ ordinal(X363)
| ~ empty(succ(X363)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_22,negated_conjecture,
( ordinal_subset(succ(esk87_0),esk88_0)
| in(esk87_0,esk88_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( ~ ordinal_subset(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)),esk88_0)
| ~ in(esk87_0,esk88_0) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2)
| ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
ordinal(esk88_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( ~ ordinal(X1)
| ordinal(succ(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( ordinal_subset(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)),esk88_0)
| in(esk87_0,esk88_0) ),
inference(rw,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(esk87_0,esk88_0)
| ~ ordinal(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)))
| ~ subset(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)),esk88_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( ~ ordinal(X1)
| ordinal(set_union2(X1,unordered_pair(X1,X1))) ),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_31,negated_conjecture,
ordinal(esk87_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_32,lemma,
! [X722,X723,X724] :
( subset(set_union2(X722,X724),X723)
| ~ subset(X724,X723)
| ~ subset(X722,X723) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
fof(c_0_33,lemma,
! [X592,X593,X594] :
( ( subset(unordered_pair(X592,X593),X594)
| ~ in(X593,X594)
| ~ in(X592,X594) )
& ( ~ subset(unordered_pair(X592,X593),X594)
| in(X593,X594) )
& ( ~ subset(unordered_pair(X592,X593),X594)
| in(X592,X594) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_zfmisc_1])])])]) ).
fof(c_0_34,plain,
! [X209,X210,X211,X212,X213] :
( ( subset(X212,X213)
| ~ in(esk41_2(X212,X213),X213) )
& ( subset(X212,X213)
| in(esk41_2(X212,X213),X212) )
& ( in(X211,X210)
| ~ in(X211,X209)
| ~ subset(X209,X210) ) ),
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_35,negated_conjecture,
( ~ ordinal(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)))
| in(esk87_0,esk88_0)
| subset(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)),esk88_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
fof(c_0_36,lemma,
! [X453] : in(X453,succ(X453)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
cnf(c_0_37,negated_conjecture,
( ~ in(esk87_0,esk88_0)
| ~ subset(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)),esk88_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_38,lemma,
( ~ subset(X3,X2)
| ~ subset(X1,X2)
| subset(set_union2(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,lemma,
( ~ subset(unordered_pair(X1,X3),X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( in(esk87_0,esk88_0)
| subset(set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)),esk88_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_31])]) ).
cnf(c_0_42,lemma,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,lemma,
( ~ subset(esk87_0,esk88_0)
| ~ subset(unordered_pair(esk87_0,esk87_0),esk88_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,lemma,
( ~ in(X3,X2)
| ~ in(X1,X2)
| subset(unordered_pair(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(X1,set_union2(esk87_0,unordered_pair(esk87_0,esk87_0)))
| in(X1,esk88_0)
| in(esk87_0,esk88_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,lemma,
in(X1,set_union2(X1,unordered_pair(X1,X1))),
inference(rw,[status(thm)],[c_0_42,c_0_19]) ).
fof(c_0_47,plain,
! [X148,X149,X150] :
( ( epsilon_transitive(X150)
| ~ subset(esk27_1(X150),X150) )
& ( epsilon_transitive(X150)
| in(esk27_1(X150),X150) )
& ( subset(X149,X148)
| ~ in(X149,X148)
| ~ epsilon_transitive(X148) ) ),
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_48,lemma,
( ~ in(esk87_0,esk88_0)
| ~ subset(esk87_0,esk88_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,lemma,
in(esk87_0,esk88_0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,lemma,
~ subset(esk87_0,esk88_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
fof(c_0_52,plain,
! [X12] :
( ( ~ ordinal(X12)
| epsilon_connected(X12) )
& ( ~ ordinal(X12)
| epsilon_transitive(X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
cnf(c_0_53,lemma,
~ epsilon_transitive(esk88_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_49]),c_0_51]) ).
cnf(c_0_54,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_55,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU236+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n013.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 06:01:21 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.51 Running first-order theorem proving
% 0.18/0.51 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
% 3.17/1.20 % Version: 3.5.1
% 3.17/1.20 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.17/1.20 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.20 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.17/1.20 % Starting new_bool_3 with 300s (1) cores
% 3.17/1.20 % Starting new_bool_1 with 300s (1) cores
% 3.17/1.20 % Starting sh5l with 300s (1) cores
% 3.17/1.20 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 85806 completed with status 0
% 3.17/1.20 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.17/1.20 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.17/1.20 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.20 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.17/1.20 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.17/1.20 % No SInE strategy applied
% 3.17/1.20 % Search class: FGHSM-FSLM32-MFFFFFNN
% 3.17/1.20 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 3.17/1.20 % Starting SubtermCWHack with 136s (1) cores
% 3.17/1.20 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.17/1.20 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 3.17/1.20 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 3.17/1.20 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 3.17/1.20 % G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 85817 completed with status 0
% 3.17/1.20 % Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 3.17/1.20 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.17/1.20 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.20 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.17/1.20 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.17/1.20 % No SInE strategy applied
% 3.17/1.20 % Search class: FGHSM-FSLM32-MFFFFFNN
% 3.17/1.20 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 3.17/1.20 % Starting SubtermCWHack with 136s (1) cores
% 3.17/1.20 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.17/1.20 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 3.17/1.20 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 3.17/1.20 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 3.17/1.20 % Preprocessing time : 0.008 s
% 3.17/1.20 % Presaturation interreduction done
% 3.17/1.20
% 3.17/1.20 % Proof found!
% 3.17/1.20 % SZS status Theorem
% 3.17/1.20 % SZS output start CNFRefutation
% See solution above
% 3.17/1.20 % Parsed axioms : 276
% 3.17/1.20 % Removed by relevancy pruning/SinE : 0
% 3.17/1.20 % Initial clauses : 561
% 3.17/1.20 % Removed in clause preprocessing : 29
% 3.17/1.20 % Initial clauses in saturation : 532
% 3.17/1.20 % Processed clauses : 1261
% 3.17/1.20 % ...of these trivial : 27
% 3.17/1.20 % ...subsumed : 147
% 3.17/1.20 % ...remaining for further processing : 1087
% 3.17/1.20 % Other redundant clauses eliminated : 163
% 3.17/1.20 % Clauses deleted for lack of memory : 0
% 3.17/1.20 % Backward-subsumed : 9
% 3.17/1.20 % Backward-rewritten : 27
% 3.17/1.20 % Generated clauses : 7922
% 3.17/1.20 % ...of the previous two non-redundant : 7557
% 3.17/1.20 % ...aggressively subsumed : 0
% 3.17/1.20 % Contextual simplify-reflections : 28
% 3.17/1.20 % Paramodulations : 7755
% 3.17/1.20 % Factorizations : 14
% 3.17/1.20 % NegExts : 0
% 3.17/1.20 % Equation resolutions : 169
% 3.17/1.20 % Disequality decompositions : 0
% 3.17/1.20 % Total rewrite steps : 956
% 3.17/1.20 % ...of those cached : 802
% 3.17/1.20 % Propositional unsat checks : 0
% 3.17/1.20 % Propositional check models : 0
% 3.17/1.20 % Propositional check unsatisfiable : 0
% 3.17/1.20 % Propositional clauses : 0
% 3.17/1.20 % Propositional clauses after purity: 0
% 3.17/1.20 % Propositional unsat core size : 0
% 3.17/1.20 % Propositional preprocessing time : 0.000
% 3.17/1.20 % Propositional encoding time : 0.000
% 3.17/1.20 % Propositional solver time : 0.000
% 3.17/1.20 % Success case prop preproc time : 0.000
% 3.17/1.20 % Success case prop encoding time : 0.000
% 3.17/1.20 % Success case prop solver time : 0.000
% 3.17/1.20 % Current number of processed clauses : 491
% 3.17/1.20 % Positive orientable unit clauses : 71
% 3.17/1.20 % Positive unorientable unit clauses: 3
% 3.17/1.20 % Negative unit clauses : 27
% 3.17/1.20 % Non-unit-clauses : 390
% 3.17/1.20 % Current number of unprocessed clauses: 7273
% 3.17/1.20 % ...number of literals in the above : 32796
% 3.17/1.20 % Current number of archived formulas : 0
% 3.17/1.20 % Current number of archived clauses : 510
% 3.17/1.20 % Clause-clause subsumption calls (NU) : 113359
% 3.17/1.20 % Rec. Clause-clause subsumption calls : 41214
% 3.17/1.20 % Non-unit clause-clause subsumptions : 111
% 3.17/1.20 % Unit Clause-clause subsumption calls : 4808
% 3.17/1.20 % Rewrite failures with RHS unbound : 0
% 3.17/1.20 % BW rewrite match attempts : 73
% 3.17/1.20 % BW rewrite match successes : 51
% 3.17/1.20 % Condensation attempts : 0
% 3.17/1.20 % Condensation successes : 0
% 3.17/1.20 % Termbank termtop insertions : 176418
% 3.17/1.20 % Search garbage collected termcells : 9425
% 3.17/1.20
% 3.17/1.20 % -------------------------------------------------
% 3.17/1.20 % User time : 0.300 s
% 3.17/1.20 % System time : 0.022 s
% 3.17/1.20 % Total time : 0.322 s
% 3.17/1.20 % Maximum resident set size: 5200 pages
% 3.17/1.20
% 3.17/1.20 % -------------------------------------------------
% 3.17/1.20 % User time : 1.803 s
% 3.17/1.20 % System time : 0.122 s
% 3.17/1.20 % Total time : 1.925 s
% 3.17/1.20 % Maximum resident set size: 5120 pages
% 3.17/1.20 % E exiting
%------------------------------------------------------------------------------