↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n017.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 : Tue Jul 19 08:41:35 EDT 2022

% Result   : Theorem 7.91s 2.42s
% Output   : CNFRefutation 7.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   27 (  13 unt;   0 nHn;  16 RR)
%            Number of literals    :   47 (  27 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   45 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_58,plain,
    ( relation_of2(X1,X2,X3)
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_58) ).

cnf(i_0_73,plain,
    relation_of2_as_subset(inclusion_relation(X1),X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_73) ).

cnf(i_0_52,plain,
    ( X1 = X2
    | rel_str_of(X1,X3) != rel_str_of(X2,X4)
    | ~ relation_of2(X3,X1,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_52) ).

cnf(i_0_53,plain,
    ( rel_str_of(the_carrier(X1),the_InternalRel(X1)) = X1
    | ~ rel_str(X1)
    | ~ strict_rel_str(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_53) ).

cnf(i_0_78,plain,
    rel_str(rel_str_of(X1,inclusion_relation(X1))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_78) ).

cnf(i_0_85,plain,
    strict_rel_str(rel_str_of(X1,inclusion_relation(X1))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_85) ).

cnf(i_0_51,plain,
    ( X1 = X2
    | rel_str_of(X3,X1) != rel_str_of(X4,X2)
    | ~ relation_of2(X1,X3,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_51) ).

cnf(i_0_87,negated_conjecture,
    ( the_carrier(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != esk14_0
    | the_InternalRel(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != inclusion_relation(esk14_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7q8bgvd/lgb.p',i_0_87) ).

cnf(c_0_96,plain,
    ( relation_of2(X1,X2,X3)
    | ~ relation_of2_as_subset(X1,X2,X3) ),
    i_0_58 ).

cnf(c_0_97,plain,
    relation_of2_as_subset(inclusion_relation(X1),X1,X1),
    i_0_73 ).

cnf(c_0_98,plain,
    ( X1 = X2
    | rel_str_of(X1,X3) != rel_str_of(X2,X4)
    | ~ relation_of2(X3,X1,X1) ),
    i_0_52 ).

cnf(c_0_99,plain,
    relation_of2(inclusion_relation(X1),X1,X1),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_100,plain,
    ( rel_str_of(the_carrier(X1),the_InternalRel(X1)) = X1
    | ~ rel_str(X1)
    | ~ strict_rel_str(X1) ),
    i_0_53 ).

cnf(c_0_101,plain,
    rel_str(rel_str_of(X1,inclusion_relation(X1))),
    i_0_78 ).

cnf(c_0_102,plain,
    strict_rel_str(rel_str_of(X1,inclusion_relation(X1))),
    i_0_85 ).

cnf(c_0_103,plain,
    ( X1 = X2
    | rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,X3) ),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_104,plain,
    rel_str_of(the_carrier(rel_str_of(X1,inclusion_relation(X1))),the_InternalRel(rel_str_of(X1,inclusion_relation(X1)))) = rel_str_of(X1,inclusion_relation(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]) ).

cnf(c_0_105,plain,
    ( X1 = the_carrier(rel_str_of(X2,inclusion_relation(X2)))
    | rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,inclusion_relation(X2)) ),
    inference(spm,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_106,plain,
    ( X1 = X2
    | rel_str_of(X3,X1) != rel_str_of(X4,X2)
    | ~ relation_of2(X1,X3,X3) ),
    i_0_51 ).

cnf(c_0_107,plain,
    the_carrier(rel_str_of(X1,inclusion_relation(X1))) = X1,
    inference(er,[status(thm)],[c_0_105]) ).

cnf(c_0_108,plain,
    ( inclusion_relation(X1) = X2
    | rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X3,X2) ),
    inference(spm,[status(thm)],[c_0_106,c_0_99]) ).

cnf(c_0_109,plain,
    rel_str_of(X1,the_InternalRel(rel_str_of(X1,inclusion_relation(X1)))) = rel_str_of(X1,inclusion_relation(X1)),
    inference(rw,[status(thm)],[c_0_104,c_0_107]) ).

cnf(c_0_110,negated_conjecture,
    ( the_carrier(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != esk14_0
    | the_InternalRel(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != inclusion_relation(esk14_0) ),
    i_0_87 ).

cnf(c_0_111,plain,
    ( inclusion_relation(X1) = the_InternalRel(rel_str_of(X2,inclusion_relation(X2)))
    | rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,inclusion_relation(X2)) ),
    inference(spm,[status(thm)],[c_0_108,c_0_109]) ).

cnf(c_0_112,negated_conjecture,
    the_InternalRel(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != inclusion_relation(esk14_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_107])]) ).

cnf(c_0_113,plain,
    the_InternalRel(rel_str_of(X1,inclusion_relation(X1))) = inclusion_relation(X1),
    inference(er,[status(thm)],[c_0_111]) ).

cnf(c_0_114,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_113])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 19 19:08:30 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.91/2.42  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.42  # No SInE strategy applied
% 7.91/2.42  # Trying AutoSched0 for 150 seconds
% 7.91/2.42  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.91/2.42  # and selection function SelectCQArEqLast.
% 7.91/2.42  #
% 7.91/2.42  # Preprocessing time       : 0.023 s
% 7.91/2.42  # Presaturation interreduction done
% 7.91/2.42  
% 7.91/2.42  # Proof found!
% 7.91/2.42  # SZS status Theorem
% 7.91/2.42  # SZS output start CNFRefutation
% See solution above
% 7.91/2.42  # Training examples: 0 positive, 0 negative
% 7.91/2.42  
% 7.91/2.42  # -------------------------------------------------
% 7.91/2.42  # User time                : 0.027 s
% 7.91/2.42  # System time              : 0.004 s
% 7.91/2.42  # Total time               : 0.031 s
% 7.91/2.42  # Maximum resident set size: 7124 pages
% 7.91/2.42  
%------------------------------------------------------------------------------