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

View Problem - Process Solution

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

% Computer : n015.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:43:27 EDT 2022

% Result   : Theorem 9.38s 2.61s
% Output   : CNFRefutation 9.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   42 (  10 unt;   6 nHn;  42 RR)
%            Number of literals    :   91 (  20 equ;  46 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :  100 (  16 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
    ( incident_c(X1,X2)
    | ~ part_of(X3,X2)
    | ~ incident_c(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_43) ).

cnf(i_0_5,plain,
    ( part_of(esk1_4(X1,X2,X3,X4),X1)
    | ~ between_c(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_5) ).

cnf(i_0_28,plain,
    ( incident_c(X1,X2)
    | ~ end_point(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_28) ).

cnf(i_0_3,plain,
    ( end_point(X1,esk1_4(X2,X3,X4,X1))
    | ~ between_c(X2,X3,X4,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_3) ).

cnf(i_0_4,plain,
    ( end_point(X1,esk1_4(X2,X1,X3,X4))
    | ~ between_c(X2,X1,X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_4) ).

cnf(i_0_51,negated_conjecture,
    between_c(esk15_0,esk16_0,esk17_0,esk18_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_51) ).

cnf(i_0_31,plain,
    ( incident_c(X1,X2)
    | ~ inner_point(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_31) ).

cnf(i_0_2,plain,
    ( inner_point(X1,esk1_4(X2,X3,X1,X4))
    | ~ between_c(X2,X3,X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_2) ).

cnf(i_0_50,negated_conjecture,
    ( esk17_0 = esk16_0
    | esk18_0 = esk16_0
    | esk18_0 = esk17_0
    | ~ incident_c(esk16_0,esk15_0)
    | ~ incident_c(esk17_0,esk15_0)
    | ~ incident_c(esk18_0,esk15_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_50) ).

cnf(i_0_30,plain,
    ( ~ end_point(X1,X2)
    | ~ inner_point(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_30) ).

cnf(i_0_6,plain,
    ( X1 != X2
    | ~ between_c(X3,X1,X4,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wjbiremm/lgb.p',i_0_6) ).

cnf(c_0_63,plain,
    ( incident_c(X1,X2)
    | ~ part_of(X3,X2)
    | ~ incident_c(X1,X3) ),
    i_0_43 ).

cnf(c_0_64,plain,
    ( part_of(esk1_4(X1,X2,X3,X4),X1)
    | ~ between_c(X1,X2,X3,X4) ),
    i_0_5 ).

cnf(c_0_65,plain,
    ( incident_c(X1,X2)
    | ~ end_point(X1,X2) ),
    i_0_28 ).

cnf(c_0_66,plain,
    ( end_point(X1,esk1_4(X2,X3,X4,X1))
    | ~ between_c(X2,X3,X4,X1) ),
    i_0_3 ).

cnf(c_0_67,plain,
    ( incident_c(X1,X2)
    | ~ between_c(X2,X3,X4,X5)
    | ~ incident_c(X1,esk1_4(X2,X3,X4,X5)) ),
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_68,plain,
    ( incident_c(X1,esk1_4(X2,X3,X4,X1))
    | ~ between_c(X2,X3,X4,X1) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_69,plain,
    ( end_point(X1,esk1_4(X2,X1,X3,X4))
    | ~ between_c(X2,X1,X3,X4) ),
    i_0_4 ).

cnf(c_0_70,plain,
    ( incident_c(X1,X2)
    | ~ between_c(X2,X3,X4,X1) ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_71,negated_conjecture,
    between_c(esk15_0,esk16_0,esk17_0,esk18_0),
    i_0_51 ).

cnf(c_0_72,plain,
    ( incident_c(X1,esk1_4(X2,X1,X3,X4))
    | ~ between_c(X2,X1,X3,X4) ),
    inference(spm,[status(thm)],[c_0_65,c_0_69]) ).

cnf(c_0_73,plain,
    ( incident_c(X1,X2)
    | ~ inner_point(X1,X2) ),
    i_0_31 ).

cnf(c_0_74,plain,
    ( inner_point(X1,esk1_4(X2,X3,X1,X4))
    | ~ between_c(X2,X3,X1,X4) ),
    i_0_2 ).

cnf(c_0_75,negated_conjecture,
    ( esk17_0 = esk16_0
    | esk18_0 = esk16_0
    | esk18_0 = esk17_0
    | ~ incident_c(esk16_0,esk15_0)
    | ~ incident_c(esk17_0,esk15_0)
    | ~ incident_c(esk18_0,esk15_0) ),
    i_0_50 ).

cnf(c_0_76,negated_conjecture,
    incident_c(esk18_0,esk15_0),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_77,plain,
    ( incident_c(X1,X2)
    | ~ between_c(X2,X1,X3,X4) ),
    inference(spm,[status(thm)],[c_0_67,c_0_72]) ).

cnf(c_0_78,plain,
    ( incident_c(X1,esk1_4(X2,X3,X1,X4))
    | ~ between_c(X2,X3,X1,X4) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_79,negated_conjecture,
    ( esk18_0 = esk16_0
    | esk18_0 = esk17_0
    | esk17_0 = esk16_0
    | ~ incident_c(esk17_0,esk15_0)
    | ~ incident_c(esk16_0,esk15_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).

cnf(c_0_80,negated_conjecture,
    incident_c(esk16_0,esk15_0),
    inference(spm,[status(thm)],[c_0_77,c_0_71]) ).

cnf(c_0_81,plain,
    ( incident_c(X1,X2)
    | ~ between_c(X2,X3,X1,X4) ),
    inference(spm,[status(thm)],[c_0_67,c_0_78]) ).

cnf(c_0_82,plain,
    ( ~ end_point(X1,X2)
    | ~ inner_point(X1,X2) ),
    i_0_30 ).

cnf(c_0_83,negated_conjecture,
    ( esk17_0 = esk16_0
    | esk18_0 = esk17_0
    | esk18_0 = esk16_0
    | ~ incident_c(esk17_0,esk15_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).

cnf(c_0_84,negated_conjecture,
    incident_c(esk17_0,esk15_0),
    inference(spm,[status(thm)],[c_0_81,c_0_71]) ).

cnf(c_0_85,plain,
    ( ~ end_point(X1,esk1_4(X2,X3,X1,X4))
    | ~ between_c(X2,X3,X1,X4) ),
    inference(spm,[status(thm)],[c_0_82,c_0_74]) ).

cnf(c_0_86,negated_conjecture,
    ( esk18_0 = esk16_0
    | esk18_0 = esk17_0
    | esk17_0 = esk16_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]) ).

cnf(c_0_87,plain,
    ~ between_c(X1,X2,X3,X3),
    inference(spm,[status(thm)],[c_0_85,c_0_66]) ).

cnf(c_0_88,plain,
    ( X1 != X2
    | ~ between_c(X3,X1,X4,X2) ),
    i_0_6 ).

cnf(c_0_89,negated_conjecture,
    ( esk17_0 = esk16_0
    | esk18_0 = esk16_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_86]),c_0_87]) ).

cnf(c_0_90,plain,
    ~ between_c(X1,X2,X3,X2),
    inference(er,[status(thm)],[c_0_88]) ).

cnf(c_0_91,negated_conjecture,
    esk17_0 = esk16_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_89]),c_0_90]) ).

cnf(c_0_92,plain,
    ~ between_c(X1,X2,X2,X3),
    inference(spm,[status(thm)],[c_0_85,c_0_69]) ).

cnf(c_0_93,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_91]),c_0_92]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : GEO111+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n015.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 18:21:15 EDT 2022
% 0.21/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.38/2.61  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.38/2.61  # No SInE strategy applied
% 9.38/2.61  # Trying AutoSched0 for 150 seconds
% 9.38/2.61  # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 9.38/2.61  # and selection function SelectNewComplexAHPExceptRRHorn.
% 9.38/2.61  #
% 9.38/2.61  # Preprocessing time       : 0.024 s
% 9.38/2.61  # Presaturation interreduction done
% 9.38/2.61  
% 9.38/2.61  # Proof found!
% 9.38/2.61  # SZS status Theorem
% 9.38/2.61  # SZS output start CNFRefutation
% See solution above
% 9.38/2.61  # Training examples: 0 positive, 0 negative
% 9.38/2.61  
% 9.38/2.61  # -------------------------------------------------
% 9.38/2.61  # User time                : 0.027 s
% 9.38/2.61  # System time              : 0.007 s
% 9.38/2.61  # Total time               : 0.033 s
% 9.38/2.61  # Maximum resident set size: 7128 pages
% 9.38/2.61  
%------------------------------------------------------------------------------