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

% Computer : n013.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:40:01 EDT 2022

% Result   : Theorem 6.60s 2.18s
% Output   : CNFRefutation 6.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (   6 unt;   5 nHn;  26 RR)
%            Number of literals    :   67 (   8 equ;  38 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   47 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
    ( in(X1,X2)
    | X3 != set_intersection2(X2,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_41) ).

cnf(i_0_39,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_39) ).

cnf(i_0_31,plain,
    ( set_intersection2(X1,cartesian_product2(X2,X2)) = relation_restriction(X1,X2)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_31) ).

cnf(i_0_33,negated_conjecture,
    ( in(esk7_0,esk9_0)
    | in(esk7_0,relation_restriction(esk9_0,esk8_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_33) ).

cnf(i_0_35,negated_conjecture,
    relation(esk9_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_35) ).

cnf(i_0_32,negated_conjecture,
    ( in(esk7_0,relation_restriction(esk9_0,esk8_0))
    | in(esk7_0,cartesian_product2(esk8_0,esk8_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_32) ).

cnf(i_0_40,plain,
    ( in(X1,X2)
    | X3 != set_intersection2(X4,X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_40) ).

cnf(i_0_34,negated_conjecture,
    ( ~ in(esk7_0,esk9_0)
    | ~ in(esk7_0,relation_restriction(esk9_0,esk8_0))
    | ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1q_h8xm7/input.p',i_0_34) ).

cnf(c_0_50,plain,
    ( in(X1,X2)
    | X3 != set_intersection2(X2,X4)
    | ~ in(X1,X3) ),
    i_0_41 ).

cnf(c_0_51,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    i_0_39 ).

cnf(c_0_52,plain,
    ( in(X1,X2)
    | ~ in(X1,set_intersection2(X2,X3)) ),
    inference(er,[status(thm)],[c_0_50]) ).

cnf(c_0_53,plain,
    ( set_intersection2(X1,cartesian_product2(X2,X2)) = relation_restriction(X1,X2)
    | ~ relation(X1) ),
    i_0_31 ).

cnf(c_0_54,plain,
    ( in(X1,set_intersection2(X2,X3))
    | ~ in(X1,X3)
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_51]) ).

cnf(c_0_55,plain,
    ( in(X1,X2)
    | ~ in(X1,relation_restriction(X2,X3))
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    ( in(esk7_0,esk9_0)
    | in(esk7_0,relation_restriction(esk9_0,esk8_0)) ),
    i_0_33 ).

cnf(c_0_57,negated_conjecture,
    relation(esk9_0),
    i_0_35 ).

cnf(c_0_58,plain,
    ( in(X1,relation_restriction(X2,X3))
    | ~ in(X1,cartesian_product2(X3,X3))
    | ~ in(X1,X2)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_54,c_0_53]) ).

cnf(c_0_59,negated_conjecture,
    ( in(esk7_0,relation_restriction(esk9_0,esk8_0))
    | in(esk7_0,cartesian_product2(esk8_0,esk8_0)) ),
    i_0_32 ).

cnf(c_0_60,plain,
    ( in(X1,X2)
    | X3 != set_intersection2(X4,X2)
    | ~ in(X1,X3) ),
    i_0_40 ).

cnf(c_0_61,negated_conjecture,
    ( ~ in(esk7_0,esk9_0)
    | ~ in(esk7_0,relation_restriction(esk9_0,esk8_0))
    | ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0)) ),
    i_0_34 ).

cnf(c_0_62,negated_conjecture,
    in(esk7_0,esk9_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).

cnf(c_0_63,negated_conjecture,
    ( in(esk7_0,relation_restriction(esk9_0,esk8_0))
    | in(esk7_0,relation_restriction(X1,esk8_0))
    | ~ in(esk7_0,X1)
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_64,plain,
    ( in(X1,X2)
    | ~ in(X1,set_intersection2(X3,X2)) ),
    inference(er,[status(thm)],[c_0_60]) ).

cnf(c_0_65,negated_conjecture,
    ( ~ in(esk7_0,relation_restriction(esk9_0,esk8_0))
    | ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).

cnf(c_0_66,negated_conjecture,
    in(esk7_0,relation_restriction(esk9_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(ef,[status(thm)],[c_0_63]),c_0_62]),c_0_57])]) ).

cnf(c_0_67,plain,
    ( in(X1,cartesian_product2(X2,X2))
    | ~ in(X1,relation_restriction(X3,X2))
    | ~ relation(X3) ),
    inference(spm,[status(thm)],[c_0_64,c_0_53]) ).

cnf(c_0_68,negated_conjecture,
    ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).

cnf(c_0_69,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_57])]),c_0_68]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SEU245+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.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 : Mon Jun 20 11:34:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 6.60/2.18  # ENIGMATIC: Solved by autoschedule:
% 6.60/2.18  # No SInE strategy applied
% 6.60/2.18  # Trying AutoSched0 for 150 seconds
% 6.60/2.18  # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 6.60/2.18  # and selection function PSelectComplexExceptUniqMaxHorn.
% 6.60/2.18  #
% 6.60/2.18  # Preprocessing time       : 0.013 s
% 6.60/2.18  
% 6.60/2.18  # Proof found!
% 6.60/2.18  # SZS status Theorem
% 6.60/2.18  # SZS output start CNFRefutation
% See solution above
% 6.60/2.18  # Training examples: 0 positive, 0 negative
% 6.60/2.18  
% 6.60/2.18  # -------------------------------------------------
% 6.60/2.18  # User time                : 0.019 s
% 6.60/2.18  # System time              : 0.003 s
% 6.60/2.18  # Total time               : 0.022 s
% 6.60/2.18  # Maximum resident set size: 7116 pages
% 6.60/2.18  
%------------------------------------------------------------------------------