TSTP Solution File: CSR185+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR185+1 : TPTP v8.2.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.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 : Mon May 20 19:16:52 EDT 2024

% Result   : Theorem 65.54s 9.09s
% Output   : CNFRefutation 65.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   67 (  38 unt;   0 def)
%            Number of atoms       :  114 (   3 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   88 (  41   ~;  36   |;   5   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  12 con; 0-2 aty)
%            Number of variables   :   58 (   1 sgn  29   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(predefinitionsA8,axiom,
    ! [X1,X2,X3] :
      ( ( p__d__subclass(X1,X2)
        & p__d__subclass(X2,X3) )
     => p__d__subclass(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA8) ).

fof(mergeA2719,axiom,
    p__d__subclass(c__LinguisticCommunication,c__Communication),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2719) ).

fof(mergeA274,axiom,
    p__d__subclass(c__ContentBearingProcess,c__ContentBearingPhysical),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA274) ).

fof(mergeA2702,axiom,
    p__d__subclass(c__Communication,c__ContentBearingProcess),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2702) ).

fof(mergeA2721,axiom,
    p__d__subclass(c__Stating,c__LinguisticCommunication),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2721) ).

fof(predefinitionsA7,axiom,
    ! [X1] : p__d__subclass(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA7) ).

fof(negatedEqualEvent0006,conjecture,
    c__Stating != c__Imagining,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',negatedEqualEvent0006) ).

fof(mergeA272,axiom,
    p__d__subclass(c__ContentBearingPhysical,c__Physical),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA272) ).

fof(mergeA2697,axiom,
    p__d__subclass(c__SocialInteraction,c__IntentionalProcess),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2697) ).

fof(mergeA2701,axiom,
    p__d__subclass(c__Communication,c__SocialInteraction),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2701) ).

fof(miloA2629,axiom,
    p__d__subclass(c__Dreaming,c__Imagining),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',miloA2629) ).

fof(predefinitionsA15,axiom,
    ! [X4,X5] :
      ( p__d__disjoint(X4,X5)
    <=> ! [X6] :
          ( ~ p__d__instance(X6,X4)
          | ~ p__d__instance(X6,X5) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA15) ).

fof(mergeA177,axiom,
    ! [X7] :
      ( p__d__instance(X7,c__Class)
    <=> p__d__subclass(X7,c__Entity) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA177) ).

fof(predefinitionsA12,axiom,
    ! [X1,X2,X3] :
      ( ( p__d__instance(X1,X2)
        & p__d__subclass(X2,X3) )
     => p__d__instance(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA12) ).

fof(miloA2630,axiom,
    p__d__disjoint(c__Dreaming,c__IntentionalProcess),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',miloA2630) ).

fof(mergeA178,axiom,
    p__d__subclass(c__Physical,c__Entity),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA178) ).

fof(mergeA176,axiom,
    ! [X7] :
      ( p__d__subclass(X7,c__Entity)
     => ? [X35] : p__d__instance(X35,X7) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA176) ).

fof(c_0_17,plain,
    ! [X1045,X1046,X1047] :
      ( ~ p__d__subclass(X1045,X1046)
      | ~ p__d__subclass(X1046,X1047)
      | p__d__subclass(X1045,X1047) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA8])])]) ).

cnf(c_0_18,plain,
    ( p__d__subclass(X1,X3)
    | ~ p__d__subclass(X1,X2)
    | ~ p__d__subclass(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_19,plain,
    p__d__subclass(c__LinguisticCommunication,c__Communication),
    inference(split_conjunct,[status(thm)],[mergeA2719]) ).

cnf(c_0_20,plain,
    p__d__subclass(c__ContentBearingProcess,c__ContentBearingPhysical),
    inference(split_conjunct,[status(thm)],[mergeA274]) ).

cnf(c_0_21,plain,
    ( p__d__subclass(X1,c__Communication)
    | ~ p__d__subclass(X1,c__LinguisticCommunication) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    ( p__d__subclass(X1,c__ContentBearingPhysical)
    | ~ p__d__subclass(X1,c__ContentBearingProcess) ),
    inference(spm,[status(thm)],[c_0_18,c_0_20]) ).

cnf(c_0_23,plain,
    p__d__subclass(c__Communication,c__ContentBearingProcess),
    inference(split_conjunct,[status(thm)],[mergeA2702]) ).

cnf(c_0_24,plain,
    ( p__d__subclass(X1,c__Communication)
    | ~ p__d__subclass(X2,c__LinguisticCommunication)
    | ~ p__d__subclass(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_21]) ).

cnf(c_0_25,plain,
    p__d__subclass(c__Stating,c__LinguisticCommunication),
    inference(split_conjunct,[status(thm)],[mergeA2721]) ).

fof(c_0_26,plain,
    ! [X1044] : p__d__subclass(X1044,X1044),
    inference(variable_rename,[status(thm)],[predefinitionsA7]) ).

cnf(c_0_27,plain,
    p__d__subclass(c__Communication,c__ContentBearingPhysical),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,plain,
    ( p__d__subclass(X1,c__Communication)
    | ~ p__d__subclass(X1,c__Stating) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    p__d__subclass(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

fof(c_0_30,negated_conjecture,
    c__Stating = c__Imagining,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[negatedEqualEvent0006])]) ).

cnf(c_0_31,plain,
    p__d__subclass(c__ContentBearingPhysical,c__Physical),
    inference(split_conjunct,[status(thm)],[mergeA272]) ).

cnf(c_0_32,plain,
    ( p__d__subclass(X1,c__ContentBearingPhysical)
    | ~ p__d__subclass(X1,c__Communication) ),
    inference(spm,[status(thm)],[c_0_18,c_0_27]) ).

cnf(c_0_33,plain,
    p__d__subclass(c__Stating,c__Communication),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    p__d__subclass(c__SocialInteraction,c__IntentionalProcess),
    inference(split_conjunct,[status(thm)],[mergeA2697]) ).

cnf(c_0_35,plain,
    p__d__subclass(c__Communication,c__SocialInteraction),
    inference(split_conjunct,[status(thm)],[mergeA2701]) ).

cnf(c_0_36,plain,
    p__d__subclass(c__Dreaming,c__Imagining),
    inference(split_conjunct,[status(thm)],[miloA2629]) ).

cnf(c_0_37,negated_conjecture,
    c__Stating = c__Imagining,
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_38,plain,
    ! [X4,X5] :
      ( p__d__disjoint(X4,X5)
    <=> ! [X6] :
          ( ~ p__d__instance(X6,X4)
          | ~ p__d__instance(X6,X5) ) ),
    inference(fof_simplification,[status(thm)],[predefinitionsA15]) ).

cnf(c_0_39,plain,
    ( p__d__subclass(X1,c__Physical)
    | ~ p__d__subclass(X1,c__ContentBearingPhysical) ),
    inference(spm,[status(thm)],[c_0_18,c_0_31]) ).

cnf(c_0_40,plain,
    p__d__subclass(c__Stating,c__ContentBearingPhysical),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_41,plain,
    ( p__d__subclass(X1,c__IntentionalProcess)
    | ~ p__d__subclass(X1,c__SocialInteraction) ),
    inference(spm,[status(thm)],[c_0_18,c_0_34]) ).

cnf(c_0_42,plain,
    ( p__d__subclass(X1,c__SocialInteraction)
    | ~ p__d__subclass(X1,c__Communication) ),
    inference(spm,[status(thm)],[c_0_18,c_0_35]) ).

cnf(c_0_43,plain,
    p__d__subclass(c__Dreaming,c__Stating),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

fof(c_0_44,plain,
    ! [X1053,X1054,X1055,X1056,X1057] :
      ( ( ~ p__d__disjoint(X1053,X1054)
        | ~ p__d__instance(X1055,X1053)
        | ~ p__d__instance(X1055,X1054) )
      & ( p__d__instance(esk1_2(X1056,X1057),X1056)
        | p__d__disjoint(X1056,X1057) )
      & ( p__d__instance(esk1_2(X1056,X1057),X1057)
        | p__d__disjoint(X1056,X1057) ) ),
    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)],[c_0_38])])])])])])]) ).

fof(c_0_45,plain,
    ! [X1281] :
      ( ( ~ p__d__instance(X1281,c__Class)
        | p__d__subclass(X1281,c__Entity) )
      & ( ~ p__d__subclass(X1281,c__Entity)
        | p__d__instance(X1281,c__Class) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mergeA177])])]) ).

cnf(c_0_46,plain,
    p__d__subclass(c__Stating,c__Physical),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

fof(c_0_47,plain,
    ! [X1050,X1051,X1052] :
      ( ~ p__d__instance(X1050,X1051)
      | ~ p__d__subclass(X1051,X1052)
      | p__d__instance(X1050,X1052) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA12])])]) ).

cnf(c_0_48,plain,
    ( p__d__subclass(X1,c__IntentionalProcess)
    | ~ p__d__subclass(X1,c__Communication) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_49,plain,
    p__d__subclass(c__Dreaming,c__Communication),
    inference(spm,[status(thm)],[c_0_28,c_0_43]) ).

cnf(c_0_50,plain,
    ( ~ p__d__disjoint(X1,X2)
    | ~ p__d__instance(X3,X1)
    | ~ p__d__instance(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_51,plain,
    p__d__disjoint(c__Dreaming,c__IntentionalProcess),
    inference(split_conjunct,[status(thm)],[miloA2630]) ).

cnf(c_0_52,plain,
    ( p__d__subclass(X1,c__Entity)
    | ~ p__d__instance(X1,c__Class) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_53,plain,
    ( p__d__subclass(X1,c__Physical)
    | ~ p__d__subclass(X1,c__Stating) ),
    inference(spm,[status(thm)],[c_0_18,c_0_46]) ).

cnf(c_0_54,plain,
    ( p__d__instance(X1,c__Class)
    | ~ p__d__subclass(X1,c__Entity) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_55,plain,
    p__d__subclass(c__Physical,c__Entity),
    inference(split_conjunct,[status(thm)],[mergeA178]) ).

cnf(c_0_56,plain,
    ( p__d__instance(X1,X3)
    | ~ p__d__instance(X1,X2)
    | ~ p__d__subclass(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_57,plain,
    p__d__subclass(c__Dreaming,c__IntentionalProcess),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_58,plain,
    ( ~ p__d__instance(X1,c__IntentionalProcess)
    | ~ p__d__instance(X1,c__Dreaming) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

fof(c_0_59,plain,
    ! [X1279] :
      ( ~ p__d__subclass(X1279,c__Entity)
      | p__d__instance(esk13_1(X1279),X1279) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mergeA176])])])]) ).

cnf(c_0_60,plain,
    ( p__d__subclass(X1,c__Entity)
    | ~ p__d__instance(X2,c__Class)
    | ~ p__d__subclass(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_52]) ).

cnf(c_0_61,plain,
    p__d__subclass(c__Dreaming,c__Physical),
    inference(spm,[status(thm)],[c_0_53,c_0_43]) ).

cnf(c_0_62,plain,
    p__d__instance(c__Physical,c__Class),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_63,plain,
    ~ p__d__instance(X1,c__Dreaming),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).

cnf(c_0_64,plain,
    ( p__d__instance(esk13_1(X1),X1)
    | ~ p__d__subclass(X1,c__Entity) ),
    inference(split_conjunct,[status(thm)],[c_0_59]) ).

cnf(c_0_65,plain,
    p__d__subclass(c__Dreaming,c__Entity),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).

cnf(c_0_66,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CSR185+1 : TPTP v8.2.0. Released v7.3.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun May 19 00:30:08 EDT 2024
% 0.19/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  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/benchmark/theBenchmark.p
% 65.54/9.09  # Version: 3.1.0
% 65.54/9.09  # Preprocessing class: FMLLSMSLSSSNFFN.
% 65.54/9.09  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.54/9.09  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 65.54/9.09  # Starting new_bool_3 with 300s (1) cores
% 65.54/9.09  # Starting new_bool_1 with 300s (1) cores
% 65.54/9.09  # Starting sh5l with 300s (1) cores
% 65.54/9.09  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 12569 completed with status 0
% 65.54/9.09  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 65.54/9.09  # Preprocessing class: FMLLSMSLSSSNFFN.
% 65.54/9.09  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.54/9.09  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 65.54/9.09  # No SInE strategy applied
% 65.54/9.09  # Search class: FGHSS-SMLM31-MFFFFFNN
% 65.54/9.09  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 65.54/9.09  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 65.54/9.09  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 65.54/9.09  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 65.54/9.09  # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 65.54/9.09  # Starting G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 113s (1) cores
% 65.54/9.09  # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 12578 completed with status 0
% 65.54/9.09  # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 65.54/9.09  # Preprocessing class: FMLLSMSLSSSNFFN.
% 65.54/9.09  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.54/9.09  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 65.54/9.09  # No SInE strategy applied
% 65.54/9.09  # Search class: FGHSS-SMLM31-MFFFFFNN
% 65.54/9.09  # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 65.54/9.09  # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 65.54/9.09  # Preprocessing time       : 0.131 s
% 65.54/9.09  
% 65.54/9.09  # Proof found!
% 65.54/9.09  # SZS status Theorem
% 65.54/9.09  # SZS output start CNFRefutation
% See solution above
% 65.54/9.09  # Parsed axioms                        : 7433
% 65.54/9.09  # Removed by relevancy pruning/SinE    : 0
% 65.54/9.09  # Initial clauses                      : 10860
% 65.54/9.09  # Removed in clause preprocessing      : 20
% 65.54/9.09  # Initial clauses in saturation        : 10840
% 65.54/9.09  # Processed clauses                    : 18302
% 65.54/9.09  # ...of these trivial                  : 245
% 65.54/9.09  # ...subsumed                          : 686
% 65.54/9.09  # ...remaining for further processing  : 17371
% 65.54/9.09  # Other redundant clauses eliminated   : 40
% 65.54/9.09  # Clauses deleted for lack of memory   : 0
% 65.54/9.09  # Backward-subsumed                    : 12
% 65.54/9.09  # Backward-rewritten                   : 0
% 65.54/9.09  # Generated clauses                    : 123472
% 65.54/9.09  # ...of the previous two non-redundant : 116508
% 65.54/9.09  # ...aggressively subsumed             : 0
% 65.54/9.09  # Contextual simplify-reflections      : 3208
% 65.54/9.09  # Paramodulations                      : 123373
% 65.54/9.09  # Factorizations                       : 1
% 65.54/9.09  # NegExts                              : 0
% 65.54/9.09  # Equation resolutions                 : 98
% 65.54/9.09  # Disequality decompositions           : 0
% 65.54/9.09  # Total rewrite steps                  : 5402
% 65.54/9.09  # ...of those cached                   : 3285
% 65.54/9.09  # Propositional unsat checks           : 0
% 65.54/9.09  #    Propositional check models        : 0
% 65.54/9.09  #    Propositional check unsatisfiable : 0
% 65.54/9.09  #    Propositional clauses             : 0
% 65.54/9.09  #    Propositional clauses after purity: 0
% 65.54/9.09  #    Propositional unsat core size     : 0
% 65.54/9.09  #    Propositional preprocessing time  : 0.000
% 65.54/9.09  #    Propositional encoding time       : 0.000
% 65.54/9.09  #    Propositional solver time         : 0.000
% 65.54/9.09  #    Success case prop preproc time    : 0.000
% 65.54/9.09  #    Success case prop encoding time   : 0.000
% 65.54/9.09  #    Success case prop solver time     : 0.000
% 65.54/9.09  # Current number of processed clauses  : 17352
% 65.54/9.09  #    Positive orientable unit clauses  : 6194
% 65.54/9.09  #    Positive unorientable unit clauses: 0
% 65.54/9.09  #    Negative unit clauses             : 61
% 65.54/9.09  #    Non-unit-clauses                  : 11097
% 65.54/9.09  # Current number of unprocessed clauses: 109027
% 65.54/9.09  # ...number of literals in the above   : 360861
% 65.54/9.09  # Current number of archived formulas  : 0
% 65.54/9.09  # Current number of archived clauses   : 12
% 65.54/9.09  # Clause-clause subsumption calls (NU) : 25386540
% 65.54/9.09  # Rec. Clause-clause subsumption calls : 14348972
% 65.54/9.09  # Non-unit clause-clause subsumptions  : 3898
% 65.54/9.09  # Unit Clause-clause subsumption calls : 5424865
% 65.54/9.09  # Rewrite failures with RHS unbound    : 0
% 65.54/9.09  # BW rewrite match attempts            : 95
% 65.54/9.09  # BW rewrite match successes           : 0
% 65.54/9.09  # Condensation attempts                : 0
% 65.54/9.09  # Condensation successes               : 0
% 65.54/9.09  # Termbank termtop insertions          : 1818538
% 65.54/9.09  # Search garbage collected termcells   : 89324
% 65.54/9.09  
% 65.54/9.09  # -------------------------------------------------
% 65.54/9.09  # User time                : 8.208 s
% 65.54/9.09  # System time              : 0.176 s
% 65.54/9.09  # Total time               : 8.384 s
% 65.54/9.09  # Maximum resident set size: 31000 pages
% 65.54/9.09  
% 65.54/9.09  # -------------------------------------------------
% 65.54/9.09  # User time                : 39.627 s
% 65.54/9.09  # System time              : 0.822 s
% 65.54/9.09  # Total time               : 40.449 s
% 65.54/9.09  # Maximum resident set size: 9664 pages
% 65.54/9.09  % E---3.1 exiting
% 65.54/9.09  % E exiting
%------------------------------------------------------------------------------