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

% Computer : n009.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:58 EDT 2022

% Result   : Theorem 6.36s 2.27s
% Output   : CNFRefutation 6.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   3 RR)
%            Number of literals    :   13 (  12 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   17 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4is3hzgq/lgb.p',i_0_19) ).

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

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

cnf(i_0_7,plain,
    addition(domain(X1),one) = one,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4is3hzgq/lgb.p',i_0_7) ).

cnf(i_0_10,negated_conjecture,
    addition(domain(esk1_0),multiplication(domain(esk1_0),domain(esk2_0))) != domain(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4is3hzgq/lgb.p',i_0_10) ).

cnf(c_0_25,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    i_0_19 ).

cnf(c_0_26,plain,
    multiplication(X1,one) = X1,
    i_0_15 ).

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

cnf(c_0_28,plain,
    addition(domain(X1),one) = one,
    i_0_7 ).

cnf(c_0_29,negated_conjecture,
    addition(domain(esk1_0),multiplication(domain(esk1_0),domain(esk2_0))) != domain(esk1_0),
    i_0_10 ).

cnf(c_0_30,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_31,plain,
    addition(one,domain(X1)) = one,
    inference(rw,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_27]),c_0_31]),c_0_26])]),
    [proof] ).

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