↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : GRP126-4.004 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n015.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:41:58 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.51s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   21
% Syntax   : Number of clauses     :   97 (  39 unt;  37 nHn;  95 RR)
%            Number of literals    :  223 (   0 equ;  86 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :  100 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
    ( ~ group_element(X2)
    | ~ group_element(X1)
    | product(X1,X2,e_4)
    | product(X1,X2,e_3)
    | product(X1,X2,e_2)
    | product(X1,X2,e_1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).

cnf(product_right_cancellation,axiom,
    ( ~ product(X1,X4,X3)
    | ~ product(X1,X2,X3)
    | equalish(X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).

cnf(product_left_cancellation,axiom,
    ( ~ product(X4,X2,X3)
    | ~ product(X1,X2,X3)
    | equalish(X1,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).

cnf(element_4,axiom,
    group_element(e_4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_4) ).

cnf(product_idempotence,axiom,
    product(X1,X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotence) ).

cnf(element_1,axiom,
    group_element(e_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).

cnf(e_4_is_not_e_1,axiom,
    ~ equalish(e_4,e_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_1) ).

cnf(e_1_is_not_e_3,axiom,
    ~ equalish(e_1,e_3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_3) ).

cnf(e_1_is_not_e_4,axiom,
    ~ equalish(e_1,e_4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_4) ).

cnf(qg4_1,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X3,X4,X2)
    | product(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg4_1) ).

cnf(element_3,axiom,
    group_element(e_3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).

cnf(qg4,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X1,X2,X3)
    | product(X3,X4,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg4) ).

cnf(e_3_is_not_e_4,axiom,
    ~ equalish(e_3,e_4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_4) ).

cnf(product_total_function2,axiom,
    ( ~ product(X1,X2,X4)
    | ~ product(X1,X2,X3)
    | equalish(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function2) ).

cnf(e_4_is_not_e_3,axiom,
    ~ equalish(e_4,e_3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_3) ).

cnf(qg4_2,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X4,X3,X1)
    | product(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg4_2) ).

cnf(e_1_is_not_e_2,axiom,
    ~ equalish(e_1,e_2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).

cnf(element_2,axiom,
    group_element(e_2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).

cnf(e_3_is_not_e_1,axiom,
    ~ equalish(e_3,e_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_1) ).

cnf(e_2_is_not_e_4,axiom,
    ~ equalish(e_2,e_4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_4) ).

cnf(e_4_is_not_e_2,axiom,
    ~ equalish(e_4,e_2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_2) ).

cnf(c_0_21,plain,
    ( ~ group_element(X2)
    | ~ group_element(X1)
    | product(X1,X2,e_4)
    | product(X1,X2,e_3)
    | product(X1,X2,e_2)
    | product(X1,X2,e_1) ),
    inference(fof_simplification,[status(thm)],[product_total_function1]) ).

cnf(c_0_22,plain,
    ( ~ product(X1,X4,X3)
    | ~ product(X1,X2,X3)
    | equalish(X2,X4) ),
    inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).

cnf(c_0_23,plain,
    ( ~ product(X4,X2,X3)
    | ~ product(X1,X2,X3)
    | equalish(X1,X4) ),
    inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).

cnf(c_0_24,plain,
    ( ~ group_element(X2)
    | ~ group_element(X1)
    | product(X1,X2,e_4)
    | product(X1,X2,e_3)
    | product(X1,X2,e_2)
    | product(X1,X2,e_1) ),
    c_0_21 ).

cnf(c_0_25,axiom,
    group_element(e_4),
    element_4 ).

cnf(c_0_26,plain,
    ( ~ product(X1,X4,X3)
    | ~ product(X1,X2,X3)
    | equalish(X2,X4) ),
    c_0_22 ).

cnf(c_0_27,plain,
    ( ~ product(X4,X2,X3)
    | ~ product(X1,X2,X3)
    | equalish(X1,X4) ),
    c_0_23 ).

cnf(c_0_28,axiom,
    product(X1,X1,X1),
    product_idempotence ).

cnf(c_0_29,plain,
    ( ~ group_element(X1)
    | product(e_4,X1,e_1)
    | product(e_4,X1,e_2)
    | product(e_4,X1,e_3)
    | product(e_4,X1,e_4) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,axiom,
    group_element(e_1),
    element_1 ).

cnf(c_0_31,plain,
    ~ equalish(e_4,e_1),
    inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).

cnf(c_0_32,plain,
    ( ~ group_element(X3)
    | ~ group_element(X2)
    | ~ product(X3,X1,e_1)
    | product(X3,X2,e_2)
    | product(X3,X2,e_3)
    | product(X3,X2,e_4)
    | equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_24]) ).

cnf(c_0_33,plain,
    ~ equalish(e_1,e_3),
    inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).

cnf(c_0_34,plain,
    ( ~ product(X1,X2,X2)
    | equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,plain,
    ( product(e_4,e_1,e_4)
    | product(e_4,e_1,e_3)
    | product(e_4,e_1,e_2)
    | product(e_4,e_1,e_1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,plain,
    ~ equalish(e_4,e_1),
    c_0_31 ).

cnf(c_0_37,plain,
    ~ equalish(e_1,e_4),
    inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X3,X4,X2)
    | product(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[qg4_1]) ).

cnf(c_0_39,plain,
    ( ~ group_element(X1)
    | product(e_1,X1,e_4)
    | product(e_1,X1,e_3)
    | product(e_1,X1,e_2)
    | equalish(e_1,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_30])]) ).

cnf(c_0_40,axiom,
    group_element(e_3),
    element_3 ).

cnf(c_0_41,plain,
    ~ equalish(e_1,e_3),
    c_0_33 ).

cnf(c_0_42,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X1,X2,X3)
    | product(X3,X4,X2) ),
    inference(fof_simplification,[status(thm)],[qg4]) ).

cnf(c_0_43,plain,
    ( ~ product(X2,X1,X2)
    | equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_28]) ).

cnf(c_0_44,plain,
    ( product(e_4,e_1,e_2)
    | product(e_4,e_1,e_3)
    | product(e_4,e_1,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_45,plain,
    ~ equalish(e_1,e_4),
    c_0_37 ).

cnf(c_0_46,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X3,X4,X2)
    | product(X1,X2,X3) ),
    c_0_38 ).

cnf(c_0_47,plain,
    ( product(e_1,e_3,e_2)
    | product(e_1,e_3,e_3)
    | product(e_1,e_3,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X1,X2,X3)
    | product(X3,X4,X2) ),
    c_0_42 ).

cnf(c_0_49,plain,
    ( product(e_4,e_1,e_3)
    | product(e_4,e_1,e_2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).

cnf(c_0_50,plain,
    ( product(e_1,e_4,e_2)
    | product(e_1,e_4,e_3)
    | product(e_1,e_4,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_45]) ).

cnf(c_0_51,negated_conjecture,
    ( ~ product(e_4,X1,e_3)
    | product(X1,e_4,e_1)
    | product(e_1,e_3,e_3)
    | product(e_1,e_3,e_2) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_52,negated_conjecture,
    ( ~ product(e_1,e_4,X1)
    | product(X1,e_3,e_4)
    | product(e_4,e_1,e_2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_53,plain,
    ( product(e_1,e_4,e_3)
    | product(e_1,e_4,e_2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_50]),c_0_45]) ).

cnf(c_0_54,negated_conjecture,
    ( product(e_1,e_3,e_2)
    | product(e_1,e_3,e_3)
    | product(e_1,e_4,e_1)
    | product(e_4,e_1,e_2) ),
    inference(spm,[status(thm)],[c_0_51,c_0_49]) ).

cnf(c_0_55,negated_conjecture,
    ( product(e_4,e_1,e_2)
    | product(e_3,e_3,e_4)
    | product(e_1,e_4,e_2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    ( product(e_4,e_1,e_2)
    | product(e_1,e_3,e_3)
    | product(e_1,e_3,e_2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_54]),c_0_36]) ).

cnf(c_0_57,plain,
    ~ equalish(e_3,e_4),
    inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).

cnf(c_0_58,negated_conjecture,
    ( ~ product(e_1,X1,e_2)
    | product(e_3,e_3,e_4)
    | product(e_4,e_1,e_2)
    | equalish(X1,e_4) ),
    inference(spm,[status(thm)],[c_0_26,c_0_55]) ).

cnf(c_0_59,negated_conjecture,
    ( product(e_1,e_3,e_2)
    | product(e_4,e_1,e_2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_56]),c_0_41]) ).

cnf(c_0_60,plain,
    ~ equalish(e_3,e_4),
    c_0_57 ).

cnf(c_0_61,plain,
    ( ~ product(X1,X2,X4)
    | ~ product(X1,X2,X3)
    | equalish(X3,X4) ),
    inference(fof_simplification,[status(thm)],[product_total_function2]) ).

cnf(c_0_62,negated_conjecture,
    ( product(e_4,e_1,e_2)
    | product(e_3,e_3,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    ( ~ product(e_4,e_1,X1)
    | product(X1,e_3,e_1)
    | product(e_1,e_4,e_2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_53]) ).

cnf(c_0_64,plain,
    ( ~ product(X1,X2,X4)
    | ~ product(X1,X2,X3)
    | equalish(X3,X4) ),
    c_0_61 ).

cnf(c_0_65,negated_conjecture,
    ( ~ product(e_1,e_4,X1)
    | product(X1,e_2,e_4)
    | product(e_3,e_3,e_4) ),
    inference(spm,[status(thm)],[c_0_48,c_0_62]) ).

cnf(c_0_66,negated_conjecture,
    ( product(e_1,e_4,e_2)
    | product(e_2,e_3,e_1)
    | product(e_3,e_3,e_4) ),
    inference(spm,[status(thm)],[c_0_63,c_0_62]) ).

cnf(c_0_67,plain,
    ~ equalish(e_4,e_3),
    inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).

cnf(c_0_68,plain,
    ( ~ product(X2,X2,X1)
    | equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_64,c_0_28]) ).

cnf(c_0_69,negated_conjecture,
    ( product(e_3,e_3,e_4)
    | product(e_2,e_2,e_4)
    | product(e_2,e_3,e_1) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_70,plain,
    ~ equalish(e_4,e_3),
    c_0_67 ).

cnf(c_0_71,negated_conjecture,
    ( product(e_3,e_3,e_4)
    | product(e_3,e_2,e_4)
    | product(e_1,e_4,e_2) ),
    inference(spm,[status(thm)],[c_0_65,c_0_53]) ).

cnf(c_0_72,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X4,X3,X1)
    | product(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[qg4_2]) ).

cnf(c_0_73,negated_conjecture,
    ( product(e_2,e_3,e_1)
    | product(e_2,e_2,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).

cnf(c_0_74,negated_conjecture,
    ( product(e_3,e_3,e_4)
    | product(e_2,e_2,e_4)
    | product(e_3,e_2,e_4) ),
    inference(spm,[status(thm)],[c_0_65,c_0_71]) ).

cnf(c_0_75,plain,
    ~ equalish(e_1,e_2),
    inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).

cnf(c_0_76,negated_conjecture,
    ( ~ product(X2,X1,X4)
    | ~ product(X4,X3,X1)
    | product(X1,X2,X3) ),
    c_0_72 ).

cnf(c_0_77,negated_conjecture,
    ( ~ product(e_3,e_2,X1)
    | product(X1,e_1,e_2)
    | product(e_2,e_2,e_4) ),
    inference(spm,[status(thm)],[c_0_48,c_0_73]) ).

cnf(c_0_78,negated_conjecture,
    ( product(e_3,e_2,e_4)
    | product(e_2,e_2,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_74]),c_0_70]) ).

cnf(c_0_79,axiom,
    group_element(e_2),
    element_2 ).

cnf(c_0_80,plain,
    ~ equalish(e_1,e_2),
    c_0_75 ).

cnf(c_0_81,negated_conjecture,
    ( ~ product(X1,e_1,e_2)
    | product(e_1,X1,e_3)
    | product(e_2,e_2,e_4) ),
    inference(spm,[status(thm)],[c_0_76,c_0_73]) ).

cnf(c_0_82,negated_conjecture,
    ( product(e_2,e_2,e_4)
    | product(e_4,e_1,e_2) ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_83,plain,
    ( product(e_1,e_2,e_2)
    | product(e_1,e_2,e_3)
    | product(e_1,e_2,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_79]),c_0_80]) ).

cnf(c_0_84,plain,
    ~ equalish(e_3,e_1),
    inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).

cnf(c_0_85,negated_conjecture,
    ( product(e_2,e_2,e_4)
    | product(e_1,e_4,e_3) ),
    inference(spm,[status(thm)],[c_0_81,c_0_82]) ).

cnf(c_0_86,plain,
    ( ~ product(X1,e_2,e_4)
    | product(e_1,e_2,e_3)
    | product(e_1,e_2,e_2)
    | equalish(X1,e_1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_83]) ).

cnf(c_0_87,plain,
    ~ equalish(e_3,e_1),
    c_0_84 ).

cnf(c_0_88,plain,
    ~ equalish(e_2,e_4),
    inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).

cnf(c_0_89,negated_conjecture,
    ( ~ product(e_1,X1,e_3)
    | product(e_2,e_2,e_4)
    | equalish(X1,e_4) ),
    inference(spm,[status(thm)],[c_0_26,c_0_85]) ).

cnf(c_0_90,negated_conjecture,
    ( product(e_1,e_2,e_2)
    | product(e_1,e_2,e_3)
    | product(e_2,e_2,e_4) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_78]),c_0_87]) ).

cnf(c_0_91,plain,
    ~ equalish(e_2,e_4),
    c_0_88 ).

cnf(c_0_92,negated_conjecture,
    ( product(e_2,e_2,e_4)
    | product(e_1,e_2,e_2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]) ).

cnf(c_0_93,plain,
    ~ equalish(e_4,e_2),
    inference(fof_simplification,[status(thm)],[e_4_is_not_e_2]) ).

cnf(c_0_94,negated_conjecture,
    product(e_2,e_2,e_4),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_92]),c_0_80]) ).

cnf(c_0_95,plain,
    ~ equalish(e_4,e_2),
    c_0_93 ).

cnf(c_0_96,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_94]),c_0_95]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP126-4.004 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n015.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 20 20:03:35 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  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.19/0.51  % Version: 3.5.1
% 0.19/0.51  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.51  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.51  % Starting sh5l with 300s (1) cores
% 0.19/0.51  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3806878 completed with status 0
% 0.19/0.51  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.51  % No SInE strategy applied
% 0.19/0.51  % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.51  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.51  % Starting new_bool_3 with 136s (1) cores
% 0.19/0.51  % Starting new_bool_1 with 136s (1) cores
% 0.19/0.51  % new_bool_3 with pid 3806887 completed with status 0
% 0.19/0.51  % Result found by new_bool_3
% 0.19/0.51  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.51  % No SInE strategy applied
% 0.19/0.51  % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.51  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.51  % Starting new_bool_3 with 136s (1) cores
% 0.19/0.51  % Preprocessing time       : 0.001 s
% 0.19/0.51  % Presaturation interreduction done
% 0.19/0.51  
% 0.19/0.51  % Proof found!
% 0.19/0.51  % SZS status Unsatisfiable
% 0.19/0.51  % SZS output start CNFRefutation
% See solution above
% 0.19/0.51  % Parsed axioms                        : 26
% 0.19/0.51  % Removed by relevancy pruning/SinE    : 0
% 0.19/0.51  % Initial clauses                      : 26
% 0.19/0.51  % Removed in clause preprocessing      : 0
% 0.19/0.51  % Initial clauses in saturation        : 26
% 0.19/0.51  % Processed clauses                    : 475
% 0.19/0.51  % ...of these trivial                  : 0
% 0.19/0.51  % ...subsumed                          : 112
% 0.19/0.51  % ...remaining for further processing  : 363
% 0.19/0.51  % Other redundant clauses eliminated   : 0
% 0.19/0.51  % Clauses deleted for lack of memory   : 0
% 0.19/0.51  % Backward-subsumed                    : 114
% 0.19/0.51  % Backward-rewritten                   : 29
% 0.19/0.51  % Generated clauses                    : 2292
% 0.19/0.51  % ...of the previous two non-redundant : 1594
% 0.19/0.51  % ...aggressively subsumed             : 0
% 0.19/0.51  % Contextual simplify-reflections      : 0
% 0.19/0.51  % Paramodulations                      : 2292
% 0.19/0.51  % Factorizations                       : 0
% 0.19/0.51  % NegExts                              : 0
% 0.19/0.51  % Equation resolutions                 : 0
% 0.19/0.51  % Disequality decompositions           : 0
% 0.19/0.51  % Total rewrite steps                  : 1518
% 0.19/0.51  % ...of those cached                   : 1503
% 0.19/0.51  % Propositional unsat checks           : 0
% 0.19/0.51  %    Propositional check models        : 0
% 0.19/0.51  %    Propositional check unsatisfiable : 0
% 0.19/0.51  %    Propositional clauses             : 0
% 0.19/0.51  %    Propositional clauses after purity: 0
% 0.19/0.51  %    Propositional unsat core size     : 0
% 0.19/0.51  %    Propositional preprocessing time  : 0.000
% 0.19/0.51  %    Propositional encoding time       : 0.000
% 0.19/0.51  %    Propositional solver time         : 0.000
% 0.19/0.51  %    Success case prop preproc time    : 0.000
% 0.19/0.51  %    Success case prop encoding time   : 0.000
% 0.19/0.51  %    Success case prop solver time     : 0.000
% 0.19/0.51  % Current number of processed clauses  : 194
% 0.19/0.51  %    Positive orientable unit clauses  : 7
% 0.19/0.51  %    Positive unorientable unit clauses: 0
% 0.19/0.51  %    Negative unit clauses             : 12
% 0.19/0.51  %    Non-unit-clauses                  : 175
% 0.19/0.51  % Current number of unprocessed clauses: 1096
% 0.19/0.51  % ...number of literals in the above   : 5888
% 0.19/0.51  % Current number of archived formulas  : 0
% 0.19/0.51  % Current number of archived clauses   : 169
% 0.19/0.51  % Clause-clause subsumption calls (NU) : 13131
% 0.19/0.51  % Rec. Clause-clause subsumption calls : 7649
% 0.19/0.51  % Non-unit clause-clause subsumptions  : 226
% 0.19/0.51  % Unit Clause-clause subsumption calls : 55
% 0.19/0.51  % Rewrite failures with RHS unbound    : 0
% 0.19/0.51  % BW rewrite match attempts            : 15
% 0.19/0.51  % BW rewrite match successes           : 1
% 0.19/0.51  % Condensation attempts                : 0
% 0.19/0.51  % Condensation successes               : 0
% 0.19/0.51  % Termbank termtop insertions          : 44022
% 0.19/0.51  % Search garbage collected termcells   : 58
% 0.19/0.51  
% 0.19/0.51  % -------------------------------------------------
% 0.19/0.51  % User time                : 0.052 s
% 0.19/0.51  % System time              : 0.005 s
% 0.19/0.51  % Total time               : 0.056 s
% 0.19/0.51  % Maximum resident set size: 3644 pages
% 0.19/0.51  
% 0.19/0.51  % -------------------------------------------------
% 0.19/0.51  % User time                : 0.173 s
% 0.19/0.51  % System time              : 0.014 s
% 0.19/0.51  % Total time               : 0.187 s
% 0.19/0.51  % Maximum resident set size: 4864 pages
% 0.19/0.51  % E exiting
%------------------------------------------------------------------------------