TSTP Solution File: SET811+4 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n022.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 00:14:19 EDT 2022

% Result   : Theorem 13.62s 3.09s
% Output   : CNFRefutation 13.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  10 unt;   8 nHn;  28 RR)
%            Number of literals    :   71 (   0 equ;  29 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-3 aty)
%            Number of variables   :   65 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
    ( subset(X1,X2)
    | ~ member(X1,X2)
    | ~ member(X2,on) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_21) ).

cnf(i_0_74,negated_conjecture,
    member(esk15_0,esk14_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_74) ).

cnf(i_0_75,negated_conjecture,
    member(esk14_0,on),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_75) ).

cnf(i_0_9,plain,
    ( apply(X1,X2,X3)
    | ~ member(X2,initial_segment(X3,X1,X4)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_9) ).

cnf(i_0_66,plain,
    ( subset(X1,X2)
    | member(esk12_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_66) ).

cnf(i_0_29,plain,
    ( apply(member_predicate,X1,X2)
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_29) ).

cnf(i_0_67,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_67) ).

cnf(i_0_30,plain,
    ( member(X1,X2)
    | ~ apply(member_predicate,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_30) ).

cnf(i_0_8,plain,
    ( member(X1,initial_segment(X2,X3,X4))
    | ~ member(X1,X4)
    | ~ apply(X3,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_8) ).

cnf(i_0_65,plain,
    ( subset(X1,X2)
    | ~ member(esk12_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_65) ).

cnf(i_0_5,plain,
    ( equal_set(X1,X2)
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_5) ).

cnf(i_0_73,negated_conjecture,
    ~ equal_set(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fz5mxdma/input.p',i_0_73) ).

cnf(c_0_88,plain,
    ( subset(X1,X2)
    | ~ member(X1,X2)
    | ~ member(X2,on) ),
    i_0_21 ).

cnf(c_0_89,negated_conjecture,
    member(esk15_0,esk14_0),
    i_0_74 ).

cnf(c_0_90,negated_conjecture,
    member(esk14_0,on),
    i_0_75 ).

cnf(c_0_91,plain,
    ( apply(X1,X2,X3)
    | ~ member(X2,initial_segment(X3,X1,X4)) ),
    i_0_9 ).

cnf(c_0_92,plain,
    ( subset(X1,X2)
    | member(esk12_2(X1,X2),X1) ),
    i_0_66 ).

cnf(c_0_93,plain,
    ( apply(member_predicate,X1,X2)
    | ~ member(X1,X2) ),
    i_0_29 ).

cnf(c_0_94,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_67 ).

cnf(c_0_95,negated_conjecture,
    subset(esk15_0,esk14_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).

cnf(c_0_96,plain,
    ( member(X1,X2)
    | ~ apply(member_predicate,X1,X2) ),
    i_0_30 ).

cnf(c_0_97,plain,
    ( apply(X1,esk12_2(initial_segment(X2,X1,X3),X4),X2)
    | subset(initial_segment(X2,X1,X3),X4) ),
    inference(spm,[status(thm)],[c_0_91,c_0_92]) ).

cnf(c_0_98,plain,
    ( member(X1,initial_segment(X2,X3,X4))
    | ~ member(X1,X4)
    | ~ apply(X3,X1,X2) ),
    i_0_8 ).

cnf(c_0_99,plain,
    ( apply(member_predicate,esk12_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(spm,[status(thm)],[c_0_93,c_0_92]) ).

cnf(c_0_100,plain,
    ( member(X1,esk14_0)
    | ~ member(X1,esk15_0) ),
    inference(spm,[status(thm)],[c_0_94,c_0_95]) ).

cnf(c_0_101,plain,
    ( subset(X1,X2)
    | ~ member(esk12_2(X1,X2),X2) ),
    i_0_65 ).

cnf(c_0_102,plain,
    ( subset(initial_segment(X1,member_predicate,X2),X3)
    | member(esk12_2(initial_segment(X1,member_predicate,X2),X3),X1) ),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_103,plain,
    ( subset(X1,X2)
    | member(esk12_2(X1,X2),initial_segment(X1,member_predicate,X3))
    | ~ member(esk12_2(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_98,c_0_99]) ).

cnf(c_0_104,plain,
    ( subset(esk15_0,X1)
    | member(esk12_2(esk15_0,X1),esk14_0) ),
    inference(spm,[status(thm)],[c_0_100,c_0_92]) ).

cnf(c_0_105,plain,
    ( equal_set(X1,X2)
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_5 ).

cnf(c_0_106,plain,
    subset(initial_segment(X1,member_predicate,X2),X1),
    inference(spm,[status(thm)],[c_0_101,c_0_102]) ).

cnf(c_0_107,plain,
    ( subset(esk15_0,X1)
    | member(esk12_2(esk15_0,X1),initial_segment(esk15_0,member_predicate,esk14_0)) ),
    inference(spm,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_108,plain,
    ( equal_set(X1,initial_segment(X1,member_predicate,X2))
    | ~ subset(X1,initial_segment(X1,member_predicate,X2)) ),
    inference(spm,[status(thm)],[c_0_105,c_0_106]) ).

cnf(c_0_109,plain,
    subset(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),
    inference(spm,[status(thm)],[c_0_101,c_0_107]) ).

cnf(c_0_110,negated_conjecture,
    ~ equal_set(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),
    i_0_73 ).

cnf(c_0_111,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET811+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 13:35:42 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 13.62/3.09  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 13.62/3.09  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 37; version: 991; iters: 150)
% 13.62/3.09  # Preprocessing time       : 0.798 s
% 13.62/3.09  # Presaturation interreduction done
% 13.62/3.09  
% 13.62/3.09  # Proof found!
% 13.62/3.09  # SZS status Theorem
% 13.62/3.09  # SZS output start CNFRefutation
% See solution above
% 13.62/3.09  # Training examples: 0 positive, 0 negative
% 13.62/3.09  
% 13.62/3.09  # -------------------------------------------------
% 13.62/3.09  # User time                : 0.708 s
% 13.62/3.09  # System time              : 0.106 s
% 13.62/3.09  # Total time               : 0.814 s
% 13.62/3.09  # ...preprocessing         : 0.798 s
% 13.62/3.09  # ...main loop             : 0.016 s
% 13.62/3.09  # Maximum resident set size: 167140 pages
% 13.62/3.09  
%------------------------------------------------------------------------------