↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : GRP682+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:44:44 PM UTC 2026

% Result   : Theorem 0.24s 0.61s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   79 (  74 unt;   0 def)
%            Number of atoms       :   84 (  83 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   8   ~;   3   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  173 (   0 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f01,axiom,
    ! [X1] : ld(X1,mult(X1,X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

fof(f03,axiom,
    ! [X2,X1] : mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).

fof(f02,axiom,
    ! [X1] : rd(mult(X1,X1),X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

fof(f04,axiom,
    ! [X2,X1] : mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).

fof(f07,axiom,
    ! [X2,X1] : ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).

fof(f06,axiom,
    ! [X3,X4,X2,X1] : rd(mult(mult(X1,X2),rd(X4,X3)),rd(X4,X3)) = mult(X1,rd(mult(X2,X3),X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).

fof(f05,axiom,
    ! [X3,X4,X2,X1] : ld(ld(X1,X2),mult(ld(X1,X2),mult(X4,X3))) = mult(ld(X1,mult(X1,X4)),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

fof(goals,conjecture,
    ! [X5,X6,X7] :
      ( ld(rd(X5,X6),mult(rd(X5,X6),X7)) = ld(X5,mult(X5,X7))
      & ld(ld(X5,X6),mult(ld(X5,X6),X7)) = ld(X5,mult(X5,X7)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(c_0_8,plain,
    ! [X8] : ld(X8,mult(X8,X8)) = X8,
    inference(variable_rename,[status(thm)],[f01]) ).

fof(c_0_9,plain,
    ! [X10,X11] : mult(X11,ld(X11,X10)) = ld(X11,mult(X11,X10)),
    inference(variable_rename,[status(thm)],[f03]) ).

fof(c_0_10,plain,
    ! [X9] : rd(mult(X9,X9),X9) = X9,
    inference(variable_rename,[status(thm)],[f02]) ).

fof(c_0_11,plain,
    ! [X12,X13] : mult(rd(X13,X12),X12) = rd(mult(X13,X12),X12),
    inference(variable_rename,[status(thm)],[f04]) ).

fof(c_0_12,plain,
    ! [X22,X23] : ld(X23,mult(X23,ld(X22,X22))) = rd(mult(rd(X23,X23),X22),X22),
    inference(variable_rename,[status(thm)],[f07]) ).

cnf(c_0_13,plain,
    ld(X1,mult(X1,X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,plain,
    ! [X18,X19,X20,X21] : rd(mult(mult(X21,X20),rd(X19,X18)),rd(X19,X18)) = mult(X21,rd(mult(X20,X18),X18)),
    inference(variable_rename,[status(thm)],[f06]) ).

cnf(c_0_16,plain,
    rd(mult(X1,X1),X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,plain,
    mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    mult(X1,ld(X1,X1)) = X1,
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,rd(mult(X2,X4),X4)),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    mult(rd(X1,X1),X1) = X1,
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    mult(rd(rd(X1,X1),X2),X2) = mult(X1,ld(X1,ld(X2,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17]),c_0_14]) ).

cnf(c_0_23,plain,
    mult(X1,ld(X1,ld(X1,X1))) = ld(X1,X1),
    inference(spm,[status(thm)],[c_0_14,c_0_19]) ).

cnf(c_0_24,plain,
    mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,mult(rd(X2,X4),X4)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17]),c_0_17]) ).

cnf(c_0_25,plain,
    rd(X1,X1) = ld(X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_22]),c_0_23]) ).

cnf(c_0_26,plain,
    mult(rd(mult(X1,X2),ld(X3,X3)),ld(X3,X3)) = mult(X1,mult(rd(X2,X3),X3)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,plain,
    mult(rd(ld(X1,X1),X2),X2) = mult(X1,ld(X1,ld(X2,X2))),
    inference(spm,[status(thm)],[c_0_22,c_0_25]) ).

cnf(c_0_28,plain,
    mult(mult(rd(X1,ld(X2,X2)),ld(X2,X2)),ld(X2,X2)) = mult(X1,ld(X2,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_27]),c_0_23]) ).

cnf(c_0_29,plain,
    mult(rd(X1,ld(X1,X1)),ld(X1,X1)) = rd(X1,ld(X1,X1)),
    inference(spm,[status(thm)],[c_0_17,c_0_19]) ).

cnf(c_0_30,plain,
    rd(X1,ld(X1,X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_29]),c_0_19]) ).

cnf(c_0_31,plain,
    mult(X1,mult(rd(X2,ld(X3,X3)),ld(X3,X3))) = mult(rd(mult(X1,X2),X3),X3),
    inference(spm,[status(thm)],[c_0_24,c_0_30]) ).

cnf(c_0_32,plain,
    mult(ld(X1,X1),X1) = X1,
    inference(rw,[status(thm)],[c_0_21,c_0_25]) ).

cnf(c_0_33,plain,
    mult(mult(rd(X1,X2),X2),X2) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30]),c_0_19]),c_0_17]) ).

cnf(c_0_34,plain,
    mult(rd(mult(X1,ld(X2,X2)),X2),X2) = mult(X1,ld(X2,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_32]) ).

cnf(c_0_35,plain,
    mult(mult(X1,ld(X1,ld(X2,X2))),X2) = mult(ld(X1,X1),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_25]) ).

fof(c_0_36,plain,
    ! [X14,X15,X16,X17] : ld(ld(X17,X16),mult(ld(X17,X16),mult(X15,X14))) = mult(ld(X17,mult(X17,X15)),X14),
    inference(variable_rename,[status(thm)],[f05]) ).

cnf(c_0_37,plain,
    mult(X1,ld(ld(X2,X2),ld(X2,X2))) = mult(X1,ld(X2,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_34]),c_0_27]),c_0_19]) ).

cnf(c_0_38,plain,
    mult(ld(ld(X1,X1),ld(X1,X1)),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_19]),c_0_32]) ).

cnf(c_0_39,plain,
    ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_40,plain,
    ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_37]),c_0_38]) ).

cnf(c_0_41,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4))) = mult(mult(X1,ld(X1,X3)),X4),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_14]),c_0_14]) ).

cnf(c_0_42,plain,
    mult(rd(mult(X1,X2),X3),X3) = mult(X1,mult(rd(X2,X3),X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_26]),c_0_31]) ).

cnf(c_0_43,plain,
    mult(mult(ld(X1,X1),ld(ld(X1,X1),X2)),X3) = mult(mult(X1,ld(X1,X2)),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_40]),c_0_41]) ).

cnf(c_0_44,plain,
    mult(ld(X1,X1),mult(rd(X1,X2),X2)) = mult(rd(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_42,c_0_32]) ).

cnf(c_0_45,plain,
    mult(mult(mult(X1,ld(X1,X2)),X3),X4) = mult(mult(X1,ld(X1,mult(X2,X3))),X4),
    inference(spm,[status(thm)],[c_0_43,c_0_41]) ).

cnf(c_0_46,plain,
    ld(ld(X1,X1),mult(rd(X1,X2),X2)) = mult(mult(X1,ld(X1,rd(X1,X2))),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_44]),c_0_41]) ).

cnf(c_0_47,plain,
    mult(mult(ld(X1,X1),X2),X3) = mult(mult(X1,ld(X1,X2)),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_32]) ).

cnf(c_0_48,plain,
    ld(ld(X1,X1),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_30]),c_0_19]),c_0_19]),c_0_19]) ).

cnf(c_0_49,plain,
    mult(mult(X1,ld(X1,ld(ld(X1,X1),X2))),X3) = mult(mult(X1,ld(X1,X2)),X3),
    inference(rw,[status(thm)],[c_0_43,c_0_47]) ).

cnf(c_0_50,plain,
    mult(mult(X1,ld(X1,X2)),X3) = mult(X1,ld(X1,mult(X2,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_47]),c_0_49]) ).

cnf(c_0_51,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),mult(X3,X4))) = mult(X1,ld(X1,mult(X3,X4))),
    inference(rw,[status(thm)],[c_0_41,c_0_50]) ).

cnf(c_0_52,plain,
    mult(ld(X1,X2),ld(ld(X1,X2),X3)) = mult(X1,ld(X1,X3)),
    inference(spm,[status(thm)],[c_0_51,c_0_19]) ).

cnf(c_0_53,plain,
    mult(ld(X1,X1),X2) = mult(X1,ld(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_50]),c_0_32]) ).

cnf(c_0_54,plain,
    mult(mult(X1,mult(X1,ld(X1,X2))),X3) = mult(mult(X1,X2),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_19]),c_0_14]) ).

cnf(c_0_55,plain,
    mult(X1,mult(X1,ld(X1,ld(X2,X2)))) = mult(rd(X1,X2),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_19]),c_0_27]) ).

cnf(c_0_56,plain,
    mult(X1,mult(X1,ld(X1,X2))) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_19]),c_0_14]) ).

cnf(c_0_57,plain,
    mult(X1,ld(X1,mult(ld(ld(X1,X1),X2),X3))) = mult(X1,ld(X1,mult(X2,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_50]) ).

cnf(c_0_58,plain,
    mult(X1,ld(X1,ld(X1,X2))) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_19,c_0_52]) ).

cnf(c_0_59,plain,
    mult(X1,ld(X1,ld(ld(X1,X1),X2))) = mult(X1,ld(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_40]),c_0_53]),c_0_53]) ).

cnf(c_0_60,plain,
    mult(mult(rd(X1,X2),X2),X3) = mult(mult(X1,ld(X2,X2)),X3),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

fof(c_0_61,negated_conjecture,
    ~ ! [X5,X6,X7] :
        ( ld(rd(X5,X6),mult(rd(X5,X6),X7)) = ld(X5,mult(X5,X7))
        & ld(ld(X5,X6),mult(ld(X5,X6),X7)) = ld(X5,mult(X5,X7)) ),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_62,plain,
    mult(X1,mult(ld(ld(X1,X1),X2),X3)) = mult(X1,mult(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_56]) ).

cnf(c_0_63,plain,
    ld(ld(X1,X1),X2) = mult(X1,ld(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_58]),c_0_59]),c_0_59]) ).

cnf(c_0_64,plain,
    mult(mult(X1,ld(X2,X2)),X2) = mult(X1,X2),
    inference(rw,[status(thm)],[c_0_33,c_0_60]) ).

fof(c_0_65,negated_conjecture,
    ( ld(rd(esk1_0,esk2_0),mult(rd(esk1_0,esk2_0),esk3_0)) != ld(esk1_0,mult(esk1_0,esk3_0))
    | ld(ld(esk1_0,esk2_0),mult(ld(esk1_0,esk2_0),esk3_0)) != ld(esk1_0,mult(esk1_0,esk3_0)) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])]) ).

cnf(c_0_66,plain,
    mult(X1,mult(X2,ld(mult(X1,ld(X1,X2)),X3))) = mult(X1,X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_52]),c_0_53]),c_0_59]),c_0_56]),c_0_63]) ).

cnf(c_0_67,plain,
    mult(rd(X1,X2),X2) = mult(X1,ld(X2,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_64]),c_0_17]),c_0_42]),c_0_27]),c_0_23]) ).

cnf(c_0_68,negated_conjecture,
    ( ld(rd(esk1_0,esk2_0),mult(rd(esk1_0,esk2_0),esk3_0)) != ld(esk1_0,mult(esk1_0,esk3_0))
    | ld(ld(esk1_0,esk2_0),mult(ld(esk1_0,esk2_0),esk3_0)) != ld(esk1_0,mult(esk1_0,esk3_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_65]) ).

cnf(c_0_69,plain,
    mult(X1,mult(mult(X1,X2),ld(mult(X1,X2),X3))) = mult(X1,X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_14]),c_0_56]) ).

cnf(c_0_70,plain,
    mult(X1,ld(X1,mult(mult(X1,X2),X3))) = mult(mult(X1,X2),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_14]),c_0_54]) ).

cnf(c_0_71,plain,
    mult(mult(X1,X2),ld(X3,X3)) = mult(X1,mult(X2,ld(X3,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_67]),c_0_67]) ).

cnf(c_0_72,plain,
    mult(ld(X1,X1),ld(X2,X2)) = mult(X1,ld(X1,ld(X2,X2))),
    inference(rw,[status(thm)],[c_0_27,c_0_67]) ).

cnf(c_0_73,negated_conjecture,
    ( mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0)) != mult(esk1_0,ld(esk1_0,esk3_0))
    | mult(ld(esk1_0,esk2_0),ld(ld(esk1_0,esk2_0),esk3_0)) != mult(esk1_0,ld(esk1_0,esk3_0)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_14]),c_0_14]),c_0_14]),c_0_14]) ).

cnf(c_0_74,plain,
    mult(mult(X1,X2),ld(mult(X1,X2),X3)) = mult(X1,ld(X1,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_69]),c_0_14]),c_0_70]) ).

cnf(c_0_75,plain,
    mult(rd(X1,X2),mult(X2,ld(X3,X3))) = mult(X1,mult(X2,ld(X2,ld(X3,X3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_67]),c_0_71]),c_0_72]) ).

cnf(c_0_76,negated_conjecture,
    mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0)) != mult(esk1_0,ld(esk1_0,esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_52])]) ).

cnf(c_0_77,plain,
    mult(rd(X1,X2),ld(rd(X1,X2),X3)) = mult(X1,ld(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_74]) ).

cnf(c_0_78,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP682+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45  % Computer : n017.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sun Sep 20 20:28:11 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53  Running first-order theorem proving
% 0.24/0.53  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.24/0.61  % Version: 3.5.1
% 0.24/0.61  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.61  % Starting sh5l with 300s (1) cores
% 0.24/0.61  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 586215 completed with status 0
% 0.24/0.61  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.61  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61  % No SInE strategy applied
% 0.24/0.61  % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.24/0.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.61  % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 0.24/0.61  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.61  % Starting new_bool_1 with 136s (1) cores
% 0.24/0.61  % new_bool_3 with pid 586223 completed with status 0
% 0.24/0.61  % Result found by new_bool_3
% 0.24/0.61  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61  % No SInE strategy applied
% 0.24/0.61  % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.24/0.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.61  % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 0.24/0.61  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.61  % Preprocessing time       : 0.001 s
% 0.24/0.61  % Presaturation interreduction done
% 0.24/0.61  
% 0.24/0.61  % Proof found!
% 0.24/0.61  % SZS status Theorem
% 0.24/0.61  % SZS output start CNFRefutation
% See solution above
% 0.24/0.61  % Parsed axioms                        : 8
% 0.24/0.61  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.61  % Initial clauses                      : 8
% 0.24/0.61  % Removed in clause preprocessing      : 0
% 0.24/0.61  % Initial clauses in saturation        : 8
% 0.24/0.61  % Processed clauses                    : 202
% 0.24/0.61  % ...of these trivial                  : 56
% 0.24/0.61  % ...subsumed                          : 0
% 0.24/0.61  % ...remaining for further processing  : 146
% 0.24/0.61  % Other redundant clauses eliminated   : 0
% 0.24/0.61  % Clauses deleted for lack of memory   : 0
% 0.24/0.61  % Backward-subsumed                    : 0
% 0.24/0.61  % Backward-rewritten                   : 81
% 0.24/0.61  % Generated clauses                    : 3920
% 0.24/0.61  % ...of the previous two non-redundant : 2500
% 0.24/0.61  % ...aggressively subsumed             : 0
% 0.24/0.61  % Contextual simplify-reflections      : 0
% 0.24/0.61  % Paramodulations                      : 3920
% 0.24/0.61  % Factorizations                       : 0
% 0.24/0.61  % NegExts                              : 0
% 0.24/0.61  % Equation resolutions                 : 0
% 0.24/0.61  % Disequality decompositions           : 0
% 0.24/0.61  % Total rewrite steps                  : 7376
% 0.24/0.61  % ...of those cached                   : 5706
% 0.24/0.61  % Propositional unsat checks           : 0
% 0.24/0.61  %    Propositional check models        : 0
% 0.24/0.61  %    Propositional check unsatisfiable : 0
% 0.24/0.61  %    Propositional clauses             : 0
% 0.24/0.61  %    Propositional clauses after purity: 0
% 0.24/0.61  %    Propositional unsat core size     : 0
% 0.24/0.61  %    Propositional preprocessing time  : 0.000
% 0.24/0.61  %    Propositional encoding time       : 0.000
% 0.24/0.61  %    Propositional solver time         : 0.000
% 0.24/0.61  %    Success case prop preproc time    : 0.000
% 0.24/0.61  %    Success case prop encoding time   : 0.000
% 0.24/0.61  %    Success case prop solver time     : 0.000
% 0.24/0.61  % Current number of processed clauses  : 57
% 0.24/0.61  %    Positive orientable unit clauses  : 57
% 0.24/0.61  %    Positive unorientable unit clauses: 0
% 0.24/0.61  %    Negative unit clauses             : 0
% 0.24/0.61  %    Non-unit-clauses                  : 0
% 0.24/0.61  % Current number of unprocessed clauses: 2021
% 0.24/0.61  % ...number of literals in the above   : 2021
% 0.24/0.61  % Current number of archived formulas  : 0
% 0.24/0.61  % Current number of archived clauses   : 89
% 0.24/0.61  % Clause-clause subsumption calls (NU) : 0
% 0.24/0.61  % Rec. Clause-clause subsumption calls : 0
% 0.24/0.61  % Non-unit clause-clause subsumptions  : 0
% 0.24/0.61  % Unit Clause-clause subsumption calls : 0
% 0.24/0.61  % Rewrite failures with RHS unbound    : 0
% 0.24/0.61  % BW rewrite match attempts            : 328
% 0.24/0.61  % BW rewrite match successes           : 79
% 0.24/0.61  % Condensation attempts                : 0
% 0.24/0.61  % Condensation successes               : 0
% 0.24/0.61  % Termbank termtop insertions          : 56559
% 0.24/0.61  % Search garbage collected termcells   : 34
% 0.24/0.61  
% 0.24/0.61  % -------------------------------------------------
% 0.24/0.61  % User time                : 0.049 s
% 0.24/0.61  % System time              : 0.005 s
% 0.24/0.61  % Total time               : 0.054 s
% 0.24/0.61  % Maximum resident set size: 3636 pages
% 0.24/0.61  
% 0.24/0.61  % -------------------------------------------------
% 0.24/0.61  % User time                : 0.231 s
% 0.24/0.61  % System time              : 0.023 s
% 0.24/0.61  % Total time               : 0.254 s
% 0.24/0.61  % Maximum resident set size: 4608 pages
% 0.24/0.61  % E exiting
%------------------------------------------------------------------------------