↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ANA027-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 : n002.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 12:02:48 PM UTC 2026

% Result   : Unsatisfiable 4.62s 1.41s
% Output   : CNFRefutation 4.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   71 (  25 unt;   3 nHn;  68 RR)
%            Number of literals    :  150 (  15 equ;  83 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :  103 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Olinorder(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_33) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_Orderings_Olinorder__not__le_0,axiom,
    ( ~ class_Orderings_Olinorder(X1)
    | c_lessequals(X3,X2,X1)
    | c_less(X2,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_0) ).

cnf(tfree_tcs,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_44) ).

cnf(cls_Orderings_Oorder__less__imp__le_0,axiom,
    ( ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__imp__le_0) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__group__add(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_54) ).

cnf(cls_OrderedGroup_Odiff__le__0__iff__le_0,axiom,
    ( ~ c_lessequals(c_minus(X2,X3,X1),c_0,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_lessequals(X2,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Odiff__le__0__iff__le_0) ).

cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
    ( ~ c_lessequals(X4,X2,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X4,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_53,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_53) ).

cnf(cls_OrderedGroup_Odiff__le__0__iff__le_1,axiom,
    ( ~ c_lessequals(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_lessequals(c_minus(X2,X3,X1),c_0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Odiff__le__0__iff__le_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(v_g(v_x),v_k(v_x),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_OrderedGroup_Onprt__eq__0_0,axiom,
    ( ~ c_lessequals(c_0,X2,X1)
    | ~ class_OrderedGroup_Olordered__ab__group(X1)
    | c_OrderedGroup_Onprt(X2,X1) = c_0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Onprt__eq__0_0) ).

cnf(cls_OrderedGroup_Odiff__less__0__iff__less_0,axiom,
    ( ~ c_less(c_minus(X2,X3,X1),c_0,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_less(X2,X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Odiff__less__0__iff__less_0) ).

cnf(cls_OrderedGroup_Onprt__eq__id_0,axiom,
    ( ~ c_lessequals(X2,c_0,X1)
    | ~ class_OrderedGroup_Olordered__ab__group(X1)
    | c_OrderedGroup_Onprt(X2,X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Onprt__eq__id_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_4) ).

cnf(cls_Orderings_Olinorder__not__le_1,axiom,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_1) ).

cnf(cls_OrderedGroup_Odiff__eq__0__iff__eq_0,axiom,
    ( c_minus(X2,X3,X1) != c_0
    | ~ class_OrderedGroup_Oab__group__add(X1)
    | X2 = X3 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Odiff__eq__0__iff__eq_0) ).

cnf(c_0_19,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Olinorder(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).

cnf(c_0_20,negated_conjecture,
    ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_21,plain,
    ( ~ class_Orderings_Olinorder(X1)
    | c_lessequals(X3,X2,X1)
    | c_less(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_0]) ).

cnf(c_0_22,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Olinorder(X1) ),
    c_0_19 ).

cnf(c_0_23,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    tfree_tcs ).

cnf(c_0_24,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_44]) ).

cnf(c_0_25,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__less__imp__le_0]) ).

cnf(c_0_26,negated_conjecture,
    ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    c_0_20 ).

cnf(c_0_27,plain,
    ( ~ class_Orderings_Olinorder(X1)
    | c_lessequals(X3,X2,X1)
    | c_less(X2,X3,X1) ),
    c_0_21 ).

cnf(c_0_28,negated_conjecture,
    class_Orderings_Olinorder(t_b),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_Orderings_Oorder(X1) ),
    c_0_24 ).

cnf(c_0_30,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__group__add(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_54]) ).

cnf(c_0_31,plain,
    ( ~ c_lessequals(c_minus(X2,X3,X1),c_0,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_lessequals(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Odiff__le__0__iff__le_0]) ).

cnf(c_0_32,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X3,X1) ),
    c_0_25 ).

cnf(c_0_33,negated_conjecture,
    c_less(c_minus(v_f(v_x),v_g(v_x),t_b),c_0,t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

cnf(c_0_34,negated_conjecture,
    class_Orderings_Oorder(t_b),
    inference(spm,[status(thm)],[c_0_29,c_0_23]) ).

cnf(c_0_35,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Opordered__ab__group__add(X1) ),
    c_0_30 ).

cnf(c_0_36,plain,
    ( ~ c_lessequals(X4,X2,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X4,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).

cnf(c_0_37,plain,
    ( ~ c_lessequals(c_minus(X2,X3,X1),c_0,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_lessequals(X2,X3,X1) ),
    c_0_31 ).

cnf(c_0_38,negated_conjecture,
    c_lessequals(c_minus(v_f(v_x),v_g(v_x),t_b),c_0,t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).

cnf(c_0_39,negated_conjecture,
    class_OrderedGroup_Opordered__ab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_35,c_0_23]) ).

cnf(c_0_40,plain,
    ( ~ c_lessequals(X4,X2,X1)
    | ~ c_lessequals(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X4,X3,X1) ),
    c_0_36 ).

cnf(c_0_41,negated_conjecture,
    c_lessequals(v_f(v_x),v_g(v_x),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).

cnf(c_0_42,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_53]) ).

cnf(c_0_43,plain,
    ( ~ c_lessequals(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_lessequals(c_minus(X2,X3,X1),c_0,X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Odiff__le__0__iff__le_1]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ c_lessequals(v_g(v_x),X1,t_b)
    | c_lessequals(v_f(v_x),X1,t_b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_34])]) ).

cnf(c_0_45,negated_conjecture,
    c_lessequals(v_g(v_x),v_k(v_x),t_b),
    cls_conjecture_2 ).

cnf(c_0_46,plain,
    ( ~ c_lessequals(c_0,X2,X1)
    | ~ class_OrderedGroup_Olordered__ab__group(X1)
    | c_OrderedGroup_Onprt(X2,X1) = c_0 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Onprt__eq__0_0]) ).

cnf(c_0_47,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group(X1) ),
    c_0_42 ).

cnf(c_0_48,plain,
    ( ~ c_less(c_minus(X2,X3,X1),c_0,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_less(X2,X3,X1) ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Odiff__less__0__iff__less_0]) ).

cnf(c_0_49,plain,
    ( ~ c_lessequals(X2,c_0,X1)
    | ~ class_OrderedGroup_Olordered__ab__group(X1)
    | c_OrderedGroup_Onprt(X2,X1) = X2 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Onprt__eq__id_0]) ).

cnf(c_0_50,plain,
    ( ~ c_lessequals(X2,X3,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_lessequals(c_minus(X2,X3,X1),c_0,X1) ),
    c_0_43 ).

cnf(c_0_51,negated_conjecture,
    c_lessequals(v_f(v_x),v_k(v_x),t_b),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_52,plain,
    ( ~ c_lessequals(c_0,X2,X1)
    | ~ class_OrderedGroup_Olordered__ab__group(X1)
    | c_OrderedGroup_Onprt(X2,X1) = c_0 ),
    c_0_46 ).

cnf(c_0_53,negated_conjecture,
    c_lessequals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
    cls_conjecture_1 ).

cnf(c_0_54,negated_conjecture,
    class_OrderedGroup_Olordered__ab__group(t_b),
    inference(spm,[status(thm)],[c_0_47,c_0_23]) ).

cnf(c_0_55,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_4]) ).

cnf(c_0_56,plain,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_1]) ).

cnf(c_0_57,plain,
    ( ~ c_less(c_minus(X2,X3,X1),c_0,X1)
    | ~ class_OrderedGroup_Opordered__ab__group__add(X1)
    | c_less(X2,X3,X1) ),
    c_0_48 ).

cnf(c_0_58,plain,
    ( c_minus(X2,X3,X1) != c_0
    | ~ class_OrderedGroup_Oab__group__add(X1)
    | X2 = X3 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Odiff__eq__0__iff__eq_0]) ).

cnf(c_0_59,plain,
    ( ~ c_lessequals(X2,c_0,X1)
    | ~ class_OrderedGroup_Olordered__ab__group(X1)
    | c_OrderedGroup_Onprt(X2,X1) = X2 ),
    c_0_49 ).

cnf(c_0_60,negated_conjecture,
    c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_39])]) ).

cnf(c_0_61,negated_conjecture,
    c_OrderedGroup_Onprt(c_minus(v_f(v_x),v_k(v_x),t_b),t_b) = c_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).

cnf(c_0_62,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    c_0_55 ).

cnf(c_0_63,plain,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    c_0_56 ).

cnf(c_0_64,negated_conjecture,
    c_less(v_f(v_x),v_g(v_x),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_33]),c_0_39])]) ).

cnf(c_0_65,plain,
    ( c_minus(X2,X3,X1) != c_0
    | ~ class_OrderedGroup_Oab__group__add(X1)
    | X2 = X3 ),
    c_0_58 ).

cnf(c_0_66,negated_conjecture,
    c_minus(v_f(v_x),v_k(v_x),t_b) = c_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_54])]) ).

cnf(c_0_67,negated_conjecture,
    class_OrderedGroup_Oab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_62,c_0_23]) ).

cnf(c_0_68,negated_conjecture,
    ~ c_lessequals(v_g(v_x),v_f(v_x),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_28])]) ).

cnf(c_0_69,negated_conjecture,
    v_f(v_x) = v_k(v_x),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).

cnf(c_0_70,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_45])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ANA027-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.50  % Computer : n002.cluster.edu
% 0.09/0.50  % Model    : x86_64 x86_64
% 0.09/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.50  % Memory   : 8046.5625MB
% 0.09/0.50  % OS       : Linux 6.8.0-71-generic
% 0.09/0.50  % CPULimit : 300
% 0.09/0.50  % WCLimit  : 300
% 0.09/0.50  % DateTime : Mon Sep 21 13:27:33 UTC 2026
% 0.09/0.51  % CPUTime  : 
% 0.09/0.51  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55  Running first-order theorem proving
% 0.09/0.55  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
% 4.62/1.41  % Version: 3.5.1
% 4.62/1.41  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.62/1.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.62/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.62/1.41  % Starting new_bool_3 with 300s (1) cores
% 4.62/1.41  % Starting new_bool_1 with 300s (1) cores
% 4.62/1.41  % Starting sh5l with 300s (1) cores
% 4.62/1.41  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3383670 completed with status 0
% 4.62/1.41  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.62/1.41  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.62/1.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.62/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.62/1.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.62/1.41  % No SInE strategy applied
% 4.62/1.41  % Search class: FGHSM-SMLM32-DFFFFFNN
% 4.62/1.41  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.62/1.41  % Starting SubtermCWHack with 136s (1) cores
% 4.62/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.62/1.41  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 4.62/1.41  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 4.62/1.41  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 4.62/1.41  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 3383679 completed with status 0
% 4.62/1.41  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 4.62/1.41  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.62/1.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.62/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.62/1.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.62/1.41  % No SInE strategy applied
% 4.62/1.41  % Search class: FGHSM-SMLM32-DFFFFFNN
% 4.62/1.41  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 4.62/1.41  % Starting SubtermCWHack with 136s (1) cores
% 4.62/1.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.62/1.41  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 4.62/1.41  % Preprocessing time       : 0.028 s
% 4.62/1.41  
% 4.62/1.41  % Proof found!
% 4.62/1.41  % SZS status Unsatisfiable
% 4.62/1.41  % SZS output start CNFRefutation
% See solution above
% 4.62/1.41  % Parsed axioms                        : 2809
% 4.62/1.41  % Removed by relevancy pruning/SinE    : 0
% 4.62/1.41  % Initial clauses                      : 2809
% 4.62/1.41  % Removed in clause preprocessing      : 9
% 4.62/1.41  % Initial clauses in saturation        : 2800
% 4.62/1.41  % Processed clauses                    : 3033
% 4.62/1.41  % ...of these trivial                  : 95
% 4.62/1.41  % ...subsumed                          : 142
% 4.62/1.41  % ...remaining for further processing  : 2796
% 4.62/1.41  % Other redundant clauses eliminated   : 71
% 4.62/1.41  % Clauses deleted for lack of memory   : 0
% 4.62/1.41  % Backward-subsumed                    : 3
% 4.62/1.41  % Backward-rewritten                   : 45
% 4.62/1.41  % Generated clauses                    : 15281
% 4.62/1.41  % ...of the previous two non-redundant : 12766
% 4.62/1.41  % ...aggressively subsumed             : 0
% 4.62/1.41  % Contextual simplify-reflections      : 1
% 4.62/1.41  % Paramodulations                      : 15148
% 4.62/1.41  % Factorizations                       : 5
% 4.62/1.41  % NegExts                              : 0
% 4.62/1.41  % Equation resolutions                 : 128
% 4.62/1.41  % Disequality decompositions           : 0
% 4.62/1.41  % Total rewrite steps                  : 7517
% 4.62/1.41  % ...of those cached                   : 6328
% 4.62/1.41  % Propositional unsat checks           : 0
% 4.62/1.41  %    Propositional check models        : 0
% 4.62/1.41  %    Propositional check unsatisfiable : 0
% 4.62/1.41  %    Propositional clauses             : 0
% 4.62/1.41  %    Propositional clauses after purity: 0
% 4.62/1.41  %    Propositional unsat core size     : 0
% 4.62/1.41  %    Propositional preprocessing time  : 0.000
% 4.62/1.41  %    Propositional encoding time       : 0.000
% 4.62/1.41  %    Propositional solver time         : 0.000
% 4.62/1.41  %    Success case prop preproc time    : 0.000
% 4.62/1.41  %    Success case prop encoding time   : 0.000
% 4.62/1.41  %    Success case prop solver time     : 0.000
% 4.62/1.41  % Current number of processed clauses  : 2748
% 4.62/1.41  %    Positive orientable unit clauses  : 625
% 4.62/1.41  %    Positive unorientable unit clauses: 8
% 4.62/1.41  %    Negative unit clauses             : 41
% 4.62/1.41  %    Non-unit-clauses                  : 2074
% 4.62/1.41  % Current number of unprocessed clauses: 12519
% 4.62/1.41  % ...number of literals in the above   : 30048
% 4.62/1.41  % Current number of archived formulas  : 0
% 4.62/1.41  % Current number of archived clauses   : 56
% 4.62/1.41  % Clause-clause subsumption calls (NU) : 1640531
% 4.62/1.41  % Rec. Clause-clause subsumption calls : 935877
% 4.62/1.41  % Non-unit clause-clause subsumptions  : 95
% 4.62/1.41  % Unit Clause-clause subsumption calls : 123196
% 4.62/1.41  % Rewrite failures with RHS unbound    : 0
% 4.62/1.41  % BW rewrite match attempts            : 441
% 4.62/1.41  % BW rewrite match successes           : 36
% 4.62/1.41  % Condensation attempts                : 0
% 4.62/1.41  % Condensation successes               : 0
% 4.62/1.41  % Termbank termtop insertions          : 302763
% 4.62/1.41  % Search garbage collected termcells   : 4116
% 4.62/1.41  
% 4.62/1.41  % -------------------------------------------------
% 4.62/1.41  % User time                : 0.725 s
% 4.62/1.41  % System time              : 0.042 s
% 4.62/1.41  % Total time               : 0.767 s
% 4.62/1.41  % Maximum resident set size: 8520 pages
% 4.62/1.41  
% 4.62/1.41  % -------------------------------------------------
% 4.62/1.41  % User time                : 3.515 s
% 4.62/1.41  % System time              : 0.149 s
% 4.62/1.41  % Total time               : 3.664 s
% 4.62/1.41  % Maximum resident set size: 6400 pages
% 4.62/1.41  % E exiting
%------------------------------------------------------------------------------