↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n019.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 02:15:36 PM UTC 2026

% Result   : Unsatisfiable 0.13s 0.42s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   50 (  19 unt;  23 nHn;  45 RR)
%            Number of literals    :  135 (  16 equ;  61 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   80 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Zorn_OTFin__linear__lemma1_0,axiom,
    ( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3)))
    | c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_0) ).

cnf(cls_Set_Osubset__antisym_0,axiom,
    ( ~ c_lessequals(X2,X1,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | X2 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_Zorn_OTFin__linear__lemma1_2,axiom,
    ( c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Zorn_OTFin__linear__lemma1_1,axiom,
    ( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
    | X1 = v_x
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_Zorn_Osucc__trans_0,axiom,
    ( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
    | c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).

cnf(cls_Zorn_OTFin__linear__lemma1_3,axiom,
    ( ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).

cnf(cls_Set_Osubset__refl_0,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

cnf(c_0_13,plain,
    ( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3)))
    | c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_0]) ).

cnf(c_0_14,plain,
    ( ~ c_lessequals(X2,X1,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | X2 = X1 ),
    inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).

cnf(c_0_15,negated_conjecture,
    v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_16,plain,
    ( c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_2]) ).

cnf(c_0_17,plain,
    ( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3)))
    | c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_1 ).

cnf(c_0_19,plain,
    ( ~ c_lessequals(X2,X1,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | X2 = X1 ),
    c_0_14 ).

cnf(c_0_20,negated_conjecture,
    c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_2 ).

cnf(c_0_21,negated_conjecture,
    v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
    c_0_15 ).

cnf(c_0_22,plain,
    ( c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3) != X1
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    c_0_16 ).

cnf(c_0_23,plain,
    ( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_1]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
    | X1 = v_x
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a))) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_26,negated_conjecture,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_0 ).

cnf(c_0_27,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a) != X1
    | c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_18]) ).

cnf(c_0_29,plain,
    ( ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    c_0_23 ).

cnf(c_0_30,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
    | X1 = v_x
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_x,tc_set(tc_set(t_a))) ),
    c_0_24 ).

cnf(c_0_31,negated_conjecture,
    ( c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    ( c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) != v_x
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_xa,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_29,c_0_18]) ).

cnf(c_0_34,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_35,plain,
    ( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
    | c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_Osucc__trans_0]) ).

cnf(c_0_36,plain,
    ( ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma1_3]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_27]) ).

cnf(c_0_39,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    c_0_34 ).

cnf(c_0_40,plain,
    ( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
    | c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
    c_0_35 ).

cnf(c_0_41,plain,
    ( ~ c_lessequals(c_Zorn_Osucc(X2,c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X3),X1,tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3))) ),
    c_0_36 ).

cnf(c_0_42,negated_conjecture,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(X1,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),X1,tc_set(tc_set(t_a))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_26])]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | v_xa = v_x ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_43]) ).

cnf(c_0_46,negated_conjecture,
    c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_18]),c_0_27]) ).

cnf(c_0_47,negated_conjecture,
    v_xa = v_x,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).

cnf(c_0_48,axiom,
    c_lessequals(X1,X1,tc_set(X2)),
    cls_Set_Osubset__refl_0 ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_47]),c_0_48])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET853-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 05:41:36 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.40  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
% 0.13/0.42  % Version: 3.5.1
% 0.13/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42  % Starting sh5l with 300s (1) cores
% 0.13/0.42  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1799360 completed with status 0
% 0.13/0.42  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42  % No SInE strategy applied
% 0.13/0.42  % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.13/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.42  % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42  % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1799366 completed with status 0
% 0.13/0.42  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42  % No SInE strategy applied
% 0.13/0.42  % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.13/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42  % Preprocessing time       : 0.001 s
% 0.13/0.42  % Presaturation interreduction done
% 0.13/0.42  
% 0.13/0.42  % Proof found!
% 0.13/0.42  % SZS status Unsatisfiable
% 0.13/0.42  % SZS output start CNFRefutation
% See solution above
% 0.13/0.42  % Parsed axioms                        : 13
% 0.13/0.42  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.42  % Initial clauses                      : 13
% 0.13/0.42  % Removed in clause preprocessing      : 0
% 0.13/0.42  % Initial clauses in saturation        : 13
% 0.13/0.42  % Processed clauses                    : 52
% 0.13/0.42  % ...of these trivial                  : 0
% 0.13/0.42  % ...subsumed                          : 2
% 0.13/0.42  % ...remaining for further processing  : 50
% 0.13/0.42  % Other redundant clauses eliminated   : 0
% 0.13/0.42  % Clauses deleted for lack of memory   : 0
% 0.13/0.42  % Backward-subsumed                    : 1
% 0.13/0.42  % Backward-rewritten                   : 17
% 0.13/0.42  % Generated clauses                    : 50
% 0.13/0.42  % ...of the previous two non-redundant : 49
% 0.13/0.42  % ...aggressively subsumed             : 0
% 0.13/0.42  % Contextual simplify-reflections      : 2
% 0.13/0.42  % Paramodulations                      : 50
% 0.13/0.42  % Factorizations                       : 0
% 0.13/0.42  % NegExts                              : 0
% 0.13/0.42  % Equation resolutions                 : 0
% 0.13/0.42  % Disequality decompositions           : 0
% 0.13/0.42  % Total rewrite steps                  : 33
% 0.13/0.42  % ...of those cached                   : 27
% 0.13/0.42  % Propositional unsat checks           : 0
% 0.13/0.42  %    Propositional check models        : 0
% 0.13/0.42  %    Propositional check unsatisfiable : 0
% 0.13/0.42  %    Propositional clauses             : 0
% 0.13/0.42  %    Propositional clauses after purity: 0
% 0.13/0.42  %    Propositional unsat core size     : 0
% 0.13/0.42  %    Propositional preprocessing time  : 0.000
% 0.13/0.42  %    Propositional encoding time       : 0.000
% 0.13/0.42  %    Propositional solver time         : 0.000
% 0.13/0.42  %    Success case prop preproc time    : 0.000
% 0.13/0.42  %    Success case prop encoding time   : 0.000
% 0.13/0.42  %    Success case prop solver time     : 0.000
% 0.13/0.42  % Current number of processed clauses  : 19
% 0.13/0.42  %    Positive orientable unit clauses  : 3
% 0.13/0.42  %    Positive unorientable unit clauses: 0
% 0.13/0.42  %    Negative unit clauses             : 2
% 0.13/0.42  %    Non-unit-clauses                  : 14
% 0.13/0.42  % Current number of unprocessed clauses: 17
% 0.13/0.42  % ...number of literals in the above   : 61
% 0.13/0.42  % Current number of archived formulas  : 0
% 0.13/0.42  % Current number of archived clauses   : 31
% 0.13/0.42  % Clause-clause subsumption calls (NU) : 202
% 0.13/0.42  % Rec. Clause-clause subsumption calls : 127
% 0.13/0.42  % Non-unit clause-clause subsumptions  : 5
% 0.13/0.42  % Unit Clause-clause subsumption calls : 10
% 0.13/0.42  % Rewrite failures with RHS unbound    : 0
% 0.13/0.42  % BW rewrite match attempts            : 5
% 0.13/0.42  % BW rewrite match successes           : 2
% 0.13/0.42  % Condensation attempts                : 0
% 0.13/0.42  % Condensation successes               : 0
% 0.13/0.42  % Termbank termtop insertions          : 2688
% 0.13/0.42  % Search garbage collected termcells   : 35
% 0.13/0.42  
% 0.13/0.42  % -------------------------------------------------
% 0.13/0.42  % User time                : 0.007 s
% 0.13/0.42  % System time              : 0.001 s
% 0.13/0.42  % Total time               : 0.008 s
% 0.13/0.42  % Maximum resident set size: 3640 pages
% 0.13/0.42  
% 0.13/0.42  % -------------------------------------------------
% 0.13/0.42  % User time                : 0.025 s
% 0.13/0.42  % System time              : 0.008 s
% 0.13/0.42  % Total time               : 0.033 s
% 0.13/0.42  % Maximum resident set size: 4608 pages
% 0.13/0.42  % E exiting
%------------------------------------------------------------------------------