↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n011.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 03:53:55 PM UTC 2026

% Result   : Theorem 52.31s 8.45s
% Output   : CNFRefutation 52.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :  227 (   0 equ)
%            Maximal formula atoms :   46 (   6 avg)
%            Number of connectives :  299 ( 106   ~; 117   |;  58   &)
%                                         (   3 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   42 (   0 sgn  23   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t23_tsp_2,conjecture,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m2_tsp_1(X2,X1)
            & v2_tsp_2(X2,X1)
            & ~ v3_struct_0(X2) )
         => r1_borsuk_1(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_tsp_2) ).

fof(t22_tsp_2,axiom,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m2_tsp_1(X2,X1)
            & v2_tsp_2(X2,X1)
            & ~ v3_struct_0(X2) )
         => ? [X3] :
              ( v3_borsuk_1(X3,X1,X2)
              & m2_relset_1(X3,u1_struct_0(X1),u1_struct_0(X2))
              & v5_pre_topc(X3,X1,X2)
              & v1_funct_2(X3,u1_struct_0(X1),u1_struct_0(X2))
              & v1_funct_1(X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_tsp_2) ).

fof(d20_borsuk_1,axiom,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_pre_topc(X2,X1)
            & ~ v3_struct_0(X2) )
         => ( r1_borsuk_1(X1,X2)
          <=> ? [X3] :
                ( v3_borsuk_1(X3,X1,X2)
                & m2_relset_1(X3,u1_struct_0(X1),u1_struct_0(X2))
                & v5_pre_topc(X3,X1,X2)
                & v1_funct_2(X3,u1_struct_0(X1),u1_struct_0(X2))
                & v1_funct_1(X3) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+309.ax',d20_borsuk_1) ).

fof(redefinition_m2_tsp_1,axiom,
    ! [X1] :
      ( l1_pre_topc(X1)
     => ! [X2] :
          ( m2_tsp_1(X2,X1)
        <=> m1_pre_topc(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+406.ax',redefinition_m2_tsp_1) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_pre_topc(X1)
          & v2_pre_topc(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( ( m2_tsp_1(X2,X1)
              & v2_tsp_2(X2,X1)
              & ~ v3_struct_0(X2) )
           => r1_borsuk_1(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[t23_tsp_2]) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m2_tsp_1(X2,X1)
            & v2_tsp_2(X2,X1)
            & ~ v3_struct_0(X2) )
         => ? [X3] :
              ( v3_borsuk_1(X3,X1,X2)
              & m2_relset_1(X3,u1_struct_0(X1),u1_struct_0(X2))
              & v5_pre_topc(X3,X1,X2)
              & v1_funct_2(X3,u1_struct_0(X1),u1_struct_0(X2))
              & v1_funct_1(X3) ) ) ),
    inference(fof_simplification,[status(thm)],[t22_tsp_2]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_pre_topc(X1)
          & v2_pre_topc(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( ( m2_tsp_1(X2,X1)
              & v2_tsp_2(X2,X1)
              & ~ v3_struct_0(X2) )
           => r1_borsuk_1(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ! [X1] :
      ( ( l1_pre_topc(X1)
        & v2_pre_topc(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_pre_topc(X2,X1)
            & ~ v3_struct_0(X2) )
         => ( r1_borsuk_1(X1,X2)
          <=> ? [X3] :
                ( v3_borsuk_1(X3,X1,X2)
                & m2_relset_1(X3,u1_struct_0(X1),u1_struct_0(X2))
                & v5_pre_topc(X3,X1,X2)
                & v1_funct_2(X3,u1_struct_0(X1),u1_struct_0(X2))
                & v1_funct_1(X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[d20_borsuk_1]) ).

fof(c_0_8,plain,
    ! [X149,X150] :
      ( ( ~ l1_pre_topc(X149)
        | ~ v2_pre_topc(X149)
        | v3_struct_0(X149)
        | ~ m2_tsp_1(X150,X149)
        | ~ v2_tsp_2(X150,X149)
        | v3_struct_0(X150)
        | v3_borsuk_1(esk23_2(X149,X150),X149,X150) )
      & ( ~ l1_pre_topc(X149)
        | ~ v2_pre_topc(X149)
        | v3_struct_0(X149)
        | ~ m2_tsp_1(X150,X149)
        | ~ v2_tsp_2(X150,X149)
        | v3_struct_0(X150)
        | m2_relset_1(esk23_2(X149,X150),u1_struct_0(X149),u1_struct_0(X150)) )
      & ( ~ l1_pre_topc(X149)
        | ~ v2_pre_topc(X149)
        | v3_struct_0(X149)
        | ~ m2_tsp_1(X150,X149)
        | ~ v2_tsp_2(X150,X149)
        | v3_struct_0(X150)
        | v5_pre_topc(esk23_2(X149,X150),X149,X150) )
      & ( ~ l1_pre_topc(X149)
        | ~ v2_pre_topc(X149)
        | v3_struct_0(X149)
        | ~ m2_tsp_1(X150,X149)
        | ~ v2_tsp_2(X150,X149)
        | v3_struct_0(X150)
        | v1_funct_2(esk23_2(X149,X150),u1_struct_0(X149),u1_struct_0(X150)) )
      & ( ~ l1_pre_topc(X149)
        | ~ v2_pre_topc(X149)
        | v3_struct_0(X149)
        | ~ m2_tsp_1(X150,X149)
        | ~ v2_tsp_2(X150,X149)
        | v3_struct_0(X150)
        | v1_funct_1(esk23_2(X149,X150)) ) ),
    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_5])])])])])]) ).

fof(c_0_9,negated_conjecture,
    ( ~ r1_borsuk_1(esk1_0,esk2_0)
    & m2_tsp_1(esk2_0,esk1_0)
    & v2_tsp_2(esk2_0,esk1_0)
    & ~ v3_struct_0(esk2_0)
    & l1_pre_topc(esk1_0)
    & v2_pre_topc(esk1_0)
    & ~ v3_struct_0(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_10,plain,
    ! [X64,X65] :
      ( ( ~ l1_pre_topc(X64)
        | m2_tsp_1(X65,X64)
        | ~ m1_pre_topc(X65,X64) )
      & ( ~ l1_pre_topc(X64)
        | m1_pre_topc(X65,X64)
        | ~ m2_tsp_1(X65,X64) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_tsp_1])])])])]) ).

fof(c_0_11,plain,
    ! [X12,X13,X15] :
      ( ( ~ l1_pre_topc(X12)
        | ~ v2_pre_topc(X12)
        | v3_struct_0(X12)
        | ~ m1_pre_topc(X13,X12)
        | v3_struct_0(X13)
        | r1_borsuk_1(X12,X13)
        | ~ v3_borsuk_1(X15,X12,X13)
        | ~ m2_relset_1(X15,u1_struct_0(X12),u1_struct_0(X13))
        | ~ v5_pre_topc(X15,X12,X13)
        | ~ v1_funct_2(X15,u1_struct_0(X12),u1_struct_0(X13))
        | ~ v1_funct_1(X15) )
      & ( ~ l1_pre_topc(X12)
        | ~ v2_pre_topc(X12)
        | v3_struct_0(X12)
        | ~ m1_pre_topc(X13,X12)
        | v3_struct_0(X13)
        | ~ r1_borsuk_1(X12,X13)
        | v3_borsuk_1(esk3_2(X12,X13),X12,X13) )
      & ( ~ l1_pre_topc(X12)
        | ~ v2_pre_topc(X12)
        | v3_struct_0(X12)
        | ~ m1_pre_topc(X13,X12)
        | v3_struct_0(X13)
        | ~ r1_borsuk_1(X12,X13)
        | m2_relset_1(esk3_2(X12,X13),u1_struct_0(X12),u1_struct_0(X13)) )
      & ( ~ l1_pre_topc(X12)
        | ~ v2_pre_topc(X12)
        | v3_struct_0(X12)
        | ~ m1_pre_topc(X13,X12)
        | v3_struct_0(X13)
        | ~ r1_borsuk_1(X12,X13)
        | v5_pre_topc(esk3_2(X12,X13),X12,X13) )
      & ( ~ l1_pre_topc(X12)
        | ~ v2_pre_topc(X12)
        | v3_struct_0(X12)
        | ~ m1_pre_topc(X13,X12)
        | v3_struct_0(X13)
        | ~ r1_borsuk_1(X12,X13)
        | v1_funct_2(esk3_2(X12,X13),u1_struct_0(X12),u1_struct_0(X13)) )
      & ( ~ l1_pre_topc(X12)
        | ~ v2_pre_topc(X12)
        | v3_struct_0(X12)
        | ~ m1_pre_topc(X13,X12)
        | v3_struct_0(X13)
        | ~ r1_borsuk_1(X12,X13)
        | v1_funct_1(esk3_2(X12,X13)) ) ),
    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_7])])])])])]) ).

cnf(c_0_12,plain,
    ( ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m2_tsp_1(X2,X1)
    | ~ v2_tsp_2(X2,X1)
    | v3_struct_0(X1)
    | v3_struct_0(X2)
    | v3_borsuk_1(esk23_2(X1,X2),X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    v2_tsp_2(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    m2_tsp_1(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    v2_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,negated_conjecture,
    l1_pre_topc(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,negated_conjecture,
    ~ v3_struct_0(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,negated_conjecture,
    ~ v3_struct_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,plain,
    ( ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m2_tsp_1(X2,X1)
    | ~ v2_tsp_2(X2,X1)
    | v3_struct_0(X1)
    | v3_struct_0(X2)
    | v5_pre_topc(esk23_2(X1,X2),X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,plain,
    ( ~ l1_pre_topc(X2)
    | ~ m2_tsp_1(X1,X2)
    | m1_pre_topc(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_21,plain,
    ( ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m2_tsp_1(X2,X1)
    | ~ v2_tsp_2(X2,X1)
    | v3_struct_0(X1)
    | v3_struct_0(X2)
    | v1_funct_1(esk23_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_22,plain,
    ( ~ l1_pre_topc(X2)
    | ~ v2_pre_topc(X2)
    | ~ m1_pre_topc(X3,X2)
    | ~ v3_borsuk_1(X1,X2,X3)
    | ~ m2_relset_1(X1,u1_struct_0(X2),u1_struct_0(X3))
    | ~ v5_pre_topc(X1,X2,X3)
    | ~ v1_funct_2(X1,u1_struct_0(X2),u1_struct_0(X3))
    | ~ v1_funct_1(X1)
    | v3_struct_0(X2)
    | v3_struct_0(X3)
    | r1_borsuk_1(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_23,negated_conjecture,
    v3_borsuk_1(esk23_2(esk1_0,esk2_0),esk1_0,esk2_0),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    v5_pre_topc(esk23_2(esk1_0,esk2_0),esk1_0,esk2_0),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    m1_pre_topc(esk2_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_16])]) ).

cnf(c_0_26,negated_conjecture,
    v1_funct_1(esk23_2(esk1_0,esk2_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).

cnf(c_0_27,negated_conjecture,
    ~ r1_borsuk_1(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_28,plain,
    ( ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m2_tsp_1(X2,X1)
    | ~ v2_tsp_2(X2,X1)
    | v3_struct_0(X1)
    | v3_struct_0(X2)
    | v1_funct_2(esk23_2(X1,X2),u1_struct_0(X1),u1_struct_0(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_29,plain,
    ( ~ l1_pre_topc(X1)
    | ~ v2_pre_topc(X1)
    | ~ m2_tsp_1(X2,X1)
    | ~ v2_tsp_2(X2,X1)
    | v3_struct_0(X1)
    | v3_struct_0(X2)
    | m2_relset_1(esk23_2(X1,X2),u1_struct_0(X1),u1_struct_0(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ m2_relset_1(esk23_2(esk1_0,esk2_0),u1_struct_0(esk1_0),u1_struct_0(esk2_0))
    | ~ v1_funct_2(esk23_2(esk1_0,esk2_0),u1_struct_0(esk1_0),u1_struct_0(esk2_0)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_15]),c_0_16]),c_0_26])]),c_0_27]),c_0_17]),c_0_18]) ).

cnf(c_0_31,negated_conjecture,
    v1_funct_2(esk23_2(esk1_0,esk2_0),u1_struct_0(esk1_0),u1_struct_0(esk2_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).

cnf(c_0_32,negated_conjecture,
    m2_relset_1(esk23_2(esk1_0,esk2_0),u1_struct_0(esk1_0),u1_struct_0(esk2_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),c_0_18]) ).

cnf(c_0_33,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_30,c_0_31,c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : TOP034+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n011.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 12:42:27 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  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
% 52.31/8.45  % Version: 3.5.1
% 52.31/8.45  % Preprocessing class: FMLMSMSLSSSNFFN.
% 52.31/8.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.31/8.45  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 52.31/8.45  % Starting new_bool_3 with 600s (2) cores
% 52.31/8.45  % Starting new_bool_1 with 600s (2) cores
% 52.31/8.45  % Starting sh5l with 300s (1) cores
% 52.31/8.45  % new_bool_3 with pid 1915024 completed with status 0
% 52.31/8.45  % Result found by new_bool_3
% 52.31/8.45  % Preprocessing class: FMLMSMSLSSSNFFN.
% 52.31/8.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.31/8.45  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 52.31/8.45  % Starting new_bool_3 with 600s (2) cores
% 52.31/8.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 52.31/8.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 52.31/8.45  % Search class: FGHSM-SMLM32-MFFFFFNN
% 52.31/8.45  % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 52.31/8.45  % Starting SubtermCWHack with 55s (1) cores
% 52.31/8.45  % Starting new_bool_3 with 61s (1) cores
% 52.31/8.45  % new_bool_3 with pid 1915032 completed with status 0
% 52.31/8.45  % Result found by new_bool_3
% 52.31/8.45  % Preprocessing class: FMLMSMSLSSSNFFN.
% 52.31/8.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.31/8.45  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 52.31/8.45  % Starting new_bool_3 with 600s (2) cores
% 52.31/8.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 52.31/8.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 52.31/8.45  % Search class: FGHSM-SMLM32-MFFFFFNN
% 52.31/8.45  % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 52.31/8.45  % Starting SubtermCWHack with 55s (1) cores
% 52.31/8.45  % Starting new_bool_3 with 61s (1) cores
% 52.31/8.45  % Preprocessing time       : 0.075 s
% 52.31/8.45  % Presaturation interreduction done
% 52.31/8.45  % SatCheck found unsatisfiable ground set
% 52.31/8.45  
% 52.31/8.45  % Proof found!
% 52.31/8.45  % SZS status Theorem
% 52.31/8.45  % SZS output start CNFRefutation
% See solution above
% 52.31/8.45  % Parsed axioms                        : 3619
% 52.31/8.45  % Removed by relevancy pruning/SinE    : 2406
% 52.31/8.45  % Initial clauses                      : 3313
% 52.31/8.45  % Removed in clause preprocessing      : 156
% 52.31/8.45  % Initial clauses in saturation        : 3157
% 52.31/8.45  % Processed clauses                    : 28654
% 52.31/8.45  % ...of these trivial                  : 220
% 52.31/8.45  % ...subsumed                          : 18434
% 52.31/8.45  % ...remaining for further processing  : 10000
% 52.31/8.45  % Other redundant clauses eliminated   : 1030
% 52.31/8.45  % Clauses deleted for lack of memory   : 0
% 52.31/8.45  % Backward-subsumed                    : 270
% 52.31/8.45  % Backward-rewritten                   : 274
% 52.31/8.45  % Generated clauses                    : 101451
% 52.31/8.45  % ...of the previous two non-redundant : 90462
% 52.31/8.45  % ...aggressively subsumed             : 0
% 52.31/8.45  % Contextual simplify-reflections      : 498
% 52.31/8.45  % Paramodulations                      : 100358
% 52.31/8.45  % Factorizations                       : 21
% 52.31/8.45  % NegExts                              : 0
% 52.31/8.45  % Equation resolutions                 : 1077
% 52.31/8.45  % Disequality decompositions           : 0
% 52.31/8.45  % Total rewrite steps                  : 33044
% 52.31/8.45  % ...of those cached                   : 30149
% 52.31/8.45  % Propositional unsat checks           : 2
% 52.31/8.45  %    Propositional check models        : 1
% 52.31/8.45  %    Propositional check unsatisfiable : 1
% 52.31/8.45  %    Propositional clauses             : 73971
% 52.31/8.45  %    Propositional clauses after purity: 9413
% 52.31/8.45  %    Propositional unsat core size     : 3
% 52.31/8.45  %    Propositional preprocessing time  : 0.000
% 52.31/8.45  %    Propositional encoding time       : 0.136
% 52.31/8.45  %    Propositional solver time         : 0.040
% 52.31/8.45  %    Success case prop preproc time    : 0.000
% 52.31/8.45  %    Success case prop encoding time   : 0.107
% 52.31/8.45  %    Success case prop solver time     : 0.016
% 52.31/8.45  % Current number of processed clauses  : 6473
% 52.31/8.45  %    Positive orientable unit clauses  : 636
% 52.31/8.45  %    Positive unorientable unit clauses: 2
% 52.31/8.45  %    Negative unit clauses             : 735
% 52.31/8.45  %    Non-unit-clauses                  : 5100
% 52.31/8.45  % Current number of unprocessed clauses: 67498
% 52.31/8.45  % ...number of literals in the above   : 275037
% 52.31/8.45  % Current number of archived formulas  : 0
% 52.31/8.45  % Current number of archived clauses   : 3318
% 52.31/8.45  % Clause-clause subsumption calls (NU) : 14305436
% 52.31/8.45  % Rec. Clause-clause subsumption calls : 1746084
% 52.31/8.45  % Non-unit clause-clause subsumptions  : 6757
% 52.31/8.45  % Unit Clause-clause subsumption calls : 213958
% 52.31/8.45  % Rewrite failures with RHS unbound    : 0
% 52.31/8.45  % BW rewrite match attempts            : 314
% 52.31/8.45  % BW rewrite match successes           : 224
% 52.31/8.45  % Condensation attempts                : 0
% 52.31/8.45  % Condensation successes               : 0
% 52.31/8.45  % Termbank termtop insertions          : 2469796
% 52.31/8.45  % Search garbage collected termcells   : 84471
% 52.31/8.45  
% 52.31/8.45  % -------------------------------------------------
% 52.31/8.45  % User time                : 7.465 s
% 52.31/8.45  % System time              : 0.141 s
% 52.31/8.45  % Total time               : 7.606 s
% 52.31/8.45  % Maximum resident set size: 17840 pages
% 52.31/8.45  
% 52.31/8.45  % -------------------------------------------------
% 52.31/8.45  % User time                : 15.040 s
% 52.31/8.45  % System time              : 0.299 s
% 52.31/8.45  % Total time               : 15.339 s
% 52.31/8.45  % Maximum resident set size: 9216 pages
% 52.31/8.45  % E exiting
%------------------------------------------------------------------------------