%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU174+1 : 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 : n006.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:07 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 20 unt; 0 def)
% Number of atoms : 159 ( 26 equ)
% Maximal formula atoms : 26 ( 2 avg)
% Number of connectives : 166 ( 71 ~; 63 |; 17 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 97 ( 12 sgn 47 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( empty(X2)
& element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( empty(X3)
& element(X2,powerset(X3))
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(t46_setfam_1,conjecture,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( complements_of_subsets(X1,X2) = empty_set
& X2 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_setfam_1) ).
fof(rc1_subset_1,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( ~ empty(X2)
& element(X2,powerset(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_subset_1) ).
fof(d8_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ! [X3] :
( element(X3,powerset(powerset(X1)))
=> ( X3 = complements_of_subsets(X1,X2)
<=> ! [X4] :
( element(X4,powerset(X1))
=> ( in(X4,X3)
<=> in(subset_complement(X1,X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_setfam_1) ).
fof(dt_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(complements_of_subsets(X1,X2),powerset(powerset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(involutiveness_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(c_0_12,plain,
! [X7] :
( X7 = empty_set
| ~ empty(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_13,plain,
! [X21] :
( empty(esk6_1(X21))
& element(esk6_1(X21),powerset(X21)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
fof(c_0_14,plain,
! [X24,X25,X26] :
( element(X24,X26)
| ~ element(X25,powerset(X26))
| ~ in(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_15,plain,
! [X17] : element(esk4_1(X17),X17),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_16,plain,
! [X32,X33] :
( in(X32,X33)
| empty(X33)
| ~ element(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_17,plain,
! [X27,X28,X29] :
( ~ empty(X29)
| ~ element(X28,powerset(X29))
| ~ in(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_18,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
empty(esk6_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
element(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ empty(X3)
| ~ element(X2,powerset(X3))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
element(esk6_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
esk6_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ in(X1,esk4_1(powerset(X2)))
| element(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( in(esk4_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,plain,
( ~ in(X2,esk4_1(powerset(X1)))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_29,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( element(esk4_1(esk4_1(powerset(X1))),X1)
| empty(esk4_1(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ empty(X1)
| empty(esk4_1(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_32,plain,
( ~ in(X2,empty_set)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_33,plain,
( in(esk4_1(esk4_1(powerset(X1))),X1)
| empty(esk4_1(powerset(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( ~ empty(X1)
| empty(esk4_1(powerset(empty_set))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
fof(c_0_36,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( complements_of_subsets(X1,X2) = empty_set
& X2 != empty_set ) ),
inference(assume_negation,[status(cth)],[t46_setfam_1]) ).
fof(c_0_37,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( ~ empty(X2)
& element(X2,powerset(X1)) ) ),
inference(fof_simplification,[status(thm)],[rc1_subset_1]) ).
cnf(c_0_38,plain,
empty(esk4_1(powerset(empty_set))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_39,plain,
! [X8,X9,X10,X11] :
( ( ~ element(X9,powerset(powerset(X8)))
| ~ element(X10,powerset(powerset(X8)))
| X10 = complements_of_subsets(X8,X9)
| in(subset_complement(X8,esk3_3(X8,X9,X10)),X9)
| in(esk3_3(X8,X9,X10),X10) )
& ( ~ element(X9,powerset(powerset(X8)))
| ~ element(X10,powerset(powerset(X8)))
| X10 = complements_of_subsets(X8,X9)
| ~ in(subset_complement(X8,esk3_3(X8,X9,X10)),X9)
| ~ in(esk3_3(X8,X9,X10),X10) )
& ( ~ element(X9,powerset(powerset(X8)))
| ~ element(X10,powerset(powerset(X8)))
| X10 = complements_of_subsets(X8,X9)
| element(esk3_3(X8,X9,X10),powerset(X8)) )
& ( ~ element(X9,powerset(powerset(X8)))
| ~ element(X10,powerset(powerset(X8)))
| X10 != complements_of_subsets(X8,X9)
| ~ element(X11,powerset(X8))
| in(X11,X10)
| ~ in(subset_complement(X8,X11),X9) )
& ( ~ element(X9,powerset(powerset(X8)))
| ~ element(X10,powerset(powerset(X8)))
| X10 != complements_of_subsets(X8,X9)
| ~ element(X11,powerset(X8))
| in(subset_complement(X8,X11),X9)
| ~ in(X11,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_setfam_1])])])])])]) ).
fof(c_0_40,plain,
! [X13,X14] :
( element(complements_of_subsets(X13,X14),powerset(powerset(X13)))
| ~ element(X14,powerset(powerset(X13))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_setfam_1])])]) ).
fof(c_0_41,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( complements_of_subsets(X1,X2) = empty_set
& X2 != empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_36]) ).
fof(c_0_42,plain,
! [X19] :
( ( empty(X19)
| ~ empty(esk5_1(X19)) )
& ( empty(X19)
| element(esk5_1(X19),powerset(X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])]) ).
cnf(c_0_43,plain,
esk4_1(powerset(empty_set)) = empty_set,
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_44,plain,
( ~ element(X4,powerset(powerset(X3)))
| ~ element(X2,powerset(powerset(X3)))
| X2 != complements_of_subsets(X3,X4)
| ~ element(X1,powerset(X3))
| ~ in(X1,X2)
| in(subset_complement(X3,X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
( ~ element(X1,powerset(powerset(X2)))
| element(complements_of_subsets(X2,X1),powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_46,plain,
! [X15,X16] :
( complements_of_subsets(X15,complements_of_subsets(X15,X16)) = X16
| ~ element(X16,powerset(powerset(X15))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k7_setfam_1])])]) ).
fof(c_0_47,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
& esk2_0 != empty_set
& element(esk2_0,powerset(powerset(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
cnf(c_0_48,plain,
( empty(X1)
| element(esk5_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,plain,
~ in(X1,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_43]),c_0_35])]) ).
cnf(c_0_50,plain,
( ~ in(X2,complements_of_subsets(X1,X3))
| ~ element(X3,powerset(powerset(X1)))
| in(subset_complement(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_44,c_0_20])]),c_0_45]) ).
cnf(c_0_51,plain,
( ~ element(X1,powerset(powerset(X2)))
| complements_of_subsets(X2,complements_of_subsets(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,negated_conjecture,
complements_of_subsets(esk1_0,esk2_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
element(esk2_0,powerset(powerset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
( ~ in(X2,esk5_1(X1))
| element(X2,X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_48]) ).
cnf(c_0_55,plain,
( ~ empty(esk5_1(X1))
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_56,plain,
~ in(X1,complements_of_subsets(X2,empty_set)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_29])]) ).
cnf(c_0_57,negated_conjecture,
complements_of_subsets(esk1_0,empty_set) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_58,plain,
( element(esk4_1(esk5_1(X1)),X1)
| empty(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_27]),c_0_55]) ).
cnf(c_0_59,negated_conjecture,
~ in(X1,esk2_0),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
( in(esk4_1(esk5_1(X1)),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
empty(esk2_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU174+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 05:54:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % new_bool_1 with pid 2138629 completed with status 0
% 0.10/0.43 % Result found by new_bool_1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHSS-FFMS31-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 2138632 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHSS-FFMS31-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 27
% 0.10/0.43 % Removed by relevancy pruning/SinE : 6
% 0.10/0.43 % Initial clauses : 29
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 29
% 0.10/0.43 % Processed clauses : 289
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 145
% 0.10/0.43 % ...remaining for further processing : 144
% 0.10/0.43 % Other redundant clauses eliminated : 2
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 6
% 0.10/0.43 % Backward-rewritten : 44
% 0.10/0.43 % Generated clauses : 716
% 0.10/0.43 % ...of the previous two non-redundant : 588
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 7
% 0.10/0.43 % Paramodulations : 714
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 2
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 196
% 0.10/0.43 % ...of those cached : 167
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 92
% 0.10/0.43 % Positive orientable unit clauses : 12
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 6
% 0.10/0.43 % Non-unit-clauses : 74
% 0.10/0.43 % Current number of unprocessed clauses: 313
% 0.10/0.43 % ...number of literals in the above : 1167
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 50
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 1505
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 1154
% 0.10/0.43 % Non-unit clause-clause subsumptions : 114
% 0.10/0.43 % Unit Clause-clause subsumption calls : 143
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 7
% 0.10/0.43 % BW rewrite match successes : 5
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 10636
% 0.10/0.43 % Search garbage collected termcells : 426
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.014 s
% 0.10/0.43 % System time : 0.002 s
% 0.10/0.43 % Total time : 0.016 s
% 0.10/0.43 % Maximum resident set size: 3652 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.014 s
% 0.10/0.43 % System time : 0.008 s
% 0.10/0.43 % Total time : 0.022 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------