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

View Problem - Process Solution

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

% Computer : n029.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:50 EDT 2023

% Result   : Theorem 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   74 (  68 unt;   0 def)
%            Number of atoms       :   80 (  79 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (   9   ~;   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   :  157 (   0 sgn;  38   !;   0   ?)

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

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

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

fof(f04,axiom,
    ! [X2,X1] : mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
    file('/export/starexec/sandbox2/tmp/tmp.eTdgx7dCUP/E---3.1_28495.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/tmp/tmp.eTdgx7dCUP/E---3.1_28495.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/tmp/tmp.eTdgx7dCUP/E---3.1_28495.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/tmp/tmp.eTdgx7dCUP/E---3.1_28495.p',f05) ).

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

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

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

fof(c_0_10,plain,
    ! [X11] : rd(mult(X11,X11),X11) = X11,
    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,
    ! [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,
    ! [X14,X15,X16,X17] : rd(mult(mult(X17,X16),rd(X15,X14)),rd(X15,X14)) = mult(X17,rd(mult(X16,X14),X14)),
    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,
    ! [X23,X24,X25,X26] : ld(ld(X26,X25),mult(ld(X26,X25),mult(X24,X23))) = mult(ld(X26,mult(X26,X24)),X23),
    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,
    mult(ld(X1,X2),ld(X2,X2)) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_57,c_0_19]) ).

cnf(c_0_59,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_58]),c_0_52]) ).

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

cnf(c_0_61,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_59]),c_0_48]),c_0_46]),c_0_43]),c_0_46]) ).

fof(c_0_62,negated_conjecture,
    ( mult(esk1_0,ld(esk2_0,mult(esk2_0,esk3_0))) != mult(esk1_0,esk3_0)
    | mult(rd(mult(esk1_0,esk2_0),esk2_0),esk3_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_63,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_61]),c_0_14]),c_0_54]),c_0_54]) ).

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

cnf(c_0_65,plain,
    mult(mult(X1,mult(rd(X2,X3),X3)),X3) = mult(mult(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_35,c_0_47]) ).

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

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

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

cnf(c_0_69,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_66]) ).

cnf(c_0_70,plain,
    mult(mult(X1,ld(X2,X2)),X2) = mult(X1,X2),
    inference(rw,[status(thm)],[c_0_35,c_0_51]) ).

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

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

cnf(c_0_73,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_66])]),c_0_72])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : GRP683+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n029.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 2400
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Oct  3 02:34:07 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order theorem proving
% 0.16/0.42  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/tmp/tmp.eTdgx7dCUP/E---3.1_28495.p
% 0.16/0.45  # Version: 3.1pre001
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # Starting sh5l with 300s (1) cores
% 0.16/0.45  # new_bool_3 with pid 28574 completed with status 0
% 0.16/0.45  # Result found by new_bool_3
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.16/0.45  # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 28581 completed with status 0
% 0.16/0.45  # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.001 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Theorem
% 0.16/0.45  # SZS output start CNFRefutation
% See solution above
% 0.16/0.45  # Parsed axioms                        : 8
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.45  # Initial clauses                      : 8
% 0.16/0.45  # Removed in clause preprocessing      : 0
% 0.16/0.45  # Initial clauses in saturation        : 8
% 0.16/0.45  # Processed clauses                    : 151
% 0.16/0.45  # ...of these trivial                  : 32
% 0.16/0.45  # ...subsumed                          : 0
% 0.16/0.45  # ...remaining for further processing  : 118
% 0.16/0.45  # Other redundant clauses eliminated   : 0
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 0
% 0.16/0.45  # Backward-rewritten                   : 67
% 0.16/0.45  # Generated clauses                    : 2169
% 0.16/0.45  # ...of the previous two non-redundant : 1451
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 0
% 0.16/0.45  # Paramodulations                      : 2169
% 0.16/0.45  # Factorizations                       : 0
% 0.16/0.45  # NegExts                              : 0
% 0.16/0.45  # Equation resolutions                 : 0
% 0.16/0.45  # Total rewrite steps                  : 4217
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 43
% 0.16/0.45  #    Positive orientable unit clauses  : 43
% 0.16/0.45  #    Positive unorientable unit clauses: 0
% 0.16/0.45  #    Negative unit clauses             : 0
% 0.16/0.45  #    Non-unit-clauses                  : 0
% 0.16/0.45  # Current number of unprocessed clauses: 1040
% 0.16/0.45  # ...number of literals in the above   : 1040
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 75
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 0
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 0
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.45  # Unit Clause-clause subsumption calls : 0
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 191
% 0.16/0.45  # BW rewrite match successes           : 68
% 0.16/0.45  # Condensation attempts                : 0
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 29194
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.025 s
% 0.16/0.45  # System time              : 0.002 s
% 0.16/0.45  # Total time               : 0.027 s
% 0.16/0.45  # Maximum resident set size: 1752 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.025 s
% 0.16/0.45  # System time              : 0.005 s
% 0.16/0.45  # Total time               : 0.030 s
% 0.16/0.45  # Maximum resident set size: 1676 pages
% 0.16/0.45  % E---3.1 exiting
% 0.16/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------