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

View Problem - Process Solution

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

% Computer : n017.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:47 EDT 2022

% Result   : Theorem 8.02s 2.49s
% Output   : CNFRefutation 8.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   35 (  31 unt;   0 nHn;   8 RR)
%            Number of literals    :   39 (  28 equ;   7 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   53 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_1) ).

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

cnf(i_0_14,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_14) ).

cnf(i_0_10,plain,
    multiplication(X1,one) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_10) ).

cnf(i_0_2,plain,
    addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_2) ).

cnf(i_0_12,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_12) ).

cnf(i_0_17,plain,
    leq(addition(one,multiplication(star(X1),X1)),star(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_17) ).

cnf(i_0_18,plain,
    leq(addition(one,multiplication(X1,star(X1))),star(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_18) ).

cnf(i_0_7,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_7) ).

cnf(i_0_9,plain,
    multiplication(one,X1) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_9) ).

cnf(i_0_5,negated_conjecture,
    ~ leq(esk1_0,star(esk1_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wycm9nxi/lgb.p',i_0_5) ).

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

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

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

cnf(c_0_33,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    i_0_14 ).

cnf(c_0_34,plain,
    multiplication(X1,one) = X1,
    i_0_10 ).

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

cnf(c_0_36,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    i_0_12 ).

cnf(c_0_38,plain,
    leq(addition(one,multiplication(star(X1),X1)),star(X1)),
    i_0_17 ).

cnf(c_0_39,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

cnf(c_0_40,plain,
    leq(addition(one,multiplication(X1,star(X1))),star(X1)),
    i_0_18 ).

cnf(c_0_41,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    i_0_7 ).

cnf(c_0_42,plain,
    multiplication(one,X1) = X1,
    i_0_9 ).

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

cnf(c_0_44,plain,
    addition(one,multiplication(star(X1),addition(X1,one))) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31]),c_0_35]),c_0_39]) ).

cnf(c_0_45,plain,
    addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_31]),c_0_35]) ).

cnf(c_0_46,negated_conjecture,
    ~ leq(esk1_0,star(esk1_0)),
    i_0_5 ).

cnf(c_0_47,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    i_0_11 ).

cnf(c_0_48,plain,
    addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_35]) ).

cnf(c_0_49,plain,
    multiplication(star(X1),addition(X1,one)) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]),c_0_39]),c_0_31]),c_0_32]) ).

cnf(c_0_50,plain,
    addition(one,star(X1)) = star(X1),
    inference(spm,[status(thm)],[c_0_36,c_0_45]) ).

cnf(c_0_51,negated_conjecture,
    addition(esk1_0,star(esk1_0)) != star(esk1_0),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_52,plain,
    addition(X1,star(X1)) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_31]),c_0_50]),c_0_35]),c_0_50]),c_0_49]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KLE038+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n017.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 : Thu Jun 16 08:36:57 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.02/2.49  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.02/2.49  # No SInE strategy applied
% 8.02/2.49  # Trying AutoSched0 for 150 seconds
% 8.02/2.49  # AutoSched0-Mode selected heuristic G_____0010_evo
% 8.02/2.49  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.02/2.49  #
% 8.02/2.49  # Preprocessing time       : 0.023 s
% 8.02/2.49  
% 8.02/2.49  # Proof found!
% 8.02/2.49  # SZS status Theorem
% 8.02/2.49  # SZS output start CNFRefutation
% See solution above
% 8.02/2.49  # Training examples: 0 positive, 0 negative
% 8.02/2.49  
% 8.02/2.49  # -------------------------------------------------
% 8.02/2.49  # User time                : 0.048 s
% 8.02/2.49  # System time              : 0.004 s
% 8.02/2.49  # Total time               : 0.052 s
% 8.02/2.49  # Maximum resident set size: 7120 pages
% 8.02/2.49  
%------------------------------------------------------------------------------