↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GRP660+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n022.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:05 EDT 2022

% Result   : Theorem 9.31s 2.57s
% Output   : CNFRefutation 9.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   58 (  55 unt;   0 nHn;   5 RR)
%            Number of literals    :   61 (  60 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  118 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    rd(mult(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9it8pitd/lgb.p',i_0_4) ).

cnf(i_0_5,plain,
    mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9it8pitd/lgb.p',i_0_5) ).

cnf(i_0_3,plain,
    mult(rd(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9it8pitd/lgb.p',i_0_3) ).

cnf(i_0_1,plain,
    mult(X1,ld(X1,X2)) = X2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9it8pitd/lgb.p',i_0_1) ).

cnf(i_0_2,plain,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9it8pitd/lgb.p',i_0_2) ).

cnf(i_0_6,negated_conjecture,
    ( mult(esk1_0,ld(esk2_0,esk2_0)) != esk1_0
    | mult(ld(esk2_0,esk2_0),esk1_0) != esk1_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9it8pitd/lgb.p',i_0_6) ).

cnf(c_0_13,plain,
    rd(mult(X1,X2),X2) = X1,
    i_0_4 ).

cnf(c_0_14,plain,
    mult(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,mult(X3,X1))),
    i_0_5 ).

cnf(c_0_15,plain,
    rd(mult(X1,mult(X2,mult(X3,X1))),X1) = mult(mult(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,plain,
    mult(rd(X1,X2),X2) = X1,
    i_0_3 ).

cnf(c_0_17,plain,
    mult(mult(X1,rd(X2,mult(X3,X1))),X3) = rd(mult(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,plain,
    rd(rd(mult(X1,X2),X1),X3) = mult(X1,rd(X2,mult(X3,X1))),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_19,plain,
    mult(mult(X1,X2),rd(X3,X1)) = rd(mult(X1,mult(X2,X3)),X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    mult(X1,ld(X1,X2)) = X2,
    i_0_1 ).

cnf(c_0_21,plain,
    ld(X1,mult(X1,X2)) = X2,
    i_0_2 ).

cnf(c_0_22,plain,
    mult(X1,rd(X1,mult(X2,X1))) = rd(X1,X2),
    inference(spm,[status(thm)],[c_0_18,c_0_13]) ).

cnf(c_0_23,plain,
    rd(mult(X1,mult(ld(X1,X2),X3)),X1) = mult(X2,rd(X3,X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ld(rd(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_21,c_0_16]) ).

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

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

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

cnf(c_0_28,plain,
    rd(X1,ld(X2,X1)) = X2,
    inference(spm,[status(thm)],[c_0_13,c_0_20]) ).

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

cnf(c_0_30,plain,
    mult(ld(X1,X2),X2) = ld(ld(X2,X1),X2),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    mult(X1,mult(ld(X1,X2),mult(X3,X1))) = mult(mult(X2,X3),X1),
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_32,plain,
    ld(rd(ld(X1,X1),X2),mult(X2,X1)) = mult(X2,mult(X2,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_21]) ).

cnf(c_0_33,plain,
    rd(ld(ld(X1,X2),X1),X1) = ld(X2,X1),
    inference(spm,[status(thm)],[c_0_13,c_0_30]) ).

cnf(c_0_34,plain,
    ld(X1,mult(mult(X2,X3),X1)) = mult(ld(X1,X2),mult(X3,X1)),
    inference(spm,[status(thm)],[c_0_21,c_0_31]) ).

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

cnf(c_0_36,plain,
    rd(ld(X1,X2),X2) = ld(mult(X2,X1),X2),
    inference(spm,[status(thm)],[c_0_33,c_0_21]) ).

cnf(c_0_37,plain,
    mult(ld(X1,X2),mult(ld(X2,X3),X1)) = ld(X1,mult(X3,X1)),
    inference(spm,[status(thm)],[c_0_34,c_0_20]) ).

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

cnf(c_0_39,plain,
    ld(ld(X1,X2),ld(X1,mult(X3,X1))) = mult(ld(X2,X3),X1),
    inference(spm,[status(thm)],[c_0_21,c_0_37]) ).

cnf(c_0_40,plain,
    mult(X1,rd(ld(X1,X1),mult(X1,X1))) = ld(X1,rd(X1,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_38]),c_0_20]),c_0_25]) ).

cnf(c_0_41,plain,
    mult(ld(X1,rd(X2,X3)),X3) = ld(ld(X3,X1),ld(X3,X2)),
    inference(spm,[status(thm)],[c_0_39,c_0_16]) ).

cnf(c_0_42,plain,
    ld(ld(X1,X1),ld(X1,X1)) = rd(X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_40]),c_0_41]),c_0_20]) ).

cnf(c_0_43,plain,
    rd(ld(X1,X1),rd(X1,X1)) = ld(X1,X1),
    inference(spm,[status(thm)],[c_0_28,c_0_42]) ).

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

cnf(c_0_45,plain,
    mult(mult(ld(X1,X2),rd(X3,X2)),X1) = rd(mult(ld(X1,X2),X3),ld(X1,X2)),
    inference(spm,[status(thm)],[c_0_17,c_0_20]) ).

cnf(c_0_46,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_32,c_0_43]),c_0_16]),c_0_16]),c_0_16]) ).

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

cnf(c_0_48,plain,
    mult(X1,rd(ld(X1,X2),ld(X1,X1))) = mult(X1,mult(ld(X1,ld(X1,X1)),X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_46]),c_0_47]) ).

cnf(c_0_49,plain,
    rd(X1,X1) = ld(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_20]) ).

cnf(c_0_50,plain,
    rd(ld(ld(X1,X2),ld(X1,X3)),X1) = ld(X2,rd(X3,X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_20]) ).

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

cnf(c_0_52,plain,
    rd(ld(X1,X2),ld(X1,X1)) = mult(ld(X1,ld(X1,X1)),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_48]),c_0_21]) ).

cnf(c_0_53,plain,
    ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_49]),c_0_49]) ).

cnf(c_0_54,plain,
    rd(ld(ld(ld(X1,X1),X2),X1),ld(X1,X1)) = ld(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_28]) ).

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

cnf(c_0_56,plain,
    rd(ld(ld(X1,X1),X2),ld(X1,X1)) = mult(ld(X1,X1),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_53]) ).

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

cnf(c_0_58,negated_conjecture,
    ( mult(esk1_0,ld(esk2_0,esk2_0)) != esk1_0
    | mult(ld(esk2_0,esk2_0),esk1_0) != esk1_0 ),
    i_0_6 ).

cnf(c_0_59,plain,
    mult(X1,ld(X2,X2)) = ld(ld(X2,X2),X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_20]),c_0_57]),c_0_46]) ).

cnf(c_0_60,negated_conjecture,
    ( ld(ld(esk2_0,esk2_0),esk1_0) != esk1_0
    | mult(ld(esk2_0,esk2_0),esk1_0) != esk1_0 ),
    inference(rw,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_61,plain,
    mult(ld(X1,X1),X2) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_59]),c_0_56]) ).

cnf(c_0_62,negated_conjecture,
    ld(ld(esk2_0,esk2_0),esk1_0) != esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).

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

cnf(c_0_64,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP660+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 12:12:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 9.31/2.57  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.31/2.57  # No SInE strategy applied
% 9.31/2.57  # Trying AutoSched0 for 150 seconds
% 9.31/2.57  # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 9.31/2.57  # and selection function SelectComplexExceptUniqMaxHorn.
% 9.31/2.57  #
% 9.31/2.57  # Preprocessing time       : 0.018 s
% 9.31/2.57  # Presaturation interreduction done
% 9.31/2.57  
% 9.31/2.57  # Proof found!
% 9.31/2.57  # SZS status Theorem
% 9.31/2.57  # SZS output start CNFRefutation
% See solution above
% 9.31/2.57  # Training examples: 0 positive, 0 negative
% 9.31/2.57  
% 9.31/2.57  # -------------------------------------------------
% 9.31/2.57  # User time                : 0.161 s
% 9.31/2.57  # System time              : 0.013 s
% 9.31/2.57  # Total time               : 0.175 s
% 9.31/2.57  # Maximum resident set size: 7124 pages
% 9.31/2.57  
%------------------------------------------------------------------------------