TSTP Solution File: GRP775+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GRP775+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% 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 : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 08:40:36 EDT 2022

% Result   : Theorem 8.00s 2.41s
% Output   : CNFRefutation 8.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   56 (  10 unt;   5 nHn;  44 RR)
%            Number of literals    :  114 (  53 equ;  57 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   98 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( product(X1,X2) = X2
    | ~ r(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_7) ).

cnf(i_0_11,plain,
    ( r(X1,esk1_2(X1,X2))
    | ~ d(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_11) ).

cnf(i_0_5,plain,
    ( product(X1,X2) = X1
    | ~ l(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_5) ).

cnf(i_0_10,plain,
    ( l(esk1_2(X1,X2),X2)
    | ~ d(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_10) ).

cnf(i_0_1,plain,
    product(product(X1,X2),X3) = product(X1,product(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_1) ).

cnf(i_0_9,plain,
    ( d(X1,X2)
    | ~ l(X3,X2)
    | ~ r(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_9) ).

cnf(i_0_3,plain,
    ( l(X1,X2)
    | product(X2,X1) != X2
    | product(X1,X2) != X1 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_3) ).

cnf(i_0_12,negated_conjecture,
    ( product(esk3_0,product(esk2_0,esk3_0)) = esk3_0
    | d(esk2_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_12) ).

cnf(i_0_2,plain,
    product(X1,X1) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_2) ).

cnf(i_0_6,plain,
    ( r(X1,X2)
    | product(X2,X1) != X1
    | product(X1,X2) != X2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_6) ).

cnf(i_0_8,plain,
    ( product(X1,X2) = X2
    | ~ r(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_8) ).

cnf(i_0_13,negated_conjecture,
    ( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
    | d(esk2_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_13) ).

cnf(i_0_4,plain,
    ( product(X1,X2) = X1
    | ~ l(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_4) ).

cnf(i_0_14,negated_conjecture,
    ( product(esk2_0,product(esk3_0,esk2_0)) != esk2_0
    | product(esk3_0,product(esk2_0,esk3_0)) != esk3_0
    | ~ d(esk2_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-659_fsfh/input.p',i_0_14) ).

cnf(c_0_29,plain,
    ( product(X1,X2) = X2
    | ~ r(X2,X1) ),
    i_0_7 ).

cnf(c_0_30,plain,
    ( r(X1,esk1_2(X1,X2))
    | ~ d(X1,X2) ),
    i_0_11 ).

cnf(c_0_31,plain,
    ( product(X1,X2) = X1
    | ~ l(X1,X2) ),
    i_0_5 ).

cnf(c_0_32,plain,
    ( l(esk1_2(X1,X2),X2)
    | ~ d(X1,X2) ),
    i_0_10 ).

cnf(c_0_33,plain,
    product(product(X1,X2),X3) = product(X1,product(X2,X3)),
    i_0_1 ).

cnf(c_0_34,plain,
    ( product(esk1_2(X1,X2),X1) = X1
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,plain,
    ( d(X1,X2)
    | ~ l(X3,X2)
    | ~ r(X1,X3) ),
    i_0_9 ).

cnf(c_0_36,plain,
    ( l(X1,X2)
    | product(X2,X1) != X2
    | product(X1,X2) != X1 ),
    i_0_3 ).

cnf(c_0_37,plain,
    ( product(esk1_2(X1,X2),X2) = esk1_2(X1,X2)
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_38,plain,
    ( product(esk1_2(X1,X2),product(X1,X3)) = product(X1,X3)
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,plain,
    ( d(X1,X2)
    | product(X2,X3) != X2
    | product(X3,X2) != X3
    | ~ r(X1,X3) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,negated_conjecture,
    ( product(esk3_0,product(esk2_0,esk3_0)) = esk3_0
    | d(esk2_0,esk3_0) ),
    i_0_12 ).

cnf(c_0_41,plain,
    product(X1,X1) = X1,
    i_0_2 ).

cnf(c_0_42,plain,
    ( esk1_2(X1,product(X1,X2)) = product(X1,X2)
    | ~ d(X1,product(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_43,negated_conjecture,
    ( d(esk2_0,esk3_0)
    | d(X1,esk3_0)
    | ~ r(X1,product(esk2_0,esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33]),c_0_41])]) ).

cnf(c_0_44,plain,
    ( r(X1,product(X1,X2))
    | ~ d(X1,product(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_42]) ).

cnf(c_0_45,plain,
    ( d(X1,X2)
    | ~ r(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_41]),c_0_41])]) ).

cnf(c_0_46,plain,
    ( r(X1,X2)
    | product(X2,X1) != X1
    | product(X1,X2) != X2 ),
    i_0_6 ).

cnf(c_0_47,plain,
    product(X1,product(X1,X2)) = product(X1,X2),
    inference(spm,[status(thm)],[c_0_33,c_0_41]) ).

cnf(c_0_48,plain,
    ( product(X1,X2) = X2
    | ~ r(X1,X2) ),
    i_0_8 ).

cnf(c_0_49,plain,
    product(X1,product(X2,product(X1,X2))) = product(X1,X2),
    inference(spm,[status(thm)],[c_0_41,c_0_33]) ).

cnf(c_0_50,plain,
    ( d(esk2_0,esk3_0)
    | ~ d(esk2_0,product(esk2_0,esk3_0)) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ( d(X1,X2)
    | product(X2,X1) != X1
    | product(X1,X2) != X2 ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    ( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
    | d(esk2_0,esk3_0) ),
    i_0_13 ).

cnf(c_0_53,plain,
    product(X1,product(X2,product(X1,product(X2,X3)))) = product(X1,product(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_47]),c_0_33]),c_0_33]) ).

cnf(c_0_54,plain,
    ( product(X1,esk1_2(X1,X2)) = esk1_2(X1,X2)
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_30]) ).

cnf(c_0_55,plain,
    ( product(X1,X2) = X1
    | ~ l(X2,X1) ),
    i_0_4 ).

cnf(c_0_56,plain,
    ( product(esk1_2(X1,X2),product(X2,esk1_2(X1,X2))) = esk1_2(X1,X2)
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_49,c_0_37]) ).

cnf(c_0_57,plain,
    ( product(esk1_2(X1,X2),product(X2,X3)) = product(esk1_2(X1,X2),X3)
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_33,c_0_37]) ).

cnf(c_0_58,negated_conjecture,
    ( product(esk2_0,product(esk3_0,esk2_0)) != esk2_0
    | product(esk3_0,product(esk2_0,esk3_0)) != esk3_0
    | ~ d(esk2_0,esk3_0) ),
    i_0_14 ).

cnf(c_0_59,plain,
    d(esk2_0,esk3_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_33]),c_0_47])]),c_0_52]) ).

cnf(c_0_60,plain,
    ( product(X1,product(X2,product(X1,esk1_2(X2,X3)))) = product(X1,esk1_2(X2,X3))
    | ~ d(X2,X3) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_61,plain,
    ( product(X1,esk1_2(X2,X1)) = X1
    | ~ d(X2,X1) ),
    inference(spm,[status(thm)],[c_0_55,c_0_32]) ).

cnf(c_0_62,plain,
    ( product(esk1_2(X1,X2),product(X2,product(esk1_2(X1,X2),X3))) = product(esk1_2(X1,X2),X3)
    | ~ d(X1,X2) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_56]),c_0_33]) ).

cnf(c_0_63,plain,
    ( product(esk1_2(X1,X2),product(X3,product(X2,X3))) = product(esk1_2(X1,X2),product(X2,X3))
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_57,c_0_49]) ).

cnf(c_0_64,negated_conjecture,
    ( product(esk2_0,product(esk3_0,esk2_0)) != esk2_0
    | product(esk3_0,product(esk2_0,esk3_0)) != esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).

cnf(c_0_65,plain,
    ( product(X1,product(X2,X1)) = X1
    | ~ d(X2,X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_66,plain,
    ( product(esk1_2(X1,X2),product(X2,X1)) = X1
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_62,c_0_34]) ).

cnf(c_0_67,plain,
    ( product(esk1_2(X1,X2),product(X2,X1)) = product(X1,product(X2,X1))
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_38,c_0_63]) ).

cnf(c_0_68,negated_conjecture,
    product(esk2_0,product(esk3_0,esk2_0)) != esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_59])]) ).

cnf(c_0_69,plain,
    ( product(X1,product(X2,X1)) = X1
    | ~ d(X1,X2) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_70,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_59])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP775+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 13:30:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.00/2.41  # ENIGMATIC: Solved by autoschedule:
% 8.00/2.41  # No SInE strategy applied
% 8.00/2.41  # Trying AutoSched0 for 150 seconds
% 8.00/2.41  # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN
% 8.00/2.41  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.00/2.41  #
% 8.00/2.41  # Preprocessing time       : 0.012 s
% 8.00/2.41  # Presaturation interreduction done
% 8.00/2.41  
% 8.00/2.41  # Proof found!
% 8.00/2.41  # SZS status Theorem
% 8.00/2.41  # SZS output start CNFRefutation
% See solution above
% 8.00/2.41  # Training examples: 0 positive, 0 negative
% 8.00/2.41  
% 8.00/2.41  # -------------------------------------------------
% 8.00/2.41  # User time                : 0.053 s
% 8.00/2.41  # System time              : 0.004 s
% 8.00/2.41  # Total time               : 0.057 s
% 8.00/2.41  # Maximum resident set size: 7120 pages
% 8.00/2.41  
%------------------------------------------------------------------------------