↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO271+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n007.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:03 EDT 2022

% Result   : Theorem 7.28s 2.50s
% Output   : CNFRefutation 7.28s
% 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_62,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/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_62) ).

cnf(i_0_6,plain,
    rcenter(vd1055,vd1061),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_6) ).

cnf(i_0_3,negated_conjecture,
    rcenter(vd1055,esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_3) ).

cnf(i_0_1,negated_conjecture,
    esk1_0 != vd1061,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_1) ).

cnf(i_0_10,plain,
    rpoint(vd1058),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_10) ).

cnf(i_0_12,plain,
    vd1058 = vd1057,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_12) ).

cnf(i_0_7,plain,
    ron(vd1057,vd1061),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_7) ).

cnf(i_0_4,negated_conjecture,
    ron(vd1057,esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vzip6k33/lgb.p',i_0_4) ).

cnf(c_0_71,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_62 ).

cnf(c_0_72,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_71])]) ).

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

cnf(c_0_74,plain,
    rcenter(vd1055,vd1061),
    i_0_6 ).

cnf(c_0_75,plain,
    ( X1 = vd1061
    | ~ rpoint(X2)
    | ~ rcenter(vd1055,X1)
    | ~ ron(X2,vd1061)
    | ~ ron(X2,X1) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_76,negated_conjecture,
    rcenter(vd1055,esk1_0),
    i_0_3 ).

cnf(c_0_77,negated_conjecture,
    esk1_0 != vd1061,
    i_0_1 ).

cnf(c_0_78,plain,
    rpoint(vd1058),
    i_0_10 ).

cnf(c_0_79,plain,
    vd1058 = vd1057,
    i_0_12 ).

cnf(c_0_80,negated_conjecture,
    ( ~ rpoint(X1)
    | ~ ron(X1,vd1061)
    | ~ ron(X1,esk1_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).

cnf(c_0_81,plain,
    ron(vd1057,vd1061),
    i_0_7 ).

cnf(c_0_82,plain,
    rpoint(vd1057),
    inference(rw,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_83,negated_conjecture,
    ron(vd1057,esk1_0),
    i_0_4 ).

cnf(c_0_84,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_83])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO271+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 22:00:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.28/2.50  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.28/2.50  # No SInE strategy applied
% 7.28/2.50  # Trying AutoSched0 for 150 seconds
% 7.28/2.50  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.28/2.50  # and selection function SelectCQArNTNpEqFirst.
% 7.28/2.50  #
% 7.28/2.50  # Preprocessing time       : 0.029 s
% 7.28/2.50  # Presaturation interreduction done
% 7.28/2.50  
% 7.28/2.50  # Proof found!
% 7.28/2.50  # SZS status Theorem
% 7.28/2.50  # SZS output start CNFRefutation
% See solution above
% 7.28/2.50  # Training examples: 0 positive, 0 negative
% 7.28/2.50  
% 7.28/2.50  # -------------------------------------------------
% 7.28/2.50  # User time                : 0.041 s
% 7.28/2.50  # System time              : 0.007 s
% 7.28/2.50  # Total time               : 0.048 s
% 7.28/2.50  # Maximum resident set size: 7124 pages
% 7.28/2.50  
%------------------------------------------------------------------------------