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

View Problem - Process Solution

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

% Computer : n032.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:38:30 EDT 2022

% Result   : Theorem 13.62s 2.94s
% Output   : CNFRefutation 13.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   31 (   6 unt;  10 nHn;  24 RR)
%            Number of literals    :   75 (   4 equ;  38 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   1 con; 0-3 aty)
%            Number of variables   :   52 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_52,plain,
    ( preboolean(X1)
    | ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
    | ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_52) ).

cnf(i_0_60,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_60) ).

cnf(i_0_10,plain,
    ( element(subset_difference(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_10) ).

cnf(i_0_50,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_50) ).

cnf(i_0_9,plain,
    ( element(subset_union2(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_9) ).

cnf(i_0_49,plain,
    ( subset_union2(X1,X2,X3) = set_union2(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_49) ).

cnf(i_0_13,plain,
    ~ empty(powerset(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_13) ).

cnf(i_0_58,plain,
    ( element(X1,X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_58) ).

cnf(i_0_53,plain,
    ( preboolean(X1)
    | in(esk12_1(X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_53) ).

cnf(i_0_54,plain,
    ( preboolean(X1)
    | in(esk11_1(X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_54) ).

cnf(i_0_59,negated_conjecture,
    ~ preboolean(powerset(esk13_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oj03a_gl/input.p',i_0_59) ).

cnf(c_0_72,plain,
    ( preboolean(X1)
    | ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
    | ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1) ),
    i_0_52 ).

cnf(c_0_73,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    i_0_60 ).

cnf(c_0_74,plain,
    ( preboolean(X1)
    | empty(X1)
    | ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
    | ~ element(set_difference(esk11_1(X1),esk12_1(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_75,plain,
    ( element(subset_difference(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_10 ).

cnf(c_0_76,plain,
    ( subset_difference(X1,X2,X3) = set_difference(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_50 ).

cnf(c_0_77,plain,
    ( element(subset_union2(X1,X2,X3),powerset(X1))
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_9 ).

cnf(c_0_78,plain,
    ( subset_union2(X1,X2,X3) = set_union2(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_49 ).

cnf(c_0_79,plain,
    ( preboolean(X1)
    | empty(X1)
    | ~ element(set_difference(esk11_1(X1),esk12_1(X1)),X1)
    | ~ element(set_union2(esk11_1(X1),esk12_1(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_74,c_0_73]) ).

cnf(c_0_80,plain,
    ( element(set_difference(X1,X2),powerset(X3))
    | ~ element(X2,powerset(X3))
    | ~ element(X1,powerset(X3)) ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_81,plain,
    ~ empty(powerset(X1)),
    i_0_13 ).

cnf(c_0_82,plain,
    ( element(set_union2(X1,X2),powerset(X3))
    | ~ element(X2,powerset(X3))
    | ~ element(X1,powerset(X3)) ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_83,plain,
    ( element(X1,X2)
    | ~ in(X1,X2) ),
    i_0_58 ).

cnf(c_0_84,plain,
    ( preboolean(X1)
    | in(esk12_1(X1),X1) ),
    i_0_53 ).

cnf(c_0_85,plain,
    ( preboolean(X1)
    | in(esk11_1(X1),X1) ),
    i_0_54 ).

cnf(c_0_86,plain,
    ( preboolean(powerset(X1))
    | ~ element(esk12_1(powerset(X1)),powerset(X1))
    | ~ element(esk11_1(powerset(X1)),powerset(X1)) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]) ).

cnf(c_0_87,plain,
    ( element(esk12_1(X1),X1)
    | preboolean(X1) ),
    inference(spm,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_88,plain,
    ( element(esk11_1(X1),X1)
    | preboolean(X1) ),
    inference(spm,[status(thm)],[c_0_83,c_0_85]) ).

cnf(c_0_89,negated_conjecture,
    ~ preboolean(powerset(esk13_0)),
    i_0_59 ).

cnf(c_0_90,plain,
    preboolean(powerset(X1)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).

cnf(c_0_91,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEU108+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.31  % Computer : n032.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 600
% 0.10/0.31  % DateTime : Sun Jun 19 07:57:04 EDT 2022
% 0.10/0.31  % CPUTime  : 
% 0.15/0.39  # ENIGMATIC: Selected complete mode:
% 13.62/2.94  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 13.62/2.94  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 21; version: 991; iters: 150)
% 13.62/2.94  # Preprocessing time       : 0.853 s
% 13.62/2.94  
% 13.62/2.94  # Proof found!
% 13.62/2.94  # SZS status Theorem
% 13.62/2.94  # SZS output start CNFRefutation
% See solution above
% 13.62/2.94  # Training examples: 0 positive, 0 negative
% 13.62/2.94  
% 13.62/2.94  # -------------------------------------------------
% 13.62/2.94  # User time                : 0.746 s
% 13.62/2.94  # System time              : 0.112 s
% 13.62/2.94  # Total time               : 0.857 s
% 13.62/2.94  # ...preprocessing         : 0.853 s
% 13.62/2.94  # ...main loop             : 0.005 s
% 13.62/2.94  # Maximum resident set size: 167752 pages
% 13.62/2.94  
%------------------------------------------------------------------------------