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

View Problem - Process Solution

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

% Computer : n009.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:40:05 EDT 2022

% Result   : Theorem 13.94s 3.48s
% Output   : CNFRefutation 13.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (   9 unt;  12 nHn;  20 RR)
%            Number of literals    :   84 (  19 equ;  42 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   79 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | X4 != fiber(X3,X2)
    | ~ relation(X3)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_12) ).

cnf(i_0_15,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_15) ).

cnf(i_0_6,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_6) ).

cnf(i_0_24,plain,
    ( relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_24) ).

cnf(i_0_49,negated_conjecture,
    relation(esk11_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_49) ).

cnf(i_0_11,plain,
    ( X1 = X2
    | in(X1,X3)
    | X3 != fiber(X4,X2)
    | ~ relation(X4)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_11) ).

cnf(i_0_46,plain,
    ( in(X1,X2)
    | ~ relation(X2)
    | ~ in(X1,relation_restriction(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_46) ).

cnf(i_0_14,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_14) ).

cnf(i_0_13,plain,
    ( X1 != X2
    | X3 != fiber(X4,X2)
    | ~ relation(X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_13) ).

cnf(i_0_48,negated_conjecture,
    ~ subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3a5ez4q9/input.p',i_0_48) ).

cnf(c_0_60,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | X4 != fiber(X3,X2)
    | ~ relation(X3)
    | ~ in(X1,X4) ),
    i_0_12 ).

cnf(c_0_61,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | ~ in(X1,fiber(X3,X2))
    | ~ relation(X3) ),
    inference(er,[status(thm)],[c_0_60]) ).

cnf(c_0_62,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    i_0_15 ).

cnf(c_0_63,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_6 ).

cnf(c_0_64,plain,
    ( relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    i_0_24 ).

cnf(c_0_65,negated_conjecture,
    relation(esk11_0),
    i_0_49 ).

cnf(c_0_66,plain,
    ( in(unordered_pair(unordered_pair(X1,esk2_2(fiber(X2,X1),X3)),singleton(esk2_2(fiber(X2,X1),X3))),X2)
    | subset(fiber(X2,X1),X3)
    | ~ relation(X2) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    relation(relation_restriction(esk11_0,X1)),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,plain,
    ( X1 = X2
    | in(X1,X3)
    | X3 != fiber(X4,X2)
    | ~ relation(X4)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4) ),
    i_0_11 ).

cnf(c_0_69,plain,
    ( in(X1,X2)
    | ~ relation(X2)
    | ~ in(X1,relation_restriction(X2,X3)) ),
    i_0_46 ).

cnf(c_0_70,negated_conjecture,
    ( in(unordered_pair(unordered_pair(X1,esk2_2(fiber(relation_restriction(esk11_0,X2),X1),X3)),singleton(esk2_2(fiber(relation_restriction(esk11_0,X2),X1),X3))),relation_restriction(esk11_0,X2))
    | subset(fiber(relation_restriction(esk11_0,X2),X1),X3) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_71,plain,
    ( X1 = X2
    | in(X1,X3)
    | X3 != fiber(X4,X2)
    | ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X1)),X4)
    | ~ relation(X4) ),
    inference(spm,[status(thm)],[c_0_68,c_0_63]) ).

cnf(c_0_72,plain,
    ( in(unordered_pair(unordered_pair(X1,esk2_2(fiber(relation_restriction(esk11_0,X2),X1),X3)),singleton(esk2_2(fiber(relation_restriction(esk11_0,X2),X1),X3))),esk11_0)
    | subset(fiber(relation_restriction(esk11_0,X2),X1),X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_65])]) ).

cnf(c_0_73,plain,
    ( esk2_2(fiber(relation_restriction(esk11_0,X1),X2),X3) = X2
    | in(esk2_2(fiber(relation_restriction(esk11_0,X1),X2),X3),X4)
    | subset(fiber(relation_restriction(esk11_0,X1),X2),X3)
    | X4 != fiber(esk11_0,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_65])]) ).

cnf(c_0_74,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    i_0_14 ).

cnf(c_0_75,plain,
    ( esk2_2(fiber(relation_restriction(esk11_0,X1),X2),X3) = X2
    | in(esk2_2(fiber(relation_restriction(esk11_0,X1),X2),X3),fiber(esk11_0,X2))
    | subset(fiber(relation_restriction(esk11_0,X1),X2),X3) ),
    inference(er,[status(thm)],[c_0_73]) ).

cnf(c_0_76,plain,
    ( X1 != X2
    | X3 != fiber(X4,X2)
    | ~ relation(X4)
    | ~ in(X1,X3) ),
    i_0_13 ).

cnf(c_0_77,plain,
    ( esk2_2(fiber(relation_restriction(esk11_0,X1),X2),fiber(esk11_0,X2)) = X2
    | subset(fiber(relation_restriction(esk11_0,X1),X2),fiber(esk11_0,X2)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_78,plain,
    ( X1 != fiber(X2,X3)
    | ~ in(X3,X1)
    | ~ relation(X2) ),
    inference(er,[status(thm)],[c_0_76]) ).

cnf(c_0_79,negated_conjecture,
    ~ subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),
    i_0_48 ).

cnf(c_0_80,plain,
    ( in(X1,fiber(relation_restriction(esk11_0,X2),X1))
    | subset(fiber(relation_restriction(esk11_0,X2),X1),fiber(esk11_0,X1)) ),
    inference(spm,[status(thm)],[c_0_62,c_0_77]) ).

cnf(c_0_81,plain,
    ( ~ in(X1,fiber(X2,X1))
    | ~ relation(X2) ),
    inference(er,[status(thm)],[c_0_78]) ).

cnf(c_0_82,negated_conjecture,
    in(esk10_0,fiber(relation_restriction(esk11_0,esk9_0),esk10_0)),
    inference(spm,[status(thm)],[c_0_79,c_0_80]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n009.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 : Mon Jun 20 04:55:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 13.94/3.48  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l4800-e0.15+coop-paramils157:
% 13.94/3.48  # SinE strategy is GSinE(CountFormulas,hypos,5.0,,3,500,1.0)
% 13.94/3.48  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l4800-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 32; version: 991; iters: 150)
% 13.94/3.48  # Preprocessing time       : 0.721 s
% 13.94/3.48  
% 13.94/3.48  # Proof found!
% 13.94/3.48  # SZS status Theorem
% 13.94/3.48  # SZS output start CNFRefutation
% See solution above
% 13.94/3.48  # Training examples: 0 positive, 0 negative
% 13.94/3.48  
% 13.94/3.48  # -------------------------------------------------
% 13.94/3.48  # User time                : 0.694 s
% 13.94/3.48  # System time              : 0.092 s
% 13.94/3.48  # Total time               : 0.786 s
% 13.94/3.48  # ...preprocessing         : 0.721 s
% 13.94/3.48  # ...main loop             : 0.065 s
% 13.94/3.48  # Maximum resident set size: 151352 pages
% 13.94/3.48  
%------------------------------------------------------------------------------