TSTP Solution File: SET223-6 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n014.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:22:30 EDT 2023

% Result   : Unsatisfiable 1923.37s 266.93s
% Output   : CNFRefutation 1923.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  10 unt;   4 nHn;  30 RR)
%            Number of literals    :   64 (   3 equ;  31 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    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   66 (  18 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_cross_product_property5_1,negated_conjecture,
    ~ subclass(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),
    file('/export/starexec/sandbox/tmp/tmp.j9NDmhMlq0/E---3.1_12997.p',prove_cross_product_property5_1) ).

cnf(not_subclass_members1,axiom,
    ( member(not_subclass_element(X1,X2),X1)
    | subclass(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.j9NDmhMlq0/E---3.1_12997.p',not_subclass_members1) ).

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

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

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

cnf(not_subclass_members2,axiom,
    ( subclass(X1,X2)
    | ~ member(not_subclass_element(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/tmp.j9NDmhMlq0/E---3.1_12997.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/sandbox/tmp/tmp.j9NDmhMlq0/E---3.1_12997.p',cartesian_product3) ).

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

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

cnf(intersection2,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.j9NDmhMlq0/E---3.1_12997.p',intersection2) ).

cnf(c_0_10,negated_conjecture,
    ~ subclass(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),
    prove_cross_product_property5_1 ).

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

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

cnf(c_0_13,negated_conjecture,
    member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),cross_product(intersection(w,y),intersection(x,z))),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

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

cnf(c_0_16,negated_conjecture,
    ordered_pair(first(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),second(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)))) = not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,plain,
    ( member(not_subclass_element(X1,X2),X1)
    | member(X3,X2)
    | ~ member(X3,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_11]) ).

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

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

cnf(c_0_20,negated_conjecture,
    ( member(first(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),X1)
    | ~ member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),cross_product(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),X1),cross_product(intersection(w,y),intersection(x,z)))
    | member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_13]) ).

cnf(c_0_22,negated_conjecture,
    ~ member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),cross_product(w,z)),
    inference(spm,[status(thm)],[c_0_10,c_0_18]) ).

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

cnf(c_0_24,negated_conjecture,
    ( member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),cross_product(X1,X2))
    | ~ member(second(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),X2)
    | ~ member(first(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

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

cnf(c_0_26,negated_conjecture,
    member(first(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),intersection(w,y)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    ( member(second(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),X1)
    | ~ member(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z)),cross_product(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ member(second(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),z)
    | ~ member(first(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),w) ),
    inference(spm,[status(thm)],[c_0_22,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    member(first(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),w),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,axiom,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    intersection2 ).

cnf(c_0_31,negated_conjecture,
    member(second(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),intersection(x,z)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_22]) ).

cnf(c_0_32,negated_conjecture,
    ~ member(second(not_subclass_element(cross_product(intersection(w,y),intersection(x,z)),cross_product(w,z))),z),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET223-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n014.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 2400
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon Oct  2 16:18:04 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.16/0.45  Running first-order model finding
% 0.16/0.45  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.j9NDmhMlq0/E---3.1_12997.p
% 1923.37/266.93  # Version: 3.1pre001
% 1923.37/266.93  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1923.37/266.93  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1923.37/266.93  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1923.37/266.93  # Starting new_bool_3 with 300s (1) cores
% 1923.37/266.93  # Starting new_bool_1 with 300s (1) cores
% 1923.37/266.93  # Starting sh5l with 300s (1) cores
% 1923.37/266.93  # new_bool_3 with pid 13075 completed with status 8
% 1923.37/266.93  # new_bool_1 with pid 13076 completed with status 8
% 1923.37/266.93  # sh5l with pid 13077 completed with status 0
% 1923.37/266.93  # Result found by sh5l
% 1923.37/266.93  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1923.37/266.93  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1923.37/266.93  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1923.37/266.93  # Starting new_bool_3 with 300s (1) cores
% 1923.37/266.93  # Starting new_bool_1 with 300s (1) cores
% 1923.37/266.93  # Starting sh5l with 300s (1) cores
% 1923.37/266.93  # SinE strategy is gf500_gu_R04_F100_L20000
% 1923.37/266.93  # Search class: FGHSM-FFMM31-MFFFFFNN
% 1923.37/266.93  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1923.37/266.93  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1923.37/266.93  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 13080 completed with status 7
% 1923.37/266.93  # Starting sh5l with 31s (1) cores
% 1923.37/266.93  # sh5l with pid 13090 completed with status 7
% 1923.37/266.93  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1923.37/266.93  # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 13095 completed with status 7
% 1923.37/266.93  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1923.37/266.93  # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 13098 completed with status 7
% 1923.37/266.93  # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1923.37/266.93  # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 13104 completed with status 7
% 1923.37/266.93  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1923.37/266.93  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 13108 completed with status 7
% 1923.37/266.93  # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1923.37/266.93  # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 13117 completed with status 7
% 1923.37/266.93  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1923.37/266.93  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 13120 completed with status 7
% 1923.37/266.93  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1923.37/266.93  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 13170 completed with status 7
% 1923.37/266.93  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1923.37/266.93  # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 13175 completed with status 7
% 1923.37/266.93  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1923.37/266.93  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 13181 completed with status 7
% 1923.37/266.93  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1923.37/266.93  # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with pid 13184 completed with status 0
% 1923.37/266.93  # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I
% 1923.37/266.93  # Preprocessing class: FSLSSMSMSSSNFFN.
% 1923.37/266.93  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1923.37/266.93  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1923.37/266.93  # Starting new_bool_3 with 300s (1) cores
% 1923.37/266.93  # Starting new_bool_1 with 300s (1) cores
% 1923.37/266.93  # Starting sh5l with 300s (1) cores
% 1923.37/266.93  # SinE strategy is gf500_gu_R04_F100_L20000
% 1923.37/266.93  # Search class: FGHSM-FFMM31-MFFFFFNN
% 1923.37/266.93  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1923.37/266.93  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 1923.37/266.93  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 13080 completed with status 7
% 1923.37/266.93  # Starting sh5l with 31s (1) cores
% 1923.37/266.93  # sh5l with pid 13090 completed with status 7
% 1923.37/266.93  # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 23s (1) cores
% 1923.37/266.93  # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 13095 completed with status 7
% 1923.37/266.93  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1923.37/266.93  # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 13098 completed with status 7
% 1923.37/266.93  # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 23s (1) cores
% 1923.37/266.93  # U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 13104 completed with status 7
% 1923.37/266.93  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 23s (1) cores
% 1923.37/266.93  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 13108 completed with status 7
% 1923.37/266.93  # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 23s (1) cores
% 1923.37/266.93  # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with pid 13117 completed with status 7
% 1923.37/266.93  # Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with 23s (1) cores
% 1923.37/266.93  # G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4c with pid 13120 completed with status 7
% 1923.37/266.93  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 23s (1) cores
% 1923.37/266.93  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 13170 completed with status 7
% 1923.37/266.93  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 23s (1) cores
% 1923.37/266.93  # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 13175 completed with status 7
% 1923.37/266.93  # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 23s (1) cores
% 1923.37/266.93  # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 13181 completed with status 7
% 1923.37/266.93  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S070I with 23s (1) cores
% 1923.37/266.93  # Preprocessing time       : 0.005 s
% 1923.37/266.93  # Presaturation interreduction done
% 1923.37/266.93  
% 1923.37/266.93  # Proof found!
% 1923.37/266.93  # SZS status Unsatisfiable
% 1923.37/266.93  # SZS output start CNFRefutation
% See solution above
% 1923.37/266.93  # Parsed axioms                        : 113
% 1923.37/266.93  # Removed by relevancy pruning/SinE    : 14
% 1923.37/266.93  # Initial clauses                      : 99
% 1923.37/266.93  # Removed in clause preprocessing      : 0
% 1923.37/266.93  # Initial clauses in saturation        : 99
% 1923.37/266.93  # Processed clauses                    : 18944
% 1923.37/266.93  # ...of these trivial                  : 205
% 1923.37/266.93  # ...subsumed                          : 14030
% 1923.37/266.93  # ...remaining for further processing  : 4709
% 1923.37/266.93  # Other redundant clauses eliminated   : 11
% 1923.37/266.93  # Clauses deleted for lack of memory   : 0
% 1923.37/266.93  # Backward-subsumed                    : 78
% 1923.37/266.93  # Backward-rewritten                   : 127
% 1923.37/266.93  # Generated clauses                    : 432538
% 1923.37/266.93  # ...of the previous two non-redundant : 402016
% 1923.37/266.93  # ...aggressively subsumed             : 0
% 1923.37/266.93  # Contextual simplify-reflections      : 98
% 1923.37/266.93  # Paramodulations                      : 432493
% 1923.37/266.93  # Factorizations                       : 34
% 1923.37/266.93  # NegExts                              : 0
% 1923.37/266.93  # Equation resolutions                 : 11
% 1923.37/266.93  # Total rewrite steps                  : 164034
% 1923.37/266.93  # Propositional unsat checks           : 0
% 1923.37/266.93  #    Propositional check models        : 0
% 1923.37/266.93  #    Propositional check unsatisfiable : 0
% 1923.37/266.93  #    Propositional clauses             : 0
% 1923.37/266.93  #    Propositional clauses after purity: 0
% 1923.37/266.93  #    Propositional unsat core size     : 0
% 1923.37/266.93  #    Propositional preprocessing time  : 0.000
% 1923.37/266.93  #    Propositional encoding time       : 0.000
% 1923.37/266.93  #    Propositional solver time         : 0.000
% 1923.37/266.93  #    Success case prop preproc time    : 0.000
% 1923.37/266.93  #    Success case prop encoding time   : 0.000
% 1923.37/266.93  #    Success case prop solver time     : 0.000
% 1923.37/266.93  # Current number of processed clauses  : 4403
% 1923.37/266.93  #    Positive orientable unit clauses  : 655
% 1923.37/266.93  #    Positive unorientable unit clauses: 3
% 1923.37/266.93  #    Negative unit clauses             : 574
% 1923.37/266.93  #    Non-unit-clauses                  : 3171
% 1923.37/266.93  # Current number of unprocessed clauses: 382763
% 1923.37/266.93  # ...number of literals in the above   : 855595
% 1923.37/266.93  # Current number of archived formulas  : 0
% 1923.37/266.93  # Current number of archived clauses   : 303
% 1923.37/266.93  # Clause-clause subsumption calls (NU) : 1045313
% 1923.37/266.93  # Rec. Clause-clause subsumption calls : 859337
% 1923.37/266.93  # Non-unit clause-clause subsumptions  : 1999
% 1923.37/266.93  # Unit Clause-clause subsumption calls : 259207
% 1923.37/266.93  # Rewrite failures with RHS unbound    : 59
% 1923.37/266.93  # BW rewrite match attempts            : 1297
% 1923.37/266.93  # BW rewrite match successes           : 61
% 1923.37/266.93  # Condensation attempts                : 0
% 1923.37/266.93  # Condensation successes               : 0
% 1923.37/266.93  # Termbank termtop insertions          : 7545354
% 1923.37/266.93  
% 1923.37/266.93  # -------------------------------------------------
% 1923.37/266.93  # User time                : 258.994 s
% 1923.37/266.93  # System time              : 6.924 s
% 1923.37/266.93  # Total time               : 265.917 s
% 1923.37/266.93  # Maximum resident set size: 1992 pages
% 1923.37/266.93  
% 1923.37/266.93  # -------------------------------------------------
% 1923.37/266.93  # User time                : 704.670 s
% 1923.37/266.93  # System time              : 7.308 s
% 1923.37/266.93  # Total time               : 711.979 s
% 1923.37/266.93  # Maximum resident set size: 1772 pages
% 1923.37/266.93  % E---3.1 exiting
%------------------------------------------------------------------------------