↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO284+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:28:05 PM UTC 2026

% Result   : Theorem 0.13s 0.80s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   49 (  16 unt;   0 def)
%            Number of atoms       :  232 (  85 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  289 ( 106   ~; 104   |;  74   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-2 aty)
%            Number of variables   :   86 (   1 sgn  22   !;  18   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))',axiom,
    ( rpoint(vd1124)
    & vd1123 = vd1124
    & rpoint(vd1126)
    & vd1125 = vd1126
    & rpoint(vd1128)
    & vd1127 = vd1128
    & rpoint(vd1130)
    & vd1129 = vd1130
    & vd1123 != vd1125
    & vd1127 != vd1129
    & rless(vf(vd1127,vd1129),vf(vd1123,vd1125)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))') ).

fof('qe(259)',conjecture,
    ? [X1,X2] :
      ( rline(X1)
      & ron(vd1123,X1)
      & ron(vd1125,X1)
      & rcircle(X2)
      & rcenter(vd1123,X2)
      & ron(vd1127,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(259)') ).

fof('qu(cond(axiom(1), 0), imp(cond(axiom(1), 0)))',axiom,
    ! [X107,X108] :
      ( rcenter(X107,X108)
     => ? [X109,X110] :
          ( rpoint(X109)
          & X107 = X109
          & rcircle(X110)
          & X108 = X110 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(1), 0), imp(cond(axiom(1), 0)))') ).

fof('qu(cond(axiom(53), 0), imp(cond(axiom(53), 0)))',axiom,
    ! [X39,X40] :
      ( ( ? [X42] :
            ( rpoint(X42)
            & X39 = X42 )
        & ? [X41] :
            ( rpoint(X41)
            & X40 = X41 )
        & X39 != X40 )
     => ? [X43] :
          ( rcircle(X43)
          & rcenter(X39,X43)
          & ron(X40,X43) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(53), 0), imp(cond(axiom(53), 0)))') ).

fof('holds(258, 1150, 0)',axiom,
    vd1123 = vd1129,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(258, 1150, 0)') ).

fof('qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))',axiom,
    ! [X53,X54] :
      ( ( ? [X56] :
            ( rpoint(X56)
            & X53 = X56 )
        & ? [X55] :
            ( rpoint(X55)
            & X54 = X55 )
        & X53 != X54 )
     => ? [X57] :
          ( rline(X57)
          & ron(X53,X57)
          & ron(X54,X57) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))') ).

fof(c_0_6,plain,
    ( rpoint(vd1124)
    & vd1123 = vd1124
    & rpoint(vd1126)
    & vd1125 = vd1126
    & rpoint(vd1128)
    & vd1127 = vd1128
    & rpoint(vd1130)
    & vd1129 = vd1130
    & vd1123 != vd1125
    & vd1127 != vd1129
    & rless(vf(vd1127,vd1129),vf(vd1123,vd1125)) ),
    inference(fof_simplification,[status(thm)],['and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))']) ).

fof(c_0_7,negated_conjecture,
    ~ ? [X1,X2] :
        ( rline(X1)
        & ron(vd1123,X1)
        & ron(vd1125,X1)
        & rcircle(X2)
        & rcenter(vd1123,X2)
        & ron(vd1127,X2) ),
    inference(assume_negation,[status(cth)],['qe(259)']) ).

fof(c_0_8,plain,
    ! [X851,X852] :
      ( ( ~ rcenter(X851,X852)
        | rpoint(esk7_2(X851,X852)) )
      & ( ~ rcenter(X851,X852)
        | X851 = esk7_2(X851,X852) )
      & ( ~ rcenter(X851,X852)
        | rcircle(esk8_2(X851,X852)) )
      & ( ~ rcenter(X851,X852)
        | X852 = esk8_2(X851,X852) ) ),
    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)],['qu(cond(axiom(1), 0), imp(cond(axiom(1), 0)))'])])])])])]) ).

fof(c_0_9,plain,
    ! [X39,X40] :
      ( ( ? [X42] :
            ( rpoint(X42)
            & X39 = X42 )
        & ? [X41] :
            ( rpoint(X41)
            & X40 = X41 )
        & X39 != X40 )
     => ? [X43] :
          ( rcircle(X43)
          & rcenter(X39,X43)
          & ron(X40,X43) ) ),
    inference(fof_simplification,[status(thm)],['qu(cond(axiom(53), 0), imp(cond(axiom(53), 0)))']) ).

fof(c_0_10,plain,
    ( rpoint(vd1124)
    & vd1123 = vd1124
    & rpoint(vd1126)
    & vd1125 = vd1126
    & rpoint(vd1128)
    & vd1127 = vd1128
    & rpoint(vd1130)
    & vd1129 = vd1130
    & vd1123 != vd1125
    & vd1127 != vd1129
    & rless(vf(vd1127,vd1129),vf(vd1123,vd1125)) ),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

fof(c_0_11,negated_conjecture,
    ! [X739,X740] :
      ( ~ rline(X739)
      | ~ ron(vd1123,X739)
      | ~ ron(vd1125,X739)
      | ~ rcircle(X740)
      | ~ rcenter(vd1123,X740)
      | ~ ron(vd1127,X740) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_12,plain,
    ( ~ rcenter(X1,X2)
    | rcircle(esk8_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ rcenter(X2,X1)
    | X1 = esk8_2(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,plain,
    ! [X777,X778,X779,X780] :
      ( ( ~ rpoint(X780)
        | X777 != X780
        | ~ rpoint(X779)
        | X778 != X779
        | X777 = X778
        | rcircle(esk3_2(X777,X778)) )
      & ( ~ rpoint(X780)
        | X777 != X780
        | ~ rpoint(X779)
        | X778 != X779
        | X777 = X778
        | rcenter(X777,esk3_2(X777,X778)) )
      & ( ~ rpoint(X780)
        | X777 != X780
        | ~ rpoint(X779)
        | X778 != X779
        | X777 = X778
        | ron(X778,esk3_2(X777,X778)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).

cnf(c_0_15,plain,
    vd1129 = vd1130,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    vd1123 = vd1129,
    inference(split_conjunct,[status(thm)],['holds(258, 1150, 0)']) ).

cnf(c_0_17,negated_conjecture,
    ( ~ rline(X2)
    | ~ ron(vd1123,X2)
    | ~ ron(vd1125,X2)
    | ~ rcircle(X1)
    | ~ rcenter(vd1123,X1)
    | ~ ron(vd1127,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( ~ rcenter(X2,X1)
    | rcircle(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ( ~ rpoint(X4)
    | X1 != X4
    | ~ rpoint(X3)
    | X2 != X3
    | X1 = X2
    | rcenter(X1,esk3_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    rpoint(vd1130),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_21,plain,
    vd1130 = vd1123,
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

fof(c_0_22,plain,
    ! [X53,X54] :
      ( ( ? [X56] :
            ( rpoint(X56)
            & X53 = X56 )
        & ? [X55] :
            ( rpoint(X55)
            & X54 = X55 )
        & X53 != X54 )
     => ? [X57] :
          ( rline(X57)
          & ron(X53,X57)
          & ron(X54,X57) ) ),
    inference(fof_simplification,[status(thm)],['qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))']) ).

cnf(c_0_23,negated_conjecture,
    ( ~ ron(vd1125,X1)
    | ~ ron(vd1123,X1)
    | ~ ron(vd1127,X2)
    | ~ rcenter(vd1123,X2)
    | ~ rline(X1) ),
    inference(csr,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,plain,
    ( ~ rpoint(X2)
    | ~ rpoint(X1)
    | rcenter(X1,esk3_2(X1,X2))
    | X1 = X2 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).

cnf(c_0_25,plain,
    rpoint(vd1123),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    ( ~ rpoint(X4)
    | X2 != X4
    | ~ rpoint(X3)
    | X1 != X3
    | X2 = X1
    | ron(X1,esk3_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_27,plain,
    rpoint(vd1128),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_28,plain,
    vd1127 = vd1128,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_29,plain,
    vd1127 != vd1129,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_30,plain,
    ! [X791,X792,X793,X794] :
      ( ( ~ rpoint(X794)
        | X791 != X794
        | ~ rpoint(X793)
        | X792 != X793
        | X791 = X792
        | rline(esk5_2(X791,X792)) )
      & ( ~ rpoint(X794)
        | X791 != X794
        | ~ rpoint(X793)
        | X792 != X793
        | X791 = X792
        | ron(X791,esk5_2(X791,X792)) )
      & ( ~ rpoint(X794)
        | X791 != X794
        | ~ rpoint(X793)
        | X792 != X793
        | X791 = X792
        | ron(X792,esk5_2(X791,X792)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])])]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ ron(vd1125,X2)
    | ~ ron(vd1123,X2)
    | ~ ron(vd1127,esk3_2(vd1123,X1))
    | ~ rline(X2)
    | ~ rpoint(X1)
    | vd1123 = X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

cnf(c_0_32,plain,
    ( ~ rpoint(X1)
    | ~ rpoint(X2)
    | ron(X1,esk3_2(X2,X1))
    | X1 = X2 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).

cnf(c_0_33,plain,
    rpoint(vd1127),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,plain,
    vd1127 != vd1123,
    inference(rw,[status(thm)],[c_0_29,c_0_16]) ).

cnf(c_0_35,plain,
    ( ~ rpoint(X4)
    | X1 != X4
    | ~ rpoint(X3)
    | X2 != X3
    | X1 = X2
    | rline(esk5_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ ron(vd1125,X1)
    | ~ ron(vd1123,X1)
    | ~ rline(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_25])]),c_0_34]) ).

cnf(c_0_37,plain,
    ( ~ rpoint(X2)
    | ~ rpoint(X1)
    | rline(esk5_2(X1,X2))
    | X1 = X2 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])]) ).

cnf(c_0_38,plain,
    ( ~ rpoint(X4)
    | X1 != X4
    | ~ rpoint(X3)
    | X2 != X3
    | X1 = X2
    | ron(X1,esk5_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_39,plain,
    rpoint(vd1126),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_40,plain,
    vd1125 = vd1126,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ ron(vd1125,esk5_2(X1,X2))
    | ~ ron(vd1123,esk5_2(X1,X2))
    | ~ rpoint(X2)
    | ~ rpoint(X1)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    ( ~ rpoint(X2)
    | ~ rpoint(X1)
    | ron(X1,esk5_2(X1,X2))
    | X1 = X2 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_38])]) ).

cnf(c_0_43,plain,
    rpoint(vd1125),
    inference(rw,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,plain,
    ( ~ rpoint(X4)
    | X2 != X4
    | ~ rpoint(X3)
    | X1 != X3
    | X2 = X1
    | ron(X1,esk5_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ ron(vd1123,esk5_2(vd1125,X1))
    | ~ rpoint(X1)
    | vd1125 = X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).

cnf(c_0_46,plain,
    ( ~ rpoint(X1)
    | ~ rpoint(X2)
    | ron(X1,esk5_2(X2,X1))
    | X1 = X2 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]) ).

cnf(c_0_47,plain,
    vd1123 != vd1125,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_25]),c_0_43])]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO284+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.66  % Computer : n016.cluster.edu
% 0.09/0.66  % Model    : x86_64 x86_64
% 0.09/0.66  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.66  % Memory   : 8046.5625MB
% 0.09/0.66  % OS       : Linux 6.8.0-71-generic
% 0.09/0.66  % CPULimit : 300
% 0.09/0.66  % WCLimit  : 300
% 0.09/0.66  % DateTime : Sun Sep 20 15:11:07 UTC 2026
% 0.09/0.66  % CPUTime  : 
% 0.09/0.66  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.71  Running first-order theorem proving
% 0.13/0.71  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
% 0.13/0.80  % Version: 3.5.1
% 0.13/0.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.80  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.80  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.80  % Starting sh5l with 300s (1) cores
% 0.13/0.80  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 309565 completed with status 0
% 0.13/0.80  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.80  % No SInE strategy applied
% 0.13/0.80  % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.13/0.80  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.80  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.80  % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.13/0.80  % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.13/0.80  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.13/0.80  % SubtermCWHack with pid 309572 completed with status 0
% 0.13/0.80  % Result found by SubtermCWHack
% 0.13/0.80  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.80  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.80  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.80  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.80  % No SInE strategy applied
% 0.13/0.80  % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.13/0.80  % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.80  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.80  % Preprocessing time       : 0.007 s
% 0.13/0.80  
% 0.13/0.80  % Proof found!
% 0.13/0.80  % SZS status Theorem
% 0.13/0.80  % SZS output start CNFRefutation
% See solution above
% 0.13/0.80  % Parsed axioms                        : 131
% 0.13/0.80  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.80  % Initial clauses                      : 295
% 0.13/0.80  % Removed in clause preprocessing      : 2
% 0.13/0.80  % Initial clauses in saturation        : 293
% 0.13/0.80  % Processed clauses                    : 248
% 0.13/0.80  % ...of these trivial                  : 17
% 0.13/0.80  % ...subsumed                          : 51
% 0.13/0.80  % ...remaining for further processing  : 180
% 0.13/0.80  % Other redundant clauses eliminated   : 125
% 0.13/0.80  % Clauses deleted for lack of memory   : 0
% 0.13/0.80  % Backward-subsumed                    : 2
% 0.13/0.80  % Backward-rewritten                   : 6
% 0.13/0.80  % Generated clauses                    : 171
% 0.13/0.80  % ...of the previous two non-redundant : 159
% 0.13/0.80  % ...aggressively subsumed             : 0
% 0.13/0.80  % Contextual simplify-reflections      : 5
% 0.13/0.80  % Paramodulations                      : 95
% 0.13/0.80  % Factorizations                       : 0
% 0.13/0.80  % NegExts                              : 0
% 0.13/0.80  % Equation resolutions                 : 128
% 0.13/0.80  % Disequality decompositions           : 0
% 0.13/0.80  % Total rewrite steps                  : 63
% 0.13/0.80  % ...of those cached                   : 51
% 0.13/0.80  % Propositional unsat checks           : 0
% 0.13/0.80  %    Propositional check models        : 0
% 0.13/0.80  %    Propositional check unsatisfiable : 0
% 0.13/0.80  %    Propositional clauses             : 0
% 0.13/0.80  %    Propositional clauses after purity: 0
% 0.13/0.80  %    Propositional unsat core size     : 0
% 0.13/0.80  %    Propositional preprocessing time  : 0.000
% 0.13/0.80  %    Propositional encoding time       : 0.000
% 0.13/0.80  %    Propositional solver time         : 0.000
% 0.13/0.80  %    Success case prop preproc time    : 0.000
% 0.13/0.80  %    Success case prop encoding time   : 0.000
% 0.13/0.80  %    Success case prop solver time     : 0.000
% 0.13/0.80  % Current number of processed clauses  : 105
% 0.13/0.80  %    Positive orientable unit clauses  : 14
% 0.13/0.80  %    Positive unorientable unit clauses: 0
% 0.13/0.80  %    Negative unit clauses             : 5
% 0.13/0.80  %    Non-unit-clauses                  : 86
% 0.13/0.80  % Current number of unprocessed clauses: 194
% 0.13/0.80  % ...number of literals in the above   : 2921
% 0.13/0.80  % Current number of archived formulas  : 0
% 0.13/0.80  % Current number of archived clauses   : 8
% 0.13/0.80  % Clause-clause subsumption calls (NU) : 4973
% 0.13/0.80  % Rec. Clause-clause subsumption calls : 1128
% 0.13/0.80  % Non-unit clause-clause subsumptions  : 45
% 0.13/0.80  % Unit Clause-clause subsumption calls : 7
% 0.13/0.80  % Rewrite failures with RHS unbound    : 0
% 0.13/0.80  % BW rewrite match attempts            : 6
% 0.13/0.80  % BW rewrite match successes           : 6
% 0.13/0.80  % Condensation attempts                : 0
% 0.13/0.80  % Condensation successes               : 0
% 0.13/0.80  % Termbank termtop insertions          : 47667
% 0.13/0.80  % Search garbage collected termcells   : 14086
% 0.13/0.80  
% 0.13/0.80  % -------------------------------------------------
% 0.13/0.80  % User time                : 0.056 s
% 0.13/0.80  % System time              : 0.006 s
% 0.13/0.80  % Total time               : 0.062 s
% 0.13/0.80  % Maximum resident set size: 6224 pages
% 0.13/0.80  
% 0.13/0.80  % -------------------------------------------------
% 0.13/0.80  % User time                : 0.133 s
% 0.13/0.80  % System time              : 0.030 s
% 0.13/0.80  % Total time               : 0.163 s
% 0.13/0.80  % Maximum resident set size: 5376 pages
% 0.13/0.80  % E exiting
%------------------------------------------------------------------------------