↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n012.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:22 PM UTC 2026

% Result   : Theorem 5.84s 1.23s
% Output   : CNFRefutation 5.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   55 (  21 unt;   0 def)
%            Number of atoms       :  189 (  34 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  267 ( 133   ~; 128   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-5 aty)
%            Number of variables   :  162 (   0 sgn  98   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(aSatz8_24a,axiom,
    ! [X13,X12,X15,X16,X36,X27,X34] :
      ( s_m(X12,X34,X15)
      | X34 != ip(X13,X36,X16,X15,X27)
      | ~ s_e(X12,X13,X15,X27)
      | ~ s_t(X15,X27,X16)
      | ~ s_t(X13,X36,X16)
      | ~ s_col(X12,X15,X36)
      | ~ perp(X16,X15,X12,X15)
      | ~ perp(X13,X12,X12,X15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz8_24a) ).

fof(aSatz8_24,conjecture,
    ! [X13,X12,X15,X16,X36,X27] :
      ( s_m(X13,midpoint(X12,X15),X27)
      | ~ s_e(X12,X13,X15,X27)
      | ~ s_t(X15,X27,X16)
      | ~ s_t(X13,X36,X16)
      | ~ s_col(X12,X15,X36)
      | ~ perp(X16,X15,X12,X15)
      | ~ perp(X13,X12,X12,X15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz8_24) ).

fof(aSatz8_24b,axiom,
    ! [X13,X12,X15,X16,X36,X27,X34] :
      ( s_m(X13,X34,X27)
      | X34 != ip(X13,X36,X16,X15,X27)
      | ~ s_e(X12,X13,X15,X27)
      | ~ s_t(X15,X27,X16)
      | ~ s_t(X13,X36,X16)
      | ~ s_col(X12,X15,X36)
      | ~ perp(X16,X15,X12,X15)
      | ~ perp(X13,X12,X12,X15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz8_24b) ).

fof(aSatz7_18,axiom,
    ! [X12,X13,X15] :
      ( X12 = X15
      | s(X12,X13) != s(X15,X13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_18) ).

fof(aSatz7_6,axiom,
    ! [X13,X12,X16] :
      ( X16 = s(X12,X13)
      | ~ s_m(X13,X12,X16) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_6) ).

fof(aSatz7_7,axiom,
    ! [X12,X13] : s(X12,s(X12,X13)) = X13,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_7) ).

fof(aSatz8_22,axiom,
    ! [X12,X15] : s_m(X12,midpoint(X12,X15),X15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz8_22) ).

fof(aSatz7_17,axiom,
    ! [X13,X12,X16,X15] :
      ( X12 = X15
      | ~ s_m(X13,X15,X16)
      | ~ s_m(X13,X12,X16) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSatz7_17) ).

fof(c_0_8,plain,
    ! [X13,X12,X15,X16,X36,X27,X34] :
      ( s_m(X12,X34,X15)
      | X34 != ip(X13,X36,X16,X15,X27)
      | ~ s_e(X12,X13,X15,X27)
      | ~ s_t(X15,X27,X16)
      | ~ s_t(X13,X36,X16)
      | ~ s_col(X12,X15,X36)
      | ~ perp(X16,X15,X12,X15)
      | ~ perp(X13,X12,X12,X15) ),
    inference(fof_simplification,[status(thm)],[aSatz8_24a]) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X13,X12,X15,X16,X36,X27] :
        ( s_m(X13,midpoint(X12,X15),X27)
        | ~ s_e(X12,X13,X15,X27)
        | ~ s_t(X15,X27,X16)
        | ~ s_t(X13,X36,X16)
        | ~ s_col(X12,X15,X36)
        | ~ perp(X16,X15,X12,X15)
        | ~ perp(X13,X12,X12,X15) ),
    inference(assume_negation,[status(cth)],[aSatz8_24]) ).

fof(c_0_10,plain,
    ! [X13,X12,X15,X16,X36,X27,X34] :
      ( s_m(X13,X34,X27)
      | X34 != ip(X13,X36,X16,X15,X27)
      | ~ s_e(X12,X13,X15,X27)
      | ~ s_t(X15,X27,X16)
      | ~ s_t(X13,X36,X16)
      | ~ s_col(X12,X15,X36)
      | ~ perp(X16,X15,X12,X15)
      | ~ perp(X13,X12,X12,X15) ),
    inference(fof_simplification,[status(thm)],[aSatz8_24b]) ).

fof(c_0_11,plain,
    ! [X605,X606,X607,X608,X609,X610,X611] :
      ( s_m(X606,X611,X607)
      | X611 != ip(X605,X609,X608,X607,X610)
      | ~ s_e(X606,X605,X607,X610)
      | ~ s_t(X607,X610,X608)
      | ~ s_t(X605,X609,X608)
      | ~ s_col(X606,X607,X609)
      | ~ perp(X608,X607,X606,X607)
      | ~ perp(X605,X606,X606,X607) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X13,X12,X15,X16,X36,X27] :
        ( s_m(X13,midpoint(X12,X15),X27)
        | ~ s_e(X12,X13,X15,X27)
        | ~ s_t(X15,X27,X16)
        | ~ s_t(X13,X36,X16)
        | ~ s_col(X12,X15,X36)
        | ~ perp(X16,X15,X12,X15)
        | ~ perp(X13,X12,X12,X15) ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X612,X613,X614,X615,X616,X617,X618] :
      ( s_m(X612,X618,X617)
      | X618 != ip(X612,X616,X615,X614,X617)
      | ~ s_e(X613,X612,X614,X617)
      | ~ s_t(X614,X617,X615)
      | ~ s_t(X612,X616,X615)
      | ~ s_col(X613,X614,X616)
      | ~ perp(X615,X614,X613,X614)
      | ~ perp(X612,X613,X613,X614) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).

cnf(c_0_14,plain,
    ( X7 != ip(X1,X5,X4,X3,X6)
    | ~ s_e(X2,X1,X3,X6)
    | ~ s_t(X3,X6,X4)
    | ~ s_t(X1,X5,X4)
    | ~ s_col(X2,X3,X5)
    | ~ perp(X4,X3,X2,X3)
    | ~ perp(X1,X2,X2,X3)
    | s_m(X2,X7,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_15,negated_conjecture,
    ( ~ s_m(esk1_0,midpoint(esk2_0,esk3_0),esk6_0)
    & s_e(esk2_0,esk1_0,esk3_0,esk6_0)
    & s_t(esk3_0,esk6_0,esk4_0)
    & s_t(esk1_0,esk5_0,esk4_0)
    & s_col(esk2_0,esk3_0,esk5_0)
    & perp(esk4_0,esk3_0,esk2_0,esk3_0)
    & perp(esk1_0,esk2_0,esk2_0,esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

fof(c_0_16,plain,
    ! [X12,X13,X15] :
      ( X12 = X15
      | s(X12,X13) != s(X15,X13) ),
    inference(fof_simplification,[status(thm)],[aSatz7_18]) ).

fof(c_0_17,plain,
    ! [X13,X12,X16] :
      ( X16 = s(X12,X13)
      | ~ s_m(X13,X12,X16) ),
    inference(fof_simplification,[status(thm)],[aSatz7_6]) ).

cnf(c_0_18,plain,
    ( X7 != ip(X1,X5,X4,X3,X6)
    | ~ s_e(X2,X1,X3,X6)
    | ~ s_t(X3,X6,X4)
    | ~ s_t(X1,X5,X4)
    | ~ s_col(X2,X3,X5)
    | ~ perp(X4,X3,X2,X3)
    | ~ perp(X1,X2,X2,X3)
    | s_m(X1,X7,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( ~ s_e(X1,X2,X5,X6)
    | ~ s_t(X2,X3,X4)
    | ~ s_t(X5,X6,X4)
    | ~ s_col(X1,X5,X3)
    | ~ perp(X2,X1,X1,X5)
    | ~ perp(X4,X5,X1,X5)
    | s_m(X1,ip(X2,X3,X4,X5,X6),X5) ),
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    perp(esk4_0,esk3_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_21,plain,
    ! [X450,X451,X452] :
      ( X450 = X452
      | s(X450,X451) != s(X452,X451) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).

fof(c_0_22,plain,
    ! [X412,X413] : s(X412,s(X412,X413)) = X413,
    inference(variable_rename,[status(thm)],[aSatz7_7]) ).

fof(c_0_23,plain,
    ! [X409,X410,X411] :
      ( X411 = s(X410,X409)
      | ~ s_m(X409,X410,X411) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).

fof(c_0_24,plain,
    ! [X603,X604] : s_m(X603,midpoint(X603,X604),X604),
    inference(variable_rename,[status(thm)],[aSatz8_22]) ).

cnf(c_0_25,plain,
    ( ~ s_e(X6,X1,X4,X5)
    | ~ s_t(X1,X2,X3)
    | ~ s_t(X4,X5,X3)
    | ~ s_col(X6,X4,X2)
    | ~ perp(X1,X6,X6,X4)
    | ~ perp(X3,X4,X6,X4)
    | s_m(X1,ip(X1,X2,X3,X4,X5),X5) ),
    inference(er,[status(thm)],[c_0_18]) ).

fof(c_0_26,plain,
    ! [X13,X12,X16,X15] :
      ( X12 = X15
      | ~ s_m(X13,X15,X16)
      | ~ s_m(X13,X12,X16) ),
    inference(fof_simplification,[status(thm)],[aSatz7_17]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ s_e(esk2_0,X1,esk3_0,X3)
    | ~ s_t(X1,X2,esk4_0)
    | ~ s_t(esk3_0,X3,esk4_0)
    | ~ s_col(esk2_0,esk3_0,X2)
    | ~ perp(X1,esk2_0,esk2_0,esk3_0)
    | s_m(esk2_0,ip(X1,X2,esk4_0,esk3_0,X3),esk3_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    s_col(esk2_0,esk3_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_29,plain,
    ( s(X1,X2) != s(X3,X2)
    | X1 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_30,plain,
    s(X1,s(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_31,plain,
    ( ~ s_m(X1,X2,X3)
    | X3 = s(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_32,plain,
    s_m(X1,midpoint(X1,X2),X2),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ s_e(esk2_0,X1,esk3_0,X3)
    | ~ s_t(X1,X2,esk4_0)
    | ~ s_t(esk3_0,X3,esk4_0)
    | ~ s_col(esk2_0,esk3_0,X2)
    | ~ perp(X1,esk2_0,esk2_0,esk3_0)
    | s_m(X1,ip(X1,X2,esk4_0,esk3_0,X3),X3) ),
    inference(spm,[status(thm)],[c_0_25,c_0_20]) ).

fof(c_0_34,plain,
    ! [X446,X447,X448,X449] :
      ( X447 = X449
      | ~ s_m(X446,X449,X448)
      | ~ s_m(X446,X447,X448) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ s_e(esk2_0,X1,esk3_0,X2)
    | ~ s_t(X1,esk5_0,esk4_0)
    | ~ s_t(esk3_0,X2,esk4_0)
    | ~ perp(X1,esk2_0,esk2_0,esk3_0)
    | s_m(esk2_0,ip(X1,esk5_0,esk4_0,esk3_0,X2),esk3_0) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_36,negated_conjecture,
    s_t(esk3_0,esk6_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_37,plain,
    ( s(X1,s(X2,X3)) != X3
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_38,plain,
    s(midpoint(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ s_e(esk2_0,X1,esk3_0,X2)
    | ~ s_t(X1,esk5_0,esk4_0)
    | ~ s_t(esk3_0,X2,esk4_0)
    | ~ perp(X1,esk2_0,esk2_0,esk3_0)
    | s_m(X1,ip(X1,esk5_0,esk4_0,esk3_0,X2),X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_28]) ).

cnf(c_0_40,plain,
    ( ~ s_m(X1,X4,X3)
    | ~ s_m(X1,X2,X3)
    | X2 = X4 ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ s_e(esk2_0,X1,esk3_0,esk6_0)
    | ~ s_t(X1,esk5_0,esk4_0)
    | ~ perp(X1,esk2_0,esk2_0,esk3_0)
    | s_m(esk2_0,ip(X1,esk5_0,esk4_0,esk3_0,esk6_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_42,negated_conjecture,
    s_t(esk1_0,esk5_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_43,negated_conjecture,
    perp(esk1_0,esk2_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_44,negated_conjecture,
    s_e(esk2_0,esk1_0,esk3_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_45,plain,
    midpoint(s(X1,X2),X2) = X1,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38])]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ s_e(esk2_0,X1,esk3_0,esk6_0)
    | ~ s_t(X1,esk5_0,esk4_0)
    | ~ perp(X1,esk2_0,esk2_0,esk3_0)
    | s_m(X1,ip(X1,esk5_0,esk4_0,esk3_0,esk6_0),esk6_0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_36]) ).

cnf(c_0_47,plain,
    ( ~ s_m(X2,X1,X3)
    | X1 = midpoint(X2,X3) ),
    inference(spm,[status(thm)],[c_0_40,c_0_32]) ).

cnf(c_0_48,negated_conjecture,
    s_m(esk2_0,ip(esk1_0,esk5_0,esk4_0,esk3_0,esk6_0),esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44])]) ).

cnf(c_0_49,plain,
    midpoint(X1,X2) = midpoint(X2,X1),
    inference(spm,[status(thm)],[c_0_45,c_0_38]) ).

cnf(c_0_50,negated_conjecture,
    ~ s_m(esk1_0,midpoint(esk2_0,esk3_0),esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_51,negated_conjecture,
    s_m(esk1_0,ip(esk1_0,esk5_0,esk4_0,esk3_0,esk6_0),esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_43]),c_0_44])]) ).

cnf(c_0_52,negated_conjecture,
    ip(esk1_0,esk5_0,esk4_0,esk3_0,esk6_0) = midpoint(esk3_0,esk2_0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).

cnf(c_0_53,negated_conjecture,
    ~ s_m(esk1_0,midpoint(esk3_0,esk2_0),esk6_0),
    inference(rw,[status(thm)],[c_0_50,c_0_49]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : GEO511+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Sun Sep 20 17:04:07 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32  Running first-order theorem proving
% 0.04/0.32  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 5.84/1.23  % Version: 3.5.1
% 5.84/1.23  % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.84/1.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.84/1.23  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.84/1.23  % Starting new_bool_3 with 300s (1) cores
% 5.84/1.23  % Starting new_bool_1 with 300s (1) cores
% 5.84/1.23  % Starting sh5l with 300s (1) cores
% 5.84/1.23  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 511306 completed with status 0
% 5.84/1.23  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 5.84/1.23  % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.84/1.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.84/1.23  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.84/1.23  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.84/1.23  % No SInE strategy applied
% 5.84/1.23  % Search class: FGHSM-FSLM33-MFFFFFNN
% 5.84/1.23  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.84/1.23  % Starting SubtermCWHack with 136s (1) cores
% 5.84/1.23  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.84/1.23  % Starting new_bool_3 with 393s (1) cores
% 5.84/1.23  % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 5.84/1.23  % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 5.84/1.23  % Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 511317 completed with status 0
% 5.84/1.23  % Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 5.84/1.23  % Preprocessing class: FSLSSMSSSSSNFFN.
% 5.84/1.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.84/1.23  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 5.84/1.23  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.84/1.23  % No SInE strategy applied
% 5.84/1.23  % Search class: FGHSM-FSLM33-MFFFFFNN
% 5.84/1.23  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.84/1.23  % Starting SubtermCWHack with 136s (1) cores
% 5.84/1.23  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 5.84/1.23  % Starting new_bool_3 with 393s (1) cores
% 5.84/1.23  % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 5.84/1.23  % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 5.84/1.23  % Preprocessing time       : 0.002 s
% 5.84/1.23  % Presaturation interreduction done
% 5.84/1.23  
% 5.84/1.23  % Proof found!
% 5.84/1.23  % SZS status Theorem
% 5.84/1.23  % SZS output start CNFRefutation
% See solution above
% 5.84/1.23  % Parsed axioms                        : 162
% 5.84/1.23  % Removed by relevancy pruning/SinE    : 0
% 5.84/1.23  % Initial clauses                      : 241
% 5.84/1.23  % Removed in clause preprocessing      : 1
% 5.84/1.23  % Initial clauses in saturation        : 240
% 5.84/1.23  % Processed clauses                    : 2989
% 5.84/1.23  % ...of these trivial                  : 233
% 5.84/1.23  % ...subsumed                          : 1182
% 5.84/1.23  % ...remaining for further processing  : 1574
% 5.84/1.23  % Other redundant clauses eliminated   : 37
% 5.84/1.23  % Clauses deleted for lack of memory   : 0
% 5.84/1.23  % Backward-subsumed                    : 9
% 5.84/1.23  % Backward-rewritten                   : 103
% 5.84/1.23  % Generated clauses                    : 16333
% 5.84/1.23  % ...of the previous two non-redundant : 13955
% 5.84/1.23  % ...aggressively subsumed             : 0
% 5.84/1.23  % Contextual simplify-reflections      : 7
% 5.84/1.23  % Paramodulations                      : 16283
% 5.84/1.23  % Factorizations                       : 6
% 5.84/1.23  % NegExts                              : 0
% 5.84/1.23  % Equation resolutions                 : 44
% 5.84/1.23  % Disequality decompositions           : 0
% 5.84/1.23  % Total rewrite steps                  : 4235
% 5.84/1.23  % ...of those cached                   : 3347
% 5.84/1.23  % Propositional unsat checks           : 0
% 5.84/1.23  %    Propositional check models        : 0
% 5.84/1.23  %    Propositional check unsatisfiable : 0
% 5.84/1.23  %    Propositional clauses             : 0
% 5.84/1.23  %    Propositional clauses after purity: 0
% 5.84/1.23  %    Propositional unsat core size     : 0
% 5.84/1.23  %    Propositional preprocessing time  : 0.000
% 5.84/1.23  %    Propositional encoding time       : 0.000
% 5.84/1.23  %    Propositional solver time         : 0.000
% 5.84/1.23  %    Success case prop preproc time    : 0.000
% 5.84/1.23  %    Success case prop encoding time   : 0.000
% 5.84/1.23  %    Success case prop solver time     : 0.000
% 5.84/1.23  % Current number of processed clauses  : 1226
% 5.84/1.23  %    Positive orientable unit clauses  : 253
% 5.84/1.23  %    Positive unorientable unit clauses: 1
% 5.84/1.23  %    Negative unit clauses             : 20
% 5.84/1.23  %    Non-unit-clauses                  : 952
% 5.84/1.23  % Current number of unprocessed clauses: 11328
% 5.84/1.23  % ...number of literals in the above   : 66238
% 5.84/1.23  % Current number of archived formulas  : 0
% 5.84/1.23  % Current number of archived clauses   : 337
% 5.84/1.23  % Clause-clause subsumption calls (NU) : 621476
% 5.84/1.23  % Rec. Clause-clause subsumption calls : 34669
% 5.84/1.23  % Non-unit clause-clause subsumptions  : 1184
% 5.84/1.23  % Unit Clause-clause subsumption calls : 53173
% 5.84/1.23  % Rewrite failures with RHS unbound    : 0
% 5.84/1.23  % BW rewrite match attempts            : 6447
% 5.84/1.23  % BW rewrite match successes           : 81
% 5.84/1.23  % Condensation attempts                : 0
% 5.84/1.23  % Condensation successes               : 0
% 5.84/1.23  % Termbank termtop insertions          : 1615468
% 5.84/1.23  % Search garbage collected termcells   : 1852
% 5.84/1.23  
% 5.84/1.23  % -------------------------------------------------
% 5.84/1.23  % User time                : 0.744 s
% 5.84/1.23  % System time              : 0.024 s
% 5.84/1.23  % Total time               : 0.768 s
% 5.84/1.23  % Maximum resident set size: 4696 pages
% 5.84/1.23  
% 5.84/1.23  % -------------------------------------------------
% 5.84/1.23  % User time                : 3.908 s
% 5.84/1.23  % System time              : 0.168 s
% 5.84/1.23  % Total time               : 4.077 s
% 5.84/1.23  % Maximum resident set size: 4864 pages
% 5.84/1.23  % E exiting
%------------------------------------------------------------------------------