TSTP Solution File: SET212-6 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET212-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.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:18:54 EDT 2023

% Result   : Timeout 2136.25s 290.26s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   41 (  15 unt;   6 nHn;  31 RR)
%            Number of literals    :   76 (   5 equ;  35 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-2 aty)
%            Number of variables   :   78 (  20 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_corollary_3_to_X_product_monotonicity_1,negated_conjecture,
    ~ subclass(cross_product(x,y),cross_product(x,union(y,z))),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',prove_corollary_3_to_X_product_monotonicity_1) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',not_subclass_members1) ).

cnf(cartesian_product4,axiom,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,cross_product(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',cartesian_product4) ).

cnf(cartesian_product1,axiom,
    ( member(X1,X3)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',cartesian_product1) ).

cnf(cartesian_product2,axiom,
    ( member(X2,X4)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',cartesian_product2) ).

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',not_subclass_members2) ).

cnf(cartesian_product3,axiom,
    ( member(ordered_pair(X1,X3),cross_product(X2,X4))
    | ~ member(X1,X2)
    | ~ member(X3,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',cartesian_product3) ).

cnf(complement2,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',complement2) ).

cnf(union,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',union) ).

cnf(subclass_members,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',class_elements_are_sets) ).

cnf(intersection1,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',intersection1) ).

cnf(complement1,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.BybjSJyeTO/E---3.1_4118.p',complement1) ).

cnf(c_0_13,negated_conjecture,
    ~ subclass(cross_product(x,y),cross_product(x,union(y,z))),
    prove_corollary_3_to_X_product_monotonicity_1 ).

cnf(c_0_14,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    not_subclass_members1 ).

cnf(c_0_15,axiom,
    ( ordered_pair(first(X1),second(X1)) = X1
    | ~ member(X1,cross_product(X2,X3)) ),
    cartesian_product4 ).

cnf(c_0_16,negated_conjecture,
    member(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))),cross_product(x,y)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    ( member(X1,X3)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    cartesian_product1 ).

cnf(c_0_18,negated_conjecture,
    ordered_pair(first(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))))) = not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,axiom,
    ( member(X2,X4)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    cartesian_product2 ).

cnf(c_0_20,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    not_subclass_members2 ).

cnf(c_0_21,axiom,
    ( member(ordered_pair(X1,X3),cross_product(X2,X4))
    | ~ member(X1,X2)
    | ~ member(X3,X4) ),
    cartesian_product3 ).

cnf(c_0_22,negated_conjecture,
    ( member(first(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),X1)
    | ~ member(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))),cross_product(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,axiom,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    complement2 ).

cnf(c_0_24,axiom,
    complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
    union ).

cnf(c_0_25,axiom,
    ( member(X3,X2)
    | ~ subclass(X1,X2)
    | ~ member(X3,X1) ),
    subclass_members ).

cnf(c_0_26,axiom,
    subclass(X1,universal_class),
    class_elements_are_sets ).

cnf(c_0_27,negated_conjecture,
    ( member(second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),X1)
    | ~ member(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))),cross_product(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_18]) ).

cnf(c_0_28,negated_conjecture,
    ~ member(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))),cross_product(x,union(y,z))),
    inference(spm,[status(thm)],[c_0_13,c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    ( member(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z))),cross_product(X1,X2))
    | ~ member(second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),X2)
    | ~ member(first(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

cnf(c_0_30,negated_conjecture,
    member(first(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),x),
    inference(spm,[status(thm)],[c_0_22,c_0_16]) ).

cnf(c_0_31,axiom,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection1 ).

cnf(c_0_32,plain,
    ( member(X1,intersection(complement(X2),complement(X3)))
    | member(X1,union(X2,X3))
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_33,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_34,negated_conjecture,
    member(second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),y),
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_35,negated_conjecture,
    ~ member(second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),union(y,z)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_36,plain,
    ( member(X1,union(X2,X3))
    | member(X1,complement(X2))
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    member(second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),universal_class),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,axiom,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    complement1 ).

cnf(c_0_39,negated_conjecture,
    member(second(not_subclass_element(cross_product(x,y),cross_product(x,union(y,z)))),complement(y)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem    : SET212-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 2400
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Mon Oct  2 17:18:52 EDT 2023
% 0.12/0.32  % CPUTime    : 
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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.BybjSJyeTO/E---3.1_4118.p
% 2136.25/290.26  # Version: 3.1pre001
% 2136.25/290.26  # Preprocessing class: FSLSSMSMSSSNFFN.
% 2136.25/290.26  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2136.25/290.26  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2136.25/290.26  # Starting new_bool_3 with 300s (1) cores
% 2136.25/290.26  # Starting new_bool_1 with 300s (1) cores
% 2136.25/290.26  # Starting sh5l with 300s (1) cores
% 2136.25/290.26  # sh5l with pid 4199 completed with status 0
% 2136.25/290.26  # Result found by sh5l
% 2136.25/290.26  # Preprocessing class: FSLSSMSMSSSNFFN.
% 2136.25/290.26  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2136.25/290.26  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2136.25/290.26  # Starting new_bool_3 with 300s (1) cores
% 2136.25/290.26  # Starting new_bool_1 with 300s (1) cores
% 2136.25/290.26  # Starting sh5l with 300s (1) cores
% 2136.25/290.26  # SinE strategy is gf500_gu_R04_F100_L20000
% 2136.25/290.26  # Search class: FGHSM-FFMM31-MFFFFFNN
% 2136.25/290.26  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2136.25/290.26  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 2136.25/290.26  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 4202 completed with status 7
% 2136.25/290.26  # Starting sh5l with 31s (1) cores
% 2136.25/290.26  # sh5l with pid 4209 completed with status 7
% 2136.25/290.26  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 2136.25/290.26  # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 4212 completed with status 7
% 2136.25/290.26  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 2136.25/290.26  # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 4214 completed with status 7
% 2136.25/290.26  # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 2136.25/290.26  # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 4217 completed with status 7
% 2136.25/290.26  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 2136.25/290.26  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 4220 completed with status 7
% 2136.25/290.26  # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 2136.25/290.26  # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 4223 completed with status 7
% 2136.25/290.26  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 2136.25/290.26  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 4274 completed with status 7
% 2136.25/290.26  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 2136.25/290.26  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 4278 completed with status 7
% 2136.25/290.26  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 2136.25/290.26  # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 4284 completed with status 7
% 2136.25/290.26  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 2136.25/290.26  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 4288 completed with status 7
% 2136.25/290.26  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 2136.25/290.26  # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with pid 4294 completed with status 0
% 2136.25/290.26  # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I
% 2136.25/290.26  # Preprocessing class: FSLSSMSMSSSNFFN.
% 2136.25/290.26  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2136.25/290.26  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2136.25/290.26  # Starting new_bool_3 with 300s (1) cores
% 2136.25/290.26  # Starting new_bool_1 with 300s (1) cores
% 2136.25/290.26  # Starting sh5l with 300s (1) cores
% 2136.25/290.26  # SinE strategy is gf500_gu_R04_F100_L20000
% 2136.25/290.26  # Search class: FGHSM-FFMM31-MFFFFFNN
% 2136.25/290.26  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2136.25/290.26  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 2136.25/290.26  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 4202 completed with status 7
% 2136.25/290.26  # Starting sh5l with 31s (1) cores
% 2136.25/290.26  # sh5l with pid 4209 completed with status 7
% 2136.25/290.26  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 2136.25/290.26  # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 4212 completed with status 7
% 2136.25/290.26  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 2136.25/290.26  # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 4214 completed with status 7
% 2136.25/290.26  # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 2136.25/290.26  # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 4217 completed with status 7
% 2136.25/290.26  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 2136.25/290.26  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 4220 completed with status 7
% 2136.25/290.26  # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 2136.25/290.26  # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 4223 completed with status 7
% 2136.25/290.26  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 2136.25/290.26  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 4274 completed with status 7
% 2136.25/290.26  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 2136.25/290.26  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 4278 completed with status 7
% 2136.25/290.26  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 2136.25/290.26  # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 4284 completed with status 7
% 2136.25/290.26  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 2136.25/290.26  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 4288 completed with status 7
% 2136.25/290.26  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 2136.25/290.26  # Preprocessing time       : 0.003 s
% 2136.25/290.26  # Presaturation interreduction done
% 2136.25/290.26  
% 2136.25/290.26  # Proof found!
% 2136.25/290.26  # SZS status Unsatisfiable
% 2136.25/290.26  # SZS output start CNFRefutation
% See solution above
% 2136.25/290.26  # Parsed axioms                        : 113
% 2136.25/290.26  # Removed by relevancy pruning/SinE    : 14
% 2136.25/290.26  # Initial clauses                      : 99
% 2136.25/290.26  # Removed in clause preprocessing      : 0
% 2136.25/290.26  # Initial clauses in saturation        : 99
% 2136.25/290.26  # Processed clauses                    : 42805
% 2136.25/290.26  # ...of these trivial                  : 342
% 2136.25/290.26  # ...subsumed                          : 33125
% 2136.25/290.26  # ...remaining for further processing  : 9338
% 2136.25/290.26  # Other redundant clauses eliminated   : 21
% 2136.25/290.26  # Clauses deleted for lack of memory   : 0
% 2136.25/290.26  # Backward-subsumed                    : 212
% 2136.25/290.26  # Backward-rewritten                   : 209
% 2136.25/290.26  # Generated clauses                    : 1550273
% 2136.25/290.26  # ...of the previous two non-redundant : 1474704
% 2136.25/290.26  # ...aggressively subsumed             : 0
% 2136.25/290.26  # Contextual simplify-reflections      : 333
% 2136.25/290.26  # Paramodulations                      : 1550206
% 2136.25/290.26  # Factorizations                       : 46
% 2136.25/290.26  # NegExts                              : 0
% 2136.25/290.26  # Equation resolutions                 : 21
% 2136.25/290.26  # Total rewrite steps                  : 662022
% 2136.25/290.26  # Propositional unsat checks           : 0
% 2136.25/290.26  #    Propositional check models        : 0
% 2136.25/290.26  #    Propositional check unsatisfiable : 0
% 2136.25/290.26  #    Propositional clauses             : 0
% 2136.25/290.26  #    Propositional clauses after purity: 0
% 2136.25/290.26  #    Propositional unsat core size     : 0
% 2136.25/290.26  #    Propositional preprocessing time  : 0.000
% 2136.25/290.26  #    Propositional encoding time       : 0.000
% 2136.25/290.26  #    Propositional solver time         : 0.000
% 2136.25/290.26  #    Success case prop preproc time    : 0.000
% 2136.25/290.26  #    Success case prop encoding time   : 0.000
% 2136.25/290.26  #    Success case prop solver time     : 0.000
% 2136.25/290.26  # Current number of processed clauses  : 8816
% 2136.25/290.26  #    Positive orientable unit clauses  : 964
% 2136.25/290.26  #    Positive unorientable unit clauses: 3
% 2136.25/290.26  #    Negative unit clauses             : 1055
% 2136.25/290.26  #    Non-unit-clauses                  : 6794
% 2136.25/290.26  # Current number of unprocessed clauses: 1431177
% 2136.25/290.26  # ...number of literals in the above   : 3157983
% 2136.25/290.26  # Current number of archived formulas  : 0
% 2136.25/290.26  # Current number of archived clauses   : 519
% 2136.25/290.26  # Clause-clause subsumption calls (NU) : 4183162
% 2136.25/290.26  # Rec. Clause-clause subsumption calls : 3414429
% 2136.25/290.26  # Non-unit clause-clause subsumptions  : 6242
% 2136.25/290.26  # Unit Clause-clause subsumption calls : 767279
% 2136.25/290.26  # Rewrite failures with RHS unbound    : 91
% 2136.25/290.26  # BW rewrite match attempts            : 4138
% 2136.25/290.26  # BW rewrite match successes           : 112
% 2136.25/290.26  # Condensation attempts                : 0
% 2136.25/290.26  # Condensation successes               : 0
% 2136.25/290.26  # Termbank termtop insertions          : 31138981
% 2136.25/290.26  
% 2136.25/290.26  # -------------------------------------------------
% 2136.25/290.26  # User time                : 272.677 s
% 2136.25/290.26  # System time              : 8.552 s
% 2136.25/290.26  # Total time               : 281.229 s
% 2136.25/290.26  # Maximum resident set size: 1992 pages
% 2136.25/290.26  
% 2136.25/290.26  # -------------------------------------------------
% 2136.25/290.26  # User time                : 272.685 s
% 2136.25/290.26  # System time              : 8.559 s
% 2136.25/290.26  # Total time               : 281.244 s
% 2136.25/290.26  # Maximum resident set size: 1776 pages
% 2136.25/290.26  % E---3.1 exiting
% 2136.25/290.26  % E---3.1 exiting
%------------------------------------------------------------------------------