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

View Problem - Process Solution

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

% Computer : n010.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:24 EDT 2022

% Result   : Theorem 8.65s 2.58s
% Output   : CNFRefutation 8.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   6 RR)
%            Number of literals    :   20 (  19 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8o8wpyh6/lgb.p',i_0_9) ).

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

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

cnf(i_0_7,plain,
    multiplication(X1,coantidomain(X1)) = zero,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8o8wpyh6/lgb.p',i_0_7) ).

cnf(i_0_4,plain,
    addition(X1,zero) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8o8wpyh6/lgb.p',i_0_4) ).

cnf(i_0_19,negated_conjecture,
    addition(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(esk1_0)))),zero))),antidomain(antidomain(esk2_0))) != antidomain(antidomain(esk2_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8o8wpyh6/lgb.p',i_0_19) ).

cnf(i_0_27,plain,
    multiplication(X1,zero) = zero,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8o8wpyh6/lgb.p',i_0_27) ).

cnf(c_0_35,plain,
    addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
    i_0_9 ).

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

cnf(c_0_37,plain,
    multiplication(one,X1) = X1,
    i_0_23 ).

cnf(c_0_38,plain,
    multiplication(X1,coantidomain(X1)) = zero,
    i_0_7 ).

cnf(c_0_39,plain,
    addition(X1,zero) = X1,
    i_0_4 ).

cnf(c_0_40,negated_conjecture,
    addition(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(esk1_0)))),zero))),antidomain(antidomain(esk2_0))) != antidomain(antidomain(esk2_0)),
    i_0_19 ).

cnf(c_0_41,plain,
    multiplication(X1,zero) = zero,
    i_0_27 ).

cnf(c_0_42,plain,
    addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
    inference(rw,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_43,plain,
    coantidomain(one) = zero,
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_44,plain,
    addition(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_39,c_0_36]) ).

cnf(c_0_45,negated_conjecture,
    addition(antidomain(antidomain(esk2_0)),coantidomain(coantidomain(zero))) != antidomain(antidomain(esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_36]) ).

cnf(c_0_46,plain,
    coantidomain(zero) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_43]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : KLE119+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 16 12:44:10 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.65/2.58  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.65/2.58  # No SInE strategy applied
% 8.65/2.58  # Trying AutoSched0 for 150 seconds
% 8.65/2.58  # AutoSched0-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 8.65/2.58  # and selection function SelectNewComplexAHP.
% 8.65/2.58  #
% 8.65/2.58  # Preprocessing time       : 0.012 s
% 8.65/2.58  
% 8.65/2.58  # Proof found!
% 8.65/2.58  # SZS status Theorem
% 8.65/2.58  # SZS output start CNFRefutation
% See solution above
% 8.65/2.58  # Training examples: 0 positive, 0 negative
% 8.65/2.58  
% 8.65/2.58  # -------------------------------------------------
% 8.65/2.58  # User time                : 0.014 s
% 8.65/2.58  # System time              : 0.004 s
% 8.65/2.58  # Total time               : 0.018 s
% 8.65/2.58  # Maximum resident set size: 7128 pages
% 8.65/2.58  
%------------------------------------------------------------------------------