TSTP Solution File: SET858-2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET858-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.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 02:56:20 EDT 2024

% Result   : Unsatisfiable 0.21s 0.47s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   43 (  15 unt;  23 nHn;  41 RR)
%            Number of literals    :  129 (  10 equ;  61 neg)
%            Maximal clause size   :    5 (   3 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   :   87 (   3 sgn)

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

cnf(cls_Zorn_OTFin__linear__lemma1_0,axiom,
    ( c_in(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | c_lessequals(X4,X1,tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,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__trans_0,axiom,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_n,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_n,v_m,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_lessequals(X4,X1,tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(X2,X1,X3),X1,tc_set(tc_set(X3)))
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).

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

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

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_m,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_3,negated_conjecture,
    ~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

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

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

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

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

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

cnf(c_0_15,negated_conjecture,
    c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_1 ).

cnf(c_0_16,negated_conjecture,
    ~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
    inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).

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

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

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

cnf(c_0_20,plain,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    c_0_13 ).

cnf(c_0_21,axiom,
    c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
    cls_Zorn_OAbrial__axiom1_0 ).

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

cnf(c_0_23,negated_conjecture,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_0 ).

cnf(c_0_24,negated_conjecture,
    ~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
    c_0_16 ).

cnf(c_0_25,negated_conjecture,
    ~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

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

cnf(c_0_27,plain,
    ( c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3)))
    | X1 = X4
    | ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
    | ~ c_lessequals(X1,X4,tc_set(tc_set(X3))) ),
    c_0_18 ).

cnf(c_0_28,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,tc_set(tc_set(t_a)))
    | c_lessequals(v_n,X1,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_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_19,c_0_15]) ).

cnf(c_0_29,plain,
    ( c_lessequals(X1,X2,tc_set(tc_set(X3)))
    | ~ c_lessequals(c_Zorn_Osucc(X4,X1,X3),X2,tc_set(tc_set(X3))) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_30,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a)))
    | c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) != v_m ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_31,negated_conjecture,
    ~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
    c_0_25 ).

cnf(c_0_32,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,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(v_n,X1,tc_set(tc_set(t_a)))
    | ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_26,c_0_15]) ).

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

cnf(c_0_34,negated_conjecture,
    ( X1 = v_m
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a)))
    | ~ c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_23]) ).

cnf(c_0_35,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a)))
    | c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_24]) ).

cnf(c_0_36,negated_conjecture,
    c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) != v_m,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_37,negated_conjecture,
    ( c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23]),c_0_24]) ).

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

cnf(c_0_39,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
    | c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23])]) ).

cnf(c_0_41,negated_conjecture,
    c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_n,tc_set(tc_set(t_a))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_15]),c_0_24]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_41]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SET858-2 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 13:01:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.46  Running first-order theorem proving
% 0.21/0.46  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.21/0.47  # Version: 3.1.0
% 0.21/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.47  # Starting sh5l with 300s (1) cores
% 0.21/0.47  # new_bool_3 with pid 18911 completed with status 0
% 0.21/0.47  # Result found by new_bool_3
% 0.21/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47  # Search class: FGUSF-FFMF32-SFFFFFNN
% 0.21/0.47  # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.21/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.47  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18917 completed with status 0
% 0.21/0.47  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47  # Search class: FGUSF-FFMF32-SFFFFFNN
% 0.21/0.47  # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.21/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.47  # Preprocessing time       : 0.001 s
% 0.21/0.47  # Presaturation interreduction done
% 0.21/0.47  
% 0.21/0.47  # Proof found!
% 0.21/0.47  # SZS status Unsatisfiable
% 0.21/0.47  # SZS output start CNFRefutation
% See solution above
% 0.21/0.48  # Parsed axioms                        : 11
% 0.21/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.48  # Initial clauses                      : 11
% 0.21/0.48  # Removed in clause preprocessing      : 0
% 0.21/0.48  # Initial clauses in saturation        : 11
% 0.21/0.48  # Processed clauses                    : 102
% 0.21/0.48  # ...of these trivial                  : 7
% 0.21/0.48  # ...subsumed                          : 12
% 0.21/0.48  # ...remaining for further processing  : 83
% 0.21/0.48  # Other redundant clauses eliminated   : 0
% 0.21/0.48  # Clauses deleted for lack of memory   : 0
% 0.21/0.48  # Backward-subsumed                    : 3
% 0.21/0.48  # Backward-rewritten                   : 27
% 0.21/0.48  # Generated clauses                    : 240
% 0.21/0.48  # ...of the previous two non-redundant : 236
% 0.21/0.48  # ...aggressively subsumed             : 0
% 0.21/0.48  # Contextual simplify-reflections      : 10
% 0.21/0.48  # Paramodulations                      : 240
% 0.21/0.48  # Factorizations                       : 0
% 0.21/0.48  # NegExts                              : 0
% 0.21/0.48  # Equation resolutions                 : 0
% 0.21/0.48  # Disequality decompositions           : 0
% 0.21/0.48  # Total rewrite steps                  : 39
% 0.21/0.48  # ...of those cached                   : 30
% 0.21/0.48  # Propositional unsat checks           : 0
% 0.21/0.48  #    Propositional check models        : 0
% 0.21/0.48  #    Propositional check unsatisfiable : 0
% 0.21/0.48  #    Propositional clauses             : 0
% 0.21/0.48  #    Propositional clauses after purity: 0
% 0.21/0.48  #    Propositional unsat core size     : 0
% 0.21/0.48  #    Propositional preprocessing time  : 0.000
% 0.21/0.48  #    Propositional encoding time       : 0.000
% 0.21/0.48  #    Propositional solver time         : 0.000
% 0.21/0.48  #    Success case prop preproc time    : 0.000
% 0.21/0.48  #    Success case prop encoding time   : 0.000
% 0.21/0.48  #    Success case prop solver time     : 0.000
% 0.21/0.48  # Current number of processed clauses  : 42
% 0.21/0.48  #    Positive orientable unit clauses  : 11
% 0.21/0.48  #    Positive unorientable unit clauses: 0
% 0.21/0.48  #    Negative unit clauses             : 4
% 0.21/0.48  #    Non-unit-clauses                  : 27
% 0.21/0.48  # Current number of unprocessed clauses: 138
% 0.21/0.48  # ...number of literals in the above   : 365
% 0.21/0.48  # Current number of archived formulas  : 0
% 0.21/0.48  # Current number of archived clauses   : 41
% 0.21/0.48  # Clause-clause subsumption calls (NU) : 1106
% 0.21/0.48  # Rec. Clause-clause subsumption calls : 863
% 0.21/0.48  # Non-unit clause-clause subsumptions  : 19
% 0.21/0.48  # Unit Clause-clause subsumption calls : 75
% 0.21/0.48  # Rewrite failures with RHS unbound    : 0
% 0.21/0.48  # BW rewrite match attempts            : 13
% 0.21/0.48  # BW rewrite match successes           : 3
% 0.21/0.48  # Condensation attempts                : 0
% 0.21/0.48  # Condensation successes               : 0
% 0.21/0.48  # Termbank termtop insertions          : 8286
% 0.21/0.48  # Search garbage collected termcells   : 31
% 0.21/0.48  
% 0.21/0.48  # -------------------------------------------------
% 0.21/0.48  # User time                : 0.013 s
% 0.21/0.48  # System time              : 0.000 s
% 0.21/0.48  # Total time               : 0.013 s
% 0.21/0.48  # Maximum resident set size: 1608 pages
% 0.21/0.48  
% 0.21/0.48  # -------------------------------------------------
% 0.21/0.48  # User time                : 0.013 s
% 0.21/0.48  # System time              : 0.003 s
% 0.21/0.48  # Total time               : 0.016 s
% 0.21/0.48  # Maximum resident set size: 1696 pages
% 0.21/0.48  % E---3.1 exiting
% 0.21/0.48  % E exiting
%------------------------------------------------------------------------------