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

View Problem - Process Solution

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

% Computer : n029.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:15:03 EDT 2022

% Result   : Theorem 8.28s 2.66s
% Output   : CNFRefutation 8.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   5 unt;   7 nHn;  14 RR)
%            Number of literals    :   45 (  18 equ;  17 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6cuwfee9/lgb.p',i_0_8) ).

cnf(i_0_22,negated_conjecture,
    union(singleton(esk8_0)) != esk8_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6cuwfee9/lgb.p',i_0_22) ).

cnf(i_0_12,plain,
    ( X1 = union(X2)
    | in(esk4_2(X2,X1),X1)
    | in(esk5_2(X2,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6cuwfee9/lgb.p',i_0_12) ).

cnf(i_0_13,plain,
    ( X1 = union(X2)
    | in(esk4_2(X2,X1),X1)
    | in(esk4_2(X2,X1),esk5_2(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6cuwfee9/lgb.p',i_0_13) ).

cnf(i_0_7,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6cuwfee9/lgb.p',i_0_7) ).

cnf(i_0_14,plain,
    ( X1 = union(X2)
    | ~ in(X3,X2)
    | ~ in(esk4_2(X2,X1),X3)
    | ~ in(esk4_2(X2,X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6cuwfee9/lgb.p',i_0_14) ).

cnf(c_0_29,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_8 ).

cnf(c_0_30,negated_conjecture,
    union(singleton(esk8_0)) != esk8_0,
    i_0_22 ).

cnf(c_0_31,plain,
    ( X1 = union(X2)
    | in(esk4_2(X2,X1),X1)
    | in(esk5_2(X2,X1),X2) ),
    i_0_12 ).

cnf(c_0_32,plain,
    ( X1 = union(X2)
    | in(esk4_2(X2,X1),X1)
    | in(esk4_2(X2,X1),esk5_2(X2,X1)) ),
    i_0_13 ).

cnf(c_0_33,plain,
    ( X1 = X2
    | ~ in(X1,singleton(X2)) ),
    inference(er,[status(thm)],[c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ( in(esk5_2(singleton(esk8_0),esk8_0),singleton(esk8_0))
    | in(esk4_2(singleton(esk8_0),esk8_0),esk8_0) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31])]) ).

cnf(c_0_35,negated_conjecture,
    ( in(esk4_2(singleton(esk8_0),esk8_0),esk5_2(singleton(esk8_0),esk8_0))
    | in(esk4_2(singleton(esk8_0),esk8_0),esk8_0) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_32])]) ).

cnf(c_0_36,plain,
    ( esk5_2(singleton(esk8_0),esk8_0) = esk8_0
    | in(esk4_2(singleton(esk8_0),esk8_0),esk8_0) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_7 ).

cnf(c_0_38,plain,
    ( X1 = union(X2)
    | ~ in(X3,X2)
    | ~ in(esk4_2(X2,X1),X3)
    | ~ in(esk4_2(X2,X1),X1) ),
    i_0_14 ).

cnf(c_0_39,plain,
    in(esk4_2(singleton(esk8_0),esk8_0),esk8_0),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_40,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).

cnf(c_0_41,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40])]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SET890+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 09:41:49 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 8.28/2.66  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.28/2.66  # No SInE strategy applied
% 8.28/2.66  # Trying AutoSched0 for 150 seconds
% 8.28/2.66  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05EA
% 8.28/2.66  # and selection function SelectDivPreferIntoLits.
% 8.28/2.66  #
% 8.28/2.66  # Preprocessing time       : 0.024 s
% 8.28/2.66  # Presaturation interreduction done
% 8.28/2.66  
% 8.28/2.66  # Proof found!
% 8.28/2.66  # SZS status Theorem
% 8.28/2.66  # SZS output start CNFRefutation
% See solution above
% 8.28/2.66  # Training examples: 0 positive, 0 negative
% 8.28/2.66  
% 8.28/2.66  # -------------------------------------------------
% 8.28/2.66  # User time                : 0.034 s
% 8.28/2.66  # System time              : 0.005 s
% 8.28/2.66  # Total time               : 0.039 s
% 8.28/2.66  # Maximum resident set size: 7132 pages
% 8.28/2.66  
%------------------------------------------------------------------------------