TSTP Solution File: NUM409+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM409+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 18:55:38 EDT 2023
% Result : Timeout 4.33s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 71 ( 25 unt; 0 def)
% Number of atoms : 171 ( 17 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 179 ( 79 ~; 69 |; 20 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-1 aty)
% Number of variables : 89 ( 13 sgn; 39 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t5_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t3_subset) ).
fof(d8_ordinal1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2)
& transfinite_sequence(X2) )
=> ( transfinite_sequence_of(X2,X1)
<=> subset(relation_rng(X2),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',d8_ordinal1) ).
fof(dt_m1_ordinal1,axiom,
! [X1,X2] :
( transfinite_sequence_of(X2,X1)
=> ( relation(X2)
& function(X2)
& transfinite_sequence(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',dt_m1_ordinal1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',existence_m1_subset_1) ).
fof(fc6_relat_1,axiom,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_rng(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',fc6_relat_1) ).
fof(existence_m1_ordinal1,axiom,
! [X1] :
? [X2] : transfinite_sequence_of(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',existence_m1_ordinal1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t6_boole) ).
fof(rc2_funct_1,axiom,
? [X1] :
( relation(X1)
& empty(X1)
& function(X1) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',rc2_funct_1) ).
fof(t65_relat_1,axiom,
! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t65_relat_1) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t2_xboole_1) ).
fof(t45_ordinal1,conjecture,
! [X1] : transfinite_sequence_of(empty_set,X1),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',t45_ordinal1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',fc1_xboole_0) ).
fof(fc4_relat_1,axiom,
( empty(empty_set)
& relation(empty_set) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',fc4_relat_1) ).
fof(fc7_relat_1,axiom,
! [X1] :
( empty(X1)
=> ( empty(relation_dom(X1))
& relation(relation_dom(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.P11gRv2cPC/E---3.1_1931.p',fc7_relat_1) ).
fof(c_0_16,plain,
! [X41,X42,X43] :
( ~ in(X41,X42)
| ~ element(X42,powerset(X43))
| ~ empty(X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_17,plain,
! [X15,X16] :
( ( ~ element(X15,powerset(X16))
| subset(X15,X16) )
& ( ~ subset(X15,X16)
| element(X15,powerset(X16)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_18,plain,
! [X6,X7] :
( ( ~ transfinite_sequence_of(X7,X6)
| subset(relation_rng(X7),X6)
| ~ relation(X7)
| ~ function(X7)
| ~ transfinite_sequence(X7) )
& ( ~ subset(relation_rng(X7),X6)
| transfinite_sequence_of(X7,X6)
| ~ relation(X7)
| ~ function(X7)
| ~ transfinite_sequence(X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_ordinal1])])]) ).
fof(c_0_19,plain,
! [X8,X9] :
( ( relation(X9)
| ~ transfinite_sequence_of(X9,X8) )
& ( function(X9)
| ~ transfinite_sequence_of(X9,X8) )
& ( transfinite_sequence(X9)
| ~ transfinite_sequence_of(X9,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_ordinal1])])]) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( subset(relation_rng(X1),X2)
| ~ transfinite_sequence_of(X1,X2)
| ~ relation(X1)
| ~ function(X1)
| ~ transfinite_sequence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( function(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( relation(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( transfinite_sequence(X1)
| ~ transfinite_sequence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( subset(relation_rng(X1),X2)
| ~ transfinite_sequence_of(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).
fof(c_0_28,plain,
! [X36,X37] :
( ~ element(X36,X37)
| empty(X37)
| in(X36,X37) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_29,plain,
( ~ transfinite_sequence_of(X1,X2)
| ~ empty(X2)
| ~ in(X3,relation_rng(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,plain,
! [X32] : element(esk10_1(X32),X32),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_32,plain,
! [X1] :
( ( ~ empty(X1)
& relation(X1) )
=> ~ empty(relation_rng(X1)) ),
inference(fof_simplification,[status(thm)],[fc6_relat_1]) ).
cnf(c_0_33,plain,
( empty(relation_rng(X1))
| ~ element(X2,relation_rng(X1))
| ~ transfinite_sequence_of(X1,X3)
| ~ empty(X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
element(esk10_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_35,plain,
! [X10] : transfinite_sequence_of(esk2_1(X10),X10),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_ordinal1])]) ).
fof(c_0_36,plain,
! [X17] :
( empty(X17)
| ~ relation(X17)
| ~ empty(relation_rng(X17)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])]) ).
cnf(c_0_37,plain,
( empty(relation_rng(X1))
| ~ transfinite_sequence_of(X1,X2)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
transfinite_sequence_of(esk2_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_39,plain,
! [X12] :
( ~ empty(X12)
| X12 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_40,plain,
( empty(X1)
| ~ relation(X1)
| ~ empty(relation_rng(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( empty(relation_rng(esk2_1(X1)))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
relation(esk2_1(X1)),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_43,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
( empty(esk2_1(X1))
| ~ empty(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
fof(c_0_45,plain,
( relation(esk5_0)
& empty(esk5_0)
& function(esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
fof(c_0_46,plain,
! [X19] :
( ( relation_dom(X19) != empty_set
| relation_rng(X19) = empty_set
| ~ relation(X19) )
& ( relation_rng(X19) != empty_set
| relation_dom(X19) = empty_set
| ~ relation(X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t65_relat_1])])]) ).
fof(c_0_47,plain,
! [X14] : subset(empty_set,X14),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_48,plain,
transfinite_sequence(esk2_1(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_49,plain,
( esk2_1(X1) = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
empty(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_51,negated_conjecture,
~ ! [X1] : transfinite_sequence_of(empty_set,X1),
inference(assume_negation,[status(cth)],[t45_ordinal1]) ).
cnf(c_0_52,plain,
( transfinite_sequence_of(X1,X2)
| ~ subset(relation_rng(X1),X2)
| ~ relation(X1)
| ~ function(X1)
| ~ transfinite_sequence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_53,plain,
( relation_rng(X1) = empty_set
| relation_dom(X1) != empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( transfinite_sequence(empty_set)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_57,plain,
function(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_58,plain,
esk5_0 = empty_set,
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
fof(c_0_59,negated_conjecture,
~ transfinite_sequence_of(empty_set,esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_60,plain,
( transfinite_sequence_of(X1,X2)
| relation_dom(X1) != empty_set
| ~ transfinite_sequence(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_61,plain,
transfinite_sequence(empty_set),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
relation(empty_set),
inference(split_conjunct,[status(thm)],[fc4_relat_1]) ).
cnf(c_0_63,plain,
function(empty_set),
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
fof(c_0_64,plain,
! [X45] :
( ( empty(relation_dom(X45))
| ~ empty(X45) )
& ( relation(relation_dom(X45))
| ~ empty(X45) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc7_relat_1])])]) ).
cnf(c_0_65,negated_conjecture,
~ transfinite_sequence_of(empty_set,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_66,plain,
( transfinite_sequence_of(empty_set,X1)
| relation_dom(empty_set) != empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63])]) ).
cnf(c_0_67,plain,
( empty(relation_dom(X1))
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_68,negated_conjecture,
relation_dom(empty_set) != empty_set,
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
( relation_dom(X1) = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : NUM409+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 14:59:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/tmp/tmp.P11gRv2cPC/E---3.1_1931.p
% 4.33/300.09 # Version: 3.1pre001
% 4.33/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.33/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.33/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.33/300.09 # Starting new_bool_3 with 300s (1) cores
% 4.33/300.09 # Starting new_bool_1 with 300s (1) cores
% 4.33/300.09 # Starting sh5l with 300s (1) cores
% 4.33/300.09 # new_bool_3 with pid 2010 completed with status 0
% 4.33/300.09 # Result found by new_bool_3
% 4.33/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.33/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.33/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.33/300.09 # Starting new_bool_3 with 300s (1) cores
% 4.33/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.33/300.09 # Search class: FGHSM-FFMM11-SFFFFFNN
% 4.33/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.33/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 4.33/300.09 # SAT001_MinMin_p005000_rr_RG with pid 2013 completed with status 0
% 4.33/300.09 # Result found by SAT001_MinMin_p005000_rr_RG
% 4.33/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.33/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.33/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.33/300.09 # Starting new_bool_3 with 300s (1) cores
% 4.33/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.33/300.09 # Search class: FGHSM-FFMM11-SFFFFFNN
% 4.33/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.33/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 4.33/300.09 # Preprocessing time : 0.002 s
% 4.33/300.09 # Presaturation interreduction done
% 4.33/300.09
% 4.33/300.09 # Proof found!
% 4.33/300.09 # SZS status Theorem
% 4.33/300.09 # SZS output start CNFRefutation
% See solution above
% 4.33/300.09 # Parsed axioms : 51
% 4.33/300.09 # Removed by relevancy pruning/SinE : 15
% 4.33/300.09 # Initial clauses : 60
% 4.33/300.09 # Removed in clause preprocessing : 0
% 4.33/300.09 # Initial clauses in saturation : 60
% 4.33/300.09 # Processed clauses : 190
% 4.33/300.09 # ...of these trivial : 1
% 4.33/300.09 # ...subsumed : 19
% 4.33/300.09 # ...remaining for further processing : 170
% 4.33/300.09 # Other redundant clauses eliminated : 0
% 4.33/300.09 # Clauses deleted for lack of memory : 0
% 4.33/300.09 # Backward-subsumed : 7
% 4.33/300.09 # Backward-rewritten : 9
% 4.33/300.09 # Generated clauses : 228
% 4.33/300.09 # ...of the previous two non-redundant : 163
% 4.33/300.09 # ...aggressively subsumed : 0
% 4.33/300.09 # Contextual simplify-reflections : 7
% 4.33/300.09 # Paramodulations : 228
% 4.33/300.09 # Factorizations : 0
% 4.33/300.09 # NegExts : 0
% 4.33/300.09 # Equation resolutions : 0
% 4.33/300.09 # Total rewrite steps : 87
% 4.33/300.09 # Propositional unsat checks : 0
% 4.33/300.09 # Propositional check models : 0
% 4.33/300.09 # Propositional check unsatisfiable : 0
% 4.33/300.09 # Propositional clauses : 0
% 4.33/300.09 # Propositional clauses after purity: 0
% 4.33/300.09 # Propositional unsat core size : 0
% 4.33/300.09 # Propositional preprocessing time : 0.000
% 4.33/300.09 # Propositional encoding time : 0.000
% 4.33/300.09 # Propositional solver time : 0.000
% 4.33/300.09 # Success case prop preproc time : 0.000
% 4.33/300.09 # Success case prop encoding time : 0.000
% 4.33/300.09 # Success case prop solver time : 0.000
% 4.33/300.09 # Current number of processed clauses : 95
% 4.33/300.09 # Positive orientable unit clauses : 28
% 4.33/300.09 # Positive unorientable unit clauses: 0
% 4.33/300.09 # Negative unit clauses : 5
% 4.33/300.09 # Non-unit-clauses : 62
% 4.33/300.09 # Current number of unprocessed clauses: 83
% 4.33/300.09 # ...number of literals in the above : 303
% 4.33/300.09 # Current number of archived formulas : 0
% 4.33/300.09 # Current number of archived clauses : 75
% 4.33/300.09 # Clause-clause subsumption calls (NU) : 740
% 4.33/300.09 # Rec. Clause-clause subsumption calls : 531
% 4.33/300.09 # Non-unit clause-clause subsumptions : 32
% 4.33/300.09 # Unit Clause-clause subsumption calls : 12
% 4.33/300.09 # Rewrite failures with RHS unbound : 0
% 4.33/300.09 # BW rewrite match attempts : 7
% 4.33/300.09 # BW rewrite match successes : 5
% 4.33/300.09 # Condensation attempts : 0
% 4.33/300.09 # Condensation successes : 0
% 4.33/300.09 # Termbank termtop insertions : 4946
% 4.33/300.09
% 4.33/300.09 # -------------------------------------------------
% 4.33/300.09 # User time : 0.015 s
% 4.33/300.09 # System time : 0.001 s
% 4.33/300.09 # Total time : 0.016 s
% 4.33/300.09 # Maximum resident set size: 1904 pages
% 4.33/300.09
% 4.33/300.09 # -------------------------------------------------
% 4.33/300.09 # User time : 0.017 s
% 4.33/300.09 # System time : 0.003 s
% 4.33/300.09 # Total time : 0.020 s
% 4.33/300.09 # Maximum resident set size: 1732 pages
% 4.33/300.09 % E---3.1 exiting
% 4.33/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------