TSTP Solution File: SEU292+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU292+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:25:40 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 22 unt; 0 def)
% Number of atoms : 159 ( 49 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 160 ( 54 ~; 54 |; 32 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 76 ( 4 sgn; 48 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',t6_boole) ).
fof(rc2_funct_1,axiom,
? [X1] :
( relation(X1)
& empty(X1)
& function(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',rc2_funct_1) ).
fof(t21_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ! [X5] :
( ( relation(X5)
& function(X5) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| apply(relation_composition(X4,X5),X3) = apply(X5,apply(X4,X3)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',t21_funct_2) ).
fof(rc1_partfun1,axiom,
? [X1] :
( relation(X1)
& function(X1)
& one_to_one(X1)
& empty(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',rc1_partfun1) ).
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/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',redefinition_m2_relset_1) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) )
& ( X2 = empty_set
=> ( X1 = empty_set
| ( quasi_total(X3,X1,X2)
<=> X3 = empty_set ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',d1_funct_2) ).
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/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',redefinition_k4_relset_1) ).
fof(t23_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',t23_funct_1) ).
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/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',dt_m2_relset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.RfVgFOreeD/E---3.1_29864.p',cc1_relset_1) ).
fof(c_0_10,plain,
! [X91] :
( ~ empty(X91)
| X91 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_11,plain,
( relation(esk10_0)
& empty(esk10_0)
& function(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
cnf(c_0_12,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
empty(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ! [X5] :
( ( relation(X5)
& function(X5) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| apply(relation_composition(X4,X5),X3) = apply(X5,apply(X4,X3)) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_funct_2]) ).
cnf(c_0_15,plain,
empty_set = esk10_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
( relation(esk6_0)
& function(esk6_0)
& one_to_one(esk6_0)
& empty(esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_partfun1])]) ).
fof(c_0_17,plain,
! [X67,X68,X69] :
( ( ~ relation_of2_as_subset(X69,X67,X68)
| relation_of2(X69,X67,X68) )
& ( ~ relation_of2(X69,X67,X68)
| relation_of2_as_subset(X69,X67,X68) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
fof(c_0_18,negated_conjecture,
( function(esk21_0)
& quasi_total(esk21_0,esk18_0,esk19_0)
& relation_of2_as_subset(esk21_0,esk18_0,esk19_0)
& relation(esk22_0)
& function(esk22_0)
& in(esk20_0,esk18_0)
& esk19_0 != empty_set
& apply(relation_composition(esk21_0,esk22_0),esk20_0) != apply(esk22_0,apply(esk21_0,esk20_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_19,plain,
! [X14,X15,X16] :
( ( ~ quasi_total(X16,X14,X15)
| X14 = relation_dom_as_subset(X14,X15,X16)
| X15 = empty_set
| ~ relation_of2_as_subset(X16,X14,X15) )
& ( X14 != relation_dom_as_subset(X14,X15,X16)
| quasi_total(X16,X14,X15)
| X15 = empty_set
| ~ relation_of2_as_subset(X16,X14,X15) )
& ( ~ quasi_total(X16,X14,X15)
| X14 = relation_dom_as_subset(X14,X15,X16)
| X14 != empty_set
| ~ relation_of2_as_subset(X16,X14,X15) )
& ( X14 != relation_dom_as_subset(X14,X15,X16)
| quasi_total(X16,X14,X15)
| X14 != empty_set
| ~ relation_of2_as_subset(X16,X14,X15) )
& ( ~ quasi_total(X16,X14,X15)
| X16 = empty_set
| X14 = empty_set
| X15 != empty_set
| ~ relation_of2_as_subset(X16,X14,X15) )
& ( X16 != empty_set
| quasi_total(X16,X14,X15)
| X14 = empty_set
| X15 != empty_set
| ~ relation_of2_as_subset(X16,X14,X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])]) ).
cnf(c_0_20,plain,
( X1 = esk10_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_21,plain,
empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X64,X65,X66] :
( ~ relation_of2(X66,X64,X65)
| relation_dom_as_subset(X64,X65,X66) = relation_dom(X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])]) ).
cnf(c_0_23,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
relation_of2_as_subset(esk21_0,esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
esk19_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( X2 = relation_dom_as_subset(X2,X3,X1)
| X3 = empty_set
| ~ quasi_total(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
esk10_0 = esk6_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( relation_dom_as_subset(X2,X3,X1) = relation_dom(X1)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
relation_of2(esk21_0,esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
esk19_0 != esk10_0,
inference(rw,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_31,plain,
( relation_dom_as_subset(X1,X2,X3) = X1
| X2 = esk6_0
| ~ quasi_total(X3,X1,X2)
| ~ relation_of2_as_subset(X3,X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_15]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
quasi_total(esk21_0,esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,negated_conjecture,
relation_dom_as_subset(esk18_0,esk19_0,esk21_0) = relation_dom(esk21_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
esk19_0 != esk6_0,
inference(rw,[status(thm)],[c_0_30,c_0_27]) ).
fof(c_0_35,plain,
! [X78,X79,X80] :
( ~ relation(X79)
| ~ function(X79)
| ~ relation(X80)
| ~ function(X80)
| ~ in(X78,relation_dom(X79))
| apply(relation_composition(X79,X80),X78) = apply(X80,apply(X79,X78)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])]) ).
cnf(c_0_36,negated_conjecture,
in(esk20_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_37,negated_conjecture,
esk18_0 = relation_dom(esk21_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_24])]),c_0_34]) ).
cnf(c_0_38,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X3,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
in(esk20_0,relation_dom(esk21_0)),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
function(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_41,plain,
! [X22,X23,X24] :
( ~ relation_of2_as_subset(X24,X22,X23)
| element(X24,powerset(cartesian_product2(X22,X23))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_42,negated_conjecture,
( apply(relation_composition(esk21_0,X1),esk20_0) = apply(X1,apply(esk21_0,esk20_0))
| ~ relation(esk21_0)
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,negated_conjecture,
function(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,negated_conjecture,
relation(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_45,negated_conjecture,
apply(relation_composition(esk21_0,esk22_0),esk20_0) != apply(esk22_0,apply(esk21_0,esk20_0)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_46,plain,
! [X10,X11,X12] :
( ~ element(X12,powerset(cartesian_product2(X10,X11)))
| relation(X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
cnf(c_0_47,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
~ relation(esk21_0),
inference(sr,[status(thm)],[inference(cn,[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,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
element(esk21_0,powerset(cartesian_product2(esk18_0,esk19_0))),
inference(spm,[status(thm)],[c_0_47,c_0_24]) ).
cnf(c_0_51,negated_conjecture,
~ element(esk21_0,powerset(cartesian_product2(X1,X2))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_37]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU292+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 09:05:31 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.50 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/tmp/tmp.RfVgFOreeD/E---3.1_29864.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29996 completed with status 0
% 0.20/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.53 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.20/0.53 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 30011 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.20/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.53 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.53 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.53 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.20/0.53 # Preprocessing time : 0.002 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 56
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 99
% 0.20/0.53 # Removed in clause preprocessing : 9
% 0.20/0.53 # Initial clauses in saturation : 90
% 0.20/0.53 # Processed clauses : 284
% 0.20/0.53 # ...of these trivial : 5
% 0.20/0.53 # ...subsumed : 19
% 0.20/0.53 # ...remaining for further processing : 260
% 0.20/0.53 # Other redundant clauses eliminated : 5
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 1
% 0.20/0.53 # Backward-rewritten : 28
% 0.20/0.53 # Generated clauses : 280
% 0.20/0.53 # ...of the previous two non-redundant : 246
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 2
% 0.20/0.53 # Paramodulations : 275
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 5
% 0.20/0.53 # Total rewrite steps : 212
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 140
% 0.20/0.53 # Positive orientable unit clauses : 50
% 0.20/0.53 # Positive unorientable unit clauses: 0
% 0.20/0.53 # Negative unit clauses : 15
% 0.20/0.53 # Non-unit-clauses : 75
% 0.20/0.53 # Current number of unprocessed clauses: 132
% 0.20/0.53 # ...number of literals in the above : 291
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 116
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 1412
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 1148
% 0.20/0.53 # Non-unit clause-clause subsumptions : 10
% 0.20/0.53 # Unit Clause-clause subsumption calls : 247
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 10
% 0.20/0.53 # BW rewrite match successes : 6
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 7503
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.020 s
% 0.20/0.53 # System time : 0.002 s
% 0.20/0.53 # Total time : 0.022 s
% 0.20/0.53 # Maximum resident set size: 1920 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.061 s
% 0.20/0.53 # System time : 0.010 s
% 0.20/0.53 # Total time : 0.072 s
% 0.20/0.53 # Maximum resident set size: 1720 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------