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

% Computer : n012.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:14 EDT 2022

% Result   : Theorem 7.87s 2.46s
% Output   : CNFRefutation 7.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   8 unt;   3 nHn;   8 RR)
%            Number of literals    :   18 (   8 equ;   7 neg)
%            Maximal clause size   :    2 (   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-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
    ( set_intersection2(X1,singleton(X2)) = singleton(X2)
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kr67l0wi/lgb.p',i_0_5) ).

cnf(i_0_4,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kr67l0wi/lgb.p',i_0_4) ).

cnf(i_0_9,negated_conjecture,
    set_intersection2(singleton(esk3_0),esk4_0) != singleton(esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kr67l0wi/lgb.p',i_0_9) ).

cnf(i_0_2,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kr67l0wi/lgb.p',i_0_2) ).

cnf(i_0_10,negated_conjecture,
    ~ disjoint(singleton(esk3_0),esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kr67l0wi/lgb.p',i_0_10) ).

cnf(c_0_16,plain,
    ( set_intersection2(X1,singleton(X2)) = singleton(X2)
    | ~ in(X2,X1) ),
    i_0_5 ).

cnf(c_0_17,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    i_0_4 ).

cnf(c_0_18,negated_conjecture,
    set_intersection2(singleton(esk3_0),esk4_0) != singleton(esk3_0),
    i_0_9 ).

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

cnf(c_0_20,negated_conjecture,
    ~ disjoint(singleton(esk3_0),esk4_0),
    i_0_10 ).

cnf(c_0_21,plain,
    ( set_intersection2(X1,singleton(X2)) = singleton(X2)
    | disjoint(singleton(X2),X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    set_intersection2(esk4_0,singleton(esk3_0)) != singleton(esk3_0),
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n012.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 12:17:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.87/2.46  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.87/2.46  # No SInE strategy applied
% 7.87/2.46  # Trying AutoSched0 for 150 seconds
% 7.87/2.46  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 7.87/2.46  # and selection function SelectCQIPrecWNTNp.
% 7.87/2.46  #
% 7.87/2.46  # Preprocessing time       : 0.013 s
% 7.87/2.46  
% 7.87/2.46  # Proof found!
% 7.87/2.46  # SZS status Theorem
% 7.87/2.46  # SZS output start CNFRefutation
% See solution above
% 7.87/2.46  # Training examples: 0 positive, 0 negative
% 7.87/2.46  
% 7.87/2.46  # -------------------------------------------------
% 7.87/2.46  # User time                : 0.012 s
% 7.87/2.46  # System time              : 0.008 s
% 7.87/2.46  # Total time               : 0.020 s
% 7.87/2.46  # Maximum resident set size: 7120 pages
% 7.87/2.46  
%------------------------------------------------------------------------------