↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 3.17s 6.15s
% Output   : CNFRefutation 3.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   72 (  25 unt;   3 nHn;  69 RR)
%            Number of literals    :  152 (  16 equ;  84 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(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_50) ).

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(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_OrderedGroup_Oabs__of__nonneg_0,axiom,
    ( ~ c_lessequals(c_0,X2,X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_HOL_Oabs(X2,X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__of__nonneg_0) ).

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

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

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

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_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(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,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_50]) ).

cnf(c_0_32,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_33,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_34,plain,
    ( ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Oorder(X1)
    | c_lessequals(X2,X3,X1) ),
    c_0_25 ).

cnf(c_0_35,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_36,negated_conjecture,
    class_Orderings_Oorder(t_b),
    inference(spm,[status(thm)],[c_0_29,c_0_23]) ).

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

cnf(c_0_38,plain,
    ( ~ c_lessequals(c_0,X2,X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_HOL_Oabs(X2,X1) = X2 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__of__nonneg_0]) ).

cnf(c_0_39,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Olordered__ab__group__abs(X1) ),
    c_0_31 ).

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_32 ).

cnf(c_0_41,negated_conjecture,
    c_lessequals(v_k(v_x),v_f(v_x),t_b),
    cls_conjecture_2 ).

cnf(c_0_42,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_33 ).

cnf(c_0_43,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_34,c_0_35]),c_0_36])]) ).

cnf(c_0_44,negated_conjecture,
    class_OrderedGroup_Opordered__ab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_37,c_0_23]) ).

cnf(c_0_45,plain,
    ( ~ c_lessequals(c_HOL_Oabs(X2,X1),c_0,X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | X2 = c_0 ),
    inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__le__zero__iff_0]) ).

cnf(c_0_46,plain,
    ( ~ c_lessequals(c_0,X2,X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | c_HOL_Oabs(X2,X1) = X2 ),
    c_0_38 ).

cnf(c_0_47,negated_conjecture,
    c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
    cls_conjecture_1 ).

cnf(c_0_48,negated_conjecture,
    class_OrderedGroup_Olordered__ab__group__abs(t_b),
    inference(spm,[status(thm)],[c_0_39,c_0_23]) ).

cnf(c_0_49,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_50,negated_conjecture,
    ( ~ c_lessequals(v_f(v_x),X1,t_b)
    | c_lessequals(v_k(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_36])]) ).

cnf(c_0_51,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_42,c_0_43]),c_0_44])]) ).

cnf(c_0_52,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_53,plain,
    ( ~ c_lessequals(c_HOL_Oabs(X2,X1),c_0,X1)
    | ~ class_OrderedGroup_Olordered__ab__group__abs(X1)
    | X2 = c_0 ),
    c_0_45 ).

cnf(c_0_54,negated_conjecture,
    c_HOL_Oabs(c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = c_minus(v_k(v_x),v_g(v_x),t_b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).

cnf(c_0_55,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_49 ).

cnf(c_0_56,negated_conjecture,
    c_lessequals(v_k(v_x),v_g(v_x),t_b),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_57,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_58,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_59,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_52 ).

cnf(c_0_60,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_61,negated_conjecture,
    ( ~ c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b)
    | c_minus(v_k(v_x),v_g(v_x),t_b) = c_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_48])]) ).

cnf(c_0_62,negated_conjecture,
    c_lessequals(c_minus(v_k(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_55,c_0_56]),c_0_44])]) ).

cnf(c_0_63,plain,
    ( ~ class_Ring__and__Field_Oordered__idom(X1)
    | class_OrderedGroup_Oab__group__add(X1) ),
    c_0_57 ).

cnf(c_0_64,plain,
    ( ~ c_lessequals(X3,X2,X1)
    | ~ c_less(X2,X3,X1)
    | ~ class_Orderings_Olinorder(X1) ),
    c_0_58 ).

cnf(c_0_65,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_59,c_0_35]),c_0_44])]) ).

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

cnf(c_0_67,negated_conjecture,
    c_minus(v_k(v_x),v_g(v_x),t_b) = c_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).

cnf(c_0_68,negated_conjecture,
    class_OrderedGroup_Oab__group__add(t_b),
    inference(spm,[status(thm)],[c_0_63,c_0_23]) ).

cnf(c_0_69,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_64,c_0_65]),c_0_28])]) ).

cnf(c_0_70,negated_conjecture,
    v_g(v_x) = v_k(v_x),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA023-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.56  % Computer : n007.cluster.edu
% 0.10/5.56  % Model    : x86_64 x86_64
% 0.10/5.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.56  % Memory   : 8046.5625MB
% 0.10/5.56  % OS       : Linux 6.8.0-71-generic
% 0.10/5.56  % CPULimit : 300
% 0.10/5.56  % WCLimit  : 300
% 0.10/5.56  % DateTime : Mon Sep 21 13:22:26 UTC 2026
% 0.10/5.56  % CPUTime  : 
% 0.10/5.56  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.61  Running first-order theorem proving
% 0.16/5.61  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
% 3.17/6.15  % Version: 3.5.1
% 3.17/6.15  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.17/6.15  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/6.15  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.17/6.15  % Starting new_bool_3 with 300s (1) cores
% 3.17/6.15  % Starting new_bool_1 with 300s (1) cores
% 3.17/6.15  % Starting sh5l with 300s (1) cores
% 3.17/6.15  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1181433 completed with status 0
% 3.17/6.15  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.17/6.15  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.17/6.15  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/6.15  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.17/6.15  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.17/6.15  % No SInE strategy applied
% 3.17/6.15  % Search class: FGHSM-SMLM32-DFFFFFNN
% 3.17/6.15  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.17/6.15  % Starting SubtermCWHack with 136s (1) cores
% 3.17/6.15  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.17/6.15  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 3.17/6.15  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 3.17/6.15  % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 3.17/6.15  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1181442 completed with status 0
% 3.17/6.15  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 3.17/6.15  % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.17/6.15  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/6.15  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.17/6.15  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.17/6.15  % No SInE strategy applied
% 3.17/6.15  % Search class: FGHSM-SMLM32-DFFFFFNN
% 3.17/6.15  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.17/6.15  % Starting SubtermCWHack with 136s (1) cores
% 3.17/6.15  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.17/6.15  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 3.17/6.15  % Preprocessing time       : 0.016 s
% 3.17/6.15  
% 3.17/6.15  % Proof found!
% 3.17/6.15  % SZS status Unsatisfiable
% 3.17/6.15  % SZS output start CNFRefutation
% See solution above
% 3.17/6.15  % Parsed axioms                        : 2809
% 3.17/6.15  % Removed by relevancy pruning/SinE    : 0
% 3.17/6.15  % Initial clauses                      : 2809
% 3.17/6.15  % Removed in clause preprocessing      : 9
% 3.17/6.15  % Initial clauses in saturation        : 2800
% 3.17/6.15  % Processed clauses                    : 3200
% 3.17/6.15  % ...of these trivial                  : 121
% 3.17/6.15  % ...subsumed                          : 190
% 3.17/6.15  % ...remaining for further processing  : 2889
% 3.17/6.15  % Other redundant clauses eliminated   : 71
% 3.17/6.15  % Clauses deleted for lack of memory   : 0
% 3.17/6.15  % Backward-subsumed                    : 3
% 3.17/6.15  % Backward-rewritten                   : 61
% 3.17/6.15  % Generated clauses                    : 17136
% 3.17/6.15  % ...of the previous two non-redundant : 14466
% 3.17/6.15  % ...aggressively subsumed             : 0
% 3.17/6.15  % Contextual simplify-reflections      : 1
% 3.17/6.15  % Paramodulations                      : 17003
% 3.17/6.15  % Factorizations                       : 5
% 3.17/6.15  % NegExts                              : 0
% 3.17/6.15  % Equation resolutions                 : 128
% 3.17/6.15  % Disequality decompositions           : 0
% 3.17/6.15  % Total rewrite steps                  : 9457
% 3.17/6.15  % ...of those cached                   : 8175
% 3.17/6.15  % Propositional unsat checks           : 0
% 3.17/6.15  %    Propositional check models        : 0
% 3.17/6.15  %    Propositional check unsatisfiable : 0
% 3.17/6.15  %    Propositional clauses             : 0
% 3.17/6.15  %    Propositional clauses after purity: 0
% 3.17/6.15  %    Propositional unsat core size     : 0
% 3.17/6.15  %    Propositional preprocessing time  : 0.000
% 3.17/6.15  %    Propositional encoding time       : 0.000
% 3.17/6.15  %    Propositional solver time         : 0.000
% 3.17/6.15  %    Success case prop preproc time    : 0.000
% 3.17/6.15  %    Success case prop encoding time   : 0.000
% 3.17/6.15  %    Success case prop solver time     : 0.000
% 3.17/6.15  % Current number of processed clauses  : 2825
% 3.17/6.15  %    Positive orientable unit clauses  : 678
% 3.17/6.15  %    Positive unorientable unit clauses: 8
% 3.17/6.15  %    Negative unit clauses             : 48
% 3.17/6.15  %    Non-unit-clauses                  : 2091
% 3.17/6.15  % Current number of unprocessed clauses: 14023
% 3.17/6.15  % ...number of literals in the above   : 33372
% 3.17/6.15  % Current number of archived formulas  : 0
% 3.17/6.15  % Current number of archived clauses   : 72
% 3.17/6.15  % Clause-clause subsumption calls (NU) : 1653564
% 3.17/6.15  % Rec. Clause-clause subsumption calls : 947208
% 3.17/6.15  % Non-unit clause-clause subsumptions  : 121
% 3.17/6.15  % Unit Clause-clause subsumption calls : 127431
% 3.17/6.15  % Rewrite failures with RHS unbound    : 0
% 3.17/6.15  % BW rewrite match attempts            : 881
% 3.17/6.15  % BW rewrite match successes           : 42
% 3.17/6.15  % Condensation attempts                : 0
% 3.17/6.15  % Condensation successes               : 0
% 3.17/6.15  % Termbank termtop insertions          : 350008
% 3.17/6.15  % Search garbage collected termcells   : 4116
% 3.17/6.15  
% 3.17/6.15  % -------------------------------------------------
% 3.17/6.15  % User time                : 0.468 s
% 3.17/6.15  % System time              : 0.024 s
% 3.17/6.15  % Total time               : 0.492 s
% 3.17/6.15  % Maximum resident set size: 8776 pages
% 3.17/6.15  
% 3.17/6.15  % -------------------------------------------------
% 3.17/6.15  % User time                : 2.148 s
% 3.17/6.15  % System time              : 0.108 s
% 3.17/6.15  % Total time               : 2.256 s
% 3.17/6.15  % Maximum resident set size: 6656 pages
% 3.17/6.15  % E exiting
%------------------------------------------------------------------------------