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

View Problem - Process Solution

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

% Computer : n029.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 : Sat Jul 16 03:46:01 EDT 2022

% Result   : Theorem 12.76s 2.96s
% Output   : CNFRefutation 12.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   40 (  22 unt;   0 nHn;  32 RR)
%            Number of literals    :   64 (  16 equ;  26 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   84 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_120,plain,
    s(X1,s(X1,X2)) = X2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_120) ).

cnf(i_0_113,negated_conjecture,
    s(esk1_0,s(esk2_0,esk3_0)) = s(esk2_0,s(esk1_0,esk3_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_113) ).

cnf(i_0_105,plain,
    s_e(X1,X2,s(X3,X1),s(X3,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_105) ).

cnf(i_0_117,plain,
    s_m(X1,X2,s(X2,X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_117) ).

cnf(i_0_2,plain,
    ( s_e(X1,X2,X3,X4)
    | ~ s_e(X5,X6,X3,X4)
    | ~ s_e(X5,X6,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_2) ).

cnf(i_0_152,plain,
    ( s_e(X1,X2,X1,X3)
    | ~ s_m(X2,X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_152) ).

cnf(i_0_153,plain,
    ( s_t(X1,X2,X3)
    | ~ s_m(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_153) ).

cnf(i_0_107,plain,
    ( s_t(X1,X2,X3)
    | ~ s_t(s(X4,X1),s(X4,X2),s(X4,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_107) ).

cnf(i_0_110,plain,
    ( X1 = X2
    | ~ s_m(X3,X2,X4)
    | ~ s_m(X3,X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_110) ).

cnf(i_0_151,plain,
    ( s_m(X1,X2,X3)
    | ~ s_t(X1,X2,X3)
    | ~ s_e(X2,X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_151) ).

cnf(i_0_103,plain,
    ( X1 = X2
    | s(X1,X2) != X2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_103) ).

cnf(i_0_112,negated_conjecture,
    esk1_0 != esk2_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k5dyi8oz/lgb.p',i_0_112) ).

cnf(c_0_166,plain,
    s(X1,s(X1,X2)) = X2,
    i_0_120 ).

cnf(c_0_167,negated_conjecture,
    s(esk1_0,s(esk2_0,esk3_0)) = s(esk2_0,s(esk1_0,esk3_0)),
    i_0_113 ).

cnf(c_0_168,plain,
    s_e(X1,X2,s(X3,X1),s(X3,X2)),
    i_0_105 ).

cnf(c_0_169,plain,
    s_m(X1,X2,s(X2,X1)),
    i_0_117 ).

cnf(c_0_170,negated_conjecture,
    s(esk1_0,s(esk2_0,s(esk1_0,esk3_0))) = s(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_166,c_0_167]) ).

cnf(c_0_171,plain,
    ( s_e(X1,X2,X3,X4)
    | ~ s_e(X5,X6,X3,X4)
    | ~ s_e(X5,X6,X1,X2) ),
    i_0_2 ).

cnf(c_0_172,plain,
    s_e(X1,s(X2,X3),s(X2,X1),X3),
    inference(spm,[status(thm)],[c_0_168,c_0_166]) ).

cnf(c_0_173,plain,
    ( s_e(X1,X2,X1,X3)
    | ~ s_m(X2,X1,X3) ),
    i_0_152 ).

cnf(c_0_174,negated_conjecture,
    s_m(s(esk2_0,s(esk1_0,esk3_0)),esk1_0,s(esk2_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_169,c_0_170]) ).

cnf(c_0_175,plain,
    ( s_t(X1,X2,X3)
    | ~ s_m(X1,X2,X3) ),
    i_0_153 ).

cnf(c_0_176,plain,
    ( s_e(X1,X2,s(X3,X4),X5)
    | ~ s_e(X4,s(X3,X5),X1,X2) ),
    inference(spm,[status(thm)],[c_0_171,c_0_172]) ).

cnf(c_0_177,plain,
    s_e(esk1_0,s(esk2_0,s(esk1_0,esk3_0)),esk1_0,s(esk2_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_173,c_0_174]) ).

cnf(c_0_178,plain,
    ( s_t(X1,X2,X3)
    | ~ s_t(s(X4,X1),s(X4,X2),s(X4,X3)) ),
    i_0_107 ).

cnf(c_0_179,plain,
    s_t(X1,X2,s(X2,X1)),
    inference(spm,[status(thm)],[c_0_175,c_0_169]) ).

cnf(c_0_180,plain,
    ( X1 = X2
    | ~ s_m(X3,X2,X4)
    | ~ s_m(X3,X1,X4) ),
    i_0_110 ).

cnf(c_0_181,plain,
    s_e(esk1_0,s(esk2_0,esk3_0),s(esk2_0,esk1_0),s(esk1_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_176,c_0_177]) ).

cnf(c_0_182,plain,
    ( s_t(X1,s(X2,X3),X4)
    | ~ s_t(s(X2,X1),X3,s(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_178,c_0_166]) ).

cnf(c_0_183,negated_conjecture,
    s_t(s(esk2_0,s(esk1_0,esk3_0)),esk1_0,s(esk2_0,esk3_0)),
    inference(spm,[status(thm)],[c_0_179,c_0_170]) ).

cnf(c_0_184,plain,
    ( X1 = X2
    | ~ s_m(X3,X1,s(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_180,c_0_169]) ).

cnf(c_0_185,plain,
    ( s_m(X1,X2,X3)
    | ~ s_t(X1,X2,X3)
    | ~ s_e(X2,X1,X2,X3) ),
    i_0_151 ).

cnf(c_0_186,plain,
    s_e(s(esk2_0,esk1_0),s(esk1_0,esk3_0),s(esk2_0,esk1_0),esk3_0),
    inference(spm,[status(thm)],[c_0_176,c_0_181]) ).

cnf(c_0_187,negated_conjecture,
    s_t(s(esk1_0,esk3_0),s(esk2_0,esk1_0),esk3_0),
    inference(spm,[status(thm)],[c_0_182,c_0_183]) ).

cnf(c_0_188,plain,
    ( X1 = X2
    | ~ s_m(s(X2,X3),X1,X3) ),
    inference(spm,[status(thm)],[c_0_184,c_0_166]) ).

cnf(c_0_189,plain,
    s_m(s(esk1_0,esk3_0),s(esk2_0,esk1_0),esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_186]),c_0_187])]) ).

cnf(c_0_190,plain,
    ( X1 = X2
    | s(X1,X2) != X2 ),
    i_0_103 ).

cnf(c_0_191,plain,
    s(esk2_0,esk1_0) = esk1_0,
    inference(spm,[status(thm)],[c_0_188,c_0_189]) ).

cnf(c_0_192,negated_conjecture,
    esk1_0 != esk2_0,
    i_0_112 ).

cnf(c_0_193,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_191]),c_0_192]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GEO500+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 18 07:02:15 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.48  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.48  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.48  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 12.76/2.96  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.76/2.96  # No SInE strategy applied
% 12.76/2.96  # Trying AutoSched0 for 150 seconds
% 12.76/2.96  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.76/2.96  # and selection function SelectComplexExceptUniqMaxHorn.
% 12.76/2.96  #
% 12.76/2.96  # Preprocessing time       : 0.026 s
% 12.76/2.96  # Presaturation interreduction done
% 12.76/2.96  
% 12.76/2.96  # Proof found!
% 12.76/2.96  # SZS status Theorem
% 12.76/2.96  # SZS output start CNFRefutation
% See solution above
% 12.76/2.96  # Training examples: 0 positive, 0 negative
% 12.76/2.96  
% 12.76/2.96  # -------------------------------------------------
% 12.76/2.96  # User time                : 0.432 s
% 12.76/2.96  # System time              : 0.021 s
% 12.76/2.96  # Total time               : 0.453 s
% 12.76/2.96  # Maximum resident set size: 7124 pages
% 12.76/2.96  
%------------------------------------------------------------------------------