%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU353+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 : n012.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:49 PM UTC 2026
% Result : Theorem 0.08s 0.43s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 19 unt; 0 def)
% Number of atoms : 137 ( 22 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 136 ( 52 ~; 41 |; 26 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 72 ( 0 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t91_tmap_1,conjecture,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t91_tmap_1) ).
fof(d11_grcat_1,axiom,
! [X1] :
( one_sorted_str(X1)
=> identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_grcat_1) ).
fof(dt_k6_partfun1,axiom,
! [X1] :
( relation_of2_as_subset(identity_as_relation_of(X1),X1,X1)
& v1_partfun1(identity_as_relation_of(X1),X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k6_partfun1) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(dt_k7_grcat_1,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( relation_of2_as_subset(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))
& quasi_total(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))
& function(identity_on_carrier(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_grcat_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/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(redefinition_k8_funct_2,axiom,
! [X1,X2,X3,X4] :
( ( element(X4,X1)
& relation_of2(X3,X1,X2)
& quasi_total(X3,X1,X2)
& function(X3)
& ~ empty(X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k8_funct_2) ).
fof(cc1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> ( ( v1_partfun1(X3,X1,X2)
& function(X3) )
=> ( quasi_total(X3,X1,X2)
& function(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_funct_2) ).
fof(t35_funct_1,axiom,
! [X1,X2] :
( in(X2,X1)
=> apply(identity_relation(X1),X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t35_funct_1) ).
fof(redefinition_k6_partfun1,axiom,
! [X1] : identity_as_relation_of(X1) = identity_relation(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k6_partfun1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
inference(assume_negation,[status(cth)],[t91_tmap_1]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2) = X2 ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X28] :
( identity_on_carrier(X28) = identity_as_relation_of(the_carrier(X28))
| ~ one_sorted_str(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_grcat_1])])]) ).
fof(c_0_14,negated_conjecture,
( apply_as_element(the_carrier(esk16_0),the_carrier(esk16_0),identity_on_carrier(esk16_0),esk17_0) != esk17_0
& element(esk17_0,the_carrier(esk16_0))
& one_sorted_str(esk16_0)
& ~ empty_carrier(esk16_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_15,plain,
! [X29] :
( relation_of2_as_subset(identity_as_relation_of(X29),X29,X29)
& v1_partfun1(identity_as_relation_of(X29),X29,X29) ),
inference(variable_rename,[status(thm)],[dt_k6_partfun1]) ).
cnf(c_0_16,plain,
( ~ one_sorted_str(X1)
| identity_on_carrier(X1) = identity_as_relation_of(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
one_sorted_str(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_19,plain,
! [X31] :
( ( ~ one_sorted_str(X31)
| relation_of2_as_subset(identity_on_carrier(X31),the_carrier(X31),the_carrier(X31)) )
& ( ~ one_sorted_str(X31)
| quasi_total(identity_on_carrier(X31),the_carrier(X31),the_carrier(X31)) )
& ( ~ one_sorted_str(X31)
| function(identity_on_carrier(X31)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_grcat_1])])])]) ).
fof(c_0_20,plain,
! [X78,X79,X80] :
( ( relation_of2_as_subset(X80,X78,X79)
| ~ relation_of2(X80,X78,X79) )
& ( relation_of2(X80,X78,X79)
| ~ relation_of2_as_subset(X80,X78,X79) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_21,plain,
relation_of2_as_subset(identity_as_relation_of(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
identity_as_relation_of(the_carrier(esk16_0)) = identity_on_carrier(esk16_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_23,plain,
! [X48] :
( ~ empty(the_carrier(X48))
| ~ one_sorted_str(X48)
| empty_carrier(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
fof(c_0_24,plain,
! [X1,X2,X3,X4] :
( ( element(X4,X1)
& relation_of2(X3,X1,X2)
& quasi_total(X3,X1,X2)
& function(X3)
& ~ empty(X1) )
=> apply_as_element(X1,X2,X3,X4) = apply(X3,X4) ),
inference(fof_simplification,[status(thm)],[redefinition_k8_funct_2]) ).
fof(c_0_25,plain,
! [X7,X8,X9] :
( ( ~ relation_of2(X9,X7,X8)
| ~ v1_partfun1(X9,X7,X8)
| ~ function(X9)
| quasi_total(X9,X7,X8) )
& ( ~ relation_of2(X9,X7,X8)
| ~ v1_partfun1(X9,X7,X8)
| ~ function(X9)
| function(X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_funct_2])])])]) ).
cnf(c_0_26,plain,
v1_partfun1(identity_as_relation_of(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
( ~ one_sorted_str(X1)
| function(identity_on_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
relation_of2_as_subset(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_30,plain,
! [X86,X87] :
( apply(identity_relation(X86),X87) = X87
| ~ in(X87,X86) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t35_funct_1])])]) ).
fof(c_0_31,plain,
! [X73] : identity_as_relation_of(X73) = identity_relation(X73),
inference(variable_rename,[status(thm)],[redefinition_k6_partfun1]) ).
fof(c_0_32,plain,
! [X84,X85] :
( in(X84,X85)
| empty(X85)
| ~ element(X84,X85) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_33,plain,
( ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
~ empty_carrier(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_35,plain,
! [X74,X75,X76,X77] :
( apply_as_element(X74,X75,X76,X77) = apply(X76,X77)
| ~ element(X77,X74)
| ~ relation_of2(X76,X74,X75)
| ~ quasi_total(X76,X74,X75)
| ~ function(X76)
| empty(X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_36,plain,
( ~ relation_of2(X1,X2,X3)
| ~ v1_partfun1(X1,X2,X3)
| ~ function(X1)
| quasi_total(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,negated_conjecture,
v1_partfun1(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0)),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
function(identity_on_carrier(esk16_0)),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_39,negated_conjecture,
relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,plain,
( ~ in(X1,X2)
| apply(identity_relation(X2),X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
identity_as_relation_of(X1) = identity_relation(X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
element(esk17_0,the_carrier(esk16_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
~ empty(the_carrier(esk16_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_17]),c_0_34]) ).
cnf(c_0_45,plain,
( ~ element(X4,X1)
| ~ relation_of2(X2,X1,X3)
| ~ quasi_total(X2,X1,X3)
| ~ function(X2)
| apply_as_element(X1,X3,X2,X4) = apply(X2,X4)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,negated_conjecture,
quasi_total(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_47,plain,
( ~ in(X1,X2)
| apply(identity_as_relation_of(X2),X1) = X1 ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
in(esk17_0,the_carrier(esk16_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( ~ element(X1,the_carrier(esk16_0))
| apply_as_element(the_carrier(esk16_0),the_carrier(esk16_0),identity_on_carrier(esk16_0),X1) = apply(identity_on_carrier(esk16_0),X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38]),c_0_39])]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
apply(identity_on_carrier(esk16_0),esk17_0) = esk17_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_22]) ).
cnf(c_0_51,negated_conjecture,
apply_as_element(the_carrier(esk16_0),the_carrier(esk16_0),identity_on_carrier(esk16_0),esk17_0) != esk17_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_43]),c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU353+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.08/0.36 % Computer : n012.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 06:14:36 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/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.08/0.43 % Version: 3.5.1
% 0.08/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.43 % Starting sh5l with 300s (1) cores
% 0.08/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1721332 completed with status 0
% 0.08/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.08/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.08/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.43 % No SInE strategy applied
% 0.08/0.43 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.08/0.43 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.08/0.43 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.08/0.43 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.08/0.43 % G-E--_208_C18_F1_SE_CS_SP_PS_S4b with pid 1721340 completed with status 0
% 0.08/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4b
% 0.08/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.08/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.43 % No SInE strategy applied
% 0.08/0.43 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.08/0.43 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.08/0.43 % Preprocessing time : 0.002 s
% 0.08/0.43 % Presaturation interreduction done
% 0.08/0.43
% 0.08/0.43 % Proof found!
% 0.08/0.43 % SZS status Theorem
% 0.08/0.43 % SZS output start CNFRefutation
% See solution above
% 0.08/0.43 % Parsed axioms : 57
% 0.08/0.43 % Removed by relevancy pruning/SinE : 0
% 0.08/0.43 % Initial clauses : 110
% 0.08/0.43 % Removed in clause preprocessing : 21
% 0.08/0.43 % Initial clauses in saturation : 89
% 0.08/0.43 % Processed clauses : 286
% 0.08/0.43 % ...of these trivial : 6
% 0.08/0.43 % ...subsumed : 18
% 0.08/0.43 % ...remaining for further processing : 262
% 0.08/0.43 % Other redundant clauses eliminated : 0
% 0.08/0.43 % Clauses deleted for lack of memory : 0
% 0.08/0.43 % Backward-subsumed : 0
% 0.08/0.43 % Backward-rewritten : 6
% 0.08/0.43 % Generated clauses : 191
% 0.08/0.43 % ...of the previous two non-redundant : 153
% 0.08/0.43 % ...aggressively subsumed : 0
% 0.08/0.43 % Contextual simplify-reflections : 3
% 0.08/0.43 % Paramodulations : 191
% 0.08/0.43 % Factorizations : 0
% 0.08/0.43 % NegExts : 0
% 0.08/0.43 % Equation resolutions : 0
% 0.08/0.43 % Disequality decompositions : 0
% 0.08/0.43 % Total rewrite steps : 116
% 0.08/0.43 % ...of those cached : 60
% 0.08/0.43 % Propositional unsat checks : 0
% 0.08/0.43 % Propositional check models : 0
% 0.08/0.43 % Propositional check unsatisfiable : 0
% 0.08/0.43 % Propositional clauses : 0
% 0.08/0.43 % Propositional clauses after purity: 0
% 0.08/0.43 % Propositional unsat core size : 0
% 0.08/0.43 % Propositional preprocessing time : 0.000
% 0.08/0.43 % Propositional encoding time : 0.000
% 0.08/0.43 % Propositional solver time : 0.000
% 0.08/0.43 % Success case prop preproc time : 0.000
% 0.08/0.43 % Success case prop encoding time : 0.000
% 0.08/0.43 % Success case prop solver time : 0.000
% 0.08/0.43 % Current number of processed clauses : 169
% 0.08/0.43 % Positive orientable unit clauses : 101
% 0.08/0.43 % Positive unorientable unit clauses: 0
% 0.08/0.43 % Negative unit clauses : 17
% 0.08/0.43 % Non-unit-clauses : 51
% 0.08/0.43 % Current number of unprocessed clauses: 43
% 0.08/0.43 % ...number of literals in the above : 96
% 0.08/0.43 % Current number of archived formulas : 0
% 0.08/0.43 % Current number of archived clauses : 94
% 0.08/0.43 % Clause-clause subsumption calls (NU) : 557
% 0.08/0.43 % Rec. Clause-clause subsumption calls : 176
% 0.08/0.43 % Non-unit clause-clause subsumptions : 12
% 0.08/0.43 % Unit Clause-clause subsumption calls : 337
% 0.08/0.43 % Rewrite failures with RHS unbound : 0
% 0.08/0.43 % BW rewrite match attempts : 12
% 0.08/0.43 % BW rewrite match successes : 4
% 0.08/0.43 % Condensation attempts : 0
% 0.08/0.43 % Condensation successes : 0
% 0.08/0.43 % Termbank termtop insertions : 8390
% 0.08/0.43 % Search garbage collected termcells : 889
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.013 s
% 0.08/0.43 % System time : 0.005 s
% 0.08/0.43 % Total time : 0.018 s
% 0.08/0.43 % Maximum resident set size: 3944 pages
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.059 s
% 0.08/0.43 % System time : 0.018 s
% 0.08/0.43 % Total time : 0.077 s
% 0.08/0.43 % Maximum resident set size: 4864 pages
% 0.08/0.43 % E exiting
%------------------------------------------------------------------------------