TSTP Solution File: KLE147+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n021.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 : Sun Jul 17 01:50:34 EDT 2022

% Result   : Theorem 60.64s 9.03s
% Output   : CNFRefutation 60.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   61 (  42 unt;   0 nHn;  24 RR)
%            Number of literals    :   80 (  39 equ;  22 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :  109 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
    addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_2) ).

cnf(i_0_1,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_1) ).

cnf(i_0_8,plain,
    ( leq(X1,multiplication(strong_iteration(X2),X3))
    | ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_8) ).

cnf(i_0_15,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_15) ).

cnf(i_0_7,plain,
    addition(X1,X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_7) ).

cnf(i_0_9,plain,
    addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_9) ).

cnf(i_0_11,plain,
    multiplication(zero,X1) = zero,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_11) ).

cnf(i_0_3,plain,
    addition(X1,zero) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_3) ).

cnf(i_0_18,plain,
    ( leq(multiplication(X1,star(X2)),X3)
    | ~ leq(addition(multiplication(X3,X2),X1),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_18) ).

cnf(i_0_12,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_12) ).

cnf(i_0_13,plain,
    multiplication(one,X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_13) ).

cnf(i_0_14,plain,
    multiplication(X1,one) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_14) ).

cnf(i_0_20,plain,
    addition(one,multiplication(star(X1),X1)) = star(X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_20) ).

cnf(i_0_16,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_16) ).

cnf(i_0_5,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_5) ).

cnf(i_0_17,plain,
    ( leq(multiplication(star(X1),X2),X3)
    | ~ leq(addition(multiplication(X1,X3),X2),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_17) ).

cnf(i_0_6,negated_conjecture,
    ( ~ leq(strong_iteration(multiplication(star(esk1_0),esk2_0)),multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))))
    | ~ leq(multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))),strong_iteration(multiplication(star(esk1_0),esk2_0))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-foefcvxv/input.p',i_0_6) ).

cnf(c_0_38,plain,
    addition(X1,X2) = addition(X2,X1),
    i_0_2 ).

cnf(c_0_39,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    i_0_1 ).

cnf(c_0_40,plain,
    ( leq(X1,multiplication(strong_iteration(X2),X3))
    | ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
    i_0_8 ).

cnf(c_0_41,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    i_0_15 ).

cnf(c_0_42,plain,
    addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,plain,
    addition(X1,X1) = X1,
    i_0_7 ).

cnf(c_0_44,plain,
    addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
    i_0_9 ).

cnf(c_0_45,plain,
    ( leq(X1,multiplication(strong_iteration(X2),X3))
    | addition(X1,addition(multiplication(X2,X1),X3)) != addition(multiplication(X2,X1),X3) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_46,plain,
    addition(X1,addition(X2,X1)) = addition(X2,X1),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_47,plain,
    addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
    inference(rw,[status(thm)],[c_0_44,c_0_38]) ).

cnf(c_0_48,plain,
    multiplication(zero,X1) = zero,
    i_0_11 ).

cnf(c_0_49,plain,
    addition(X1,zero) = X1,
    i_0_3 ).

cnf(c_0_50,plain,
    ( leq(multiplication(X1,star(X2)),X3)
    | ~ leq(addition(multiplication(X3,X2),X1),X3) ),
    i_0_18 ).

cnf(c_0_51,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    i_0_12 ).

cnf(c_0_52,plain,
    leq(X1,multiplication(strong_iteration(X2),X1)),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_53,plain,
    strong_iteration(zero) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).

cnf(c_0_54,plain,
    multiplication(one,X1) = X1,
    i_0_13 ).

cnf(c_0_55,plain,
    ( leq(multiplication(X1,multiplication(X2,star(X2))),X1)
    | ~ leq(multiplication(X1,X2),X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_51]) ).

cnf(c_0_56,plain,
    multiplication(X1,one) = X1,
    i_0_14 ).

cnf(c_0_57,plain,
    leq(X1,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).

cnf(c_0_58,plain,
    leq(multiplication(X1,star(one)),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_54]),c_0_56]),c_0_57])]) ).

cnf(c_0_59,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_39,c_0_43]) ).

cnf(c_0_60,plain,
    addition(one,multiplication(star(X1),X1)) = star(X1),
    i_0_20 ).

cnf(c_0_61,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    i_0_16 ).

cnf(c_0_62,plain,
    leq(star(one),one),
    inference(spm,[status(thm)],[c_0_58,c_0_54]) ).

cnf(c_0_63,plain,
    addition(one,star(X1)) = star(X1),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_64,plain,
    star(one) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_38]),c_0_63]) ).

cnf(c_0_65,plain,
    ( leq(X1,X2)
    | ~ leq(addition(X2,X1),X2) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_56]),c_0_64]),c_0_56]) ).

cnf(c_0_66,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    i_0_5 ).

cnf(c_0_67,plain,
    ( leq(X1,X2)
    | ~ leq(addition(X1,X2),X2) ),
    inference(spm,[status(thm)],[c_0_65,c_0_38]) ).

cnf(c_0_68,plain,
    ( leq(multiplication(star(X1),X2),X3)
    | ~ leq(addition(multiplication(X1,X3),X2),X3) ),
    i_0_17 ).

cnf(c_0_69,plain,
    addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_54]),c_0_38]) ).

cnf(c_0_70,plain,
    addition(multiplication(X1,X2),addition(multiplication(X3,X2),X4)) = addition(multiplication(addition(X1,X3),X2),X4),
    inference(spm,[status(thm)],[c_0_39,c_0_66]) ).

cnf(c_0_71,plain,
    ( leq(multiplication(X1,X2),multiplication(X3,X2))
    | ~ leq(multiplication(addition(X1,X3),X2),multiplication(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_67,c_0_66]) ).

cnf(c_0_72,plain,
    ( leq(multiplication(star(X1),multiplication(X2,X3)),X3)
    | ~ leq(multiplication(addition(X1,X2),X3),X3) ),
    inference(spm,[status(thm)],[c_0_68,c_0_66]) ).

cnf(c_0_73,plain,
    multiplication(addition(X1,one),strong_iteration(X1)) = strong_iteration(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_38]),c_0_69]) ).

cnf(c_0_74,plain,
    addition(X1,addition(multiplication(X2,X1),X3)) = addition(multiplication(addition(one,X2),X1),X3),
    inference(spm,[status(thm)],[c_0_70,c_0_54]) ).

cnf(c_0_75,negated_conjecture,
    ( ~ leq(strong_iteration(multiplication(star(esk1_0),esk2_0)),multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))))
    | ~ leq(multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))),strong_iteration(multiplication(star(esk1_0),esk2_0))) ),
    i_0_6 ).

cnf(c_0_76,plain,
    leq(X1,multiplication(star(X2),X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_63]),c_0_54]),c_0_57])]) ).

cnf(c_0_77,plain,
    ( leq(multiplication(star(X1),strong_iteration(X2)),strong_iteration(X2))
    | ~ leq(multiplication(addition(X1,addition(X2,one)),strong_iteration(X2)),strong_iteration(X2)) ),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_78,plain,
    addition(X1,addition(multiplication(star(X2),X1),X3)) = addition(multiplication(star(X2),X1),X3),
    inference(spm,[status(thm)],[c_0_74,c_0_63]) ).

cnf(c_0_79,negated_conjecture,
    ~ leq(multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))),strong_iteration(multiplication(star(esk1_0),esk2_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).

cnf(c_0_80,plain,
    leq(multiplication(star(X1),strong_iteration(multiplication(star(X2),X1))),strong_iteration(multiplication(star(X2),X1))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_73]),c_0_57])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KLE147+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n021.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 : Thu Jun 16 10:17:46 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 60.64/9.03  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 60.64/9.03  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 33; version: 991; iters: 150)
% 60.64/9.03  # Preprocessing time       : 1.125 s
% 60.64/9.03  
% 60.64/9.03  # Proof found!
% 60.64/9.03  # SZS status Theorem
% 60.64/9.03  # SZS output start CNFRefutation
% See solution above
% 60.64/9.03  # Training examples: 0 positive, 0 negative
% 60.64/9.03  
% 60.64/9.03  # -------------------------------------------------
% 60.64/9.03  # User time                : 6.259 s
% 60.64/9.03  # System time              : 0.222 s
% 60.64/9.03  # Total time               : 6.481 s
% 60.64/9.03  # ...preprocessing         : 1.125 s
% 60.64/9.03  # ...main loop             : 5.357 s
% 60.64/9.03  # Maximum resident set size: 175396 pages
% 60.64/9.03  
%------------------------------------------------------------------------------