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

View Problem - Process Solution

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

% Computer : n026.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 : Thu Jul 14 15:32:44 EDT 2022

% Result   : Theorem 8.53s 2.53s
% Output   : CNFRefutation 8.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   46 (  33 unt;  13 nHn;  46 RR)
%            Number of literals    :   87 (  80 equ;  10 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_130,negated_conjecture,
    op1(j(e20),j(e20)) = j(op2(e20,e20)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_130) ).

cnf(i_0_95,plain,
    op2(e20,e20) = e20,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_95) ).

cnf(i_0_161,plain,
    ( j(e20) = e10
    | j(e20) = e11
    | j(e20) = e12
    | j(e20) = e13
    | j(e20) = e14
    | ~ epred1_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_161) ).

cnf(i_0_156,negated_conjecture,
    epred1_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_156) ).

cnf(i_0_46,plain,
    op1(e14,e14) = e10,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_46) ).

cnf(i_0_7,plain,
    e14 != e10,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_7) ).

cnf(i_0_124,negated_conjecture,
    op1(j(e21),j(e21)) = j(op2(e21,e21)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_124) ).

cnf(i_0_89,plain,
    op2(e21,e21) = e21,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_89) ).

cnf(i_0_160,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e21) = e13
    | j(e21) = e14
    | ~ epred1_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_160) ).

cnf(i_0_52,plain,
    op1(e13,e13) = e12,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_52) ).

cnf(i_0_3,plain,
    e13 != e12,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_3) ).

cnf(i_0_58,plain,
    op1(e12,e12) = e13,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_58) ).

cnf(i_0_105,negated_conjecture,
    h(j(e20)) = e20,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_105) ).

cnf(i_0_70,plain,
    op1(e10,e10) = e14,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_70) ).

cnf(i_0_104,negated_conjecture,
    h(j(e21)) = e21,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_104) ).

cnf(i_0_20,plain,
    e21 != e20,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q70m7rxi/input.p',i_0_20) ).

cnf(c_0_178,negated_conjecture,
    op1(j(e20),j(e20)) = j(op2(e20,e20)),
    i_0_130 ).

cnf(c_0_179,plain,
    op2(e20,e20) = e20,
    i_0_95 ).

cnf(c_0_180,plain,
    ( j(e20) = e10
    | j(e20) = e11
    | j(e20) = e12
    | j(e20) = e13
    | j(e20) = e14
    | ~ epred1_0 ),
    i_0_161 ).

cnf(c_0_181,negated_conjecture,
    epred1_0,
    i_0_156 ).

cnf(c_0_182,negated_conjecture,
    op1(j(e20),j(e20)) = j(e20),
    inference(rw,[status(thm)],[c_0_178,c_0_179]) ).

cnf(c_0_183,plain,
    ( j(e20) = e14
    | j(e20) = e13
    | j(e20) = e12
    | j(e20) = e11
    | j(e20) = e10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_180,c_0_181])]) ).

cnf(c_0_184,plain,
    op1(e14,e14) = e10,
    i_0_46 ).

cnf(c_0_185,plain,
    e14 != e10,
    i_0_7 ).

cnf(c_0_186,negated_conjecture,
    op1(j(e21),j(e21)) = j(op2(e21,e21)),
    i_0_124 ).

cnf(c_0_187,plain,
    op2(e21,e21) = e21,
    i_0_89 ).

cnf(c_0_188,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e21) = e13
    | j(e21) = e14
    | ~ epred1_0 ),
    i_0_160 ).

cnf(c_0_189,plain,
    ( j(e20) = e10
    | j(e20) = e11
    | j(e20) = e12
    | j(e20) = e13 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_183]),c_0_184]),c_0_185]) ).

cnf(c_0_190,plain,
    op1(e13,e13) = e12,
    i_0_52 ).

cnf(c_0_191,plain,
    e13 != e12,
    i_0_3 ).

cnf(c_0_192,negated_conjecture,
    op1(j(e21),j(e21)) = j(e21),
    inference(rw,[status(thm)],[c_0_186,c_0_187]) ).

cnf(c_0_193,plain,
    ( j(e21) = e14
    | j(e21) = e13
    | j(e21) = e12
    | j(e21) = e11
    | j(e21) = e10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_181])]) ).

cnf(c_0_194,negated_conjecture,
    ( j(e20) = e12
    | j(e20) = e11
    | j(e20) = e10 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_189]),c_0_190]),c_0_191]) ).

cnf(c_0_195,plain,
    op1(e12,e12) = e13,
    i_0_58 ).

cnf(c_0_196,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e21) = e13 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_184]),c_0_185]) ).

cnf(c_0_197,negated_conjecture,
    h(j(e20)) = e20,
    i_0_105 ).

cnf(c_0_198,negated_conjecture,
    ( j(e20) = e10
    | j(e20) = e11 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_194]),c_0_195]),c_0_191]) ).

cnf(c_0_199,negated_conjecture,
    ( j(e21) = e12
    | j(e21) = e11
    | j(e21) = e10 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_196]),c_0_190]),c_0_191]) ).

cnf(c_0_200,negated_conjecture,
    ( j(e20) = e10
    | h(e11) = e20 ),
    inference(spm,[status(thm)],[c_0_197,c_0_198]) ).

cnf(c_0_201,plain,
    op1(e10,e10) = e14,
    i_0_70 ).

cnf(c_0_202,negated_conjecture,
    h(j(e21)) = e21,
    i_0_104 ).

cnf(c_0_203,negated_conjecture,
    ( j(e21) = e10
    | j(e21) = e11 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_199]),c_0_195]),c_0_191]) ).

cnf(c_0_204,negated_conjecture,
    h(e11) = e20,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_200]),c_0_201]),c_0_185]) ).

cnf(c_0_205,plain,
    e21 != e20,
    i_0_20 ).

cnf(c_0_206,negated_conjecture,
    j(e21) = e10,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_204]),c_0_205]) ).

cnf(c_0_207,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_192,c_0_206]),c_0_206]),c_0_201]),c_0_206]),c_0_185]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : ALG184+1 : TPTP v8.1.0. Released v2.7.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n026.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 : Wed Jun  8 11:13:03 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 8.53/2.53  # ENIGMATIC: Solved by autoschedule:
% 8.53/2.53  # No SInE strategy applied
% 8.53/2.53  # Trying AutoSched0 for 150 seconds
% 8.53/2.53  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 8.53/2.53  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.53/2.53  #
% 8.53/2.53  # Preprocessing time       : 0.025 s
% 8.53/2.53  
% 8.53/2.53  # Proof found!
% 8.53/2.53  # SZS status Theorem
% 8.53/2.53  # SZS output start CNFRefutation
% See solution above
% 8.53/2.53  # Training examples: 0 positive, 0 negative
% 8.53/2.53  
% 8.53/2.53  # -------------------------------------------------
% 8.53/2.53  # User time                : 0.034 s
% 8.53/2.53  # System time              : 0.003 s
% 8.53/2.53  # Total time               : 0.037 s
% 8.53/2.53  # Maximum resident set size: 7124 pages
% 8.53/2.53  
%------------------------------------------------------------------------------