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

% Computer : n006.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:27 EDT 2022

% Result   : Theorem 8.09s 2.33s
% Output   : CNFRefutation 8.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  12 unt;   2 nHn;  30 RR)
%            Number of literals    :   69 (  12 equ;  38 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-3 aty)
%            Number of variables   :   67 (   9 sgn)

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

cnf(i_0_21,negated_conjecture,
    ~ disjoint(union(esk8_0),esk9_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_21) ).

cnf(i_0_20,plain,
    ( disjoint(X1,X2)
    | in(esk7_2(X1,X2),set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_20) ).

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

cnf(i_0_13,plain,
    ( in(esk2_3(X1,X2,X3),X1)
    | X2 != union(X1)
    | ~ in(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_13) ).

cnf(i_0_8,plain,
    ( in(X1,X2)
    | X3 != set_intersection2(X2,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_8) ).

cnf(i_0_6,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_6) ).

cnf(i_0_14,plain,
    ( in(X1,esk2_3(X2,X3,X1))
    | X3 != union(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_14) ).

cnf(i_0_22,negated_conjecture,
    ( disjoint(X1,esk9_0)
    | ~ in(X1,esk8_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_22) ).

cnf(i_0_19,plain,
    ( ~ disjoint(X1,X2)
    | ~ in(X3,set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nq_p66ox/lgb.p',i_0_19) ).

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

cnf(c_0_34,negated_conjecture,
    ~ disjoint(union(esk8_0),esk9_0),
    i_0_21 ).

cnf(c_0_35,plain,
    ( disjoint(X1,X2)
    | in(esk7_2(X1,X2),set_intersection2(X1,X2)) ),
    i_0_20 ).

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

cnf(c_0_37,plain,
    ( in(esk2_3(X1,X2,X3),X1)
    | X2 != union(X1)
    | ~ in(X3,X2) ),
    i_0_13 ).

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

cnf(c_0_39,negated_conjecture,
    in(esk7_2(union(esk8_0),esk9_0),set_intersection2(esk9_0,union(esk8_0))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

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

cnf(c_0_41,plain,
    ( in(esk2_3(X1,union(X1),X2),X1)
    | ~ in(X2,union(X1)) ),
    inference(er,[status(thm)],[c_0_37]) ).

cnf(c_0_42,plain,
    in(esk7_2(union(esk8_0),esk9_0),union(esk8_0)),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

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

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

cnf(c_0_45,plain,
    ( in(X1,esk2_3(X2,X3,X1))
    | X3 != union(X2)
    | ~ in(X1,X3) ),
    i_0_14 ).

cnf(c_0_46,negated_conjecture,
    ( disjoint(X1,esk9_0)
    | ~ in(X1,esk8_0) ),
    i_0_22 ).

cnf(c_0_47,plain,
    in(esk2_3(esk8_0,union(esk8_0),esk7_2(union(esk8_0),esk9_0)),esk8_0),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

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

cnf(c_0_49,plain,
    in(esk7_2(union(esk8_0),esk9_0),esk9_0),
    inference(spm,[status(thm)],[c_0_44,c_0_39]) ).

cnf(c_0_50,plain,
    ( in(X1,esk2_3(X2,union(X2),X1))
    | ~ in(X1,union(X2)) ),
    inference(er,[status(thm)],[c_0_45]) ).

cnf(c_0_51,plain,
    ( ~ disjoint(X1,X2)
    | ~ in(X3,set_intersection2(X1,X2)) ),
    i_0_19 ).

cnf(c_0_52,negated_conjecture,
    disjoint(esk2_3(esk8_0,union(esk8_0),esk7_2(union(esk8_0),esk9_0)),esk9_0),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_53,plain,
    ( in(esk7_2(union(esk8_0),esk9_0),set_intersection2(esk9_0,X1))
    | ~ in(esk7_2(union(esk8_0),esk9_0),X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_54,plain,
    in(esk7_2(union(esk8_0),esk9_0),esk2_3(esk8_0,union(esk8_0),esk7_2(union(esk8_0),esk9_0))),
    inference(spm,[status(thm)],[c_0_50,c_0_42]) ).

cnf(c_0_55,plain,
    ~ in(X1,set_intersection2(esk9_0,esk2_3(esk8_0,union(esk8_0),esk7_2(union(esk8_0),esk9_0)))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_36]) ).

cnf(c_0_56,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET945+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n006.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 01:42:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.09/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.09/2.33  # No SInE strategy applied
% 8.09/2.33  # Trying AutoSched0 for 150 seconds
% 8.09/2.33  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002A
% 8.09/2.33  # and selection function SelectNegativeLiterals.
% 8.09/2.33  #
% 8.09/2.33  # Preprocessing time       : 0.023 s
% 8.09/2.33  # Presaturation interreduction done
% 8.09/2.33  
% 8.09/2.33  # Proof found!
% 8.09/2.33  # SZS status Theorem
% 8.09/2.33  # SZS output start CNFRefutation
% See solution above
% 8.09/2.33  # Training examples: 0 positive, 0 negative
% 8.09/2.33  
% 8.09/2.33  # -------------------------------------------------
% 8.09/2.33  # User time                : 0.040 s
% 8.09/2.33  # System time              : 0.012 s
% 8.09/2.33  # Total time               : 0.052 s
% 8.09/2.33  # Maximum resident set size: 7124 pages
% 8.09/2.33  
%------------------------------------------------------------------------------