%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET097+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:13:34 PM UTC 2026
% Result : Theorem 43.77s 6.94s
% Output : CNFRefutation 43.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 18 unt; 0 def)
% Number of atoms : 172 ( 43 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 175 ( 68 ~; 72 |; 26 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 116 ( 14 sgn 45 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(number_of_elements_in_class,conjecture,
! [X1] :
( ? [X4] :
( ? [X7] : member(X7,intersection(complement(singleton(X4)),X1))
& member(X4,X1) )
| ? [X2] : singleton(X2) = X1
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',number_of_elements_in_class) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X2)
& member(X5,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( ~ member(X5,X1)
& member(X5,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',complement) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( disjoint(X3,X1)
& member(X3,X1)
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( ( X3 = X2
| X3 = X1 )
& member(X3,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(null_class_defn,axiom,
! [X1] : ~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X2,X1)
& subclass(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ? [X4] :
( ? [X7] : member(X7,intersection(complement(singleton(X4)),X1))
& member(X4,X1) )
| ? [X2] : singleton(X2) = X1
| X1 = null_class ),
inference(assume_negation,[status(cth)],[number_of_elements_in_class]) ).
fof(c_0_11,negated_conjecture,
! [X108,X109,X110] :
( ( ~ member(X110,intersection(complement(singleton(X109)),esk8_0))
| ~ member(X109,esk8_0) )
& singleton(X108) != esk8_0
& esk8_0 != null_class ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_12,plain,
! [X24] : singleton(X24) = unordered_pair(X24,X24),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(X2,intersection(complement(singleton(X1)),esk8_0))
| ~ member(X1,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X38,X39,X40] :
( ( member(X40,intersection(X38,X39))
| ~ member(X40,X39)
| ~ member(X40,X38) )
& ( ~ member(X40,intersection(X38,X39))
| member(X40,X39) )
& ( ~ member(X40,intersection(X38,X39))
| member(X40,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
fof(c_0_16,plain,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( ~ member(X5,X1)
& member(X5,universal_class) ) ),
inference(fof_simplification,[status(thm)],[complement]) ).
fof(c_0_17,plain,
! [X10,X11,X12,X13,X14] :
( ( subclass(X13,X14)
| ~ member(esk1_2(X13,X14),X14) )
& ( subclass(X13,X14)
| member(esk1_2(X13,X14),X13) )
& ( member(X12,X11)
| ~ member(X12,X10)
| ~ subclass(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)],[subclass_defn])])])])])])]) ).
fof(c_0_18,plain,
! [X16] : subclass(X16,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X2,intersection(complement(unordered_pair(X1,X1)),esk8_0))
| ~ member(X1,esk8_0) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X41,X42] :
( ( member(X42,complement(X41))
| member(X42,X41)
| ~ member(X42,universal_class) )
& ( ~ member(X42,complement(X41))
| ~ member(X42,X41) )
& ( ~ member(X42,complement(X41))
| member(X42,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_22,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X1] :
( X1 != null_class
=> ? [X3] :
( disjoint(X3,X1)
& member(X3,X1)
& member(X3,universal_class) ) ),
inference(fof_simplification,[status(thm)],[regularity]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ member(X2,esk8_0)
| ~ member(X1,complement(unordered_pair(X2,X2))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ member(X1,universal_class)
| member(X1,complement(X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X101] :
( ( X101 = null_class
| disjoint(esk6_1(X101),X101) )
& ( X101 = null_class
| member(esk6_1(X101),X101) )
& ( X101 = null_class
| member(esk6_1(X101),universal_class) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_29,plain,
! [X19,X20,X21] :
( ( member(X19,unordered_pair(X20,X21))
| ~ member(X19,universal_class)
| X19 != X21 )
& ( member(X19,unordered_pair(X20,X21))
| ~ member(X19,universal_class)
| X19 != X20 )
& ( ~ member(X19,unordered_pair(X20,X21))
| X19 = X21
| X19 = X20 )
& ( ~ member(X19,unordered_pair(X20,X21))
| member(X19,universal_class) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ member(X2,esk8_0)
| member(X1,unordered_pair(X2,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,esk8_0)
| member(X1,unordered_pair(esk6_1(esk8_0),esk6_1(esk8_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(X1,esk8_0)
| X1 = esk6_1(esk8_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( member(esk6_1(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
fof(c_0_38,plain,
! [X1] : ~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[null_class_defn]) ).
cnf(c_0_39,negated_conjecture,
( intersection(X1,esk8_0) = null_class
| esk6_1(intersection(X1,esk8_0)) = esk6_1(esk8_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_40,plain,
! [X46] : ~ member(X46,null_class),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( member(esk6_1(esk8_0),esk8_0)
| intersection(X1,esk8_0) = null_class ),
inference(spm,[status(thm)],[c_0_37,c_0_39]) ).
cnf(c_0_42,plain,
~ member(X1,null_class),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ member(X1,X2)
| ~ member(X1,esk8_0)
| member(esk6_1(esk8_0),esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_41]),c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(esk6_1(esk8_0),X1)
| member(esk6_1(esk8_0),esk8_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_32]) ).
cnf(c_0_45,plain,
( X1 = null_class
| member(esk6_1(X1),universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_46,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_47,plain,
( ~ member(X1,universal_class)
| X1 != X2
| member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_48,negated_conjecture,
member(esk6_1(esk8_0),esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_32]) ).
cnf(c_0_49,plain,
( ~ member(esk1_2(X1,X2),X2)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_50,negated_conjecture,
( subclass(esk8_0,X1)
| esk1_2(esk8_0,X1) = esk6_1(esk8_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_51,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
member(esk6_1(esk8_0),universal_class),
inference(spm,[status(thm)],[c_0_27,c_0_48]) ).
fof(c_0_53,plain,
! [X17,X18] :
( ( X17 = X18
| ~ subclass(X18,X17)
| ~ subclass(X17,X18) )
& ( X17 != X18
| subclass(X18,X17) )
& ( X17 != X18
| subclass(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(esk6_1(esk8_0),X1)
| subclass(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
member(esk6_1(esk8_0),unordered_pair(esk6_1(esk8_0),X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( subclass(unordered_pair(X1,X2),X3)
| esk1_2(unordered_pair(X1,X2),X3) = X2
| esk1_2(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_33,c_0_46]) ).
cnf(c_0_57,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,negated_conjecture,
subclass(esk8_0,unordered_pair(esk6_1(esk8_0),X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( subclass(unordered_pair(X1,X1),X2)
| esk1_2(unordered_pair(X1,X1),X2) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_56])]) ).
cnf(c_0_60,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_61,negated_conjecture,
( ~ subclass(unordered_pair(esk6_1(esk8_0),X1),esk8_0)
| unordered_pair(esk6_1(esk8_0),X1) = esk8_0 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_60,c_0_14]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_48])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET097+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 04:51:55 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.44 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
% 43.77/6.94 % Version: 3.5.1
% 43.77/6.94 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.77/6.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.77/6.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.77/6.94 % Starting new_bool_3 with 300s (1) cores
% 43.77/6.94 % Starting new_bool_1 with 300s (1) cores
% 43.77/6.94 % Starting sh5l with 300s (1) cores
% 43.77/6.94 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1007856 completed with status 0
% 43.77/6.94 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 43.77/6.94 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.77/6.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.77/6.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.77/6.94 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 43.77/6.94 % No SInE strategy applied
% 43.77/6.94 % Search class: FGHSM-FFMS21-DFFFFFNN
% 43.77/6.94 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 43.77/6.94 % Starting SubtermCWHack with 136s (1) cores
% 43.77/6.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 43.77/6.94 % Starting sh3 with 271s (1) cores
% 43.77/6.94 % Starting ho_unfolding_3 with 271s (1) cores
% 43.77/6.94 % Starting new_ho_10_cnf2 with 271s (1) cores
% 43.77/6.94 % sh3 with pid 1007864 completed with status 0
% 43.77/6.94 % Result found by sh3
% 43.77/6.94 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.77/6.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.77/6.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.77/6.94 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 43.77/6.94 % No SInE strategy applied
% 43.77/6.94 % Search class: FGHSM-FFMS21-DFFFFFNN
% 43.77/6.94 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 43.77/6.94 % Starting SubtermCWHack with 136s (1) cores
% 43.77/6.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 43.77/6.94 % Starting sh3 with 271s (1) cores
% 43.77/6.94 % Preprocessing time : 0.004 s
% 43.77/6.94 % Presaturation interreduction done
% 43.77/6.94
% 43.77/6.94 % Proof found!
% 43.77/6.94 % SZS status Theorem
% 43.77/6.94 % SZS output start CNFRefutation
% See solution above
% 43.77/6.94 % Parsed axioms : 44
% 43.77/6.94 % Removed by relevancy pruning/SinE : 0
% 43.77/6.94 % Initial clauses : 92
% 43.77/6.94 % Removed in clause preprocessing : 8
% 43.77/6.94 % Initial clauses in saturation : 84
% 43.77/6.94 % Processed clauses : 19227
% 43.77/6.94 % ...of these trivial : 194
% 43.77/6.94 % ...subsumed : 16206
% 43.77/6.94 % ...remaining for further processing : 2827
% 43.77/6.94 % Other redundant clauses eliminated : 60
% 43.77/6.94 % Clauses deleted for lack of memory : 0
% 43.77/6.94 % Backward-subsumed : 168
% 43.77/6.94 % Backward-rewritten : 292
% 43.77/6.94 % Generated clauses : 220944
% 43.77/6.94 % ...of the previous two non-redundant : 184891
% 43.77/6.94 % ...aggressively subsumed : 0
% 43.77/6.94 % Contextual simplify-reflections : 54
% 43.77/6.94 % Paramodulations : 220678
% 43.77/6.94 % Factorizations : 206
% 43.77/6.94 % NegExts : 0
% 43.77/6.94 % Equation resolutions : 60
% 43.77/6.94 % Disequality decompositions : 0
% 43.77/6.94 % Total rewrite steps : 125907
% 43.77/6.94 % ...of those cached : 123915
% 43.77/6.94 % Propositional unsat checks : 0
% 43.77/6.94 % Propositional check models : 0
% 43.77/6.94 % Propositional check unsatisfiable : 0
% 43.77/6.94 % Propositional clauses : 0
% 43.77/6.94 % Propositional clauses after purity: 0
% 43.77/6.94 % Propositional unsat core size : 0
% 43.77/6.94 % Propositional preprocessing time : 0.000
% 43.77/6.94 % Propositional encoding time : 0.000
% 43.77/6.94 % Propositional solver time : 0.000
% 43.77/6.94 % Success case prop preproc time : 0.000
% 43.77/6.94 % Success case prop encoding time : 0.000
% 43.77/6.94 % Success case prop solver time : 0.000
% 43.77/6.94 % Current number of processed clauses : 2278
% 43.77/6.94 % Positive orientable unit clauses : 186
% 43.77/6.94 % Positive unorientable unit clauses: 0
% 43.77/6.94 % Negative unit clauses : 22
% 43.77/6.94 % Non-unit-clauses : 2070
% 43.77/6.94 % Current number of unprocessed clauses: 164818
% 43.77/6.94 % ...number of literals in the above : 562689
% 43.77/6.94 % Current number of archived formulas : 0
% 43.77/6.94 % Current number of archived clauses : 551
% 43.77/6.94 % Clause-clause subsumption calls (NU) : 849961
% 43.77/6.94 % Rec. Clause-clause subsumption calls : 572084
% 43.77/6.94 % Non-unit clause-clause subsumptions : 5293
% 43.77/6.94 % Unit Clause-clause subsumption calls : 37275
% 43.77/6.94 % Rewrite failures with RHS unbound : 0
% 43.77/6.94 % BW rewrite match attempts : 326
% 43.77/6.94 % BW rewrite match successes : 60
% 43.77/6.94 % Condensation attempts : 0
% 43.77/6.94 % Condensation successes : 0
% 43.77/6.94 % Termbank termtop insertions : 4135631
% 43.77/6.94 % Search garbage collected termcells : 1011
% 43.77/6.94
% 43.77/6.94 % -------------------------------------------------
% 43.77/6.94 % User time : 5.765 s
% 43.77/6.94 % System time : 0.200 s
% 43.77/6.94 % Total time : 5.964 s
% 43.77/6.94 % Maximum resident set size: 3640 pages
% 43.77/6.94
% 43.77/6.94 % -------------------------------------------------
% 43.77/6.94 % User time : 30.086 s
% 43.77/6.94 % System time : 1.009 s
% 43.77/6.94 % Total time : 31.095 s
% 43.77/6.94 % Maximum resident set size: 4608 pages
% 43.77/6.94 % E exiting
%------------------------------------------------------------------------------