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

View Problem - Process Solution

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

% Computer : n023.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:07 EDT 2022

% Result   : Theorem 7.92s 2.58s
% Output   : CNFRefutation 7.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (  15 unt;   4 nHn;  21 RR)
%            Number of literals    :   43 (  35 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
    subset(X1,set_union2(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_17) ).

cnf(i_0_1,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_1) ).

cnf(i_0_16,negated_conjecture,
    set_union2(esk4_0,esk5_0) = singleton(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_16) ).

cnf(i_0_9,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | ~ subset(X1,singleton(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_9) ).

cnf(i_0_13,negated_conjecture,
    ( esk5_0 != empty_set
    | singleton(esk3_0) != esk4_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_13) ).

cnf(i_0_15,negated_conjecture,
    ( singleton(esk3_0) != esk4_0
    | singleton(esk3_0) != esk5_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_15) ).

cnf(i_0_14,negated_conjecture,
    ( esk4_0 != empty_set
    | singleton(esk3_0) != esk5_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_14) ).

cnf(i_0_5,plain,
    set_union2(X1,X1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g2px75hz/lgb.p',i_0_5) ).

cnf(c_0_26,plain,
    subset(X1,set_union2(X1,X2)),
    i_0_17 ).

cnf(c_0_27,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_1 ).

cnf(c_0_28,negated_conjecture,
    set_union2(esk4_0,esk5_0) = singleton(esk3_0),
    i_0_16 ).

cnf(c_0_29,plain,
    subset(X1,set_union2(X2,X1)),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | ~ subset(X1,singleton(X2)) ),
    i_0_9 ).

cnf(c_0_31,negated_conjecture,
    subset(esk4_0,singleton(esk3_0)),
    inference(spm,[status(thm)],[c_0_26,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    subset(esk5_0,singleton(esk3_0)),
    inference(spm,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    ( esk5_0 != empty_set
    | singleton(esk3_0) != esk4_0 ),
    i_0_13 ).

cnf(c_0_34,negated_conjecture,
    ( singleton(esk3_0) = esk4_0
    | empty_set = esk4_0 ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    ( singleton(esk3_0) != esk4_0
    | singleton(esk3_0) != esk5_0 ),
    i_0_15 ).

cnf(c_0_36,negated_conjecture,
    ( esk4_0 != empty_set
    | singleton(esk3_0) != esk5_0 ),
    i_0_14 ).

cnf(c_0_37,plain,
    ( singleton(esk3_0) = esk5_0
    | empty_set = esk5_0 ),
    inference(spm,[status(thm)],[c_0_30,c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    ( empty_set = esk4_0
    | empty_set != esk5_0 ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,negated_conjecture,
    ( empty_set = esk4_0
    | esk5_0 != esk4_0 ),
    inference(spm,[status(thm)],[c_0_35,c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    ( empty_set = esk5_0
    | empty_set != esk4_0 ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,negated_conjecture,
    empty_set = esk4_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_37]),c_0_38]),c_0_39]) ).

cnf(c_0_42,negated_conjecture,
    esk5_0 = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41])]) ).

cnf(c_0_43,plain,
    set_union2(X1,X1) = X1,
    i_0_5 ).

cnf(c_0_44,negated_conjecture,
    singleton(esk3_0) != esk4_0,
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_41])]),c_0_42]) ).

cnf(c_0_45,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_42]),c_0_43]),c_0_44]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : SET902+1 : TPTP v8.1.0. Released v3.2.0.
% 0.09/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.36  % Computer : n023.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jul 10 02:40:12 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.22/0.48  # ENIGMATIC: Selected complete mode:
% 7.92/2.58  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.58  # No SInE strategy applied
% 7.92/2.58  # Trying AutoSched0 for 150 seconds
% 7.92/2.58  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00AA
% 7.92/2.58  # and selection function SelectLargestOrientable.
% 7.92/2.58  #
% 7.92/2.58  # Preprocessing time       : 0.012 s
% 7.92/2.58  # Presaturation interreduction done
% 7.92/2.58  
% 7.92/2.58  # Proof found!
% 7.92/2.58  # SZS status Theorem
% 7.92/2.58  # SZS output start CNFRefutation
% See solution above
% 7.92/2.58  # Training examples: 0 positive, 0 negative
% 7.92/2.58  
% 7.92/2.58  # -------------------------------------------------
% 7.92/2.58  # User time                : 0.014 s
% 7.92/2.58  # System time              : 0.006 s
% 7.92/2.58  # Total time               : 0.020 s
% 7.92/2.58  # Maximum resident set size: 7128 pages
% 7.92/2.58  
%------------------------------------------------------------------------------