%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU290+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:34 PM UTC 2026
% Result : Theorem 0.27s 0.56s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 19 unt; 0 def)
% Number of atoms : 176 ( 55 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 196 ( 70 ~; 75 |; 33 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 79 ( 2 sgn 50 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_funct_1,axiom,
? [X1] :
( function(X1)
& empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_funct_1) ).
fof(t6_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ( in(X3,X1)
=> ( in(apply(X4,X3),relation_rng(X4))
| X2 = empty_set ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_funct_2) ).
fof(rc1_partfun1,axiom,
? [X1] :
( empty(X1)
& one_to_one(X1)
& function(X1)
& relation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_partfun1) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( X2 = empty_set
=> ( ( quasi_total(X3,X1,X2)
<=> X3 = empty_set )
| X1 = empty_set ) )
& ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_funct_2) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_funct_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k4_relset_1) ).
fof(c_0_10,plain,
! [X86] :
( X86 = empty_set
| ~ empty(X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_11,plain,
( function(esk13_0)
& empty(esk13_0)
& relation(esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
cnf(c_0_12,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
empty(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ( in(X3,X1)
=> ( in(apply(X4,X3),relation_rng(X4))
| X2 = empty_set ) ) ),
inference(assume_negation,[status(cth)],[t6_funct_2]) ).
cnf(c_0_15,plain,
empty_set = esk13_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
( empty(esk9_0)
& one_to_one(esk9_0)
& function(esk9_0)
& relation(esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_partfun1])]) ).
fof(c_0_17,negated_conjecture,
( ~ in(apply(esk24_0,esk23_0),relation_rng(esk24_0))
& esk22_0 != empty_set
& in(esk23_0,esk21_0)
& relation_of2_as_subset(esk24_0,esk21_0,esk22_0)
& quasi_total(esk24_0,esk21_0,esk22_0)
& function(esk24_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_18,plain,
! [X13,X14,X15] :
( ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 != empty_set
| X13 = empty_set
| quasi_total(X15,X13,X14)
| X15 != empty_set )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 != empty_set
| X13 = empty_set
| X15 = empty_set
| ~ quasi_total(X15,X13,X14) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X13 != empty_set
| quasi_total(X15,X13,X14)
| X13 != relation_dom_as_subset(X13,X14,X15) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X13 != empty_set
| X13 = relation_dom_as_subset(X13,X14,X15)
| ~ quasi_total(X15,X13,X14) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 = empty_set
| quasi_total(X15,X13,X14)
| X13 != relation_dom_as_subset(X13,X14,X15) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 = empty_set
| X13 = relation_dom_as_subset(X13,X14,X15)
| ~ quasi_total(X15,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])])]) ).
cnf(c_0_19,plain,
( ~ empty(X1)
| X1 = esk13_0 ),
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_20,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk22_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X29,X30,X31] :
( element(X31,powerset(cartesian_product2(X29,X30)))
| ~ relation_of2_as_subset(X31,X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
cnf(c_0_23,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| ~ quasi_total(X1,X2,X3)
| X3 = empty_set
| X2 = relation_dom_as_subset(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
esk13_0 = esk9_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
esk22_0 != esk13_0,
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_26,plain,
! [X70,X71,X72] :
( ( relation_of2_as_subset(X72,X70,X71)
| ~ relation_of2(X72,X70,X71) )
& ( relation_of2(X72,X70,X71)
| ~ relation_of2_as_subset(X72,X70,X71) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
fof(c_0_27,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( ~ function(X16)
| ~ relation(X16)
| X22 = relation_rng(X16)
| in(esk2_2(X16,X22),X22)
| esk2_2(X16,X22) = apply(X16,esk3_2(X16,X22)) )
& ( ~ function(X16)
| ~ relation(X16)
| X22 = relation_rng(X16)
| in(esk2_2(X16,X22),X22)
| in(esk3_2(X16,X22),relation_dom(X16)) )
& ( ~ function(X16)
| ~ relation(X16)
| X22 = relation_rng(X16)
| esk2_2(X16,X22) != apply(X16,X24)
| ~ in(X24,relation_dom(X16))
| ~ in(esk2_2(X16,X22),X22) )
& ( ~ function(X16)
| ~ relation(X16)
| X17 != relation_rng(X16)
| in(X20,X17)
| X20 != apply(X16,X21)
| ~ in(X21,relation_dom(X16)) )
& ( ~ function(X16)
| ~ relation(X16)
| X17 != relation_rng(X16)
| ~ in(X18,X17)
| X18 = apply(X16,esk1_3(X16,X17,X18)) )
& ( ~ function(X16)
| ~ relation(X16)
| X17 != relation_rng(X16)
| ~ in(X18,X17)
| in(esk1_3(X16,X17,X18),relation_dom(X16)) ) ),
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)],[d5_funct_1])])])])])])]) ).
fof(c_0_28,plain,
! [X9,X10,X11] :
( relation(X11)
| ~ element(X11,powerset(cartesian_product2(X9,X10))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
cnf(c_0_29,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
relation_of2_as_subset(esk24_0,esk21_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_31,plain,
! [X67,X68,X69] :
( relation_dom_as_subset(X67,X68,X69) = relation_dom(X69)
| ~ relation_of2(X69,X67,X68) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])])]) ).
cnf(c_0_32,plain,
( ~ relation_of2_as_subset(X3,X1,X2)
| ~ quasi_total(X3,X1,X2)
| X2 = esk9_0
| relation_dom_as_subset(X1,X2,X3) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_15]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
quasi_total(esk24_0,esk21_0,esk22_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,negated_conjecture,
esk22_0 != esk9_0,
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_35,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ~ function(X2)
| ~ relation(X2)
| X4 != relation_rng(X2)
| X3 != apply(X2,X1)
| ~ in(X1,relation_dom(X2))
| in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( ~ element(X1,powerset(cartesian_product2(X2,X3)))
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
element(esk24_0,powerset(cartesian_product2(esk21_0,esk22_0))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( ~ relation_of2(X1,X2,X3)
| relation_dom_as_subset(X2,X3,X1) = relation_dom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
relation_dom_as_subset(esk21_0,esk22_0,esk24_0) = esk21_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30])]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
relation_of2(esk24_0,esk21_0,esk22_0),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
~ in(apply(esk24_0,esk23_0),relation_rng(esk24_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_43,plain,
( ~ in(X2,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| in(apply(X1,X2),relation_rng(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]) ).
cnf(c_0_44,negated_conjecture,
relation(esk24_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
function(esk24_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_46,negated_conjecture,
in(esk23_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_47,negated_conjecture,
esk21_0 = relation_dom(esk24_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_48,negated_conjecture,
~ in(esk23_0,relation_dom(esk24_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU290+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n001.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 06:13:44 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/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
% 0.27/0.56 % Version: 3.5.1
% 0.27/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56 % Starting sh5l with 300s (1) cores
% 0.27/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2361785 completed with status 0
% 0.27/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.56 % No SInE strategy applied
% 0.27/0.56 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.27/0.56 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.27/0.56 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.27/0.56 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.56 % G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2361793 completed with status 0
% 0.27/0.56 % Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.56 % No SInE strategy applied
% 0.27/0.56 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.27/0.56 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.27/0.56 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.27/0.56 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.56 % Preprocessing time : 0.002 s
% 0.27/0.56 % Presaturation interreduction done
% 0.27/0.56
% 0.27/0.56 % Proof found!
% 0.27/0.56 % SZS status Theorem
% 0.27/0.56 % SZS output start CNFRefutation
% See solution above
% 0.27/0.56 % Parsed axioms : 55
% 0.27/0.56 % Removed by relevancy pruning/SinE : 0
% 0.27/0.56 % Initial clauses : 99
% 0.27/0.56 % Removed in clause preprocessing : 10
% 0.27/0.56 % Initial clauses in saturation : 89
% 0.27/0.56 % Processed clauses : 283
% 0.27/0.56 % ...of these trivial : 3
% 0.27/0.56 % ...subsumed : 41
% 0.27/0.56 % ...remaining for further processing : 239
% 0.27/0.56 % Other redundant clauses eliminated : 9
% 0.27/0.56 % Clauses deleted for lack of memory : 0
% 0.27/0.56 % Backward-subsumed : 3
% 0.27/0.56 % Backward-rewritten : 27
% 0.27/0.56 % Generated clauses : 209
% 0.27/0.56 % ...of the previous two non-redundant : 187
% 0.27/0.56 % ...aggressively subsumed : 0
% 0.27/0.56 % Contextual simplify-reflections : 2
% 0.27/0.56 % Paramodulations : 202
% 0.27/0.56 % Factorizations : 0
% 0.27/0.56 % NegExts : 0
% 0.27/0.56 % Equation resolutions : 9
% 0.27/0.56 % Disequality decompositions : 0
% 0.27/0.56 % Total rewrite steps : 104
% 0.27/0.56 % ...of those cached : 77
% 0.27/0.56 % Propositional unsat checks : 0
% 0.27/0.56 % Propositional check models : 0
% 0.27/0.56 % Propositional check unsatisfiable : 0
% 0.27/0.56 % Propositional clauses : 0
% 0.27/0.56 % Propositional clauses after purity: 0
% 0.27/0.56 % Propositional unsat core size : 0
% 0.27/0.56 % Propositional preprocessing time : 0.000
% 0.27/0.56 % Propositional encoding time : 0.000
% 0.27/0.56 % Propositional solver time : 0.000
% 0.27/0.56 % Success case prop preproc time : 0.000
% 0.27/0.56 % Success case prop encoding time : 0.000
% 0.27/0.56 % Success case prop solver time : 0.000
% 0.27/0.56 % Current number of processed clauses : 116
% 0.27/0.56 % Positive orientable unit clauses : 42
% 0.27/0.56 % Positive unorientable unit clauses: 0
% 0.27/0.56 % Negative unit clauses : 9
% 0.27/0.56 % Non-unit-clauses : 65
% 0.27/0.56 % Current number of unprocessed clauses: 68
% 0.27/0.56 % ...number of literals in the above : 252
% 0.27/0.56 % Current number of archived formulas : 0
% 0.27/0.56 % Current number of archived clauses : 116
% 0.27/0.56 % Clause-clause subsumption calls (NU) : 1181
% 0.27/0.56 % Rec. Clause-clause subsumption calls : 739
% 0.27/0.56 % Non-unit clause-clause subsumptions : 38
% 0.27/0.56 % Unit Clause-clause subsumption calls : 306
% 0.27/0.56 % Rewrite failures with RHS unbound : 0
% 0.27/0.56 % BW rewrite match attempts : 9
% 0.27/0.56 % BW rewrite match successes : 6
% 0.27/0.56 % Condensation attempts : 0
% 0.27/0.56 % Condensation successes : 0
% 0.27/0.56 % Termbank termtop insertions : 7002
% 0.27/0.56 % Search garbage collected termcells : 831
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.016 s
% 0.27/0.56 % System time : 0.004 s
% 0.27/0.56 % Total time : 0.019 s
% 0.27/0.56 % Maximum resident set size: 3676 pages
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.071 s
% 0.27/0.56 % System time : 0.019 s
% 0.27/0.56 % Total time : 0.090 s
% 0.27/0.56 % Maximum resident set size: 4864 pages
% 0.27/0.56 % E exiting
%------------------------------------------------------------------------------