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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : ALG054+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 14:47:31 EDT 2022

% Result   : Theorem 7.49s 2.34s
% Output   : CNFRefutation 7.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   43 (  33 unt;   5 nHn;  43 RR)
%            Number of literals    :   62 (  61 equ;  19 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_216,negated_conjecture,
    ( op(e1,e4) = e1
    | op(e1,e1) != e4 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_216) ).

cnf(i_0_197,plain,
    op(e1,e1) = e4,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_197) ).

cnf(i_0_117,plain,
    op(e1,e4) != op(e1,e3),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_117) ).

cnf(i_0_199,plain,
    op(op(e1,e1),op(e1,e1)) = e2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_199) ).

cnf(i_0_33,plain,
    op(e1,unit) = e1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_33) ).

cnf(i_0_26,plain,
    ( unit = e0
    | unit = e1
    | e2 = unit
    | e3 = unit
    | e4 = unit ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_26) ).

cnf(i_0_200,plain,
    op(e1,op(op(e1,e1),op(e1,e1))) = e0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_200) ).

cnf(i_0_196,plain,
    e0 != e1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_196) ).

cnf(i_0_123,plain,
    op(e1,e4) != op(e1,e0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_123) ).

cnf(i_0_111,plain,
    op(e2,e3) != op(e2,e1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_111) ).

cnf(i_0_212,negated_conjecture,
    ( op(e2,e3) = e2
    | op(e2,e2) != e3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_212) ).

cnf(i_0_198,plain,
    op(op(op(e1,e1),op(e1,e1)),op(op(e1,e1),op(e1,e1))) = e3,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_198) ).

cnf(i_0_27,plain,
    op(e4,unit) = e4,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_27) ).

cnf(i_0_188,plain,
    e4 != e2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_188) ).

cnf(i_0_31,plain,
    op(e2,unit) = e2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-549wws93/input.p',i_0_31) ).

cnf(c_0_232,negated_conjecture,
    ( op(e1,e4) = e1
    | op(e1,e1) != e4 ),
    i_0_216 ).

cnf(c_0_233,plain,
    op(e1,e1) = e4,
    i_0_197 ).

cnf(c_0_234,plain,
    op(e1,e4) != op(e1,e3),
    i_0_117 ).

cnf(c_0_235,negated_conjecture,
    op(e1,e4) = e1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_233])]) ).

cnf(c_0_236,plain,
    op(op(e1,e1),op(e1,e1)) = e2,
    i_0_199 ).

cnf(c_0_237,plain,
    op(e1,unit) = e1,
    i_0_33 ).

cnf(c_0_238,plain,
    ( unit = e0
    | unit = e1
    | e2 = unit
    | e3 = unit
    | e4 = unit ),
    i_0_26 ).

cnf(c_0_239,plain,
    op(e1,e3) != e1,
    inference(rw,[status(thm)],[c_0_234,c_0_235]) ).

cnf(c_0_240,plain,
    op(e1,op(op(e1,e1),op(e1,e1))) = e0,
    i_0_200 ).

cnf(c_0_241,plain,
    op(e4,e4) = e2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_233]),c_0_233]) ).

cnf(c_0_242,plain,
    ( unit = e1
    | unit = e4
    | unit = e0
    | unit = e2 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239]) ).

cnf(c_0_243,plain,
    op(e1,e2) = e0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_233]),c_0_233]),c_0_241]) ).

cnf(c_0_244,plain,
    e0 != e1,
    i_0_196 ).

cnf(c_0_245,plain,
    op(e1,e4) != op(e1,e0),
    i_0_123 ).

cnf(c_0_246,plain,
    ( unit = e0
    | unit = e4
    | unit = e1 ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_242]),c_0_243]),c_0_244]) ).

cnf(c_0_247,plain,
    op(e1,e0) != e1,
    inference(rw,[status(thm)],[c_0_245,c_0_235]) ).

cnf(c_0_248,plain,
    op(e2,e3) != op(e2,e1),
    i_0_111 ).

cnf(c_0_249,negated_conjecture,
    ( op(e2,e3) = e2
    | op(e2,e2) != e3 ),
    i_0_212 ).

cnf(c_0_250,plain,
    op(op(op(e1,e1),op(e1,e1)),op(op(e1,e1),op(e1,e1))) = e3,
    i_0_198 ).

cnf(c_0_251,plain,
    op(e4,unit) = e4,
    i_0_27 ).

cnf(c_0_252,plain,
    ( unit = e1
    | unit = e4 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_246]),c_0_247]) ).

cnf(c_0_253,plain,
    e4 != e2,
    i_0_188 ).

cnf(c_0_254,plain,
    ( op(e2,e1) != e2
    | op(e2,e2) != e3 ),
    inference(spm,[status(thm)],[c_0_248,c_0_249]) ).

cnf(c_0_255,plain,
    op(e2,e2) = e3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_233]),c_0_233]),c_0_241]),c_0_233]),c_0_233]),c_0_241]) ).

cnf(c_0_256,plain,
    op(e2,unit) = e2,
    i_0_31 ).

cnf(c_0_257,plain,
    unit = e1,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_241]),c_0_253]) ).

cnf(c_0_258,plain,
    op(e2,e1) != e2,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_254,c_0_255])]) ).

cnf(c_0_259,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_256,c_0_257]),c_0_258]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG054+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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  9 03:19:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.49/2.34  # ENIGMATIC: Solved by autoschedule:
% 7.49/2.34  # No SInE strategy applied
% 7.49/2.34  # Trying AutoSched0 for 150 seconds
% 7.49/2.34  # AutoSched0-Mode selected heuristic G_____0031_C18_F1_SE_CS_SP_S0Y
% 7.49/2.34  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.49/2.34  #
% 7.49/2.34  # Preprocessing time       : 0.027 s
% 7.49/2.34  
% 7.49/2.34  # Proof found!
% 7.49/2.34  # SZS status Theorem
% 7.49/2.34  # SZS output start CNFRefutation
% See solution above
% 7.49/2.34  # Training examples: 0 positive, 0 negative
% 7.49/2.34  
% 7.49/2.34  # -------------------------------------------------
% 7.49/2.34  # User time                : 0.032 s
% 7.49/2.34  # System time              : 0.008 s
% 7.49/2.34  # Total time               : 0.040 s
% 7.49/2.34  # Maximum resident set size: 7120 pages
% 7.49/2.34  
%------------------------------------------------------------------------------