↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO290+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n021.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:19 EDT 2022

% Result   : Theorem 0.29s 26.60s
% Output   : CNFRefutation 0.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   67 (  43 unt;   0 def)
%            Number of atoms       :  224 ( 105 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  244 (  87   ~;  93   |;  61   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   20 (  20 usr;  18 con; 0-3 aty)
%            Number of variables   :   60 (   0 sgn  20   !;  14   ?)

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

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,
    ( ~ ? [X12] :
          ( ron(vd1187,X12)
          & ron(vd1186,X12)
          & ron(vd1185,X12)
          & rline(X12) )
    & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
    & vf(vd1178,vd1180) = vf(vd1185,vd1187)
    & vf(vd1178,vd1179) = vf(vd1185,vd1186)
    & ? [X13] :
        ( vd1187 = X13
        & rpoint(X13) )
    & ? [X14] :
        ( vd1186 = X14
        & rpoint(X14) )
    & ? [X15] :
        ( vd1185 = X15
        & rpoint(X15) )
    & vd1179 != vd1180
    & vd1178 != vd1180
    & vd1178 != vd1179
    & ? [X16] :
        ( vd1180 = X16
        & rpoint(X16) )
    & ? [X17] :
        ( vd1179 = X17
        & rpoint(X17) )
    & ? [X18] :
        ( vd1178 = X18
        & rpoint(X18) ) ),
    file('/export/starexec/sandbox/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('qe(s1(plural(271)))',axiom,
    ? [X11] :
      ( vd1199 = X11
      & rpoint(X11) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s1(plural(271)))') ).

fof('qe(s2(plural(271)))',axiom,
    ? [X10] :
      ( vd1200 = X10
      & rpoint(X10) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qe(s2(plural(271)))') ).

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

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

fof('holds(conjunct1(comma_conjunct2(plural(271))), 1212, 0)',axiom,
    vd1200 = vd1186,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(conjunct1(comma_conjunct2(plural(271))), 1212, 0)') ).

fof('dis(276)',conjecture,
    ( rR(vd1199,vd1185,vd1186)
    | rR(vd1185,vd1199,vd1186) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','dis(276)') ).

fof('qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))',axiom,
    ! [X27,X28] :
      ( ( ? [X29] :
            ( X28 = X29
            & rpoint(X29) )
        & ? [X30] :
            ( X27 = X30
            & rpoint(X30) ) )
     => ( vf(X27,X28) = v0
      <=> X27 = X28 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))') ).

fof('holds(273, 1215, 0)',axiom,
    vf(vd1199,vd1200) = vf(vd1185,vd1186),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(273, 1215, 0)') ).

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

fof('holds(275, 1217, 0)',axiom,
    vd1199 != vd1185,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','holds(275, 1217, 0)') ).

fof('neg(neg(conjunct2(conjunct2(comma_conjunct2(plural(271))))))',axiom,
    ~ rR(vd1186,vd1199,vd1185),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','neg(neg(conjunct2(conjunct2(comma_conjunct2(plural(271))))))') ).

fof('pred(s2(plural(269)), 0)',axiom,
    ron(vd1186,vd1197),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in','pred(s2(plural(269)), 0)') ).

fof(c_0_14,plain,
    ! [X9,X10,X11,X12,X13,X14,X15,X16] :
      ( X12 != X13
      | ~ ron(X11,X12)
      | ~ ron(X10,X12)
      | ~ ron(X9,X12)
      | ~ rline(X13)
      | X10 = X11
      | X9 = X11
      | X9 = X10
      | X11 != X14
      | ~ rpoint(X14)
      | X10 != X15
      | ~ rpoint(X15)
      | X9 != X16
      | ~ rpoint(X16)
      | rR(X10,X9,X11)
      | rR(X9,X10,X11)
      | rR(X11,X9,X10) ),
    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)],['qu(cond(axiom(91), 0), imp(cond(axiom(91), 0)))'])])])])]) ).

fof(c_0_15,plain,
    ! [X19] :
      ( ( ~ ron(vd1187,X19)
        | ~ ron(vd1186,X19)
        | ~ ron(vd1185,X19)
        | ~ rline(X19) )
      & vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
      & vf(vd1178,vd1180) = vf(vd1185,vd1187)
      & vf(vd1178,vd1179) = vf(vd1185,vd1186)
      & vd1187 = esk4_0
      & rpoint(esk4_0)
      & vd1186 = esk5_0
      & rpoint(esk5_0)
      & vd1185 = esk6_0
      & rpoint(esk6_0)
      & vd1179 != vd1180
      & vd1178 != vd1180
      & vd1178 != vd1179
      & vd1180 = esk7_0
      & rpoint(esk7_0)
      & vd1179 = esk8_0
      & rpoint(esk8_0)
      & vd1178 = esk9_0
      & rpoint(esk9_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,
    ( rR(X1,X2,X3)
    | rR(X2,X3,X1)
    | rR(X3,X2,X1)
    | X2 = X3
    | X2 = X1
    | X3 = X1
    | ~ rpoint(X4)
    | X2 != X4
    | ~ rpoint(X5)
    | X3 != X5
    | ~ rpoint(X6)
    | X1 != X6
    | ~ rline(X7)
    | ~ ron(X2,X8)
    | ~ ron(X3,X8)
    | ~ ron(X1,X8)
    | X8 != X7 ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,plain,
    rpoint(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_18,plain,
    vd1185 = esk6_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_19,plain,
    ( vd1199 = esk3_0
    & rpoint(esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(271)))'])]) ).

fof(c_0_20,plain,
    ( vd1200 = esk2_0
    & rpoint(esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(271)))'])]) ).

cnf(c_0_21,plain,
    ( X1 = X2
    | X3 = X2
    | X3 = X1
    | rR(X2,X1,X3)
    | rR(X1,X2,X3)
    | rR(X3,X1,X2)
    | ~ rpoint(X3)
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | ~ rline(X4)
    | ~ ron(X2,X4)
    | ~ ron(X1,X4)
    | ~ ron(X3,X4) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])])])]) ).

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

cnf(c_0_23,plain,
    rpoint(vd1185),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

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

cnf(c_0_25,plain,
    rpoint(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,plain,
    vd1199 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_27,plain,
    vd1200 = esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    vd1200 = vd1186,
    inference(split_conjunct,[status(thm)],['holds(conjunct1(comma_conjunct2(plural(271))), 1212, 0)']) ).

fof(c_0_29,negated_conjecture,
    ~ ( rR(vd1199,vd1185,vd1186)
      | rR(vd1185,vd1199,vd1186) ),
    inference(assume_negation,[status(cth)],['dis(276)']) ).

fof(c_0_30,plain,
    ! [X31,X32,X33,X34] :
      ( ( vf(X31,X32) != v0
        | X31 = X32
        | X32 != X33
        | ~ rpoint(X33)
        | X31 != X34
        | ~ rpoint(X34) )
      & ( X31 != X32
        | vf(X31,X32) = v0
        | X32 != X33
        | ~ rpoint(X33)
        | X31 != X34
        | ~ rpoint(X34) ) ),
    inference(distribute,[status(thm)],[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)],['qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))'])])])])])]) ).

cnf(c_0_31,plain,
    vf(vd1199,vd1200) = vf(vd1185,vd1186),
    inference(split_conjunct,[status(thm)],['holds(273, 1215, 0)']) ).

cnf(c_0_32,plain,
    ( X1 = vd1185
    | X2 = vd1185
    | X1 = X2
    | rR(X1,X2,vd1185)
    | rR(X2,vd1185,X1)
    | rR(vd1185,X2,X1)
    | ~ rpoint(X1)
    | ~ rpoint(X2)
    | ~ ron(X2,vd1197)
    | ~ ron(X1,vd1197) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

cnf(c_0_33,plain,
    ron(vd1199,vd1197),
    inference(split_conjunct,[status(thm)],['pred(s1(plural(274)), 0)']) ).

cnf(c_0_34,plain,
    rpoint(vd1199),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_35,plain,
    vd1199 != vd1185,
    inference(split_conjunct,[status(thm)],['holds(275, 1217, 0)']) ).

cnf(c_0_36,plain,
    rpoint(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_37,plain,
    esk2_0 = vd1186,
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

fof(c_0_38,negated_conjecture,
    ( ~ rR(vd1199,vd1185,vd1186)
    & ~ rR(vd1185,vd1199,vd1186) ),
    inference(fof_nnf,[status(thm)],[c_0_29]) ).

fof(c_0_39,plain,
    ~ rR(vd1186,vd1199,vd1185),
    inference(fof_simplification,[status(thm)],['neg(neg(conjunct2(conjunct2(comma_conjunct2(plural(271))))))']) ).

cnf(c_0_40,plain,
    ( X2 = X4
    | ~ rpoint(X1)
    | X2 != X1
    | ~ rpoint(X3)
    | X4 != X3
    | vf(X2,X4) != v0 ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_41,plain,
    vf(vd1178,vd1179) = vf(vd1185,vd1186),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_42,plain,
    vf(vd1185,vd1186) = vf(vd1199,vd1186),
    inference(rw,[status(thm)],[c_0_31,c_0_28]) ).

cnf(c_0_43,plain,
    rpoint(esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_44,plain,
    vd1179 = esk8_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_45,plain,
    rpoint(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_46,plain,
    vd1178 = esk9_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_47,plain,
    ( X1 = vd1199
    | X1 = vd1185
    | rR(vd1185,vd1199,X1)
    | rR(vd1199,vd1185,X1)
    | rR(X1,vd1199,vd1185)
    | ~ rpoint(X1)
    | ~ ron(X1,vd1197) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).

cnf(c_0_48,plain,
    ron(vd1186,vd1197),
    inference(split_conjunct,[status(thm)],['pred(s2(plural(269)), 0)']) ).

cnf(c_0_49,plain,
    rpoint(vd1186),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_50,negated_conjecture,
    ~ rR(vd1185,vd1199,vd1186),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_51,negated_conjecture,
    ~ rR(vd1199,vd1185,vd1186),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_52,plain,
    ~ rR(vd1186,vd1199,vd1185),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_53,plain,
    ( X1 = X2
    | vf(X1,X2) != v0
    | ~ rpoint(X2)
    | ~ rpoint(X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_40])]) ).

cnf(c_0_54,plain,
    vf(vd1178,vd1179) = vf(vd1199,vd1186),
    inference(rw,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_55,plain,
    rpoint(vd1179),
    inference(rw,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_56,plain,
    rpoint(vd1178),
    inference(rw,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_57,plain,
    vd1178 != vd1179,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_58,plain,
    ( vf(X2,X4) = v0
    | ~ rpoint(X1)
    | X2 != X1
    | ~ rpoint(X3)
    | X4 != X3
    | X2 != X4 ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_59,plain,
    ( vd1186 = vd1185
    | vd1186 = vd1199 ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),c_0_50]),c_0_51]),c_0_52]) ).

cnf(c_0_60,plain,
    vf(vd1199,vd1186) != v0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56])]),c_0_57]) ).

cnf(c_0_61,plain,
    ( vf(X1,X1) = v0
    | ~ rpoint(X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_58])])]) ).

cnf(c_0_62,plain,
    ( vf(vd1185,vd1185) = vf(vd1199,vd1185)
    | vd1186 = vd1199 ),
    inference(spm,[status(thm)],[c_0_42,c_0_59]) ).

cnf(c_0_63,plain,
    ( vd1186 = vd1199
    | vf(vd1199,vd1185) != v0 ),
    inference(spm,[status(thm)],[c_0_60,c_0_59]) ).

cnf(c_0_64,plain,
    vd1186 = vd1199,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_23])]),c_0_63]) ).

cnf(c_0_65,plain,
    vf(vd1199,vd1199) != v0,
    inference(rw,[status(thm)],[c_0_60,c_0_64]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem  : GEO290+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.09  % Command  : run_ET %s %d
% 0.09/0.29  % Computer : n021.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sat Jun 18 01:07:46 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.28/23.37  eprover: CPU time limit exceeded, terminating
% 0.28/23.40  eprover: CPU time limit exceeded, terminating
% 0.28/23.42  eprover: CPU time limit exceeded, terminating
% 0.28/23.66  eprover: CPU time limit exceeded, terminating
% 0.29/26.60  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.29/26.60  
% 0.29/26.60  # Failure: Resource limit exceeded (time)
% 0.29/26.60  # OLD status Res
% 0.29/26.60  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.29/26.60  # Preprocessing time       : 0.028 s
% 0.29/26.60  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.29/26.60  # Preprocessing time       : 0.064 s
% 0.29/26.60  
% 0.29/26.60  # Proof found!
% 0.29/26.60  # SZS status Theorem
% 0.29/26.60  # SZS output start CNFRefutation
% See solution above
% 0.29/26.60  # Proof object total steps             : 67
% 0.29/26.60  # Proof object clause steps            : 45
% 0.29/26.60  # Proof object formula steps           : 22
% 0.29/26.60  # Proof object conjectures             : 5
% 0.29/26.60  # Proof object clause conjectures      : 2
% 0.29/26.60  # Proof object formula conjectures     : 3
% 0.29/26.60  # Proof object initial clauses used    : 25
% 0.29/26.60  # Proof object initial formulas used   : 14
% 0.29/26.60  # Proof object generating inferences   : 8
% 0.29/26.60  # Proof object simplifying inferences  : 38
% 0.29/26.60  # Training examples: 0 positive, 0 negative
% 0.29/26.60  # Parsed axioms                        : 135
% 0.29/26.60  # Removed by relevancy pruning/SinE    : 0
% 0.29/26.60  # Initial clauses                      : 303
% 0.29/26.60  # Removed in clause preprocessing      : 2
% 0.29/26.60  # Initial clauses in saturation        : 301
% 0.29/26.60  # Processed clauses                    : 11996
% 0.29/26.60  # ...of these trivial                  : 22
% 0.29/26.60  # ...subsumed                          : 7805
% 0.29/26.60  # ...remaining for further processing  : 4169
% 0.29/26.60  # Other redundant clauses eliminated   : 1112
% 0.29/26.60  # Clauses deleted for lack of memory   : 0
% 0.29/26.60  # Backward-subsumed                    : 373
% 0.29/26.60  # Backward-rewritten                   : 1848
% 0.29/26.60  # Generated clauses                    : 61204
% 0.29/26.60  # ...of the previous two non-trivial   : 58298
% 0.29/26.60  # Contextual simplify-reflections      : 6759
% 0.29/26.60  # Paramodulations                      : 60948
% 0.29/26.60  # Factorizations                       : 1
% 0.29/26.60  # Equation resolutions                 : 1127
% 0.29/26.60  # Current number of processed clauses  : 1708
% 0.29/26.60  #    Positive orientable unit clauses  : 42
% 0.29/26.60  #    Positive unorientable unit clauses: 0
% 0.29/26.60  #    Negative unit clauses             : 21
% 0.29/26.60  #    Non-unit-clauses                  : 1645
% 0.29/26.60  # Current number of unprocessed clauses: 24303
% 0.29/26.60  # ...number of literals in the above   : 339137
% 0.29/26.60  # Current number of archived formulas  : 0
% 0.29/26.60  # Current number of archived clauses   : 2221
% 0.29/26.60  # Clause-clause subsumption calls (NU) : 6458910
% 0.29/26.60  # Rec. Clause-clause subsumption calls : 605548
% 0.29/26.60  # Non-unit clause-clause subsumptions  : 13444
% 0.29/26.60  # Unit Clause-clause subsumption calls : 13607
% 0.29/26.60  # Rewrite failures with RHS unbound    : 0
% 0.29/26.60  # BW rewrite match attempts            : 8
% 0.29/26.60  # BW rewrite match successes           : 8
% 0.29/26.60  # Condensation attempts                : 0
% 0.29/26.60  # Condensation successes               : 0
% 0.29/26.60  # Termbank termtop insertions          : 2071778
% 0.29/26.60  
% 0.29/26.60  # -------------------------------------------------
% 0.29/26.60  # User time                : 2.488 s
% 0.29/26.60  # System time              : 0.046 s
% 0.29/26.60  # Total time               : 2.534 s
% 0.29/26.60  # Maximum resident set size: 63972 pages
% 0.29/46.40  eprover: CPU time limit exceeded, terminating
% 0.29/46.41  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.41  eprover: No such file or directory
% 0.29/46.42  eprover: CPU time limit exceeded, terminating
% 0.29/46.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.42  eprover: No such file or directory
% 0.29/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.43  eprover: No such file or directory
% 0.29/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.43  eprover: No such file or directory
% 0.29/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.43  eprover: No such file or directory
% 0.29/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.43  eprover: No such file or directory
% 0.29/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.44  eprover: No such file or directory
% 0.29/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.44  eprover: No such file or directory
% 0.29/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.44  eprover: No such file or directory
% 0.29/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.44  eprover: No such file or directory
% 0.29/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.45  eprover: No such file or directory
% 0.29/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.45  eprover: No such file or directory
% 0.29/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.45  eprover: No such file or directory
% 0.29/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.45  eprover: No such file or directory
% 0.29/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.46  eprover: No such file or directory
% 0.29/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.46  eprover: No such file or directory
% 0.29/46.46  eprover: CPU time limit exceeded, terminating
% 0.29/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.46  eprover: No such file or directory
% 0.29/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.46  eprover: No such file or directory
% 0.29/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.47  eprover: No such file or directory
% 0.29/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/46.48  eprover: No such file or directory
% 0.29/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.48  eprover: No such file or directory
% 0.29/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.49  eprover: No such file or directory
% 0.29/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.49  eprover: No such file or directory
% 0.29/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.50  eprover: No such file or directory
% 0.29/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.50  eprover: No such file or directory
% 0.29/46.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.51  eprover: No such file or directory
% 0.29/46.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.51  eprover: No such file or directory
% 0.29/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.52  eprover: No such file or directory
% 0.29/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.52  eprover: No such file or directory
% 0.29/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/46.53  eprover: No such file or directory
%------------------------------------------------------------------------------