%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU232+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 : 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:39 PM UTC 2026
% Result : Theorem 244.14s 36.24s
% Output : CNFRefutation 244.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 62 ( 10 unt; 0 def)
% Number of atoms : 184 ( 16 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 194 ( 72 ~; 84 |; 24 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_ordinal1,conjecture,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_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(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(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(X3,X2)
& X2 != X3
& ~ in(X2,X3)
& in(X3,X1)
& in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_ordinal1) ).
fof(t3_ordinal1,lemma,
! [X1,X2,X3] :
~ ( in(X3,X1)
& in(X2,X3)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_connected(X1)
& epsilon_transitive(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_ordinal1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
inference(assume_negation,[status(cth)],[t23_ordinal1]) ).
fof(c_0_9,plain,
! [X9] :
( ( ~ ordinal(X9)
| epsilon_connected(X9) )
& ( ~ ordinal(X9)
| epsilon_transitive(X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])])]) ).
fof(c_0_10,negated_conjecture,
( ~ ordinal(esk1_0)
& in(esk1_0,esk2_0)
& ordinal(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X33,X34,X35] :
( ( epsilon_transitive(X35)
| ~ subset(esk8_1(X35),X35) )
& ( epsilon_transitive(X35)
| in(esk8_1(X35),X35) )
& ( subset(X34,X33)
| ~ in(X34,X33)
| ~ epsilon_transitive(X33) ) ),
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_12,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X46,X47,X48,X49,X50] :
( ( subset(X49,X50)
| ~ in(esk9_2(X49,X50),X50) )
& ( subset(X49,X50)
| in(esk9_2(X49,X50),X49) )
& ( in(X48,X47)
| ~ in(X48,X46)
| ~ subset(X46,X47) ) ),
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_15,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
epsilon_transitive(esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
subset(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
fof(c_0_20,plain,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(X3,X2)
& X2 != X3
& ~ in(X2,X3)
& in(X3,X1)
& in(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[d3_ordinal1]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(X1,esk1_0)
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
! [X27,X28,X29,X30] :
( ( epsilon_connected(X30)
| ~ in(esk7_1(X30),esk6_1(X30)) )
& ( epsilon_connected(X30)
| esk6_1(X30) != esk7_1(X30) )
& ( epsilon_connected(X30)
| ~ in(esk6_1(X30),esk7_1(X30)) )
& ( epsilon_connected(X30)
| in(esk7_1(X30),X30) )
& ( epsilon_connected(X30)
| in(esk6_1(X30),X30) )
& ( in(X29,X28)
| X28 = X29
| in(X28,X29)
| ~ in(X29,X27)
| ~ in(X28,X27)
| ~ epsilon_connected(X27) ) ),
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)],[c_0_20])])])])])])]) ).
cnf(c_0_23,plain,
( ~ ordinal(X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,esk1_0)
| subset(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_17])]) ).
cnf(c_0_25,plain,
( epsilon_transitive(X1)
| in(esk8_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_26,lemma,
! [X20,X21,X22] :
( ~ in(X22,X20)
| ~ in(X21,X22)
| ~ in(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_ordinal1])])]) ).
cnf(c_0_27,plain,
( ~ in(X3,X1)
| ~ in(X2,X1)
| ~ epsilon_connected(X1)
| in(X3,X2)
| X2 = X3
| in(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
epsilon_connected(esk2_0),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_29,negated_conjecture,
( epsilon_transitive(esk1_0)
| subset(esk8_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,lemma,
( ~ in(X3,X1)
| ~ in(X2,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(X1,esk2_0)
| in(esk1_0,X1)
| in(X1,esk1_0)
| X1 = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_16]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( ~ in(X1,esk8_1(esk1_0))
| in(X1,esk2_0)
| epsilon_transitive(esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_33,lemma,
( ~ in(X1,X2)
| ~ in(X2,esk8_1(X1))
| epsilon_transitive(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
fof(c_0_34,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_35,negated_conjecture,
( ~ in(X1,esk8_1(esk1_0))
| in(X1,esk1_0)
| epsilon_transitive(esk1_0)
| X1 = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,plain,
( subset(X1,X2)
| in(esk9_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_37,plain,
! [X15,X16] :
( ~ in(X16,X15)
| ~ in(X15,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
fof(c_0_38,plain,
! [X10] :
( ordinal(X10)
| ~ epsilon_connected(X10)
| ~ epsilon_transitive(X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])])]) ).
cnf(c_0_39,plain,
( ~ in(esk9_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,negated_conjecture,
( in(esk9_2(esk8_1(esk1_0),X1),esk1_0)
| epsilon_transitive(esk1_0)
| subset(esk8_1(esk1_0),X1)
| esk9_2(esk8_1(esk1_0),X1) = esk1_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( ~ subset(esk8_1(X1),X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,plain,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( ~ in(X2,esk1_0)
| ~ in(X1,esk2_0)
| in(X2,X1)
| in(X1,X2)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_28])]) ).
cnf(c_0_44,negated_conjecture,
~ ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,plain,
( ~ epsilon_connected(X1)
| ~ epsilon_transitive(X1)
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( epsilon_transitive(esk1_0)
| esk9_2(esk8_1(esk1_0),esk1_0) = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_47,plain,
( ~ in(X1,esk8_1(X1))
| epsilon_transitive(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_48,negated_conjecture,
( ~ in(X1,esk1_0)
| ~ in(X2,esk1_0)
| in(X1,X2)
| in(X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_49,plain,
( epsilon_connected(X1)
| in(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_50,negated_conjecture,
( ~ epsilon_transitive(esk1_0)
| ~ epsilon_connected(esk1_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
epsilon_transitive(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_47]),c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( ~ in(X1,esk1_0)
| in(esk7_1(esk1_0),X1)
| in(X1,esk7_1(esk1_0))
| epsilon_connected(esk1_0)
| X1 = esk7_1(esk1_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( epsilon_connected(X1)
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_54,negated_conjecture,
~ epsilon_connected(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_55,plain,
( ~ in(esk7_1(X1),esk6_1(X1))
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_56,negated_conjecture,
( in(esk6_1(esk1_0),esk7_1(esk1_0))
| in(esk7_1(esk1_0),esk6_1(esk1_0))
| esk7_1(esk1_0) = esk6_1(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_57,plain,
( ~ in(esk6_1(X1),esk7_1(X1))
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_58,negated_conjecture,
( in(esk6_1(esk1_0),esk7_1(esk1_0))
| esk7_1(esk1_0) = esk6_1(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_54]) ).
cnf(c_0_59,plain,
( esk6_1(X1) != esk7_1(X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_60,negated_conjecture,
esk7_1(esk1_0) = esk6_1(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_54]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU232+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n015.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 06:04:37 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/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
% 244.14/36.24 % Version: 3.5.1
% 244.14/36.24 % Preprocessing class: FSLSSMSSSSSNFFN.
% 244.14/36.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 244.14/36.24 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 244.14/36.24 % Starting new_bool_3 with 300s (1) cores
% 244.14/36.24 % Starting new_bool_1 with 300s (1) cores
% 244.14/36.24 % Starting sh5l with 300s (1) cores
% 244.14/36.24 % new_bool_1 with pid 720770 completed with status 0
% 244.14/36.24 % Result found by new_bool_1
% 244.14/36.24 % Preprocessing class: FSLSSMSSSSSNFFN.
% 244.14/36.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 244.14/36.24 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 244.14/36.24 % Starting new_bool_3 with 300s (1) cores
% 244.14/36.24 % Starting new_bool_1 with 300s (1) cores
% 244.14/36.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 244.14/36.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 244.14/36.24 % Search class: FGHSF-FFMS21-SFFFFFNN
% 244.14/36.24 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 244.14/36.24 % Starting SubtermCWHack with 31s (1) cores
% 244.14/36.24 % SubtermCWHack with pid 720773 completed with status 8
% 244.14/36.24 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 244.14/36.24 % G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 721193 completed with status 0
% 244.14/36.24 % Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 244.14/36.24 % Preprocessing class: FSLSSMSSSSSNFFN.
% 244.14/36.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 244.14/36.24 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 244.14/36.24 % Starting new_bool_3 with 300s (1) cores
% 244.14/36.24 % Starting new_bool_1 with 300s (1) cores
% 244.14/36.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 244.14/36.24 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 244.14/36.24 % Search class: FGHSF-FFMS21-SFFFFFNN
% 244.14/36.24 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 244.14/36.24 % Starting SubtermCWHack with 31s (1) cores
% 244.14/36.24 % SubtermCWHack with pid 720773 completed with status 8
% 244.14/36.24 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 244.14/36.24 % Preprocessing time : 0.003 s
% 244.14/36.24 % Presaturation interreduction done
% 244.14/36.24
% 244.14/36.24 % Proof found!
% 244.14/36.24 % SZS status Theorem
% 244.14/36.24 % SZS output start CNFRefutation
% See solution above
% 244.14/36.24 % Parsed axioms : 264
% 244.14/36.24 % Removed by relevancy pruning/SinE : 244
% 244.14/36.24 % Initial clauses : 42
% 244.14/36.24 % Removed in clause preprocessing : 0
% 244.14/36.24 % Initial clauses in saturation : 42
% 244.14/36.24 % Processed clauses : 4679
% 244.14/36.24 % ...of these trivial : 97
% 244.14/36.24 % ...subsumed : 2237
% 244.14/36.24 % ...remaining for further processing : 2345
% 244.14/36.24 % Other redundant clauses eliminated : 3
% 244.14/36.24 % Clauses deleted for lack of memory : 0
% 244.14/36.24 % Backward-subsumed : 400
% 244.14/36.24 % Backward-rewritten : 702
% 244.14/36.24 % Generated clauses : 88501
% 244.14/36.24 % ...of the previous two non-redundant : 83425
% 244.14/36.24 % ...aggressively subsumed : 0
% 244.14/36.24 % Contextual simplify-reflections : 38
% 244.14/36.24 % Paramodulations : 88397
% 244.14/36.24 % Factorizations : 34
% 244.14/36.24 % NegExts : 0
% 244.14/36.24 % Equation resolutions : 3
% 244.14/36.24 % Disequality decompositions : 0
% 244.14/36.24 % Total rewrite steps : 19937
% 244.14/36.24 % ...of those cached : 19854
% 244.14/36.24 % Propositional unsat checks : 0
% 244.14/36.24 % Propositional check models : 0
% 244.14/36.24 % Propositional check unsatisfiable : 0
% 244.14/36.24 % Propositional clauses : 0
% 244.14/36.24 % Propositional clauses after purity: 0
% 244.14/36.24 % Propositional unsat core size : 0
% 244.14/36.24 % Propositional preprocessing time : 0.000
% 244.14/36.24 % Propositional encoding time : 0.000
% 244.14/36.24 % Propositional solver time : 0.000
% 244.14/36.24 % Success case prop preproc time : 0.000
% 244.14/36.24 % Success case prop encoding time : 0.000
% 244.14/36.24 % Success case prop solver time : 0.000
% 244.14/36.24 % Current number of processed clauses : 1137
% 244.14/36.24 % Positive orientable unit clauses : 37
% 244.14/36.24 % Positive unorientable unit clauses: 0
% 244.14/36.24 % Negative unit clauses : 13
% 244.14/36.24 % Non-unit-clauses : 1087
% 244.14/36.24 % Current number of unprocessed clauses: 76731
% 244.14/36.24 % ...number of literals in the above : 392555
% 244.14/36.24 % Current number of archived formulas : 0
% 244.14/36.24 % Current number of archived clauses : 1205
% 244.14/36.24 % Clause-clause subsumption calls (NU) : 330558
% 244.14/36.24 % Rec. Clause-clause subsumption calls : 107243
% 244.14/36.24 % Non-unit clause-clause subsumptions : 1957
% 244.14/36.24 % Unit Clause-clause subsumption calls : 15547
% 244.14/36.24 % Rewrite failures with RHS unbound : 0
% 244.14/36.24 % BW rewrite match attempts : 238
% 244.14/36.24 % BW rewrite match successes : 26
% 244.14/36.24 % Condensation attempts : 0
% 244.14/36.24 % Condensation successes : 0
% 244.14/36.24 % Termbank termtop insertions : 1834676
% 244.14/36.24 % Search garbage collected termcells : 2148
% 244.14/36.24
% 244.14/36.24 % -------------------------------------------------
% 244.14/36.24 % User time : 33.680 s
% 244.14/36.24 % System time : 1.099 s
% 244.14/36.24 % Total time : 34.780 s
% 244.14/36.24 % Maximum resident set size: 3904 pages
% 244.14/36.24
% 244.14/36.24 % -------------------------------------------------
% 244.14/36.24 % User time : 33.689 s
% 244.14/36.24 % System time : 1.106 s
% 244.14/36.24 % Total time : 34.795 s
% 244.14/36.24 % Maximum resident set size: 4864 pages
% 244.14/36.24 % E exiting
%------------------------------------------------------------------------------