%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU232+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:23 PM UTC 2026
% Result : Theorem 211.63s 31.53s
% Output : CNFRefutation 211.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 8 unt; 0 def)
% Number of atoms : 176 ( 10 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 182 ( 66 ~; 78 |; 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 : 83 ( 0 sgn 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_ordinal1,conjecture,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_connected(X1)
& epsilon_transitive(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',d3_ordinal1) ).
fof(t3_ordinal1,axiom,
! [X1,X2,X3] :
~ ( in(X3,X1)
& in(X2,X3)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_connected(X1)
& epsilon_transitive(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox2/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,
! [X28,X29,X30] :
( ( epsilon_transitive(X30)
| ~ subset(esk7_1(X30),X30) )
& ( epsilon_transitive(X30)
| in(esk7_1(X30),X30) )
& ( subset(X29,X28)
| ~ in(X29,X28)
| ~ epsilon_transitive(X28) ) ),
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])])])])])])]) ).
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])])])]) ).
cnf(c_0_11,plain,
( ~ in(X2,X1)
| ~ epsilon_transitive(X1)
| subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,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])])])]) ).
fof(c_0_14,plain,
! [X39,X40,X41,X42,X43] :
( ( subset(X42,X43)
| ~ in(esk12_2(X42,X43),X43) )
& ( subset(X42,X43)
| in(esk12_2(X42,X43),X42) )
& ( in(X41,X40)
| ~ in(X41,X39)
| ~ subset(X39,X40) ) ),
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,negated_conjecture,
( ~ epsilon_transitive(esk2_0)
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ ordinal(X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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])]) ).
cnf(c_0_20,negated_conjecture,
( ~ in(X1,esk1_0)
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( epsilon_transitive(X1)
| in(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( in(esk7_1(esk1_0),esk2_0)
| epsilon_transitive(esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_23,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_24,negated_conjecture,
( ~ epsilon_transitive(esk2_0)
| epsilon_transitive(esk1_0)
| subset(esk7_1(esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
fof(c_0_25,plain,
! [X13,X14,X15] :
( ~ in(X15,X13)
| ~ in(X14,X15)
| ~ in(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_ordinal1])])]) ).
fof(c_0_26,plain,
! [X22,X23,X24,X25] :
( ( epsilon_connected(X25)
| ~ in(esk6_1(X25),esk5_1(X25)) )
& ( epsilon_connected(X25)
| esk5_1(X25) != esk6_1(X25) )
& ( epsilon_connected(X25)
| ~ in(esk5_1(X25),esk6_1(X25)) )
& ( epsilon_connected(X25)
| in(esk6_1(X25),X25) )
& ( epsilon_connected(X25)
| in(esk5_1(X25),X25) )
& ( in(X24,X23)
| X23 = X24
| in(X23,X24)
| ~ in(X24,X22)
| ~ in(X23,X22)
| ~ epsilon_connected(X22) ) ),
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_23])])])])])])]) ).
cnf(c_0_27,plain,
( ~ ordinal(X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
( epsilon_transitive(esk1_0)
| subset(esk7_1(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_17])]) ).
cnf(c_0_29,plain,
( ~ in(X3,X1)
| ~ in(X2,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( subset(X1,X2)
| in(esk12_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_31,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_32,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_26]) ).
cnf(c_0_33,negated_conjecture,
epsilon_connected(esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( ~ in(X1,esk7_1(esk1_0))
| in(X1,esk2_0)
| epsilon_transitive(esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_35,plain,
( ~ in(X1,X3)
| ~ in(X3,esk12_2(X1,X2))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_36,plain,
! [X11,X12] :
( ~ in(X12,X11)
| ~ in(X11,X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])]) ).
cnf(c_0_37,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_32,c_0_12]),c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
( in(esk12_2(esk7_1(esk1_0),X1),esk2_0)
| epsilon_transitive(esk1_0)
| subset(esk7_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_39,plain,
( ~ in(X1,esk12_2(esk7_1(X1),X2))
| epsilon_transitive(X1)
| subset(esk7_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_40,plain,
( epsilon_connected(X1)
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41,plain,
( ~ in(X2,X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( ~ in(esk12_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,negated_conjecture,
( in(esk12_2(esk7_1(esk1_0),X1),esk1_0)
| epsilon_transitive(esk1_0)
| subset(esk7_1(esk1_0),X1)
| esk12_2(esk7_1(esk1_0),X1) = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
( ~ subset(esk7_1(X1),X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_45,negated_conjecture,
( in(esk6_1(esk1_0),esk2_0)
| epsilon_connected(esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_46,plain,
( epsilon_connected(X1)
| in(esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_47,plain,
! [X8] :
( ordinal(X8)
| ~ epsilon_connected(X8)
| ~ epsilon_transitive(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])])]) ).
cnf(c_0_48,plain,
( ~ in(X1,esk12_2(X1,X2))
| subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( epsilon_transitive(esk1_0)
| esk12_2(esk7_1(esk1_0),esk1_0) = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( ~ in(X1,esk2_0)
| in(esk6_1(esk1_0),X1)
| in(X1,esk6_1(esk1_0))
| epsilon_connected(esk1_0)
| X1 = esk6_1(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_33])]) ).
cnf(c_0_51,negated_conjecture,
( in(esk5_1(esk1_0),esk2_0)
| epsilon_connected(esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_46]) ).
cnf(c_0_52,plain,
( ~ in(esk6_1(X1),esk5_1(X1))
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_53,plain,
( ~ in(esk5_1(X1),esk6_1(X1))
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_54,plain,
( esk5_1(X1) != esk6_1(X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_55,plain,
( ~ epsilon_connected(X1)
| ~ epsilon_transitive(X1)
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
epsilon_transitive(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_21]),c_0_44]) ).
cnf(c_0_57,negated_conjecture,
epsilon_connected(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
~ ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU232+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n026.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 06:04:09 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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
% 211.63/31.53 % Version: 3.5.1
% 211.63/31.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 211.63/31.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 211.63/31.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 211.63/31.53 % Starting new_bool_3 with 300s (1) cores
% 211.63/31.53 % Starting new_bool_1 with 300s (1) cores
% 211.63/31.53 % Starting sh5l with 300s (1) cores
% 211.63/31.53 % new_bool_1 with pid 1524541 completed with status 0
% 211.63/31.53 % Result found by new_bool_1
% 211.63/31.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 211.63/31.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 211.63/31.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 211.63/31.53 % Starting new_bool_3 with 300s (1) cores
% 211.63/31.53 % Starting new_bool_1 with 300s (1) cores
% 211.63/31.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 211.63/31.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 211.63/31.53 % Search class: FGHSF-FFMM21-SFFFFFNN
% 211.63/31.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 211.63/31.53 % Starting SubtermCWHack with 28s (1) cores
% 211.63/31.53 % SubtermCWHack with pid 1524549 completed with status 8
% 211.63/31.53 % Starting new_bool_1 with 31s (1) cores
% 211.63/31.53 % new_bool_1 with pid 1524554 completed with status 0
% 211.63/31.53 % Result found by new_bool_1
% 211.63/31.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 211.63/31.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 211.63/31.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 211.63/31.53 % Starting new_bool_3 with 300s (1) cores
% 211.63/31.53 % Starting new_bool_1 with 300s (1) cores
% 211.63/31.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 211.63/31.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 211.63/31.53 % Search class: FGHSF-FFMM21-SFFFFFNN
% 211.63/31.53 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 211.63/31.53 % Starting SubtermCWHack with 28s (1) cores
% 211.63/31.53 % SubtermCWHack with pid 1524549 completed with status 8
% 211.63/31.53 % Starting new_bool_1 with 31s (1) cores
% 211.63/31.53 % Preprocessing time : 0.003 s
% 211.63/31.53 % Presaturation interreduction done
% 211.63/31.53
% 211.63/31.53 % Proof found!
% 211.63/31.53 % SZS status Theorem
% 211.63/31.53 % SZS output start CNFRefutation
% See solution above
% 211.63/31.53 % Parsed axioms : 41
% 211.63/31.53 % Removed by relevancy pruning/SinE : 21
% 211.63/31.53 % Initial clauses : 40
% 211.63/31.53 % Removed in clause preprocessing : 0
% 211.63/31.53 % Initial clauses in saturation : 40
% 211.63/31.53 % Processed clauses : 8482
% 211.63/31.53 % ...of these trivial : 53
% 211.63/31.53 % ...subsumed : 5523
% 211.63/31.53 % ...remaining for further processing : 2906
% 211.63/31.53 % Other redundant clauses eliminated : 2
% 211.63/31.53 % Clauses deleted for lack of memory : 0
% 211.63/31.53 % Backward-subsumed : 530
% 211.63/31.53 % Backward-rewritten : 1100
% 211.63/31.53 % Generated clauses : 41208
% 211.63/31.53 % ...of the previous two non-redundant : 37724
% 211.63/31.53 % ...aggressively subsumed : 0
% 211.63/31.53 % Contextual simplify-reflections : 113
% 211.63/31.53 % Paramodulations : 41204
% 211.63/31.53 % Factorizations : 2
% 211.63/31.53 % NegExts : 0
% 211.63/31.53 % Equation resolutions : 2
% 211.63/31.53 % Disequality decompositions : 0
% 211.63/31.53 % Total rewrite steps : 6861
% 211.63/31.53 % ...of those cached : 6813
% 211.63/31.53 % Propositional unsat checks : 0
% 211.63/31.53 % Propositional check models : 0
% 211.63/31.53 % Propositional check unsatisfiable : 0
% 211.63/31.53 % Propositional clauses : 0
% 211.63/31.53 % Propositional clauses after purity: 0
% 211.63/31.53 % Propositional unsat core size : 0
% 211.63/31.53 % Propositional preprocessing time : 0.000
% 211.63/31.53 % Propositional encoding time : 0.000
% 211.63/31.53 % Propositional solver time : 0.000
% 211.63/31.53 % Success case prop preproc time : 0.000
% 211.63/31.53 % Success case prop encoding time : 0.000
% 211.63/31.53 % Success case prop solver time : 0.000
% 211.63/31.53 % Current number of processed clauses : 1239
% 211.63/31.53 % Positive orientable unit clauses : 29
% 211.63/31.53 % Positive unorientable unit clauses: 0
% 211.63/31.53 % Negative unit clauses : 9
% 211.63/31.53 % Non-unit-clauses : 1201
% 211.63/31.53 % Current number of unprocessed clauses: 25813
% 211.63/31.53 % ...number of literals in the above : 126205
% 211.63/31.53 % Current number of archived formulas : 0
% 211.63/31.53 % Current number of archived clauses : 1667
% 211.63/31.53 % Clause-clause subsumption calls (NU) : 478992
% 211.63/31.53 % Rec. Clause-clause subsumption calls : 187275
% 211.63/31.53 % Non-unit clause-clause subsumptions : 5401
% 211.63/31.53 % Unit Clause-clause subsumption calls : 851
% 211.63/31.53 % Rewrite failures with RHS unbound : 0
% 211.63/31.53 % BW rewrite match attempts : 17
% 211.63/31.53 % BW rewrite match successes : 12
% 211.63/31.53 % Condensation attempts : 0
% 211.63/31.53 % Condensation successes : 0
% 211.63/31.53 % Termbank termtop insertions : 860966
% 211.63/31.53 % Search garbage collected termcells : 604
% 211.63/31.53
% 211.63/31.53 % -------------------------------------------------
% 211.63/31.53 % User time : 29.441 s
% 211.63/31.53 % System time : 0.851 s
% 211.63/31.53 % Total time : 30.292 s
% 211.63/31.53 % Maximum resident set size: 3660 pages
% 211.63/31.53
% 211.63/31.53 % -------------------------------------------------
% 211.63/31.53 % User time : 29.445 s
% 211.63/31.53 % System time : 0.859 s
% 211.63/31.53 % Total time : 30.304 s
% 211.63/31.53 % Maximum resident set size: 4608 pages
% 211.63/31.53 % E exiting
%------------------------------------------------------------------------------