%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU108+1 : 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 : n005.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:23:49 PM UTC 2026
% Result : Theorem 2.31s 0.93s
% Output : CNFRefutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 18 unt; 0 def)
% Number of atoms : 133 ( 12 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 134 ( 57 ~; 55 |; 12 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 92 ( 1 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_finsub_1,conjecture,
! [X1] : preboolean(powerset(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_finsub_1) ).
fof(t10_finsub_1,axiom,
! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X3,X1)
& in(X2,X1) )
=> ( in(set_difference(X2,X3),X1)
& in(set_union2(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(dt_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> element(subset_union2(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k4_subset_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(commutativity_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> subset_union2(X1,X2,X3) = subset_union2(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k4_subset_1) ).
fof(redefinition_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> subset_union2(X1,X2,X3) = set_union2(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k4_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(dt_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> element(subset_difference(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_subset_1) ).
fof(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] : preboolean(powerset(X1)),
inference(assume_negation,[status(cth)],[t20_finsub_1]) ).
fof(c_0_12,negated_conjecture,
~ preboolean(powerset(esk13_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_13,plain,
! [X58,X59,X60,X61] :
( ( preboolean(X61)
| ~ in(set_difference(esk11_1(X61),esk12_1(X61)),X61)
| ~ in(set_union2(esk11_1(X61),esk12_1(X61)),X61) )
& ( preboolean(X61)
| in(esk12_1(X61),X61) )
& ( preboolean(X61)
| in(esk11_1(X61),X61) )
& ( ~ preboolean(X58)
| ~ in(X60,X58)
| ~ in(X59,X58)
| in(set_difference(X59,X60),X58) )
& ( ~ preboolean(X58)
| ~ in(X60,X58)
| ~ in(X59,X58)
| in(set_union2(X59,X60),X58) ) ),
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)],[t10_finsub_1])])])])])])]) ).
fof(c_0_14,plain,
! [X71,X72] :
( ( element(X71,powerset(X72))
| ~ subset(X71,X72) )
& ( subset(X71,X72)
| ~ element(X71,powerset(X72)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_15,plain,
! [X16,X17,X18] :
( element(subset_union2(X16,X17,X18),powerset(X16))
| ~ element(X18,powerset(X16))
| ~ element(X17,powerset(X16)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_subset_1])])]) ).
fof(c_0_16,plain,
! [X65,X66] :
( element(X65,X66)
| ~ in(X65,X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_17,negated_conjecture,
~ preboolean(powerset(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( preboolean(X1)
| in(esk11_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| element(subset_union2(X2,X1,X3),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
in(esk11_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X13,X14,X15] :
( subset_union2(X13,X14,X15) = subset_union2(X13,X15,X14)
| ~ element(X15,powerset(X13))
| ~ element(X14,powerset(X13)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commutativity_k4_subset_1])])]) ).
cnf(c_0_25,negated_conjecture,
in(esk12_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_26,plain,
( ~ element(X2,powerset(X1))
| ~ element(X3,powerset(X1))
| subset(subset_union2(X1,X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
element(esk11_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| subset_union2(X2,X1,X3) = subset_union2(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
element(esk12_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
fof(c_0_30,plain,
! [X51,X52,X53] :
( subset_union2(X51,X52,X53) = set_union2(X52,X53)
| ~ element(X53,powerset(X51))
| ~ element(X52,powerset(X51)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_subset_1])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ element(X1,powerset(esk13_0))
| subset(subset_union2(esk13_0,X1,esk11_1(powerset(esk13_0))),esk13_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ element(X1,powerset(esk13_0))
| subset_union2(esk13_0,X1,esk12_1(powerset(esk13_0))) = subset_union2(esk13_0,esk12_1(powerset(esk13_0)),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| subset_union2(X2,X1,X3) = set_union2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
subset(subset_union2(esk13_0,esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( ~ element(X1,powerset(esk13_0))
| subset_union2(esk13_0,X1,esk12_1(powerset(esk13_0))) = set_union2(X1,esk12_1(powerset(esk13_0))) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
fof(c_0_36,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_37,plain,
! [X68,X69] :
( in(X68,X69)
| empty(X69)
| ~ element(X68,X69) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_38,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,negated_conjecture,
subset(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27])]) ).
fof(c_0_40,plain,
! [X26] : ~ empty(powerset(X26)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_36])]) ).
fof(c_0_41,plain,
! [X19,X20,X21] :
( element(subset_difference(X19,X20,X21),powerset(X19))
| ~ element(X21,powerset(X19))
| ~ element(X20,powerset(X19)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_subset_1])])]) ).
fof(c_0_42,plain,
! [X54,X55,X56] :
( subset_difference(X54,X55,X56) = set_difference(X55,X56)
| ~ element(X56,powerset(X54))
| ~ element(X55,powerset(X54)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])])]) ).
cnf(c_0_43,plain,
( ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
| preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_44,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
element(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| element(subset_difference(X2,X1,X3),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| subset_difference(X2,X1,X3) = set_difference(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( ~ in(set_difference(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0))
| ~ in(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
in(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
( ~ element(X2,powerset(X1))
| ~ element(X3,powerset(X1))
| in(subset_difference(X1,X2,X3),powerset(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( ~ element(X1,powerset(esk13_0))
| subset_difference(esk13_0,X1,esk12_1(powerset(esk13_0))) = set_difference(X1,esk12_1(powerset(esk13_0))) ),
inference(spm,[status(thm)],[c_0_48,c_0_29]) ).
cnf(c_0_53,negated_conjecture,
~ in(set_difference(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
( ~ element(X1,powerset(esk13_0))
| in(set_difference(X1,esk12_1(powerset(esk13_0))),powerset(esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_29])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU108+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 % Computer : n005.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Mon Sep 21 05:50:47 UTC 2026
% 0.15/0.44 % CPUTime :
% 0.15/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 2.31/0.93 % Version: 3.5.1
% 2.31/0.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.31/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.31/0.93 % Starting new_bool_3 with 300s (1) cores
% 2.31/0.93 % Starting new_bool_1 with 300s (1) cores
% 2.31/0.93 % Starting sh5l with 300s (1) cores
% 2.31/0.93 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2690677 completed with status 0
% 2.31/0.93 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.31/0.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.31/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.31/0.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.31/0.93 % No SInE strategy applied
% 2.31/0.93 % Search class: FGHSM-FFMM31-SFFFFFNN
% 2.31/0.93 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 2.31/0.93 % Starting SubtermCWHack with 136s (1) cores
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 2.31/0.93 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 2.31/0.93 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.31/0.93 % G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2690688 completed with status 0
% 2.31/0.93 % Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.31/0.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.31/0.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.31/0.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.31/0.93 % No SInE strategy applied
% 2.31/0.93 % Search class: FGHSM-FFMM31-SFFFFFNN
% 2.31/0.93 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 2.31/0.93 % Starting SubtermCWHack with 136s (1) cores
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.31/0.93 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 2.31/0.93 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 2.31/0.93 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.31/0.93 % Preprocessing time : 0.002 s
% 2.31/0.93 % Presaturation interreduction done
% 2.31/0.93
% 2.31/0.93 % Proof found!
% 2.31/0.93 % SZS status Theorem
% 2.31/0.93 % SZS output start CNFRefutation
% See solution above
% 2.31/0.93 % Parsed axioms : 43
% 2.31/0.93 % Removed by relevancy pruning/SinE : 0
% 2.31/0.93 % Initial clauses : 69
% 2.31/0.93 % Removed in clause preprocessing : 0
% 2.31/0.93 % Initial clauses in saturation : 69
% 2.31/0.93 % Processed clauses : 2412
% 2.31/0.93 % ...of these trivial : 42
% 2.31/0.93 % ...subsumed : 1470
% 2.31/0.93 % ...remaining for further processing : 900
% 2.31/0.93 % Other redundant clauses eliminated : 0
% 2.31/0.93 % Clauses deleted for lack of memory : 0
% 2.31/0.93 % Backward-subsumed : 55
% 2.31/0.93 % Backward-rewritten : 40
% 2.31/0.93 % Generated clauses : 9695
% 2.31/0.93 % ...of the previous two non-redundant : 8428
% 2.31/0.93 % ...aggressively subsumed : 0
% 2.31/0.93 % Contextual simplify-reflections : 9
% 2.31/0.93 % Paramodulations : 9695
% 2.31/0.93 % Factorizations : 0
% 2.31/0.93 % NegExts : 0
% 2.31/0.93 % Equation resolutions : 0
% 2.31/0.93 % Disequality decompositions : 0
% 2.31/0.93 % Total rewrite steps : 2811
% 2.31/0.93 % ...of those cached : 2417
% 2.31/0.93 % Propositional unsat checks : 0
% 2.31/0.93 % Propositional check models : 0
% 2.31/0.93 % Propositional check unsatisfiable : 0
% 2.31/0.93 % Propositional clauses : 0
% 2.31/0.93 % Propositional clauses after purity: 0
% 2.31/0.93 % Propositional unsat core size : 0
% 2.31/0.93 % Propositional preprocessing time : 0.000
% 2.31/0.93 % Propositional encoding time : 0.000
% 2.31/0.93 % Propositional solver time : 0.000
% 2.31/0.93 % Success case prop preproc time : 0.000
% 2.31/0.93 % Success case prop encoding time : 0.000
% 2.31/0.93 % Success case prop solver time : 0.000
% 2.31/0.93 % Current number of processed clauses : 736
% 2.31/0.93 % Positive orientable unit clauses : 161
% 2.31/0.93 % Positive unorientable unit clauses: 3
% 2.31/0.93 % Negative unit clauses : 27
% 2.31/0.93 % Non-unit-clauses : 545
% 2.31/0.93 % Current number of unprocessed clauses: 6018
% 2.31/0.93 % ...number of literals in the above : 16662
% 2.31/0.93 % Current number of archived formulas : 0
% 2.31/0.93 % Current number of archived clauses : 164
% 2.31/0.93 % Clause-clause subsumption calls (NU) : 58783
% 2.31/0.93 % Rec. Clause-clause subsumption calls : 43103
% 2.31/0.93 % Non-unit clause-clause subsumptions : 778
% 2.31/0.93 % Unit Clause-clause subsumption calls : 5303
% 2.31/0.93 % Rewrite failures with RHS unbound : 0
% 2.31/0.93 % BW rewrite match attempts : 206
% 2.31/0.93 % BW rewrite match successes : 47
% 2.31/0.93 % Condensation attempts : 0
% 2.31/0.93 % Condensation successes : 0
% 2.31/0.93 % Termbank termtop insertions : 145192
% 2.31/0.93 % Search garbage collected termcells : 615
% 2.31/0.93
% 2.31/0.93 % -------------------------------------------------
% 2.31/0.93 % User time : 0.289 s
% 2.31/0.93 % System time : 0.012 s
% 2.31/0.93 % Total time : 0.301 s
% 2.31/0.93 % Maximum resident set size: 3668 pages
% 2.31/0.93
% 2.31/0.93 % -------------------------------------------------
% 2.31/0.93 % User time : 1.387 s
% 2.31/0.93 % System time : 0.066 s
% 2.31/0.93 % Total time : 1.453 s
% 2.31/0.93 % Maximum resident set size: 4608 pages
% 2.31/0.93 % E exiting
%------------------------------------------------------------------------------