↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n007.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:37 PM UTC 2026

% Result   : Unsatisfiable 0.27s 0.72s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   42 (  15 unt;  22 nHn;  40 RR)
%            Number of literals    :  131 (  11 equ;  63 neg)
%            Maximal clause size   :    6 (   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   :   88 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).

cnf(cls_Zorn_OTFin__linear__lemma2_0,axiom,
    ( ~ c_lessequals(X1,X4,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)))
    | X1 = X4
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma2_0) ).

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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_0) ).

cnf(cls_Set_Osubset__trans_0,axiom,
    ( ~ c_lessequals(X4,X1,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | c_lessequals(X4,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).

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/sandbox/benchmark/theBenchmark.p',cls_conjecture_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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

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/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).

cnf(c_0_11,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_12,plain,
    ( ~ c_lessequals(X1,X4,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)))
    | X1 = X4
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__linear__lemma2_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(X4,X1,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | c_lessequals(X4,X2,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_Osubset__trans_0]) ).

cnf(c_0_15,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_11 ).

cnf(c_0_16,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_17,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_18,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_19,plain,
    ( ~ c_lessequals(X1,X4,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)))
    | X1 = X4
    | c_lessequals(c_Zorn_Osucc(X2,X1,X3),X4,tc_set(tc_set(X3))) ),
    c_0_12 ).

cnf(c_0_20,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_21,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_22,plain,
    ( ~ c_lessequals(X4,X1,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | c_lessequals(X4,X2,tc_set(X3)) ),
    c_0_14 ).

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

cnf(c_0_24,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_n,X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_26,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_27,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_18 ).

cnf(c_0_28,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_29,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a)))
    | X1 = v_m ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_30,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_n,X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_21,c_0_16]) ).

cnf(c_0_31,plain,
    ( ~ c_lessequals(c_Zorn_Osucc(X4,X1,X3),X2,tc_set(tc_set(X3)))
    | c_lessequals(X1,X2,tc_set(tc_set(X3))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_32,negated_conjecture,
    ( c_Zorn_OTFin__linear__lemma1__1(v_S,v_m,t_a) != v_m
    | 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_24,c_0_20]),c_0_25]) ).

cnf(c_0_33,negated_conjecture,
    ~ c_lessequals(v_m,v_n,tc_set(tc_set(t_a))),
    c_0_26 ).

cnf(c_0_34,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(v_n,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_n,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_35,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_28 ).

cnf(c_0_36,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(v_n,X1,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_n,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a),t_a),v_m,tc_set(tc_set(t_a)))
    | c_Zorn_OTFin__linear__lemma1__1(v_S,X1,t_a) = v_m ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_37,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_31,c_0_32]),c_0_33]) ).

cnf(c_0_38,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_OTFin__linear__lemma1__1(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_25]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(X1,v_m,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(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(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20])]),c_0_37]),c_0_25]),c_0_38]) ).

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))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_16]),c_0_25]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET858-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.40  % Computer : n007.cluster.edu
% 0.16/0.40  % Model    : x86_64 x86_64
% 0.16/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40  % Memory   : 8046.5625MB
% 0.16/0.40  % OS       : Linux 6.8.0-71-generic
% 0.16/0.40  % CPULimit : 300
% 0.16/0.40  % WCLimit  : 300
% 0.16/0.40  % DateTime : Mon Sep 21 05:39:50 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.50  Running first-order theorem proving
% 0.20/0.50  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.27/0.72  % Version: 3.5.1
% 0.27/0.72  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.27/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.72  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.72  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.72  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.72  % Starting sh5l with 300s (1) cores
% 0.27/0.72  % new_bool_1 with pid 290818 completed with status 0
% 0.27/0.72  % Result found by new_bool_1
% 0.27/0.72  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.27/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.72  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.72  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.72  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.72  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.72  % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.27/0.72  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.72  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.72  % SubtermCWHack with pid 290820 completed with status 0
% 0.27/0.72  % Result found by SubtermCWHack
% 0.27/0.72  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.27/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.72  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.72  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.72  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.72  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.72  % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.27/0.72  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.72  % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.72  % Preprocessing time       : 0.004 s
% 0.27/0.72  
% 0.27/0.72  % Proof found!
% 0.27/0.72  % SZS status Unsatisfiable
% 0.27/0.72  % SZS output start CNFRefutation
% See solution above
% 0.27/0.72  % Parsed axioms                        : 1368
% 0.27/0.72  % Removed by relevancy pruning/SinE    : 981
% 0.27/0.72  % Initial clauses                      : 387
% 0.27/0.72  % Removed in clause preprocessing      : 0
% 0.27/0.72  % Initial clauses in saturation        : 387
% 0.27/0.72  % Processed clauses                    : 857
% 0.27/0.72  % ...of these trivial                  : 53
% 0.27/0.72  % ...subsumed                          : 246
% 0.27/0.72  % ...remaining for further processing  : 558
% 0.27/0.72  % Other redundant clauses eliminated   : 0
% 0.27/0.72  % Clauses deleted for lack of memory   : 0
% 0.27/0.72  % Backward-subsumed                    : 8
% 0.27/0.72  % Backward-rewritten                   : 45
% 0.27/0.72  % Generated clauses                    : 967
% 0.27/0.72  % ...of the previous two non-redundant : 826
% 0.27/0.72  % ...aggressively subsumed             : 0
% 0.27/0.72  % Contextual simplify-reflections      : 3
% 0.27/0.72  % Paramodulations                      : 963
% 0.27/0.72  % Factorizations                       : 0
% 0.27/0.72  % NegExts                              : 0
% 0.27/0.72  % Equation resolutions                 : 4
% 0.27/0.72  % Disequality decompositions           : 0
% 0.27/0.72  % Total rewrite steps                  : 230
% 0.27/0.72  % ...of those cached                   : 180
% 0.27/0.72  % Propositional unsat checks           : 0
% 0.27/0.72  %    Propositional check models        : 0
% 0.27/0.72  %    Propositional check unsatisfiable : 0
% 0.27/0.72  %    Propositional clauses             : 0
% 0.27/0.72  %    Propositional clauses after purity: 0
% 0.27/0.72  %    Propositional unsat core size     : 0
% 0.27/0.72  %    Propositional preprocessing time  : 0.000
% 0.27/0.72  %    Propositional encoding time       : 0.000
% 0.27/0.72  %    Propositional solver time         : 0.000
% 0.27/0.72  %    Success case prop preproc time    : 0.000
% 0.27/0.72  %    Success case prop encoding time   : 0.000
% 0.27/0.72  %    Success case prop solver time     : 0.000
% 0.27/0.72  % Current number of processed clauses  : 505
% 0.27/0.72  %    Positive orientable unit clauses  : 55
% 0.27/0.72  %    Positive unorientable unit clauses: 0
% 0.27/0.72  %    Negative unit clauses             : 10
% 0.27/0.72  %    Non-unit-clauses                  : 440
% 0.27/0.72  % Current number of unprocessed clauses: 335
% 0.27/0.72  % ...number of literals in the above   : 722
% 0.27/0.72  % Current number of archived formulas  : 0
% 0.27/0.72  % Current number of archived clauses   : 53
% 0.27/0.72  % Clause-clause subsumption calls (NU) : 97670
% 0.27/0.72  % Rec. Clause-clause subsumption calls : 81530
% 0.27/0.72  % Non-unit clause-clause subsumptions  : 247
% 0.27/0.72  % Unit Clause-clause subsumption calls : 426
% 0.27/0.72  % Rewrite failures with RHS unbound    : 0
% 0.27/0.72  % BW rewrite match attempts            : 167
% 0.27/0.72  % BW rewrite match successes           : 2
% 0.27/0.72  % Condensation attempts                : 0
% 0.27/0.72  % Condensation successes               : 0
% 0.27/0.72  % Termbank termtop insertions          : 46238
% 0.27/0.72  % Search garbage collected termcells   : 2519
% 0.27/0.72  
% 0.27/0.72  % -------------------------------------------------
% 0.27/0.72  % User time                : 0.065 s
% 0.27/0.72  % System time              : 0.005 s
% 0.27/0.72  % Total time               : 0.070 s
% 0.27/0.72  % Maximum resident set size: 4868 pages
% 0.27/0.72  
% 0.27/0.72  % -------------------------------------------------
% 0.27/0.72  % User time                : 0.087 s
% 0.27/0.72  % System time              : 0.010 s
% 0.27/0.72  % Total time               : 0.097 s
% 0.27/0.72  % Maximum resident set size: 5632 pages
% 0.27/0.72  % E exiting
%------------------------------------------------------------------------------