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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO278+1 : TPTP v8.1.0. Released v4.1.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 : Sat Jul 16 03:45:05 EDT 2022

% Result   : Theorem 7.59s 2.36s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (  13 unt;   0 nHn;  19 RR)
%            Number of literals    :   55 (  14 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_94,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-f51fhnqx/lgb.p',i_0_94) ).

cnf(i_0_6,plain,
    rcenter(vd1089,vd1102),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f51fhnqx/lgb.p',i_0_6) ).

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

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

cnf(i_0_7,plain,
    ron(vd1096,vd1102),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f51fhnqx/lgb.p',i_0_7) ).

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

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

cnf(c_0_102,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_94 ).

cnf(c_0_103,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_102])]) ).

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

cnf(c_0_105,plain,
    rcenter(vd1089,vd1102),
    i_0_6 ).

cnf(c_0_106,plain,
    ( X1 = vd1102
    | ~ rpoint(X2)
    | ~ rcenter(vd1089,X1)
    | ~ ron(X2,vd1102)
    | ~ ron(X2,X1) ),
    inference(spm,[status(thm)],[c_0_104,c_0_105]) ).

cnf(c_0_107,negated_conjecture,
    rcenter(vd1089,esk1_0),
    i_0_3 ).

cnf(c_0_108,negated_conjecture,
    esk1_0 != vd1102,
    i_0_1 ).

cnf(c_0_109,negated_conjecture,
    ( ~ rpoint(X1)
    | ~ ron(X1,vd1102)
    | ~ ron(X1,esk1_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]) ).

cnf(c_0_110,plain,
    ron(vd1096,vd1102),
    i_0_7 ).

cnf(c_0_111,plain,
    rpoint(vd1096),
    i_0_14 ).

cnf(c_0_112,negated_conjecture,
    ron(vd1096,esk1_0),
    i_0_4 ).

cnf(c_0_113,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]),c_0_112])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : GEO278+1 : TPTP v8.1.0. Released v4.1.0.
% 0.09/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n026.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sat Jun 18 18:40:11 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 7.59/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.36  # No SInE strategy applied
% 7.59/2.36  # Trying AutoSched0 for 150 seconds
% 7.59/2.36  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.59/2.36  # and selection function SelectCQArNTNpEqFirst.
% 7.59/2.36  #
% 7.59/2.36  # Preprocessing time       : 0.024 s
% 7.59/2.36  # Presaturation interreduction done
% 7.59/2.36  
% 7.59/2.36  # Proof found!
% 7.59/2.36  # SZS status Theorem
% 7.59/2.36  # SZS output start CNFRefutation
% See solution above
% 7.59/2.36  # Training examples: 0 positive, 0 negative
% 7.59/2.36  
% 7.59/2.36  # -------------------------------------------------
% 7.59/2.36  # User time                : 0.045 s
% 7.59/2.36  # System time              : 0.007 s
% 7.59/2.36  # Total time               : 0.053 s
% 7.59/2.36  # Maximum resident set size: 7128 pages
% 7.59/2.36  
%------------------------------------------------------------------------------