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

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

% Computer : n007.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:49:36 EDT 2022

% Result   : Theorem 7.91s 2.41s
% Output   : CNFRefutation 7.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   48 (  34 unt;   0 nHn;  28 RR)
%            Number of literals    :   64 (  36 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   57 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_16) ).

cnf(i_0_6,negated_conjecture,
    leq(multiplication(esk1_0,c(esk2_0)),esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_6) ).

cnf(i_0_2,plain,
    addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.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-ypsjnjyi/lgb.p',i_0_1) ).

cnf(i_0_26,plain,
    ( complement(X1,X2)
    | c(X1) != X2
    | ~ test(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_26) ).

cnf(i_0_18,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_18) ).

cnf(i_0_22,plain,
    ( addition(X1,X2) = one
    | ~ complement(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_22) ).

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

cnf(i_0_8,negated_conjecture,
    test(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_8) ).

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

cnf(i_0_20,plain,
    ( complement(esk4_1(X1),X1)
    | ~ test(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_20) ).

cnf(i_0_11,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_11) ).

cnf(i_0_9,negated_conjecture,
    test(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_9) ).

cnf(i_0_5,negated_conjecture,
    ~ leq(esk1_0,addition(esk2_0,esk3_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ypsjnjyi/lgb.p',i_0_5) ).

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

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

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

cnf(c_0_44,negated_conjecture,
    leq(multiplication(esk1_0,c(esk2_0)),esk3_0),
    i_0_6 ).

cnf(c_0_45,negated_conjecture,
    addition(multiplication(esk1_0,c(esk2_0)),esk3_0) = esk3_0,
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

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

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

cnf(c_0_48,negated_conjecture,
    addition(esk3_0,multiplication(esk1_0,c(esk2_0))) = esk3_0,
    inference(rw,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    addition(esk3_0,addition(multiplication(esk1_0,c(esk2_0)),X1)) = addition(esk3_0,X1),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_50,plain,
    ( complement(X1,X2)
    | c(X1) != X2
    | ~ test(X1) ),
    i_0_26 ).

cnf(c_0_51,plain,
    addition(esk3_0,addition(X1,multiplication(esk1_0,c(esk2_0)))) = addition(esk3_0,X1),
    inference(spm,[status(thm)],[c_0_49,c_0_46]) ).

cnf(c_0_52,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    i_0_18 ).

cnf(c_0_53,plain,
    ( addition(X1,X2) = one
    | ~ complement(X2,X1) ),
    i_0_22 ).

cnf(c_0_54,plain,
    ( complement(X1,c(X1))
    | ~ test(X1) ),
    inference(er,[status(thm)],[c_0_50]) ).

cnf(c_0_55,plain,
    addition(esk3_0,multiplication(esk1_0,addition(X1,c(esk2_0)))) = addition(esk3_0,multiplication(esk1_0,X1)),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_56,plain,
    ( addition(X1,c(X1)) = one
    | ~ test(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_46]) ).

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

cnf(c_0_58,negated_conjecture,
    test(esk2_0),
    i_0_8 ).

cnf(c_0_59,plain,
    addition(X1,X1) = X1,
    i_0_3 ).

cnf(c_0_60,plain,
    ( complement(esk4_1(X1),X1)
    | ~ test(X1) ),
    i_0_20 ).

cnf(c_0_61,plain,
    addition(esk3_0,multiplication(esk1_0,esk2_0)) = addition(esk1_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_46]),c_0_58])]) ).

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

cnf(c_0_63,plain,
    ( addition(X1,esk4_1(X1)) = one
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_53,c_0_60]) ).

cnf(c_0_64,plain,
    addition(esk3_0,addition(multiplication(esk1_0,esk2_0),X1)) = addition(esk1_0,addition(esk3_0,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_61]),c_0_47]) ).

cnf(c_0_65,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    i_0_11 ).

cnf(c_0_66,plain,
    ( addition(X1,one) = one
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    test(esk1_0),
    i_0_9 ).

cnf(c_0_68,negated_conjecture,
    ~ leq(esk1_0,addition(esk2_0,esk3_0)),
    i_0_5 ).

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

cnf(c_0_70,plain,
    addition(esk3_0,multiplication(addition(esk1_0,X1),esk2_0)) = addition(esk1_0,addition(esk3_0,multiplication(X1,esk2_0))),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_71,negated_conjecture,
    addition(esk1_0,one) = one,
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

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

cnf(c_0_73,negated_conjecture,
    addition(esk1_0,addition(esk2_0,esk3_0)) != addition(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_74,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_72]),c_0_46]),c_0_46]),c_0_73]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : KLE018+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n007.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 16:04:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.91/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.41  # No SInE strategy applied
% 7.91/2.41  # Trying AutoSched0 for 150 seconds
% 7.91/2.41  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.91/2.41  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.91/2.41  #
% 7.91/2.41  # Preprocessing time       : 0.023 s
% 7.91/2.41  # Presaturation interreduction done
% 7.91/2.41  
% 7.91/2.41  # Proof found!
% 7.91/2.41  # SZS status Theorem
% 7.91/2.41  # SZS output start CNFRefutation
% See solution above
% 7.91/2.41  # Training examples: 0 positive, 0 negative
% 7.91/2.41  
% 7.91/2.41  # -------------------------------------------------
% 7.91/2.41  # User time                : 0.042 s
% 7.91/2.41  # System time              : 0.002 s
% 7.91/2.41  # Total time               : 0.044 s
% 7.91/2.41  # Maximum resident set size: 7124 pages
% 7.91/2.41  
%------------------------------------------------------------------------------