TSTP Solution File: GRP682+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP682+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:42:49 EDT 2023

% Result   : Theorem 0.21s 0.54s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   81 (  75 unt;   0 def)
%            Number of atoms       :   87 (  86 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (  10   ~;   4   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   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   :  171 (   0 sgn;  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f01,axiom,
    ! [X1] : ld(X1,mult(X1,X1)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p',f01) ).

fof(f03,axiom,
    ! [X2,X1] : mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
    file('/export/starexec/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p',f03) ).

fof(f02,axiom,
    ! [X1] : rd(mult(X1,X1),X1) = X1,
    file('/export/starexec/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p',f02) ).

fof(f04,axiom,
    ! [X2,X1] : mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
    file('/export/starexec/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p',f04) ).

fof(f07,axiom,
    ! [X2,X1] : ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
    file('/export/starexec/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.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/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.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/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p',f05) ).

fof(goals,conjecture,
    ! [X5,X6,X7] :
      ( ld(ld(X5,X6),mult(ld(X5,X6),X7)) = ld(X5,mult(X5,X7))
      & ld(rd(X5,X6),mult(rd(X5,X6),X7)) = ld(X5,mult(X5,X7)) ),
    file('/export/starexec/sandbox/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p',goals) ).

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

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

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

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

fof(c_0_12,plain,
    ! [X18,X19] : ld(X19,mult(X19,ld(X18,X18))) = rd(mult(rd(X19,X19),X18),X18),
    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,
    ! [X23,X24,X25,X26] : rd(mult(mult(X26,X25),rd(X24,X23)),rd(X24,X23)) = mult(X26,rd(mult(X25,X23),X23)),
    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]) ).

fof(c_0_31,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_32,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_33,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_31]) ).

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

cnf(c_0_35,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_32,c_0_30]),c_0_19]),c_0_17]) ).

cnf(c_0_36,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_33,c_0_14]),c_0_14]) ).

cnf(c_0_37,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_32,c_0_25]),c_0_34]) ).

cnf(c_0_38,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_35,c_0_22]),c_0_25]) ).

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

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

cnf(c_0_41,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_37]),c_0_27]),c_0_19]) ).

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

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

cnf(c_0_44,plain,
    ld(ld(X1,X1),X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_19]),c_0_19]) ).

cnf(c_0_45,plain,
    ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_41]),c_0_42]) ).

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

cnf(c_0_47,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_45]),c_0_26]),c_0_32]) ).

cnf(c_0_48,plain,
    mult(mult(X1,ld(X1,X2)),X3) = mult(X1,ld(X1,mult(X2,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_43]),c_0_46]) ).

cnf(c_0_49,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_47,c_0_19]),c_0_27]) ).

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

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

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

cnf(c_0_53,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_47,c_0_51]),c_0_51]) ).

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

cnf(c_0_55,plain,
    mult(X1,ld(X1,mult(X2,ld(X3,X3)))) = mult(X1,mult(ld(X1,X2),ld(X3,X3))),
    inference(spm,[status(thm)],[c_0_48,c_0_53]) ).

cnf(c_0_56,plain,
    mult(X1,ld(X1,mult(ld(X1,X2),X3))) = mult(ld(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_48,c_0_54]) ).

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

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

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

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

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

cnf(c_0_62,plain,
    ld(ld(X1,X2),ld(X1,X2)) = mult(X1,ld(X1,ld(X2,X2))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_59]),c_0_52]) ).

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

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

cnf(c_0_65,plain,
    ld(ld(X1,X1),ld(X1,X2)) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_61,c_0_54]) ).

cnf(c_0_66,plain,
    mult(X1,ld(X1,mult(X2,ld(X2,X3)))) = mult(X1,ld(X1,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_62]),c_0_48]),c_0_46]),c_0_43]),c_0_46]) ).

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

cnf(c_0_68,plain,
    ld(ld(X1,X1),X2) = mult(X1,ld(X1,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_54]),c_0_43]),c_0_46]) ).

cnf(c_0_69,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_48,c_0_14]),c_0_50]) ).

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

cnf(c_0_71,negated_conjecture,
    ( mult(ld(esk1_0,esk2_0),ld(ld(esk1_0,esk2_0),esk3_0)) != mult(esk1_0,ld(esk1_0,esk3_0))
    | mult(rd(esk1_0,esk2_0),ld(rd(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_67,c_0_14]),c_0_14]),c_0_14]),c_0_14]) ).

cnf(c_0_72,plain,
    ld(mult(X1,ld(X1,ld(X2,X2))),X3) = mult(X1,ld(X1,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_62]),c_0_43]),c_0_46]) ).

cnf(c_0_73,plain,
    mult(X1,ld(X1,ld(mult(X1,X2),X3))) = ld(mult(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_69,c_0_54]) ).

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

cnf(c_0_75,negated_conjecture,
    ( mult(mult(esk1_0,ld(esk1_0,esk3_0)),ld(esk3_0,esk3_0)) != mult(esk1_0,ld(esk1_0,esk3_0))
    | mult(rd(esk1_0,esk2_0),ld(rd(esk1_0,esk2_0),esk3_0)) != mult(esk1_0,ld(esk1_0,esk3_0)) ),
    inference(rw,[status(thm)],[c_0_71,c_0_40]) ).

cnf(c_0_76,plain,
    mult(mult(X1,X2),ld(mult(X1,X2),X3)) = mult(X1,ld(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_68]) ).

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

cnf(c_0_78,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)],[inference(rw,[status(thm)],[c_0_75,c_0_48]),c_0_19])]) ).

cnf(c_0_79,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_76,c_0_77]),c_0_76]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : GRP682+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n019.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Oct  3 02:50:06 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.21/0.50  Running first-order theorem proving
% 0.21/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/tmp/tmp.h0dIfEcbDE/E---3.1_13768.p
% 0.21/0.54  # Version: 3.1pre001
% 0.21/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54  # Starting sh5l with 300s (1) cores
% 0.21/0.54  # sh5l with pid 13849 completed with status 0
% 0.21/0.54  # Result found by sh5l
% 0.21/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54  # Starting sh5l with 300s (1) cores
% 0.21/0.54  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54  # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.21/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54  # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.21/0.54  # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 13852 completed with status 0
% 0.21/0.54  # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.21/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54  # Starting sh5l with 300s (1) cores
% 0.21/0.54  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54  # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.21/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54  # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.21/0.54  # Preprocessing time       : 0.001 s
% 0.21/0.54  # Presaturation interreduction done
% 0.21/0.54  
% 0.21/0.54  # Proof found!
% 0.21/0.54  # SZS status Theorem
% 0.21/0.54  # SZS output start CNFRefutation
% See solution above
% 0.21/0.54  # Parsed axioms                        : 8
% 0.21/0.54  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.54  # Initial clauses                      : 8
% 0.21/0.54  # Removed in clause preprocessing      : 0
% 0.21/0.54  # Initial clauses in saturation        : 8
% 0.21/0.54  # Processed clauses                    : 166
% 0.21/0.54  # ...of these trivial                  : 37
% 0.21/0.54  # ...subsumed                          : 0
% 0.21/0.54  # ...remaining for further processing  : 129
% 0.21/0.54  # Other redundant clauses eliminated   : 0
% 0.21/0.54  # Clauses deleted for lack of memory   : 0
% 0.21/0.54  # Backward-subsumed                    : 0
% 0.21/0.54  # Backward-rewritten                   : 85
% 0.21/0.54  # Generated clauses                    : 2520
% 0.21/0.54  # ...of the previous two non-redundant : 1567
% 0.21/0.54  # ...aggressively subsumed             : 0
% 0.21/0.54  # Contextual simplify-reflections      : 0
% 0.21/0.54  # Paramodulations                      : 2520
% 0.21/0.54  # Factorizations                       : 0
% 0.21/0.54  # NegExts                              : 0
% 0.21/0.54  # Equation resolutions                 : 0
% 0.21/0.54  # Total rewrite steps                  : 4949
% 0.21/0.54  # Propositional unsat checks           : 0
% 0.21/0.54  #    Propositional check models        : 0
% 0.21/0.54  #    Propositional check unsatisfiable : 0
% 0.21/0.54  #    Propositional clauses             : 0
% 0.21/0.54  #    Propositional clauses after purity: 0
% 0.21/0.54  #    Propositional unsat core size     : 0
% 0.21/0.54  #    Propositional preprocessing time  : 0.000
% 0.21/0.54  #    Propositional encoding time       : 0.000
% 0.21/0.54  #    Propositional solver time         : 0.000
% 0.21/0.54  #    Success case prop preproc time    : 0.000
% 0.21/0.54  #    Success case prop encoding time   : 0.000
% 0.21/0.54  #    Success case prop solver time     : 0.000
% 0.21/0.54  # Current number of processed clauses  : 36
% 0.21/0.54  #    Positive orientable unit clauses  : 36
% 0.21/0.54  #    Positive unorientable unit clauses: 0
% 0.21/0.54  #    Negative unit clauses             : 0
% 0.21/0.54  #    Non-unit-clauses                  : 0
% 0.21/0.54  # Current number of unprocessed clauses: 1116
% 0.21/0.54  # ...number of literals in the above   : 1116
% 0.21/0.54  # Current number of archived formulas  : 0
% 0.21/0.54  # Current number of archived clauses   : 93
% 0.21/0.54  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.54  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.54  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.54  # Unit Clause-clause subsumption calls : 0
% 0.21/0.54  # Rewrite failures with RHS unbound    : 2
% 0.21/0.54  # BW rewrite match attempts            : 216
% 0.21/0.54  # BW rewrite match successes           : 88
% 0.21/0.54  # Condensation attempts                : 0
% 0.21/0.54  # Condensation successes               : 0
% 0.21/0.54  # Termbank termtop insertions          : 32100
% 0.21/0.54  
% 0.21/0.54  # -------------------------------------------------
% 0.21/0.54  # User time                : 0.031 s
% 0.21/0.54  # System time              : 0.000 s
% 0.21/0.54  # Total time               : 0.031 s
% 0.21/0.54  # Maximum resident set size: 1772 pages
% 0.21/0.54  
% 0.21/0.54  # -------------------------------------------------
% 0.21/0.54  # User time                : 0.034 s
% 0.21/0.54  # System time              : 0.001 s
% 0.21/0.54  # Total time               : 0.034 s
% 0.21/0.54  # Maximum resident set size: 1672 pages
% 0.21/0.54  % E---3.1 exiting
% 0.21/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------