↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET863-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 : n008.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:39 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.45s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   56 (  16 unt;  17 nHn;  45 RR)
%            Number of literals    :  151 (   0 equ;  80 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-3 aty)
%            Number of variables   :  119 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Zorn_Ochain__extend_0,axiom,
    ( ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | c_in(c_Zorn_Ochain__extend__1(X4,X1,X3),X4,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Ochain__extend_0) ).

cnf(cls_Zorn_Omaxchain__super__lemma_1,axiom,
    ( ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X6,tc_set(X3))
    | ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X6,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__super__lemma_1) ).

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

cnf(cls_Zorn_Omaxchain__super__lemma_0,axiom,
    ( ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,X3)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X4,tc_set(X3))
    | c_in(X1,X6,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__super__lemma_0) ).

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

cnf(cls_conjecture_7,negated_conjecture,
    ( ~ c_in(X1,v_c,tc_set(t_a))
    | c_lessequals(X1,v_y,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).

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

cnf(cls_conjecture_6,negated_conjecture,
    ~ c_in(v_xa,v_y,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(cls_conjecture_5,negated_conjecture,
    c_in(v_xa,v_x,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

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

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

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

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

cnf(cls_Zorn_Ochain__extend_1,axiom,
    ( ~ c_lessequals(c_Zorn_Ochain__extend__1(X4,X1,X3),X1,tc_set(X3))
    | ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Ochain__extend_1) ).

cnf(c_0_14,plain,
    ( ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | c_in(c_Zorn_Ochain__extend__1(X4,X1,X3),X4,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_Ochain__extend_0]) ).

cnf(c_0_15,plain,
    ( ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X6,tc_set(X3))
    | ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X6,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__super__lemma_1]) ).

cnf(c_0_16,plain,
    ( ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | c_in(c_Zorn_Ochain__extend__1(X4,X1,X3),X4,tc_set(X3)) ),
    c_0_14 ).

cnf(c_0_17,negated_conjecture,
    c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_1 ).

cnf(c_0_18,plain,
    ( ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,X3)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X4,tc_set(X3))
    | c_in(X1,X6,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__super__lemma_0]) ).

cnf(c_0_19,plain,
    ( ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X6,tc_set(X3))
    | ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X6,X3) ),
    c_0_15 ).

cnf(c_0_20,negated_conjecture,
    ( ~ c_in(X1,v_S,tc_set(t_a))
    | c_in(c_Zorn_Ochain__extend__1(v_c,X1,t_a),v_c,tc_set(t_a))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_0 ).

cnf(c_0_22,negated_conjecture,
    ( ~ c_in(X1,v_c,tc_set(t_a))
    | c_lessequals(X1,v_y,tc_set(t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_7]) ).

cnf(c_0_23,plain,
    ( ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,X3)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X4,tc_set(X3))
    | c_in(X1,X6,X3) ),
    c_0_18 ).

cnf(c_0_24,plain,
    ( ~ c_lessequals(X2,X4,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X4,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ c_in(X2,X1,t_a)
    | ~ c_in(X1,v_S,tc_set(t_a))
    | ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,X3,t_a),X3,tc_set(t_a))
    | c_in(X2,X3,t_a)
    | c_in(c_Zorn_Ochain__extend__1(v_c,X1,t_a),v_c,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_26,negated_conjecture,
    ( ~ c_in(X1,v_c,tc_set(t_a))
    | c_lessequals(X1,v_y,tc_set(t_a)) ),
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    ( ~ c_in(X3,X1,t_a)
    | ~ c_in(X1,v_S,tc_set(t_a))
    | c_in(X3,X2,t_a)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,X2,t_a),v_c,tc_set(t_a))
    | c_in(c_Zorn_Ochain__extend__1(v_c,X1,t_a),v_c,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_21])]) ).

cnf(c_0_28,negated_conjecture,
    ~ c_in(v_xa,v_y,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).

cnf(c_0_29,plain,
    ( ~ c_lessequals(X2,X4,tc_set(X3))
    | ~ c_in(X1,X2,X3)
    | c_in(X1,X4,X3) ),
    c_0_24 ).

cnf(c_0_30,negated_conjecture,
    ( ~ c_in(X2,X1,t_a)
    | ~ c_in(X1,v_S,tc_set(t_a))
    | c_in(X2,v_y,t_a)
    | c_in(c_Zorn_Ochain__extend__1(v_c,X1,t_a),v_c,tc_set(t_a)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    c_in(v_xa,v_x,t_a),
    cls_conjecture_5 ).

cnf(c_0_32,negated_conjecture,
    c_in(v_x,v_S,tc_set(t_a)),
    cls_conjecture_3 ).

cnf(c_0_33,negated_conjecture,
    ~ c_in(v_xa,v_y,t_a),
    c_0_28 ).

cnf(c_0_34,negated_conjecture,
    ( ~ c_in(X1,X2,t_a)
    | ~ c_in(X2,v_c,tc_set(t_a))
    | c_in(X1,v_y,t_a) ),
    inference(spm,[status(thm)],[c_0_29,c_0_26]) ).

cnf(c_0_35,negated_conjecture,
    c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    c_lessequals(v_y,v_x,tc_set(t_a)),
    cls_conjecture_4 ).

cnf(c_0_37,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_Ochain__extend__1(v_c,v_x,t_a),t_a)
    | c_in(X1,v_y,t_a) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

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

cnf(c_0_39,plain,
    ( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ c_in(X1,v_y,t_a)
    | c_in(X1,v_x,t_a) ),
    inference(spm,[status(thm)],[c_0_29,c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    ( c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),X1,t_a),v_y,t_a)
    | c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),X1,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    ( ~ c_lessequals(c_Zorn_Ochain__extend__1(X4,X1,X3),X1,tc_set(X3))
    | ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_Ochain__extend_1]) ).

cnf(c_0_43,plain,
    ( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    c_0_39 ).

cnf(c_0_44,negated_conjecture,
    ( c_in(c_Main_OsubsetI__1(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),X1,t_a),v_x,t_a)
    | c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),X1,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ( ~ c_lessequals(c_Zorn_Ochain__extend__1(X4,X1,X3),X1,tc_set(X3))
    | ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
    c_0_42 ).

cnf(c_0_46,negated_conjecture,
    c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ c_in(v_x,X1,tc_set(t_a))
    | ~ c_in(v_c,c_Zorn_Ochain(X1,t_a),tc_set(tc_set(t_a)))
    | c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(X1,t_a),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ c_in(X1,v_x,t_a)
    | ~ c_in(v_x,X3,tc_set(t_a))
    | ~ c_in(v_c,c_Zorn_Ochain(X3,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(v_c,c_Zorn_Omaxchain(X3,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,X2,t_a),X2,tc_set(t_a))
    | c_in(X1,X2,t_a) ),
    inference(spm,[status(thm)],[c_0_19,c_0_47]) ).

cnf(c_0_49,negated_conjecture,
    ( ~ c_in(X2,v_x,t_a)
    | ~ c_in(v_x,X3,tc_set(t_a))
    | ~ c_in(v_c,c_Zorn_Ochain(X3,t_a),tc_set(tc_set(t_a)))
    | ~ c_in(v_c,c_Zorn_Omaxchain(X3,t_a),tc_set(tc_set(t_a)))
    | c_in(X2,X1,t_a)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,X1,t_a),v_c,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ c_in(X1,v_x,t_a)
    | ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(v_c,X2,t_a),X2,tc_set(t_a))
    | c_in(X1,X2,t_a) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_21]),c_0_17]),c_0_32])]) ).

cnf(c_0_51,negated_conjecture,
    ( ~ c_in(X2,v_x,t_a)
    | c_in(X2,X1,t_a)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,X1,t_a),v_c,tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_21]),c_0_17]),c_0_32])]) ).

cnf(c_0_52,negated_conjecture,
    ( ~ c_in(X1,v_x,t_a)
    | ~ c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a))
    | c_in(X1,v_y,t_a) ),
    inference(spm,[status(thm)],[c_0_50,c_0_26]) ).

cnf(c_0_53,negated_conjecture,
    ( c_in(v_xa,X1,t_a)
    | c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,X1,t_a),v_c,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_51,c_0_31]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ c_in(X1,v_x,t_a)
    | c_in(X1,v_y,t_a) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_33]) ).

cnf(c_0_55,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_54]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET863-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n008.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:43:39 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  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.10/0.45  % Version: 3.5.1
% 0.10/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45  % Starting sh5l with 300s (1) cores
% 0.10/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 264438 completed with status 0
% 0.10/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45  % No SInE strategy applied
% 0.10/0.45  % Search class: FGUNF-FFMS32-MFFFFFNN
% 0.10/0.45  % partial match(1): FGUSF-FFMS32-MFFFFFNN
% 0.10/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 264445 completed with status 0
% 0.10/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.10/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45  % No SInE strategy applied
% 0.10/0.45  % Search class: FGUNF-FFMS32-MFFFFFNN
% 0.10/0.45  % partial match(1): FGUSF-FFMS32-MFFFFFNN
% 0.10/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45  % Preprocessing time       : 0.001 s
% 0.10/0.45  % Presaturation interreduction done
% 0.10/0.45  
% 0.10/0.45  % Proof found!
% 0.10/0.45  % SZS status Unsatisfiable
% 0.10/0.45  % SZS output start CNFRefutation
% See solution above
% 0.10/0.45  % Parsed axioms                        : 14
% 0.10/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.45  % Initial clauses                      : 14
% 0.10/0.45  % Removed in clause preprocessing      : 0
% 0.10/0.45  % Initial clauses in saturation        : 14
% 0.10/0.45  % Processed clauses                    : 65
% 0.10/0.45  % ...of these trivial                  : 1
% 0.10/0.45  % ...subsumed                          : 4
% 0.10/0.45  % ...remaining for further processing  : 60
% 0.10/0.45  % Other redundant clauses eliminated   : 0
% 0.10/0.45  % Clauses deleted for lack of memory   : 0
% 0.10/0.45  % Backward-subsumed                    : 3
% 0.10/0.45  % Backward-rewritten                   : 2
% 0.10/0.45  % Generated clauses                    : 66
% 0.10/0.45  % ...of the previous two non-redundant : 55
% 0.10/0.45  % ...aggressively subsumed             : 0
% 0.10/0.45  % Contextual simplify-reflections      : 1
% 0.10/0.45  % Paramodulations                      : 66
% 0.10/0.45  % Factorizations                       : 0
% 0.10/0.45  % NegExts                              : 0
% 0.10/0.45  % Equation resolutions                 : 0
% 0.10/0.45  % Disequality decompositions           : 0
% 0.10/0.45  % Total rewrite steps                  : 23
% 0.10/0.45  % ...of those cached                   : 17
% 0.10/0.45  % Propositional unsat checks           : 0
% 0.10/0.45  %    Propositional check models        : 0
% 0.10/0.45  %    Propositional check unsatisfiable : 0
% 0.10/0.45  %    Propositional clauses             : 0
% 0.10/0.45  %    Propositional clauses after purity: 0
% 0.10/0.45  %    Propositional unsat core size     : 0
% 0.10/0.45  %    Propositional preprocessing time  : 0.000
% 0.10/0.45  %    Propositional encoding time       : 0.000
% 0.10/0.45  %    Propositional solver time         : 0.000
% 0.10/0.45  %    Success case prop preproc time    : 0.000
% 0.10/0.45  %    Success case prop encoding time   : 0.000
% 0.10/0.45  %    Success case prop solver time     : 0.000
% 0.10/0.45  % Current number of processed clauses  : 41
% 0.10/0.45  %    Positive orientable unit clauses  : 9
% 0.10/0.45  %    Positive unorientable unit clauses: 0
% 0.10/0.45  %    Negative unit clauses             : 1
% 0.10/0.45  %    Non-unit-clauses                  : 31
% 0.10/0.45  % Current number of unprocessed clauses: 18
% 0.10/0.45  % ...number of literals in the above   : 82
% 0.10/0.45  % Current number of archived formulas  : 0
% 0.10/0.45  % Current number of archived clauses   : 19
% 0.10/0.45  % Clause-clause subsumption calls (NU) : 155
% 0.10/0.45  % Rec. Clause-clause subsumption calls : 110
% 0.10/0.45  % Non-unit clause-clause subsumptions  : 8
% 0.10/0.45  % Unit Clause-clause subsumption calls : 6
% 0.10/0.45  % Rewrite failures with RHS unbound    : 0
% 0.10/0.45  % BW rewrite match attempts            : 5
% 0.10/0.45  % BW rewrite match successes           : 1
% 0.10/0.45  % Condensation attempts                : 0
% 0.10/0.45  % Condensation successes               : 0
% 0.10/0.45  % Termbank termtop insertions          : 3083
% 0.10/0.45  % Search garbage collected termcells   : 38
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.010 s
% 0.10/0.45  % System time              : 0.002 s
% 0.10/0.45  % Total time               : 0.012 s
% 0.10/0.45  % Maximum resident set size: 3644 pages
% 0.10/0.45  
% 0.10/0.45  % -------------------------------------------------
% 0.10/0.45  % User time                : 0.041 s
% 0.10/0.45  % System time              : 0.015 s
% 0.10/0.45  % Total time               : 0.056 s
% 0.10/0.45  % Maximum resident set size: 4864 pages
% 0.10/0.45  % E exiting
%------------------------------------------------------------------------------