TSTP Solution File: GEO297+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO297+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n022.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  : 600s
% DateTime : Sat Jul 16 04:05:21 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   46 (  32 unt;   0 def)
%            Number of atoms       :  199 (  83 equ)
%            Maximal formula atoms :   43 (   4 avg)
%            Number of connectives :  251 (  98   ~;  89   |;  61   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   19 (  19 usr;  17 con; 0-3 aty)
%            Number of variables   :   59 (   0 sgn  27   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('qu(cond(axiom(188), 0), imp(cond(axiom(188), 0)))',axiom,
    ! [X1,X2,X3,X4,X5,X6,X7,X8] :
      ( ( ron(X3,X7)
        & ron(X1,X7)
        & X1 != X5
        & X1 != X3
        & X7 = X8
        & rline(X8)
        & X5 = X6
        & rpoint(X6)
        & X3 = X4
        & rpoint(X4)
        & X1 = X2
        & rpoint(X2) )
     => ( ( ~ rR(X1,X3,X5)
          & ron(X5,X7) )
      <=> vangle(X3,X1,X5) = v0 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(axiom(188), 0), imp(cond(axiom(188), 0)))') ).

fof('qe(s3(plural(271)))',axiom,
    ? [X16] :
      ( vd1201 = X16
      & rpoint(X16) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s3(plural(271)))') ).

fof('and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))',axiom,
    ( ~ ? [X9] :
          ( ron(vd1187,X9)
          & ron(vd1186,X9)
          & ron(vd1185,X9)
          & rline(X9) )
    & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
    & vf(vd1178,vd1180) = vf(vd1185,vd1187)
    & vf(vd1178,vd1179) = vf(vd1185,vd1186)
    & ? [X10] :
        ( vd1187 = X10
        & rpoint(X10) )
    & ? [X11] :
        ( vd1186 = X11
        & rpoint(X11) )
    & ? [X12] :
        ( vd1185 = X12
        & rpoint(X12) )
    & vd1179 != vd1180
    & vd1178 != vd1180
    & vd1178 != vd1179
    & ? [X13] :
        ( vd1180 = X13
        & rpoint(X13) )
    & ? [X14] :
        ( vd1179 = X14
        & rpoint(X14) )
    & ? [X15] :
        ( vd1178 = X15
        & rpoint(X15) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))') ).

fof('qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))',axiom,
    ! [X95,X96,X97,X98] :
      ( ( rS(X95,X96,X97)
        & X97 = X98
        & rline(X98)
        & ? [X99] :
            ( X96 = X99
            & rpoint(X99) )
        & ? [X100] :
            ( X95 = X100
            & rpoint(X100) ) )
     => ~ ron(X95,X97) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))') ).

fof('holds(310, 1246, 0)',axiom,
    vangle(vd1187,vd1185,vd1201) = v0,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(310, 1246, 0)') ).

fof('neg(neg(296))',axiom,
    ~ ron(vd1201,vd1232),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','neg(neg(296))') ).

fof('neg(neg(270))',axiom,
    ~ ron(vd1187,vd1197),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','neg(neg(270))') ).

fof('pred(293, 0)',axiom,
    rline(vd1232),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(293, 0)') ).

fof('pred(311, 0)',axiom,
    ron(vd1187,vd1232),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(311, 0)') ).

fof('pred(s1(plural(293)), 0)',axiom,
    ron(vd1185,vd1232),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s1(plural(293)), 0)') ).

fof('holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)',axiom,
    rS(vd1201,vd1187,vd1197),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)') ).

fof('pred(269, 0)',axiom,
    rline(vd1197),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(269, 0)') ).

fof('pred(s3(plural(274)), 0)',axiom,
    ron(vd1185,vd1197),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s3(plural(274)), 0)') ).

fof(c_0_13,plain,
    ! [X9,X10,X11,X12,X13,X14,X15,X16] :
      ( ( rR(X9,X11,X13)
        | ~ ron(X13,X15)
        | vangle(X11,X9,X13) = v0
        | ~ ron(X11,X15)
        | ~ ron(X9,X15)
        | X9 = X13
        | X9 = X11
        | X15 != X16
        | ~ rline(X16)
        | X13 != X14
        | ~ rpoint(X14)
        | X11 != X12
        | ~ rpoint(X12)
        | X9 != X10
        | ~ rpoint(X10) )
      & ( ~ rR(X9,X11,X13)
        | vangle(X11,X9,X13) != v0
        | ~ ron(X11,X15)
        | ~ ron(X9,X15)
        | X9 = X13
        | X9 = X11
        | X15 != X16
        | ~ rline(X16)
        | X13 != X14
        | ~ rpoint(X14)
        | X11 != X12
        | ~ rpoint(X12)
        | X9 != X10
        | ~ rpoint(X10) )
      & ( ron(X13,X15)
        | vangle(X11,X9,X13) != v0
        | ~ ron(X11,X15)
        | ~ ron(X9,X15)
        | X9 = X13
        | X9 = X11
        | X15 != X16
        | ~ rline(X16)
        | X13 != X14
        | ~ rpoint(X14)
        | X11 != X12
        | ~ rpoint(X12)
        | X9 != X10
        | ~ rpoint(X10) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['qu(cond(axiom(188), 0), imp(cond(axiom(188), 0)))'])])])])])]) ).

fof(c_0_14,plain,
    ( vd1201 = esk7_0
    & rpoint(esk7_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(271)))'])]) ).

fof(c_0_15,plain,
    ! [X16] :
      ( ( ~ ron(vd1187,X16)
        | ~ ron(vd1186,X16)
        | ~ ron(vd1185,X16)
        | ~ rline(X16) )
      & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
      & vf(vd1178,vd1180) = vf(vd1185,vd1187)
      & vf(vd1178,vd1179) = vf(vd1185,vd1186)
      & vd1187 = esk1_0
      & rpoint(esk1_0)
      & vd1186 = esk2_0
      & rpoint(esk2_0)
      & vd1185 = esk3_0
      & rpoint(esk3_0)
      & vd1179 != vd1180
      & vd1178 != vd1180
      & vd1178 != vd1179
      & vd1180 = esk4_0
      & rpoint(esk4_0)
      & vd1179 = esk5_0
      & rpoint(esk5_0)
      & vd1178 = esk6_0
      & rpoint(esk6_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))'])])])])])]) ).

cnf(c_0_16,plain,
    ( X2 = X4
    | X2 = X6
    | ron(X6,X8)
    | ~ rpoint(X1)
    | X2 != X1
    | ~ rpoint(X3)
    | X4 != X3
    | ~ rpoint(X5)
    | X6 != X5
    | ~ rline(X7)
    | X8 != X7
    | ~ ron(X2,X8)
    | ~ ron(X4,X8)
    | vangle(X4,X2,X6) != v0 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    rpoint(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    vd1201 = esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    rpoint(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    vd1187 = esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    rpoint(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    vd1185 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_23,plain,
    ! [X101,X102,X103,X104,X105,X106] :
      ( ~ rS(X101,X102,X103)
      | X103 != X104
      | ~ rline(X104)
      | X102 != X105
      | ~ rpoint(X105)
      | X101 != X106
      | ~ rpoint(X106)
      | ~ ron(X101,X103) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))'])])])])])]) ).

cnf(c_0_24,plain,
    ( X1 = X2
    | X1 = X3
    | ron(X2,X4)
    | vangle(X3,X1,X2) != v0
    | ~ rpoint(X2)
    | ~ rpoint(X3)
    | ~ rpoint(X1)
    | ~ rline(X4)
    | ~ ron(X3,X4)
    | ~ ron(X1,X4) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])])])]) ).

cnf(c_0_25,plain,
    vangle(vd1187,vd1185,vd1201) = v0,
    inference(split_conjunct,[status(thm)],['holds(310, 1246, 0)']) ).

cnf(c_0_26,plain,
    rpoint(vd1201),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_27,plain,
    rpoint(vd1187),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_28,plain,
    rpoint(vd1185),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_29,plain,
    ~ ron(vd1201,vd1232),
    inference(fof_simplification,[status(thm)],['neg(neg(296))']) ).

cnf(c_0_30,plain,
    ( ~ ron(X1,X2)
    | ~ rpoint(X3)
    | X1 != X3
    | ~ rpoint(X4)
    | X5 != X4
    | ~ rline(X6)
    | X2 != X6
    | ~ rS(X1,X5,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_31,plain,
    ~ ron(vd1187,vd1197),
    inference(fof_simplification,[status(thm)],['neg(neg(270))']) ).

cnf(c_0_32,plain,
    ( vd1187 = vd1185
    | vd1201 = vd1185
    | ron(vd1201,X1)
    | ~ rline(X1)
    | ~ ron(vd1187,X1)
    | ~ ron(vd1185,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28])]) ).

cnf(c_0_33,plain,
    rline(vd1232),
    inference(split_conjunct,[status(thm)],['pred(293, 0)']) ).

cnf(c_0_34,plain,
    ron(vd1187,vd1232),
    inference(split_conjunct,[status(thm)],['pred(311, 0)']) ).

cnf(c_0_35,plain,
    ron(vd1185,vd1232),
    inference(split_conjunct,[status(thm)],['pred(s1(plural(293)), 0)']) ).

cnf(c_0_36,plain,
    ~ ron(vd1201,vd1232),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_37,plain,
    ( ~ rS(X1,X2,X3)
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | ~ rline(X3)
    | ~ ron(X1,X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])])]) ).

cnf(c_0_38,plain,
    rS(vd1201,vd1187,vd1197),
    inference(split_conjunct,[status(thm)],['holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)']) ).

cnf(c_0_39,plain,
    rline(vd1197),
    inference(split_conjunct,[status(thm)],['pred(269, 0)']) ).

cnf(c_0_40,plain,
    ~ ron(vd1187,vd1197),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_41,plain,
    ( vd1201 = vd1185
    | vd1187 = vd1185 ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]),c_0_36]) ).

cnf(c_0_42,plain,
    ron(vd1185,vd1197),
    inference(split_conjunct,[status(thm)],['pred(s3(plural(274)), 0)']) ).

cnf(c_0_43,plain,
    ~ ron(vd1201,vd1197),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_27]),c_0_26]),c_0_39])]) ).

cnf(c_0_44,plain,
    vd1201 = vd1185,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).

cnf(c_0_45,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_42])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO297+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 18 08:21:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.022 s
% 0.23/1.42  
% 0.23/1.42  # Failure: Out of unprocessed clauses!
% 0.23/1.42  # OLD status GaveUp
% 0.23/1.42  # Parsed axioms                        : 156
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 155
% 0.23/1.42  # Initial clauses                      : 1
% 0.23/1.42  # Removed in clause preprocessing      : 1
% 0.23/1.42  # Initial clauses in saturation        : 0
% 0.23/1.42  # Processed clauses                    : 0
% 0.23/1.42  # ...of these trivial                  : 0
% 0.23/1.42  # ...subsumed                          : 0
% 0.23/1.42  # ...remaining for further processing  : 0
% 0.23/1.42  # Other redundant clauses eliminated   : 0
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 0
% 0.23/1.42  # Backward-rewritten                   : 0
% 0.23/1.42  # Generated clauses                    : 0
% 0.23/1.42  # ...of the previous two non-trivial   : 0
% 0.23/1.42  # Contextual simplify-reflections      : 0
% 0.23/1.42  # Paramodulations                      : 0
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 0
% 0.23/1.42  # Current number of processed clauses  : 0
% 0.23/1.42  #    Positive orientable unit clauses  : 0
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 0
% 0.23/1.42  #    Non-unit-clauses                  : 0
% 0.23/1.42  # Current number of unprocessed clauses: 0
% 0.23/1.42  # ...number of literals in the above   : 0
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 0
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.42  # Unit Clause-clause subsumption calls : 0
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 0
% 0.23/1.42  # BW rewrite match successes           : 0
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 4414
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.020 s
% 0.23/1.42  # System time              : 0.002 s
% 0.23/1.42  # Total time               : 0.022 s
% 0.23/1.42  # Maximum resident set size: 3528 pages
% 0.23/1.42  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.42  # Preprocessing time       : 0.065 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 46
% 0.23/1.42  # Proof object clause steps            : 27
% 0.23/1.42  # Proof object formula steps           : 19
% 0.23/1.42  # Proof object conjectures             : 0
% 0.23/1.42  # Proof object clause conjectures      : 0
% 0.23/1.42  # Proof object formula conjectures     : 0
% 0.23/1.42  # Proof object initial clauses used    : 17
% 0.23/1.42  # Proof object initial formulas used   : 13
% 0.23/1.42  # Proof object generating inferences   : 4
% 0.23/1.42  # Proof object simplifying inferences  : 27
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 156
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.42  # Initial clauses                      : 323
% 0.23/1.42  # Removed in clause preprocessing      : 3
% 0.23/1.42  # Initial clauses in saturation        : 320
% 0.23/1.42  # Processed clauses                    : 1063
% 0.23/1.42  # ...of these trivial                  : 25
% 0.23/1.42  # ...subsumed                          : 291
% 0.23/1.42  # ...remaining for further processing  : 747
% 0.23/1.42  # Other redundant clauses eliminated   : 1112
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 8
% 0.23/1.42  # Backward-rewritten                   : 120
% 0.23/1.42  # Generated clauses                    : 2250
% 0.23/1.42  # ...of the previous two non-trivial   : 2216
% 0.23/1.42  # Contextual simplify-reflections      : 137
% 0.23/1.42  # Paramodulations                      : 1996
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 1126
% 0.23/1.42  # Current number of processed clauses  : 379
% 0.23/1.42  #    Positive orientable unit clauses  : 39
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 13
% 0.23/1.42  #    Non-unit-clauses                  : 327
% 0.23/1.42  # Current number of unprocessed clauses: 1187
% 0.23/1.42  # ...number of literals in the above   : 11227
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 128
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 79277
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 13106
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 391
% 0.23/1.42  # Unit Clause-clause subsumption calls : 382
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 5
% 0.23/1.42  # BW rewrite match successes           : 4
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 104177
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.167 s
% 0.23/1.42  # System time              : 0.008 s
% 0.23/1.42  # Total time               : 0.175 s
% 0.23/1.42  # Maximum resident set size: 7908 pages
% 0.23/23.50  eprover: CPU time limit exceeded, terminating
% 0.23/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52  eprover: No such file or directory
% 0.23/23.52  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.52  eprover: No such file or directory
% 0.23/23.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53  eprover: No such file or directory
% 0.23/23.53  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.53  eprover: No such file or directory
% 0.23/23.54  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.54  eprover: No such file or directory
% 0.23/23.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.55  eprover: No such file or directory
% 0.23/23.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.55  eprover: No such file or directory
% 0.23/23.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.56  eprover: No such file or directory
%------------------------------------------------------------------------------