TSTP Solution File: SET831-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET831-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% 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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:21:00 EDT 2023

% Result   : Unsatisfiable 298.32s 41.33s
% Output   : CNFRefutation 298.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   70 (  16 unt;  16 nHn;  54 RR)
%            Number of literals    :  156 (  32 equ;  75 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :  103 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OIntE_1,axiom,
    ( c_in(X1,X2,X4)
    | ~ c_in(X1,c_inter(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_OIntE_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    ( v_X = c_inter(v_Y,v_Z,t_a)
    | c_lessequals(v_X,v_Y,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_conjecture_0) ).

cnf(cls_Set_OsubsetD_0,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_OsubsetD_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OIntE_0,axiom,
    ( c_in(X1,X3,X4)
    | ~ c_in(X1,c_inter(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_OIntE_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( v_X = c_inter(v_Y,v_Z,t_a)
    | c_lessequals(v_X,v_Z,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_conjecture_1) ).

cnf(cls_Set_OIntI_0,axiom,
    ( c_in(X1,c_inter(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_in(X1,X4,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_OIntI_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    ( c_lessequals(v_x,v_Y,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | v_X != c_inter(v_Y,v_Z,t_a) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_conjecture_2) ).

cnf(cls_Set_Osubset__antisym_0,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ( c_lessequals(v_x,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | v_X != c_inter(v_Y,v_Z,t_a) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_conjecture_3) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( v_X = c_inter(v_Y,v_Z,t_a)
    | c_lessequals(X1,v_X,tc_set(t_a))
    | ~ c_lessequals(X1,v_Z,tc_set(t_a))
    | ~ c_lessequals(X1,v_Y,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_conjecture_5) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( ~ c_lessequals(v_x,v_X,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | v_X != c_inter(v_Y,v_Z,t_a) ),
    file('/export/starexec/sandbox2/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p',cls_conjecture_4) ).

cnf(c_0_13,axiom,
    ( c_in(X1,X2,X4)
    | ~ c_in(X1,c_inter(X2,X3,X4),X4) ),
    cls_Set_OIntE_1 ).

cnf(c_0_14,negated_conjecture,
    ( v_X = c_inter(v_Y,v_Z,t_a)
    | c_lessequals(v_X,v_Y,tc_set(t_a)) ),
    cls_conjecture_0 ).

cnf(c_0_15,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    cls_Set_OsubsetD_0 ).

cnf(c_0_16,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    cls_Set_OsubsetI_1 ).

cnf(c_0_17,negated_conjecture,
    ( c_in(X1,v_Y,t_a)
    | ~ c_in(X1,v_X,t_a) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_18,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    cls_Set_OsubsetI_0 ).

cnf(c_0_19,axiom,
    ( c_in(X1,X3,X4)
    | ~ c_in(X1,c_inter(X2,X3,X4),X4) ),
    cls_Set_OIntE_0 ).

cnf(c_0_20,negated_conjecture,
    ( v_X = c_inter(v_Y,v_Z,t_a)
    | c_lessequals(v_X,v_Z,tc_set(t_a)) ),
    cls_conjecture_1 ).

cnf(c_0_21,negated_conjecture,
    ( c_lessequals(X1,v_Y,tc_set(t_a))
    | ~ c_in(c_Main_OsubsetI__1(X1,v_Y,t_a),v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    ( c_lessequals(c_inter(X1,X2,X3),X4,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(c_inter(X1,X2,X3),X4,X3),X1,X3) ),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_23,axiom,
    ( c_in(X1,c_inter(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_in(X1,X4,X3) ),
    cls_Set_OIntI_0 ).

cnf(c_0_24,negated_conjecture,
    ( c_in(X1,v_Z,t_a)
    | ~ c_in(X1,v_X,t_a) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    c_lessequals(c_inter(v_X,X1,t_a),v_Y,tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    ( c_lessequals(X1,c_inter(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_inter(X2,X3,X4),X4),X2,X4)
    | ~ c_in(c_Main_OsubsetI__1(X1,c_inter(X2,X3,X4),X4),X3,X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ( c_lessequals(X1,v_Z,tc_set(t_a))
    | ~ c_in(c_Main_OsubsetI__1(X1,v_Z,t_a),v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_16,c_0_24]) ).

cnf(c_0_28,plain,
    ( c_lessequals(c_inter(X1,X2,X3),X4,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(c_inter(X1,X2,X3),X4,X3),X2,X3) ),
    inference(spm,[status(thm)],[c_0_19,c_0_18]) ).

cnf(c_0_29,negated_conjecture,
    ( c_in(X1,v_Y,t_a)
    | ~ c_in(X1,c_inter(v_X,X2,t_a),t_a) ),
    inference(spm,[status(thm)],[c_0_15,c_0_25]) ).

cnf(c_0_30,plain,
    ( c_lessequals(X1,c_inter(X1,X2,X3),tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_inter(X1,X2,X3),X3),X2,X3) ),
    inference(spm,[status(thm)],[c_0_26,c_0_18]) ).

cnf(c_0_31,negated_conjecture,
    ( c_lessequals(v_x,v_Y,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | v_X != c_inter(v_Y,v_Z,t_a) ),
    cls_conjecture_2 ).

cnf(c_0_32,negated_conjecture,
    c_lessequals(v_X,v_Z,tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_27,c_0_18]) ).

cnf(c_0_33,negated_conjecture,
    c_lessequals(c_inter(v_X,X1,t_a),v_Z,tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_27,c_0_22]) ).

cnf(c_0_34,plain,
    ( c_lessequals(c_inter(X1,X2,X3),c_inter(X2,X4,X3),tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(c_inter(X1,X2,X3),c_inter(X2,X4,X3),X3),X4,X3) ),
    inference(spm,[status(thm)],[c_0_26,c_0_28]) ).

cnf(c_0_35,negated_conjecture,
    ( c_lessequals(c_inter(v_X,X1,t_a),X2,tc_set(t_a))
    | c_in(c_Main_OsubsetI__1(c_inter(v_X,X1,t_a),X2,t_a),v_Y,t_a) ),
    inference(spm,[status(thm)],[c_0_29,c_0_18]) ).

cnf(c_0_36,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    cls_Set_Osubset__antisym_0 ).

cnf(c_0_37,plain,
    c_lessequals(X1,c_inter(X1,X1,X2),tc_set(X2)),
    inference(spm,[status(thm)],[c_0_30,c_0_18]) ).

cnf(c_0_38,plain,
    c_lessequals(c_inter(X1,X2,X3),X1,tc_set(X3)),
    inference(spm,[status(thm)],[c_0_16,c_0_22]) ).

cnf(c_0_39,negated_conjecture,
    ( c_lessequals(v_x,v_Y,tc_set(t_a))
    | c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).

cnf(c_0_40,negated_conjecture,
    c_lessequals(v_X,v_Y,tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_21,c_0_18]) ).

cnf(c_0_41,negated_conjecture,
    ( c_lessequals(v_x,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | v_X != c_inter(v_Y,v_Z,t_a) ),
    cls_conjecture_3 ).

cnf(c_0_42,negated_conjecture,
    ( v_X = c_inter(v_Y,v_Z,t_a)
    | c_lessequals(X1,v_X,tc_set(t_a))
    | ~ c_lessequals(X1,v_Z,tc_set(t_a))
    | ~ c_lessequals(X1,v_Y,tc_set(t_a)) ),
    cls_conjecture_5 ).

cnf(c_0_43,plain,
    c_lessequals(c_inter(X1,X2,X3),X2,tc_set(X3)),
    inference(spm,[status(thm)],[c_0_16,c_0_28]) ).

cnf(c_0_44,negated_conjecture,
    ( c_in(X1,v_Z,t_a)
    | ~ c_in(X1,c_inter(v_X,X2,t_a),t_a) ),
    inference(spm,[status(thm)],[c_0_15,c_0_33]) ).

cnf(c_0_45,negated_conjecture,
    c_lessequals(c_inter(v_X,X1,t_a),c_inter(X1,v_Y,t_a),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_46,plain,
    c_inter(X1,X1,X2) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).

cnf(c_0_47,negated_conjecture,
    ( c_lessequals(v_x,v_Y,tc_set(t_a))
    | c_inter(v_Y,v_Z,t_a) != v_X ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_48,negated_conjecture,
    ( c_lessequals(v_x,v_Z,tc_set(t_a))
    | c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_32])]) ).

cnf(c_0_49,negated_conjecture,
    ( c_inter(v_Y,v_Z,t_a) = v_X
    | c_lessequals(c_inter(X1,v_Z,t_a),v_X,tc_set(t_a))
    | ~ c_lessequals(c_inter(X1,v_Z,t_a),v_Y,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_50,negated_conjecture,
    ( c_lessequals(c_inter(v_X,X1,t_a),X2,tc_set(t_a))
    | c_in(c_Main_OsubsetI__1(c_inter(v_X,X1,t_a),X2,t_a),v_Z,t_a) ),
    inference(spm,[status(thm)],[c_0_44,c_0_18]) ).

cnf(c_0_51,negated_conjecture,
    c_lessequals(v_X,c_inter(v_X,v_Y,t_a),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    ( c_in(X1,v_Y,t_a)
    | c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_in(X1,v_x,t_a) ),
    inference(spm,[status(thm)],[c_0_15,c_0_47]) ).

cnf(c_0_53,negated_conjecture,
    ( c_lessequals(v_x,v_Z,tc_set(t_a))
    | c_inter(v_Y,v_Z,t_a) != v_X ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_40])]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ c_lessequals(v_x,v_X,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Z,tc_set(t_a))
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | v_X != c_inter(v_Y,v_Z,t_a) ),
    cls_conjecture_4 ).

cnf(c_0_55,negated_conjecture,
    ( c_inter(v_Y,v_Z,t_a) = v_X
    | c_lessequals(c_inter(v_Y,v_Z,t_a),v_X,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_49,c_0_38]) ).

cnf(c_0_56,negated_conjecture,
    c_lessequals(c_inter(v_X,X1,t_a),c_inter(X1,v_Z,t_a),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_34,c_0_50]) ).

cnf(c_0_57,negated_conjecture,
    c_inter(v_X,v_Y,t_a) = v_X,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_51]),c_0_38])]) ).

cnf(c_0_58,negated_conjecture,
    ( c_lessequals(v_x,X1,tc_set(t_a))
    | c_in(c_Main_OsubsetI__1(v_x,X1,t_a),v_Y,t_a)
    | c_inter(v_Y,v_Z,t_a) != v_X ),
    inference(spm,[status(thm)],[c_0_52,c_0_18]) ).

cnf(c_0_59,negated_conjecture,
    ( c_in(X1,v_Z,t_a)
    | c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_in(X1,v_x,t_a) ),
    inference(spm,[status(thm)],[c_0_15,c_0_53]) ).

cnf(c_0_60,negated_conjecture,
    ( c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_lessequals(v_X,v_Y,tc_set(t_a))
    | ~ c_lessequals(v_x,v_X,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_32])]) ).

cnf(c_0_61,negated_conjecture,
    ( c_inter(v_Y,v_Z,t_a) = v_X
    | ~ c_lessequals(v_X,c_inter(v_Y,v_Z,t_a),tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_55]) ).

cnf(c_0_62,negated_conjecture,
    c_lessequals(v_X,c_inter(v_Y,v_Z,t_a),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_63,negated_conjecture,
    ( c_lessequals(v_x,c_inter(v_Y,X1,t_a),tc_set(t_a))
    | c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_in(c_Main_OsubsetI__1(v_x,c_inter(v_Y,X1,t_a),t_a),X1,t_a) ),
    inference(spm,[status(thm)],[c_0_26,c_0_58]) ).

cnf(c_0_64,negated_conjecture,
    ( c_lessequals(v_x,X1,tc_set(t_a))
    | c_in(c_Main_OsubsetI__1(v_x,X1,t_a),v_Z,t_a)
    | c_inter(v_Y,v_Z,t_a) != v_X ),
    inference(spm,[status(thm)],[c_0_59,c_0_18]) ).

cnf(c_0_65,negated_conjecture,
    ( c_inter(v_Y,v_Z,t_a) != v_X
    | ~ c_lessequals(v_x,v_X,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_40])]) ).

cnf(c_0_66,negated_conjecture,
    c_inter(v_Y,v_Z,t_a) = v_X,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).

cnf(c_0_67,negated_conjecture,
    ( c_lessequals(v_x,c_inter(v_Y,v_Z,t_a),tc_set(t_a))
    | c_inter(v_Y,v_Z,t_a) != v_X ),
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_68,negated_conjecture,
    ~ c_lessequals(v_x,v_X,tc_set(t_a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).

cnf(c_0_69,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_66]),c_0_66])]),c_0_68]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.20  % Problem    : SET831-1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.21  % Command    : run_E %s %d THM
% 0.20/0.41  % Computer : n021.cluster.edu
% 0.20/0.41  % Model    : x86_64 x86_64
% 0.20/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.41  % Memory   : 8042.1875MB
% 0.20/0.41  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.20/0.41  % CPULimit   : 2400
% 0.20/0.41  % WCLimit    : 300
% 0.20/0.41  % DateTime   : Mon Oct  2 16:51:59 EDT 2023
% 0.20/0.41  % CPUTime    : 
% 0.38/0.61  Running first-order theorem proving
% 0.38/0.61  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/tmp/tmp.1TdIyKkD9P/E---3.1_11303.p
% 298.32/41.33  # Version: 3.1pre001
% 298.32/41.33  # Preprocessing class: FMLMSMSMSSSNFFN.
% 298.32/41.33  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 298.32/41.33  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 298.32/41.33  # Starting new_bool_3 with 300s (1) cores
% 298.32/41.33  # Starting new_bool_1 with 300s (1) cores
% 298.32/41.33  # Starting sh5l with 300s (1) cores
% 298.32/41.33  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11381 completed with status 0
% 298.32/41.33  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 298.32/41.33  # Preprocessing class: FMLMSMSMSSSNFFN.
% 298.32/41.33  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 298.32/41.33  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 298.32/41.33  # No SInE strategy applied
% 298.32/41.33  # Search class: FGHSM-SSLM33-MFFFFFNN
% 298.32/41.33  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 298.32/41.33  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 298.32/41.33  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 298.32/41.33  # Starting new_bool_3 with 136s (1) cores
% 298.32/41.33  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 298.32/41.33  # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 298.32/41.33  # G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with pid 11391 completed with status 0
% 298.32/41.33  # Result found by G-E--_207_B07_F1_AE_CS_SP_PS_S0Y
% 298.32/41.33  # Preprocessing class: FMLMSMSMSSSNFFN.
% 298.32/41.33  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 298.32/41.33  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 298.32/41.33  # No SInE strategy applied
% 298.32/41.33  # Search class: FGHSM-SSLM33-MFFFFFNN
% 298.32/41.33  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 298.32/41.33  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 298.32/41.33  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 298.32/41.33  # Starting new_bool_3 with 136s (1) cores
% 298.32/41.33  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 298.32/41.33  # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 298.32/41.33  # Preprocessing time       : 0.008 s
% 298.32/41.33  # Presaturation interreduction done
% 298.32/41.33  
% 298.32/41.33  # Proof found!
% 298.32/41.33  # SZS status Unsatisfiable
% 298.32/41.33  # SZS output start CNFRefutation
% See solution above
% 298.32/41.33  # Parsed axioms                        : 1363
% 298.32/41.33  # Removed by relevancy pruning/SinE    : 0
% 298.32/41.33  # Initial clauses                      : 1363
% 298.32/41.33  # Removed in clause preprocessing      : 1
% 298.32/41.33  # Initial clauses in saturation        : 1362
% 298.32/41.33  # Processed clauses                    : 99997
% 298.32/41.33  # ...of these trivial                  : 2513
% 298.32/41.33  # ...subsumed                          : 82311
% 298.32/41.33  # ...remaining for further processing  : 15172
% 298.32/41.33  # Other redundant clauses eliminated   : 341
% 298.32/41.33  # Clauses deleted for lack of memory   : 0
% 298.32/41.33  # Backward-subsumed                    : 3290
% 298.32/41.33  # Backward-rewritten                   : 4158
% 298.32/41.33  # Generated clauses                    : 975483
% 298.32/41.33  # ...of the previous two non-redundant : 911901
% 298.32/41.33  # ...aggressively subsumed             : 0
% 298.32/41.33  # Contextual simplify-reflections      : 164
% 298.32/41.33  # Paramodulations                      : 974798
% 298.32/41.33  # Factorizations                       : 122
% 298.32/41.33  # NegExts                              : 0
% 298.32/41.33  # Equation resolutions                 : 525
% 298.32/41.33  # Total rewrite steps                  : 877359
% 298.32/41.33  # Propositional unsat checks           : 0
% 298.32/41.33  #    Propositional check models        : 0
% 298.32/41.33  #    Propositional check unsatisfiable : 0
% 298.32/41.33  #    Propositional clauses             : 0
% 298.32/41.33  #    Propositional clauses after purity: 0
% 298.32/41.33  #    Propositional unsat core size     : 0
% 298.32/41.33  #    Propositional preprocessing time  : 0.000
% 298.32/41.33  #    Propositional encoding time       : 0.000
% 298.32/41.33  #    Propositional solver time         : 0.000
% 298.32/41.33  #    Success case prop preproc time    : 0.000
% 298.32/41.33  #    Success case prop encoding time   : 0.000
% 298.32/41.33  #    Success case prop solver time     : 0.000
% 298.32/41.33  # Current number of processed clauses  : 6360
% 298.32/41.33  #    Positive orientable unit clauses  : 829
% 298.32/41.33  #    Positive unorientable unit clauses: 2
% 298.32/41.33  #    Negative unit clauses             : 489
% 298.32/41.33  #    Non-unit-clauses                  : 5040
% 298.32/41.33  # Current number of unprocessed clauses: 806341
% 298.32/41.33  # ...number of literals in the above   : 2633846
% 298.32/41.33  # Current number of archived formulas  : 0
% 298.32/41.33  # Current number of archived clauses   : 8812
% 298.32/41.33  # Clause-clause subsumption calls (NU) : 21859506
% 298.32/41.33  # Rec. Clause-clause subsumption calls : 12792423
% 298.32/41.33  # Non-unit clause-clause subsumptions  : 46933
% 298.32/41.33  # Unit Clause-clause subsumption calls : 585983
% 298.32/41.33  # Rewrite failures with RHS unbound    : 359
% 298.32/41.33  # BW rewrite match attempts            : 3108
% 298.32/41.33  # BW rewrite match successes           : 382
% 298.32/41.33  # Condensation attempts                : 0
% 298.32/41.33  # Condensation successes               : 0
% 298.32/41.33  # Termbank termtop insertions          : 32463061
% 298.32/41.33  
% 298.32/41.33  # -------------------------------------------------
% 298.32/41.33  # User time                : 32.272 s
% 298.32/41.33  # System time              : 0.753 s
% 298.32/41.33  # Total time               : 33.025 s
% 298.32/41.33  # Maximum resident set size: 3720 pages
% 298.32/41.33  
% 298.32/41.33  # -------------------------------------------------
% 298.32/41.33  # User time                : 177.425 s
% 298.32/41.33  # System time              : 3.550 s
% 298.32/41.33  # Total time               : 180.975 s
% 298.32/41.33  # Maximum resident set size: 2400 pages
% 298.32/41.33  % E---3.1 exiting
% 298.32/41.33  % E---3.1 exiting
%------------------------------------------------------------------------------