TSTP Solution File: SEU354+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n004.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:06 EDT 2022

% Result   : Theorem 8.74s 3.00s
% Output   : CNFRefutation 8.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (   9 unt;   2 nHn;  14 RR)
%            Number of literals    :   31 (  11 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_317,plain,
    ( X1 != union(X2)
    | ~ element(X1,X2)
    | ~ proper_element(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_317) ).

cnf(i_0_316,plain,
    ( X1 = union(X2)
    | proper_element(X1,X2)
    | ~ element(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_316) ).

cnf(i_0_2641,negated_conjecture,
    element(esk435_0,powerset(esk434_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_2641) ).

cnf(i_0_2699,lemma,
    union(powerset(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_2699) ).

cnf(i_0_2640,negated_conjecture,
    ( esk434_0 = esk435_0
    | ~ proper_element(esk435_0,powerset(esk434_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_2640) ).

cnf(i_0_550,plain,
    element(X1,powerset(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_550) ).

cnf(i_0_2639,negated_conjecture,
    ( proper_element(esk435_0,powerset(esk434_0))
    | esk434_0 != esk435_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r9a9bda8/lgb.p',i_0_2639) ).

cnf(c_0_2707,plain,
    ( X1 != union(X2)
    | ~ element(X1,X2)
    | ~ proper_element(X1,X2) ),
    i_0_317 ).

cnf(c_0_2708,plain,
    ( X1 = union(X2)
    | proper_element(X1,X2)
    | ~ element(X1,X2) ),
    i_0_316 ).

cnf(c_0_2709,negated_conjecture,
    element(esk435_0,powerset(esk434_0)),
    i_0_2641 ).

cnf(c_0_2710,lemma,
    union(powerset(X1)) = X1,
    i_0_2699 ).

cnf(c_0_2711,negated_conjecture,
    ( esk434_0 = esk435_0
    | ~ proper_element(esk435_0,powerset(esk434_0)) ),
    i_0_2640 ).

cnf(c_0_2712,plain,
    ( ~ element(union(X1),X1)
    | ~ proper_element(union(X1),X1) ),
    inference(er,[status(thm)],[c_0_2707]) ).

cnf(c_0_2713,plain,
    element(X1,powerset(X1)),
    i_0_550 ).

cnf(c_0_2714,negated_conjecture,
    ( proper_element(esk435_0,powerset(esk434_0))
    | esk434_0 != esk435_0 ),
    i_0_2639 ).

cnf(c_0_2715,negated_conjecture,
    esk434_0 = esk435_0,
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2708,c_0_2709]),c_0_2710]),c_0_2711]) ).

cnf(c_0_2716,lemma,
    ~ proper_element(X1,powerset(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2712,c_0_2710]),c_0_2713])]) ).

cnf(c_0_2717,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_2714,c_0_2715]),c_0_2715])]),c_0_2716]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU354+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n004.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 Jun 19 11:10:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.49  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.49  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.49  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.74/3.00  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.74/3.00  # No SInE strategy applied
% 8.74/3.00  # Trying AutoSched0 for 150 seconds
% 8.74/3.00  # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 8.74/3.00  # and selection function SelectCQArEqLast.
% 8.74/3.00  #
% 8.74/3.00  # Preprocessing time       : 0.014 s
% 8.74/3.00  # Presaturation interreduction done
% 8.74/3.00  
% 8.74/3.00  # Proof found!
% 8.74/3.00  # SZS status Theorem
% 8.74/3.00  # SZS output start CNFRefutation
% See solution above
% 8.74/3.00  # Training examples: 0 positive, 0 negative
% 8.74/3.00  
% 8.74/3.00  # -------------------------------------------------
% 8.74/3.00  # User time                : 0.019 s
% 8.74/3.00  # System time              : 0.001 s
% 8.74/3.00  # Total time               : 0.020 s
% 8.74/3.00  # Maximum resident set size: 7132 pages
% 8.74/3.00  
%------------------------------------------------------------------------------