TSTP Solution File: SET943+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET943+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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  : 300s
% DateTime : Tue May 21 03:00:30 EDT 2024

% Result   : Theorem 18.75s 2.85s
% Output   : CNFRefutation 18.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   61 (  17 unt;   0 def)
%            Number of atoms       :  180 (  32 equ)
%            Maximal formula atoms :   20 (   2 avg)
%            Number of connectives :  216 (  97   ~;  93   |;  17   &)
%                                         (   6 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :  121 (   6 sgn  57   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t96_zfmisc_1,conjecture,
    ! [X1,X2] : union(set_union2(X1,X2)) = set_union2(union(X1),union(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t96_zfmisc_1) ).

fof(d10_xboole_0,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).

fof(d3_tarski,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(d2_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = set_union2(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            | in(X4,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).

fof(d4_tarski,axiom,
    ! [X1,X2] :
      ( X2 = union(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ? [X4] :
              ( in(X3,X4)
              & in(X4,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).

fof(t8_xboole_1,axiom,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X3,X2) )
     => subset(set_union2(X1,X3),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).

fof(t7_xboole_1,axiom,
    ! [X1,X2] : subset(X1,set_union2(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).

fof(commutativity_k2_xboole_0,axiom,
    ! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).

fof(t95_zfmisc_1,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
     => subset(union(X1),union(X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t95_zfmisc_1) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X1,X2] : union(set_union2(X1,X2)) = set_union2(union(X1),union(X2)),
    inference(assume_negation,[status(cth)],[t96_zfmisc_1]) ).

fof(c_0_10,negated_conjecture,
    union(set_union2(esk8_0,esk9_0)) != set_union2(union(esk8_0),union(esk9_0)),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

fof(c_0_11,plain,
    ! [X9,X10] :
      ( ( subset(X9,X10)
        | X9 != X10 )
      & ( subset(X10,X9)
        | X9 != X10 )
      & ( ~ subset(X9,X10)
        | ~ subset(X10,X9)
        | X9 = X10 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).

cnf(c_0_12,negated_conjecture,
    union(set_union2(esk8_0,esk9_0)) != set_union2(union(esk8_0),union(esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_14,plain,
    ! [X20,X21,X22,X23,X24] :
      ( ( ~ subset(X20,X21)
        | ~ in(X22,X20)
        | in(X22,X21) )
      & ( in(esk2_2(X23,X24),X23)
        | subset(X23,X24) )
      & ( ~ in(esk2_2(X23,X24),X24)
        | subset(X23,X24) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).

fof(c_0_15,plain,
    ! [X11,X12,X13,X14,X15,X16,X17,X18] :
      ( ( ~ in(X14,X13)
        | in(X14,X11)
        | in(X14,X12)
        | X13 != set_union2(X11,X12) )
      & ( ~ in(X15,X11)
        | in(X15,X13)
        | X13 != set_union2(X11,X12) )
      & ( ~ in(X15,X12)
        | in(X15,X13)
        | X13 != set_union2(X11,X12) )
      & ( ~ in(esk1_3(X16,X17,X18),X16)
        | ~ in(esk1_3(X16,X17,X18),X18)
        | X18 = set_union2(X16,X17) )
      & ( ~ in(esk1_3(X16,X17,X18),X17)
        | ~ in(esk1_3(X16,X17,X18),X18)
        | X18 = set_union2(X16,X17) )
      & ( in(esk1_3(X16,X17,X18),X18)
        | in(esk1_3(X16,X17,X18),X16)
        | in(esk1_3(X16,X17,X18),X17)
        | X18 = set_union2(X16,X17) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])])]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ subset(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))
    | ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_17,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( in(X1,X3)
    | ~ in(X1,X2)
    | X3 != set_union2(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_19,plain,
    ! [X26,X27,X28,X30,X31,X32,X33,X35] :
      ( ( in(X28,esk3_3(X26,X27,X28))
        | ~ in(X28,X27)
        | X27 != union(X26) )
      & ( in(esk3_3(X26,X27,X28),X26)
        | ~ in(X28,X27)
        | X27 != union(X26) )
      & ( ~ in(X30,X31)
        | ~ in(X31,X26)
        | in(X30,X27)
        | X27 != union(X26) )
      & ( ~ in(esk4_2(X32,X33),X33)
        | ~ in(esk4_2(X32,X33),X35)
        | ~ in(X35,X32)
        | X33 = union(X32) )
      & ( in(esk4_2(X32,X33),esk5_2(X32,X33))
        | in(esk4_2(X32,X33),X33)
        | X33 = union(X32) )
      & ( in(esk5_2(X32,X33),X32)
        | in(esk4_2(X32,X33),X33)
        | X33 = union(X32) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_tarski])])])])])])]) ).

cnf(c_0_20,plain,
    ( in(X1,X3)
    | ~ in(X1,X2)
    | X3 != set_union2(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),set_union2(union(esk8_0),union(esk9_0))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    ( in(X1,X4)
    | ~ in(X1,X2)
    | ~ in(X2,X3)
    | X4 != union(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,plain,
    ( in(esk2_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_25,plain,
    ! [X47,X48,X49] :
      ( ~ subset(X47,X48)
      | ~ subset(X49,X48)
      | subset(set_union2(X47,X49),X48) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).

fof(c_0_26,plain,
    ! [X45,X46] : subset(X45,set_union2(X45,X46)),
    inference(variable_rename,[status(thm)],[t7_xboole_1]) ).

fof(c_0_27,plain,
    ! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
    inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).

cnf(c_0_28,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(esk8_0)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_30,plain,
    ( in(X1,union(X2))
    | ~ in(X3,X2)
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    ( in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0)))
    | ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_24]) ).

cnf(c_0_32,plain,
    ( subset(set_union2(X1,X3),X2)
    | ~ subset(X1,X2)
    | ~ subset(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

fof(c_0_33,plain,
    ! [X50,X51] :
      ( ~ subset(X50,X51)
      | subset(union(X50),union(X51)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t95_zfmisc_1])])]) ).

cnf(c_0_34,plain,
    subset(X1,set_union2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_35,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(esk9_0)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_28]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk8_0) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_38,negated_conjecture,
    ( in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0)))
    | ~ subset(union(esk9_0),union(set_union2(esk8_0,esk9_0)))
    | ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_39,plain,
    ( subset(union(X1),union(X2))
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_40,plain,
    subset(X1,set_union2(X2,X1)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ subset(set_union2(union(esk8_0),union(esk9_0)),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_36,c_0_30]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ subset(union(esk9_0),union(set_union2(esk8_0,esk9_0)))
    | ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk8_0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_32]) ).

cnf(c_0_43,plain,
    ( in(X1,esk3_3(X2,X3,X1))
    | ~ in(X1,X3)
    | X3 != union(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_44,negated_conjecture,
    ( in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0)))
    | ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ subset(union(esk9_0),union(set_union2(esk8_0,esk9_0)))
    | ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_41,c_0_32]) ).

cnf(c_0_46,plain,
    ( in(esk3_3(X1,X2,X3),X1)
    | ~ in(X3,X2)
    | X2 != union(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_39]),c_0_40])]) ).

cnf(c_0_48,plain,
    ( in(X1,esk3_3(X2,union(X2),X1))
    | ~ in(X1,union(X2)) ),
    inference(er,[status(thm)],[c_0_43]) ).

cnf(c_0_49,negated_conjecture,
    in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),union(set_union2(esk8_0,esk9_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_34])]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ subset(union(esk8_0),union(set_union2(esk8_0,esk9_0)))
    | ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk9_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_40])]) ).

cnf(c_0_51,plain,
    ( in(X1,X3)
    | in(X1,X4)
    | ~ in(X1,X2)
    | X2 != set_union2(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_52,plain,
    ( in(esk3_3(X1,union(X1),X2),X1)
    | ~ in(X2,union(X1)) ),
    inference(er,[status(thm)],[c_0_46]) ).

cnf(c_0_53,negated_conjecture,
    ( ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk8_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_34])]) ).

cnf(c_0_54,negated_conjecture,
    in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))))),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ in(esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0))),X1)
    | ~ in(X1,esk9_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_34])]) ).

cnf(c_0_56,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | ~ in(X1,set_union2(X3,X2)) ),
    inference(er,[status(thm)],[c_0_51]) ).

cnf(c_0_57,negated_conjecture,
    in(esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))),set_union2(esk8_0,esk9_0)),
    inference(spm,[status(thm)],[c_0_52,c_0_49]) ).

cnf(c_0_58,negated_conjecture,
    ~ in(esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))),esk8_0),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_59,negated_conjecture,
    ~ in(esk3_3(set_union2(esk8_0,esk9_0),union(set_union2(esk8_0,esk9_0)),esk2_2(union(set_union2(esk8_0,esk9_0)),set_union2(union(esk8_0),union(esk9_0)))),esk9_0),
    inference(spm,[status(thm)],[c_0_55,c_0_54]) ).

cnf(c_0_60,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET943+1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 12:26:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.75/2.85  # Version: 3.1.0
% 18.75/2.85  # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.75/2.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.75/2.85  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.75/2.85  # Starting new_bool_3 with 300s (1) cores
% 18.75/2.85  # Starting new_bool_1 with 300s (1) cores
% 18.75/2.85  # Starting sh5l with 300s (1) cores
% 18.75/2.85  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2628 completed with status 0
% 18.75/2.85  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.75/2.85  # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.75/2.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.75/2.85  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.75/2.85  # No SInE strategy applied
% 18.75/2.85  # Search class: FGHSM-FFMF32-SFFFFFNN
% 18.75/2.85  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.75/2.85  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 18.75/2.85  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.75/2.85  # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 18.75/2.85  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 18.75/2.85  # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 18.75/2.85  # G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 2638 completed with status 0
% 18.75/2.85  # Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 18.75/2.85  # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.75/2.85  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.75/2.85  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.75/2.85  # No SInE strategy applied
% 18.75/2.85  # Search class: FGHSM-FFMF32-SFFFFFNN
% 18.75/2.85  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.75/2.85  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 18.75/2.85  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.75/2.85  # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 18.75/2.85  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 18.75/2.85  # Preprocessing time       : 0.001 s
% 18.75/2.85  # Presaturation interreduction done
% 18.75/2.85  
% 18.75/2.85  # Proof found!
% 18.75/2.85  # SZS status Theorem
% 18.75/2.85  # SZS output start CNFRefutation
% See solution above
% 18.75/2.85  # Parsed axioms                        : 16
% 18.75/2.85  # Removed by relevancy pruning/SinE    : 0
% 18.75/2.85  # Initial clauses                      : 30
% 18.75/2.85  # Removed in clause preprocessing      : 0
% 18.75/2.85  # Initial clauses in saturation        : 30
% 18.75/2.85  # Processed clauses                    : 7794
% 18.75/2.85  # ...of these trivial                  : 46
% 18.75/2.85  # ...subsumed                          : 5261
% 18.75/2.85  # ...remaining for further processing  : 2486
% 18.75/2.85  # Other redundant clauses eliminated   : 432
% 18.75/2.85  # Clauses deleted for lack of memory   : 0
% 18.75/2.85  # Backward-subsumed                    : 133
% 18.75/2.85  # Backward-rewritten                   : 27
% 18.75/2.85  # Generated clauses                    : 163152
% 18.75/2.85  # ...of the previous two non-redundant : 162063
% 18.75/2.85  # ...aggressively subsumed             : 0
% 18.75/2.85  # Contextual simplify-reflections      : 2
% 18.75/2.85  # Paramodulations                      : 162713
% 18.75/2.85  # Factorizations                       : 6
% 18.75/2.85  # NegExts                              : 0
% 18.75/2.85  # Equation resolutions                 : 433
% 18.75/2.85  # Disequality decompositions           : 0
% 18.75/2.85  # Total rewrite steps                  : 9784
% 18.75/2.85  # ...of those cached                   : 9513
% 18.75/2.85  # Propositional unsat checks           : 0
% 18.75/2.85  #    Propositional check models        : 0
% 18.75/2.85  #    Propositional check unsatisfiable : 0
% 18.75/2.85  #    Propositional clauses             : 0
% 18.75/2.85  #    Propositional clauses after purity: 0
% 18.75/2.85  #    Propositional unsat core size     : 0
% 18.75/2.85  #    Propositional preprocessing time  : 0.000
% 18.75/2.85  #    Propositional encoding time       : 0.000
% 18.75/2.85  #    Propositional solver time         : 0.000
% 18.75/2.85  #    Success case prop preproc time    : 0.000
% 18.75/2.85  #    Success case prop encoding time   : 0.000
% 18.75/2.85  #    Success case prop solver time     : 0.000
% 18.75/2.85  # Current number of processed clauses  : 2290
% 18.75/2.85  #    Positive orientable unit clauses  : 43
% 18.75/2.85  #    Positive unorientable unit clauses: 1
% 18.75/2.85  #    Negative unit clauses             : 117
% 18.75/2.85  #    Non-unit-clauses                  : 2129
% 18.75/2.85  # Current number of unprocessed clauses: 153919
% 18.75/2.85  # ...number of literals in the above   : 743245
% 18.75/2.85  # Current number of archived formulas  : 0
% 18.75/2.85  # Current number of archived clauses   : 188
% 18.75/2.85  # Clause-clause subsumption calls (NU) : 831343
% 18.75/2.85  # Rec. Clause-clause subsumption calls : 442345
% 18.75/2.85  # Non-unit clause-clause subsumptions  : 3936
% 18.75/2.85  # Unit Clause-clause subsumption calls : 12980
% 18.75/2.85  # Rewrite failures with RHS unbound    : 0
% 18.75/2.85  # BW rewrite match attempts            : 110
% 18.75/2.85  # BW rewrite match successes           : 34
% 18.75/2.85  # Condensation attempts                : 0
% 18.75/2.85  # Condensation successes               : 0
% 18.75/2.85  # Termbank termtop insertions          : 3439391
% 18.75/2.85  # Search garbage collected termcells   : 530
% 18.75/2.85  
% 18.75/2.85  # -------------------------------------------------
% 18.75/2.85  # User time                : 2.208 s
% 18.75/2.85  # System time              : 0.080 s
% 18.75/2.85  # Total time               : 2.288 s
% 18.75/2.85  # Maximum resident set size: 1776 pages
% 18.75/2.85  
% 18.75/2.85  # -------------------------------------------------
% 18.75/2.85  # User time                : 11.081 s
% 18.75/2.85  # System time              : 0.429 s
% 18.75/2.85  # Total time               : 11.510 s
% 18.75/2.85  # Maximum resident set size: 1700 pages
% 18.75/2.85  % E---3.1 exiting
%------------------------------------------------------------------------------