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

View Problem - Process Solution

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

% Computer : n016.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:45:04 EDT 2022

% Result   : Theorem 8.01s 2.46s
% Output   : CNFRefutation 8.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  16 unt;   0 nHn;  22 RR)
%            Number of literals    :   58 (  16 equ;  39 neg)
%            Maximal clause size   :   10 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_251,plain,
    ( X1 = X2
    | X3 != X4
    | X5 != X6
    | vf(X7,X5) != vf(X7,X3)
    | ~ rpoint(X6)
    | ~ rpoint(X4)
    | ~ ron(X3,X1)
    | ~ ron(X5,X2)
    | ~ rcenter(X7,X2)
    | ~ rcenter(X7,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_251) ).

cnf(i_0_6,plain,
    rcenter(vd1080,vd1095),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_6) ).

cnf(i_0_3,negated_conjecture,
    rcenter(vd1080,esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_3) ).

cnf(i_0_1,negated_conjecture,
    esk1_0 != vd1095,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_1) ).

cnf(i_0_14,plain,
    rpoint(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_14) ).

cnf(i_0_15,plain,
    vd1081 = esk2_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_15) ).

cnf(i_0_7,plain,
    ron(vd1081,vd1095),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_7) ).

cnf(i_0_4,negated_conjecture,
    ron(vd1081,esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2i7eed4s/lgb.p',i_0_4) ).

cnf(c_0_260,plain,
    ( X1 = X2
    | X3 != X4
    | X5 != X6
    | vf(X7,X5) != vf(X7,X3)
    | ~ rpoint(X6)
    | ~ rpoint(X4)
    | ~ ron(X3,X1)
    | ~ ron(X5,X2)
    | ~ rcenter(X7,X2)
    | ~ rcenter(X7,X1) ),
    i_0_251 ).

cnf(c_0_261,plain,
    ( X1 = X2
    | vf(X3,X4) != vf(X3,X5)
    | ~ rpoint(X5)
    | ~ rpoint(X4)
    | ~ rcenter(X3,X2)
    | ~ rcenter(X3,X1)
    | ~ ron(X5,X2)
    | ~ ron(X4,X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_260])]) ).

cnf(c_0_262,plain,
    ( X1 = X2
    | ~ rpoint(X3)
    | ~ rcenter(X4,X2)
    | ~ rcenter(X4,X1)
    | ~ ron(X3,X2)
    | ~ ron(X3,X1) ),
    inference(er,[status(thm)],[c_0_261]) ).

cnf(c_0_263,plain,
    rcenter(vd1080,vd1095),
    i_0_6 ).

cnf(c_0_264,plain,
    ( X1 = vd1095
    | ~ rpoint(X2)
    | ~ rcenter(vd1080,X1)
    | ~ ron(X2,vd1095)
    | ~ ron(X2,X1) ),
    inference(spm,[status(thm)],[c_0_262,c_0_263]) ).

cnf(c_0_265,negated_conjecture,
    rcenter(vd1080,esk1_0),
    i_0_3 ).

cnf(c_0_266,negated_conjecture,
    esk1_0 != vd1095,
    i_0_1 ).

cnf(c_0_267,plain,
    rpoint(esk2_0),
    i_0_14 ).

cnf(c_0_268,plain,
    vd1081 = esk2_0,
    i_0_15 ).

cnf(c_0_269,negated_conjecture,
    ( ~ rpoint(X1)
    | ~ ron(X1,vd1095)
    | ~ ron(X1,esk1_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_264,c_0_265]),c_0_266]) ).

cnf(c_0_270,plain,
    ron(vd1081,vd1095),
    i_0_7 ).

cnf(c_0_271,plain,
    rpoint(vd1081),
    inference(rw,[status(thm)],[c_0_267,c_0_268]) ).

cnf(c_0_272,negated_conjecture,
    ron(vd1081,esk1_0),
    i_0_4 ).

cnf(c_0_273,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_270]),c_0_271]),c_0_272])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO275+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n016.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 : Sat Jun 18 11:47:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.01/2.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.01/2.46  # No SInE strategy applied
% 8.01/2.46  # Trying AutoSched0 for 150 seconds
% 8.01/2.46  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.01/2.46  # and selection function SelectCQArNTNpEqFirst.
% 8.01/2.46  #
% 8.01/2.46  # Preprocessing time       : 0.015 s
% 8.01/2.46  # Presaturation interreduction done
% 8.01/2.46  
% 8.01/2.46  # Proof found!
% 8.01/2.46  # SZS status Theorem
% 8.01/2.46  # SZS output start CNFRefutation
% See solution above
% 8.01/2.46  # Training examples: 0 positive, 0 negative
% 8.01/2.46  
% 8.01/2.46  # -------------------------------------------------
% 8.01/2.46  # User time                : 0.027 s
% 8.01/2.46  # System time              : 0.004 s
% 8.01/2.46  # Total time               : 0.031 s
% 8.01/2.46  # Maximum resident set size: 7128 pages
% 8.01/2.46  
%------------------------------------------------------------------------------