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

View Problem - Process Solution

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

% Computer : n019.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:13:30 EDT 2022

% Result   : Theorem 17.47s 3.73s
% Output   : CNFRefutation 17.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   36 (   6 unt;  11 nHn;  19 RR)
%            Number of literals    :   73 (   0 equ;  26 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   86 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( subset(X1,X2)
    | ~ member(X1,power_set(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_12) ).

cnf(i_0_19,plain,
    ( subset(X1,X2)
    | member(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_19) ).

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

cnf(i_0_18,plain,
    ( subset(X1,X2)
    | ~ member(esk2_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_18) ).

cnf(i_0_25,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_25) ).

cnf(i_0_26,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_26) ).

cnf(i_0_11,plain,
    ( member(X1,power_set(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_11) ).

cnf(i_0_27,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_27) ).

cnf(i_0_24,negated_conjecture,
    ~ subset(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0_qro3hp/input.p',i_0_24) ).

cnf(c_0_37,plain,
    ( subset(X1,X2)
    | ~ member(X1,power_set(X2)) ),
    i_0_12 ).

cnf(c_0_38,plain,
    ( subset(X1,X2)
    | member(esk2_2(X1,X2),X1) ),
    i_0_19 ).

cnf(c_0_39,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_20 ).

cnf(c_0_40,plain,
    ( subset(esk2_2(power_set(X1),X2),X1)
    | subset(power_set(X1),X2) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,plain,
    ( subset(X1,X2)
    | ~ member(esk2_2(X1,X2),X2) ),
    i_0_18 ).

cnf(c_0_42,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    i_0_25 ).

cnf(c_0_43,plain,
    ( subset(power_set(X1),X2)
    | member(X3,X1)
    | ~ member(X3,esk2_2(power_set(X1),X2)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    i_0_26 ).

cnf(c_0_45,plain,
    ( member(X1,power_set(X2))
    | ~ subset(X1,X2) ),
    i_0_11 ).

cnf(c_0_46,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk2_2(X1,union(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_47,plain,
    ( subset(esk2_2(power_set(X1),X2),X3)
    | subset(power_set(X1),X2)
    | member(esk2_2(esk2_2(power_set(X1),X2),X3),X1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_38]) ).

cnf(c_0_48,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk2_2(X1,union(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_44]) ).

cnf(c_0_49,plain,
    ( subset(X1,power_set(X2))
    | ~ subset(esk2_2(X1,power_set(X2)),X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_45]) ).

cnf(c_0_50,plain,
    ( subset(esk2_2(power_set(X1),X2),union(X3,X1))
    | subset(power_set(X1),X2) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_51,plain,
    ( subset(esk2_2(power_set(X1),X2),union(X1,X3))
    | subset(power_set(X1),X2) ),
    inference(spm,[status(thm)],[c_0_48,c_0_47]) ).

cnf(c_0_52,plain,
    subset(power_set(X1),power_set(union(X2,X1))),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_53,plain,
    subset(power_set(X1),power_set(union(X1,X2))),
    inference(spm,[status(thm)],[c_0_49,c_0_51]) ).

cnf(c_0_54,plain,
    ( member(X1,power_set(union(X2,X3)))
    | ~ member(X1,power_set(X3)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_52]) ).

cnf(c_0_55,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    i_0_27 ).

cnf(c_0_56,plain,
    ( member(X1,power_set(union(X2,X3)))
    | ~ member(X1,power_set(X2)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_53]) ).

cnf(c_0_57,plain,
    ( subset(X1,power_set(union(X2,X3)))
    | ~ member(esk2_2(X1,power_set(union(X2,X3))),power_set(X3)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_54]) ).

cnf(c_0_58,plain,
    ( subset(union(X1,X2),X3)
    | member(esk2_2(union(X1,X2),X3),X1)
    | member(esk2_2(union(X1,X2),X3),X2) ),
    inference(spm,[status(thm)],[c_0_55,c_0_38]) ).

cnf(c_0_59,plain,
    ( subset(X1,power_set(union(X2,X3)))
    | ~ member(esk2_2(X1,power_set(union(X2,X3))),power_set(X2)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_56]) ).

cnf(c_0_60,plain,
    ( subset(union(X1,power_set(X2)),power_set(union(X3,X2)))
    | member(esk2_2(union(X1,power_set(X2)),power_set(union(X3,X2))),X1) ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_61,negated_conjecture,
    ~ subset(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),
    i_0_24 ).

cnf(c_0_62,plain,
    subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET694+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 09:09:54 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 17.47/3.73  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.47/3.73  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 31; version: 991; iters: 150)
% 17.47/3.73  # Preprocessing time       : 1.155 s
% 17.47/3.73  
% 17.47/3.73  # Proof found!
% 17.47/3.73  # SZS status Theorem
% 17.47/3.73  # SZS output start CNFRefutation
% See solution above
% 17.47/3.73  # Training examples: 0 positive, 0 negative
% 17.47/3.73  
% 17.47/3.73  # -------------------------------------------------
% 17.47/3.73  # User time                : 1.140 s
% 17.47/3.73  # System time              : 0.147 s
% 17.47/3.73  # Total time               : 1.287 s
% 17.47/3.73  # ...preprocessing         : 1.155 s
% 17.47/3.73  # ...main loop             : 0.132 s
% 17.47/3.73  # Maximum resident set size: 175464 pages
% 17.47/3.73  
%------------------------------------------------------------------------------