%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET877+1 : TPTP v8.1.0. Released v3.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:14:58 EDT 2022

% Result   : Theorem 7.04s 2.30s
% Output   : CNFRefutation 7.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (   8 unt;   0 nHn;  12 RR)
%            Number of literals    :   22 (  15 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( in(X1,X2)
    | set_intersection2(X2,singleton(X1)) != singleton(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnzof7tz/input.p',i_0_8) ).

cnf(i_0_2,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnzof7tz/input.p',i_0_2) ).

cnf(i_0_12,negated_conjecture,
    set_intersection2(singleton(esk4_0),singleton(esk5_0)) = singleton(esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnzof7tz/input.p',i_0_12) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnzof7tz/input.p',i_0_6) ).

cnf(i_0_11,negated_conjecture,
    esk5_0 != esk4_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fnzof7tz/input.p',i_0_11) ).

cnf(c_0_18,plain,
    ( in(X1,X2)
    | set_intersection2(X2,singleton(X1)) != singleton(X1) ),
    i_0_8 ).

cnf(c_0_19,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    i_0_2 ).

cnf(c_0_20,plain,
    ( in(X1,X2)
    | set_intersection2(singleton(X1),X2) != singleton(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,negated_conjecture,
    set_intersection2(singleton(esk4_0),singleton(esk5_0)) = singleton(esk4_0),
    i_0_12 ).

cnf(c_0_22,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_6 ).

cnf(c_0_23,negated_conjecture,
    in(esk4_0,singleton(esk5_0)),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,plain,
    ( esk4_0 = X1
    | singleton(esk5_0) != singleton(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    esk5_0 != esk4_0,
    i_0_11 ).

cnf(c_0_26,plain,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET877+1 : TPTP v8.1.0. Released v3.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 19:51:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.04/2.30  # ENIGMATIC: Solved by autoschedule:
% 7.04/2.30  # No SInE strategy applied
% 7.04/2.30  # Trying AutoSched0 for 150 seconds
% 7.04/2.30  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.04/2.30  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.04/2.30  #
% 7.04/2.30  # Preprocessing time       : 0.012 s
% 7.04/2.30  
% 7.04/2.30  # Proof found!
% 7.04/2.30  # SZS status Theorem
% 7.04/2.30  # SZS output start CNFRefutation
% See solution above
% 7.04/2.30  # Training examples: 0 positive, 0 negative
% 7.04/2.30  
% 7.04/2.30  # -------------------------------------------------
% 7.04/2.30  # User time                : 0.013 s
% 7.04/2.30  # System time              : 0.003 s
% 7.04/2.30  # Total time               : 0.015 s
% 7.04/2.30  # Maximum resident set size: 7120 pages
% 7.04/2.30  
%------------------------------------------------------------------------------