TSTP Solution File: CSR084+4 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CSR084+4 : TPTP v8.1.2. Bugfixed v7.3.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:36:00 EDT 2024

% Result   : Theorem 18.63s 3.97s
% Output   : CNFRefutation 18.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   46 (  17 unt;   0 def)
%            Number of atoms       :  162 (  25 equ)
%            Maximal formula atoms :   45 (   3 avg)
%            Number of connectives :  187 (  71   ~;  78   |;  26   &)
%                                         (   3 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-3 aty)
%            Number of variables   :   89 (  29 sgn  35   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
    s__instance(s__BananaSlug10_1,s__Invertebrate),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',prove_from_SUMO) ).

fof(kb_SUMO_3489,axiom,
    ! [X169,X170] :
      ( ! [X49] :
          ( ( s__instance(X170,s__Set)
            & s__instance(X169,s__Set) )
         => ( s__element(X49,X170)
          <=> s__element(X49,X169) ) )
     => X170 = X169 ),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',kb_SUMO_3489) ).

fof(kb_SUMO_3496,axiom,
    ! [X171,X172,X173] :
      ( X172 = s__UnionFn(X173,X171)
    <=> ! [X174,X175,X176] :
          ( ( s__instance(X173,s__SetOrClass)
            & s__instance(X172,s__SetOrClass)
            & s__instance(X171,s__SetOrClass) )
         => ( ( s__instance(X174,X173)
              & s__instance(X175,X171)
              & s__instance(X176,X172) )
           => ( s__instance(X174,X172)
              & s__instance(X175,X172)
              & ( s__instance(X176,X173)
                | s__instance(X176,X171) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',kb_SUMO_3496) ).

fof(kb_SUMO_502,axiom,
    ! [X26] : s__instance(X26,s__Entity),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',kb_SUMO_502) ).

fof(kb_SUMO_3533,axiom,
    ! [X168] :
      ( s__instance(X168,s__SetOrClass)
     => ( s__instance(X168,s__NullSet)
       => ~ ? [X48] : s__instance(X48,X168) ) ),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',kb_SUMO_3533) ).

fof(kb_SUMO_276,axiom,
    ! [X9,X10] :
      ( s__disjoint(X9,X10)
    <=> ! [X48] :
          ( ( s__instance(X10,s__SetOrClass)
            & s__instance(X9,s__SetOrClass) )
         => ~ ( s__instance(X48,X9)
              & s__instance(X48,X10) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',kb_SUMO_276) ).

fof(kb_SUMO_3537,axiom,
    ! [X168] :
      ( s__instance(X168,s__SetOrClass)
     => ( s__instance(X168,s__NonNullSet)
       => ? [X48] : s__instance(X48,X168) ) ),
    file('/export/starexec/sandbox/tmp/tmp.qyrYHUnJ3N/E---3.1_17642.p',kb_SUMO_3537) ).

fof(c_0_7,negated_conjecture,
    ~ s__instance(s__BananaSlug10_1,s__Invertebrate),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).

fof(c_0_8,negated_conjecture,
    ~ s__instance(s__BananaSlug10_1,s__Invertebrate),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

fof(c_0_9,plain,
    ! [X6426,X6427] :
      ( ( s__instance(X6427,s__Set)
        | X6427 = X6426 )
      & ( s__instance(X6426,s__Set)
        | X6427 = X6426 )
      & ( ~ s__element(esk157_2(X6426,X6427),X6427)
        | ~ s__element(esk157_2(X6426,X6427),X6426)
        | X6427 = X6426 )
      & ( s__element(esk157_2(X6426,X6427),X6427)
        | s__element(esk157_2(X6426,X6427),X6426)
        | X6427 = X6426 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).

fof(c_0_10,plain,
    ! [X6429,X6430,X6431,X6432,X6433,X6434,X6435,X6436,X6437] :
      ( ( s__instance(X6432,X6430)
        | ~ s__instance(X6432,X6431)
        | ~ s__instance(X6433,X6429)
        | ~ s__instance(X6434,X6430)
        | ~ s__instance(X6431,s__SetOrClass)
        | ~ s__instance(X6430,s__SetOrClass)
        | ~ s__instance(X6429,s__SetOrClass)
        | X6430 != s__UnionFn(X6431,X6429) )
      & ( s__instance(X6433,X6430)
        | ~ s__instance(X6432,X6431)
        | ~ s__instance(X6433,X6429)
        | ~ s__instance(X6434,X6430)
        | ~ s__instance(X6431,s__SetOrClass)
        | ~ s__instance(X6430,s__SetOrClass)
        | ~ s__instance(X6429,s__SetOrClass)
        | X6430 != s__UnionFn(X6431,X6429) )
      & ( s__instance(X6434,X6431)
        | s__instance(X6434,X6429)
        | ~ s__instance(X6432,X6431)
        | ~ s__instance(X6433,X6429)
        | ~ s__instance(X6434,X6430)
        | ~ s__instance(X6431,s__SetOrClass)
        | ~ s__instance(X6430,s__SetOrClass)
        | ~ s__instance(X6429,s__SetOrClass)
        | X6430 != s__UnionFn(X6431,X6429) )
      & ( s__instance(X6437,s__SetOrClass)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( s__instance(X6436,s__SetOrClass)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( s__instance(X6435,s__SetOrClass)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( s__instance(esk158_3(X6435,X6436,X6437),X6437)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( s__instance(esk159_3(X6435,X6436,X6437),X6435)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( s__instance(esk160_3(X6435,X6436,X6437),X6436)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( ~ s__instance(esk160_3(X6435,X6436,X6437),X6437)
        | ~ s__instance(esk158_3(X6435,X6436,X6437),X6436)
        | ~ s__instance(esk159_3(X6435,X6436,X6437),X6436)
        | X6436 = s__UnionFn(X6437,X6435) )
      & ( ~ s__instance(esk160_3(X6435,X6436,X6437),X6435)
        | ~ s__instance(esk158_3(X6435,X6436,X6437),X6436)
        | ~ s__instance(esk159_3(X6435,X6436,X6437),X6436)
        | X6436 = s__UnionFn(X6437,X6435) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3496])])])])])])]) ).

cnf(c_0_11,negated_conjecture,
    ~ s__instance(s__BananaSlug10_1,s__Invertebrate),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( s__instance(X1,s__Set)
    | X2 = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X2330] : s__instance(X2330,s__Entity),
    inference(variable_rename,[status(thm)],[kb_SUMO_502]) ).

cnf(c_0_14,plain,
    ( s__instance(X1,s__SetOrClass)
    | X2 = s__UnionFn(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ( s__instance(s__Invertebrate,s__Set)
    | ~ s__instance(s__BananaSlug10_1,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    s__instance(X1,s__Entity),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__instance(s__BananaSlug10_1,s__UnionFn(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    s__instance(s__Invertebrate,s__Set),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

fof(c_0_19,plain,
    ! [X6441,X6442] :
      ( ~ s__instance(X6441,s__SetOrClass)
      | ~ s__instance(X6441,s__NullSet)
      | ~ s__instance(X6442,X6441) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).

cnf(c_0_20,negated_conjecture,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__instance(s__BananaSlug10_1,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    s__instance(X1,s__Set),
    inference(spm,[status(thm)],[c_0_18,c_0_12]) ).

cnf(c_0_22,plain,
    ( ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X1,s__NullSet)
    | ~ s__instance(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    s__instance(X1,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_24,plain,
    ! [X1519,X1520,X1521,X1522,X1523] :
      ( ( ~ s__disjoint(X1519,X1520)
        | ~ s__instance(X1520,s__SetOrClass)
        | ~ s__instance(X1519,s__SetOrClass)
        | ~ s__instance(X1521,X1519)
        | ~ s__instance(X1521,X1520) )
      & ( s__instance(X1523,s__SetOrClass)
        | s__disjoint(X1522,X1523) )
      & ( s__instance(X1522,s__SetOrClass)
        | s__disjoint(X1522,X1523) )
      & ( s__instance(esk1_2(X1522,X1523),X1522)
        | s__disjoint(X1522,X1523) )
      & ( s__instance(esk1_2(X1522,X1523),X1523)
        | s__disjoint(X1522,X1523) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_276])])])])])])]) ).

cnf(c_0_25,plain,
    ( ~ s__instance(X1,s__NullSet)
    | ~ s__instance(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).

cnf(c_0_26,plain,
    ( s__instance(esk1_2(X1,X2),X1)
    | s__disjoint(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_27,plain,
    ( s__disjoint(s__NullSet,X1)
    | ~ s__instance(X2,esk1_2(s__NullSet,X1)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,plain,
    ( s__instance(esk158_3(X1,X2,X3),X3)
    | X2 = s__UnionFn(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_29,plain,
    ( X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3)
    | s__disjoint(s__NullSet,X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    ( X1 = X2
    | s__disjoint(s__NullSet,X3) ),
    inference(spm,[status(thm)],[c_0_29,c_0_29]) ).

cnf(c_0_31,plain,
    ( ~ s__disjoint(X1,X2)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X3,X1)
    | ~ s__instance(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    ( s__disjoint(s__NullSet,X1)
    | ~ s__instance(s__BananaSlug10_1,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_30]) ).

cnf(c_0_33,plain,
    ( ~ s__disjoint(X1,X2)
    | ~ s__instance(X3,X2)
    | ~ s__instance(X3,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_23]),c_0_23])]) ).

cnf(c_0_34,negated_conjecture,
    s__disjoint(s__NullSet,X1),
    inference(spm,[status(thm)],[c_0_32,c_0_21]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ s__instance(X1,s__NullSet)
    | ~ s__instance(X1,X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_36,negated_conjecture,
    ( X1 = s__UnionFn(s__NullSet,X2)
    | ~ s__instance(esk158_3(X2,X1,s__NullSet),X3) ),
    inference(spm,[status(thm)],[c_0_35,c_0_28]) ).

cnf(c_0_37,negated_conjecture,
    X1 = s__UnionFn(s__NullSet,X2),
    inference(spm,[status(thm)],[c_0_36,c_0_21]) ).

fof(c_0_38,plain,
    ! [X6443] :
      ( ~ s__instance(X6443,s__SetOrClass)
      | ~ s__instance(X6443,s__NonNullSet)
      | s__instance(esk161_1(X6443),X6443) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3537])])])]) ).

cnf(c_0_39,negated_conjecture,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_37,c_0_37]) ).

cnf(c_0_40,plain,
    ( s__instance(esk161_1(X1),X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X1,s__NonNullSet) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    ~ s__instance(X1,s__Invertebrate),
    inference(spm,[status(thm)],[c_0_11,c_0_39]) ).

cnf(c_0_42,plain,
    ( s__instance(esk161_1(X1),X1)
    | ~ s__instance(X1,s__NonNullSet) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_23])]) ).

cnf(c_0_43,negated_conjecture,
    ~ s__instance(s__Invertebrate,s__NonNullSet),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_44,negated_conjecture,
    ~ s__instance(s__Invertebrate,X1),
    inference(spm,[status(thm)],[c_0_43,c_0_39]) ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_44,c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CSR084+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Fri May  3 15:03:52 EDT 2024
% 0.18/0.34  % CPUTime    : 
% 1.05/1.27  Running first-order model finding
% 1.05/1.27  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.qyrYHUnJ3N/E---3.1_17642.p
% 18.63/3.97  # Version: 3.1.0
% 18.63/3.97  # Preprocessing class: FMLLSMSLSSSNFFN.
% 18.63/3.97  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.63/3.97  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 18.63/3.97  # Starting new_bool_3 with 300s (1) cores
% 18.63/3.97  # Starting new_bool_1 with 300s (1) cores
% 18.63/3.97  # Starting sh5l with 300s (1) cores
% 18.63/3.97  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 17719 completed with status 0
% 18.63/3.97  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 18.63/3.97  # Preprocessing class: FMLLSMSLSSSNFFN.
% 18.63/3.97  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.63/3.97  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 18.63/3.97  # No SInE strategy applied
% 18.63/3.97  # Search class: FGHSM-SMLM31-MFFFFFNN
% 18.63/3.97  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.63/3.97  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 18.63/3.97  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 18.63/3.97  # Starting new_bool_3 with 136s (1) cores
% 18.63/3.97  # Starting new_bool_1 with 136s (1) cores
% 18.63/3.97  # Starting sh5l with 136s (1) cores
% 18.63/3.97  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 17731 completed with status 0
% 18.63/3.97  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 18.63/3.97  # Preprocessing class: FMLLSMSLSSSNFFN.
% 18.63/3.97  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.63/3.97  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 18.63/3.97  # No SInE strategy applied
% 18.63/3.97  # Search class: FGHSM-SMLM31-MFFFFFNN
% 18.63/3.97  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.63/3.97  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 18.63/3.97  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 18.63/3.97  # Preprocessing time       : 0.097 s
% 18.63/3.97  # Presaturation interreduction done
% 18.63/3.97  
% 18.63/3.97  # Proof found!
% 18.63/3.97  # SZS status Theorem
% 18.63/3.97  # SZS output start CNFRefutation
% See solution above
% 18.63/3.97  # Parsed axioms                        : 7225
% 18.63/3.97  # Removed by relevancy pruning/SinE    : 0
% 18.63/3.97  # Initial clauses                      : 8419
% 18.63/3.97  # Removed in clause preprocessing      : 63
% 18.63/3.97  # Initial clauses in saturation        : 8356
% 18.63/3.97  # Processed clauses                    : 16845
% 18.63/3.97  # ...of these trivial                  : 544
% 18.63/3.97  # ...subsumed                          : 398
% 18.63/3.97  # ...remaining for further processing  : 15903
% 18.63/3.97  # Other redundant clauses eliminated   : 41
% 18.63/3.97  # Clauses deleted for lack of memory   : 0
% 18.63/3.97  # Backward-subsumed                    : 218
% 18.63/3.97  # Backward-rewritten                   : 1730
% 18.63/3.97  # Generated clauses                    : 106902
% 18.63/3.97  # ...of the previous two non-redundant : 96666
% 18.63/3.97  # ...aggressively subsumed             : 0
% 18.63/3.97  # Contextual simplify-reflections      : 668
% 18.63/3.97  # Paramodulations                      : 106804
% 18.63/3.97  # Factorizations                       : 1
% 18.63/3.97  # NegExts                              : 0
% 18.63/3.97  # Equation resolutions                 : 59
% 18.63/3.97  # Disequality decompositions           : 0
% 18.63/3.97  # Total rewrite steps                  : 12820
% 18.63/3.97  # ...of those cached                   : 7852
% 18.63/3.97  # Propositional unsat checks           : 0
% 18.63/3.97  #    Propositional check models        : 0
% 18.63/3.97  #    Propositional check unsatisfiable : 0
% 18.63/3.97  #    Propositional clauses             : 0
% 18.63/3.97  #    Propositional clauses after purity: 0
% 18.63/3.97  #    Propositional unsat core size     : 0
% 18.63/3.97  #    Propositional preprocessing time  : 0.000
% 18.63/3.97  #    Propositional encoding time       : 0.000
% 18.63/3.97  #    Propositional solver time         : 0.000
% 18.63/3.97  #    Success case prop preproc time    : 0.000
% 18.63/3.97  #    Success case prop encoding time   : 0.000
% 18.63/3.97  #    Success case prop solver time     : 0.000
% 18.63/3.97  # Current number of processed clauses  : 5750
% 18.63/3.97  #    Positive orientable unit clauses  : 3957
% 18.63/3.97  #    Positive unorientable unit clauses: 1
% 18.63/3.97  #    Negative unit clauses             : 17
% 18.63/3.97  #    Non-unit-clauses                  : 1775
% 18.63/3.97  # Current number of unprocessed clauses: 79258
% 18.63/3.97  # ...number of literals in the above   : 159578
% 18.63/3.97  # Current number of archived formulas  : 0
% 18.63/3.97  # Current number of archived clauses   : 10145
% 18.63/3.97  # Clause-clause subsumption calls (NU) : 3001282
% 18.63/3.97  # Rec. Clause-clause subsumption calls : 718117
% 18.63/3.97  # Non-unit clause-clause subsumptions  : 1075
% 18.63/3.97  # Unit Clause-clause subsumption calls : 305594
% 18.63/3.97  # Rewrite failures with RHS unbound    : 9355
% 18.63/3.97  # BW rewrite match attempts            : 31973
% 18.63/3.97  # BW rewrite match successes           : 10538
% 18.63/3.97  # Condensation attempts                : 0
% 18.63/3.97  # Condensation successes               : 0
% 18.63/3.97  # Termbank termtop insertions          : 1196374
% 18.63/3.97  # Search garbage collected termcells   : 89883
% 18.63/3.97  
% 18.63/3.97  # -------------------------------------------------
% 18.63/3.97  # User time                : 2.390 s
% 18.63/3.97  # System time              : 0.122 s
% 18.63/3.97  # Total time               : 2.512 s
% 18.63/3.97  # Maximum resident set size: 29788 pages
% 18.63/3.97  
% 18.63/3.97  # -------------------------------------------------
% 18.63/3.97  # User time                : 10.410 s
% 18.63/3.97  # System time              : 0.265 s
% 18.63/3.97  # Total time               : 10.675 s
% 18.63/3.97  # Maximum resident set size: 9176 pages
% 18.63/3.97  % E---3.1 exiting
%------------------------------------------------------------------------------