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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO523+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:06 EDT 2022

% Result   : Theorem 10.27s 2.73s
% Output   : CNFRefutation 10.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   53 (  21 unt;  13 nHn;  40 RR)
%            Number of literals    :   99 (  70 equ;  37 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :  102 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_139,plain,
    ( X1 = X2
    | s(X1,X3) != s(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_139) ).

cnf(i_0_153,plain,
    s(X1,s(X1,X2)) = X2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_153) ).

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

cnf(i_0_187,plain,
    s_m(X1,midpoint(X1,X2),X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_187) ).

cnf(i_0_36,plain,
    ( X1 = X2
    | X3 = reflect(X1,X2,X4)
    | X4 != X3
    | ~ s_col(X1,X2,midpoint(X4,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_36) ).

cnf(i_0_148,plain,
    ( X1 = X2
    | ~ s_m(X1,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_148) ).

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

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

cnf(i_0_35,plain,
    ( X1 = X2
    | s_col(X1,X2,midpoint(X3,reflect(X1,X2,X3))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_35) ).

cnf(i_0_39,negated_conjecture,
    reflect(esk1_0,esk2_0,esk3_0) = esk4_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_39) ).

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

cnf(i_0_34,plain,
    ( X1 = X2
    | reflect(X1,X2,X3) = X3
    | perp(X1,X2,X3,reflect(X1,X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_34) ).

cnf(i_0_37,plain,
    ( X1 = X2
    | X3 = reflect(X1,X2,X4)
    | ~ perp(X1,X2,X4,X3)
    | ~ s_col(X1,X2,midpoint(X4,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_37) ).

cnf(i_0_17,plain,
    ( perp(X1,X2,X3,X4)
    | ~ perp(X1,X2,X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_17) ).

cnf(i_0_38,negated_conjecture,
    reflect(esk1_0,esk2_0,esk4_0) != esk3_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7v2yxc2a/lgb.p',i_0_38) ).

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

cnf(c_0_204,plain,
    ( X1 = X2
    | s(X1,X3) != s(X2,X3) ),
    i_0_139 ).

cnf(c_0_205,plain,
    s(X1,s(X1,X2)) = X2,
    i_0_153 ).

cnf(c_0_206,plain,
    ( X1 = s(X2,X3)
    | ~ s_m(X3,X2,X1) ),
    i_0_152 ).

cnf(c_0_207,plain,
    s_m(X1,midpoint(X1,X2),X2),
    i_0_187 ).

cnf(c_0_208,plain,
    ( X1 = X2
    | X3 = reflect(X1,X2,X4)
    | X4 != X3
    | ~ s_col(X1,X2,midpoint(X4,X3)) ),
    i_0_36 ).

cnf(c_0_209,plain,
    ( X1 = X2
    | ~ s_m(X1,X2,X1) ),
    i_0_148 ).

cnf(c_0_210,plain,
    ( X1 = X2
    | s(X1,s(X2,X3)) != X3 ),
    inference(spm,[status(thm)],[c_0_204,c_0_205]) ).

cnf(c_0_211,plain,
    s(midpoint(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_206,c_0_207]) ).

cnf(c_0_212,plain,
    ( X1 = X2
    | s(X1,s(X2,X3)) != s(X2,s(X1,X3)) ),
    i_0_140 ).

cnf(c_0_213,plain,
    ( s(X1,X2) = X2
    | X1 != X2 ),
    i_0_132 ).

cnf(c_0_214,plain,
    ( reflect(X1,X2,X3) = X3
    | X1 = X2
    | ~ s_col(X1,X2,midpoint(X3,X3)) ),
    inference(er,[status(thm)],[c_0_208]) ).

cnf(c_0_215,plain,
    midpoint(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_209,c_0_207]) ).

cnf(c_0_216,plain,
    ( X1 = X2
    | s_col(X1,X2,midpoint(X3,reflect(X1,X2,X3))) ),
    i_0_35 ).

cnf(c_0_217,negated_conjecture,
    reflect(esk1_0,esk2_0,esk3_0) = esk4_0,
    i_0_39 ).

cnf(c_0_218,negated_conjecture,
    esk2_0 != esk1_0,
    i_0_40 ).

cnf(c_0_219,plain,
    midpoint(s(X1,X2),X2) = X1,
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_211])]) ).

cnf(c_0_220,plain,
    ( midpoint(X1,X2) = X3
    | s(midpoint(X1,X2),s(X3,X1)) != s(X3,X2) ),
    inference(spm,[status(thm)],[c_0_212,c_0_211]) ).

cnf(c_0_221,plain,
    s(X1,X1) = X1,
    inference(er,[status(thm)],[c_0_213]) ).

cnf(c_0_222,plain,
    ( reflect(X1,X2,X3) = X3
    | X1 = X2
    | ~ s_col(X1,X2,X3) ),
    inference(rw,[status(thm)],[c_0_214,c_0_215]) ).

cnf(c_0_223,negated_conjecture,
    s_col(esk1_0,esk2_0,midpoint(esk3_0,esk4_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_217]),c_0_218]) ).

cnf(c_0_224,plain,
    midpoint(X1,X2) = midpoint(X2,X1),
    inference(spm,[status(thm)],[c_0_219,c_0_211]) ).

cnf(c_0_225,plain,
    ( midpoint(X1,X2) = X1
    | s(X1,X2) != X2 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_211]) ).

cnf(c_0_226,plain,
    ( X1 = X2
    | reflect(X1,X2,X3) = X3
    | perp(X1,X2,X3,reflect(X1,X2,X3)) ),
    i_0_34 ).

cnf(c_0_227,plain,
    ( X1 = X2
    | X3 = reflect(X1,X2,X4)
    | ~ perp(X1,X2,X4,X3)
    | ~ s_col(X1,X2,midpoint(X4,X3)) ),
    i_0_37 ).

cnf(c_0_228,negated_conjecture,
    reflect(esk1_0,esk2_0,midpoint(esk3_0,esk4_0)) = midpoint(esk3_0,esk4_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_218]) ).

cnf(c_0_229,plain,
    ( midpoint(X1,X2) = X2
    | s(X2,X1) != X1 ),
    inference(spm,[status(thm)],[c_0_224,c_0_225]) ).

cnf(c_0_230,plain,
    ( perp(X1,X2,X3,X4)
    | ~ perp(X1,X2,X4,X3) ),
    i_0_17 ).

cnf(c_0_231,negated_conjecture,
    ( esk4_0 = esk3_0
    | perp(esk1_0,esk2_0,esk3_0,esk4_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_217]),c_0_218]) ).

cnf(c_0_232,plain,
    ( X1 = reflect(X2,X3,X4)
    | X2 = X3
    | ~ perp(X2,X3,X4,X1)
    | ~ s_col(X2,X3,midpoint(X1,X4)) ),
    inference(spm,[status(thm)],[c_0_227,c_0_224]) ).

cnf(c_0_233,negated_conjecture,
    reflect(esk1_0,esk2_0,esk4_0) != esk3_0,
    i_0_38 ).

cnf(c_0_234,negated_conjecture,
    ( reflect(esk1_0,esk2_0,esk4_0) = esk4_0
    | s(esk4_0,esk3_0) != esk3_0 ),
    inference(spm,[status(thm)],[c_0_228,c_0_229]) ).

cnf(c_0_235,plain,
    ( X1 = X2
    | s(X1,X2) != X2 ),
    i_0_131 ).

cnf(c_0_236,plain,
    ( esk4_0 = esk3_0
    | perp(esk1_0,esk2_0,esk4_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_230,c_0_231]) ).

cnf(c_0_237,negated_conjecture,
    ~ perp(esk1_0,esk2_0,esk4_0,esk3_0),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_223]),c_0_233]),c_0_218]) ).

cnf(c_0_238,negated_conjecture,
    s(esk4_0,esk3_0) != esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235]) ).

cnf(c_0_239,plain,
    esk4_0 = esk3_0,
    inference(sr,[status(thm)],[c_0_236,c_0_237]) ).

cnf(c_0_240,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_239]),c_0_221])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GEO523+1 : TPTP v8.1.0. Released v7.0.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n029.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 : Fri Jun 17 18:27:45 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox2/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
% 10.27/2.73  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.27/2.73  # No SInE strategy applied
% 10.27/2.73  # Trying AutoSched0 for 150 seconds
% 10.27/2.73  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.27/2.73  # and selection function SelectComplexExceptUniqMaxHorn.
% 10.27/2.73  #
% 10.27/2.73  # Preprocessing time       : 0.027 s
% 10.27/2.73  # Presaturation interreduction done
% 10.27/2.73  
% 10.27/2.73  # Proof found!
% 10.27/2.73  # SZS status Theorem
% 10.27/2.73  # SZS output start CNFRefutation
% See solution above
% 10.27/2.73  # Training examples: 0 positive, 0 negative
% 10.27/2.73  
% 10.27/2.73  # -------------------------------------------------
% 10.27/2.73  # User time                : 0.280 s
% 10.27/2.73  # System time              : 0.014 s
% 10.27/2.73  # Total time               : 0.294 s
% 10.27/2.73  # Maximum resident set size: 7124 pages
% 10.27/2.73  
%------------------------------------------------------------------------------