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

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

% Result   : Theorem 7.94s 2.29s
% Output   : CNFRefutation 7.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   9 unt;   0 nHn;  11 RR)
%            Number of literals    :   23 (   4 equ;  12 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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-qkfg7p86/lgb.p',i_0_6) ).

cnf(i_0_12,plain,
    cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qkfg7p86/lgb.p',i_0_12) ).

cnf(i_0_13,negated_conjecture,
    ~ in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qkfg7p86/lgb.p',i_0_13) ).

cnf(i_0_14,negated_conjecture,
    in(esk4_0,cartesian_product2(esk7_0,esk8_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qkfg7p86/lgb.p',i_0_14) ).

cnf(i_0_15,negated_conjecture,
    in(esk4_0,cartesian_product2(esk5_0,esk6_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qkfg7p86/lgb.p',i_0_15) ).

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

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

cnf(c_0_23,plain,
    cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
    i_0_12 ).

cnf(c_0_24,negated_conjecture,
    ~ in(esk4_0,cartesian_product2(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk8_0))),
    i_0_13 ).

cnf(c_0_25,plain,
    ( in(X1,cartesian_product2(set_intersection2(X2,X3),set_intersection2(X4,X5)))
    | ~ in(X1,cartesian_product2(X3,X5))
    | ~ in(X1,cartesian_product2(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    in(esk4_0,cartesian_product2(esk7_0,esk8_0)),
    i_0_14 ).

cnf(c_0_27,negated_conjecture,
    in(esk4_0,cartesian_product2(esk5_0,esk6_0)),
    i_0_15 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 15:25:28 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.94/2.29  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.94/2.29  # No SInE strategy applied
% 7.94/2.29  # Trying AutoSched0 for 150 seconds
% 7.94/2.29  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.94/2.29  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.94/2.29  #
% 7.94/2.29  # Preprocessing time       : 0.024 s
% 7.94/2.29  # Presaturation interreduction done
% 7.94/2.29  
% 7.94/2.29  # Proof found!
% 7.94/2.29  # SZS status Theorem
% 7.94/2.29  # SZS output start CNFRefutation
% See solution above
% 7.94/2.29  # Training examples: 0 positive, 0 negative
% 7.94/2.29  
% 7.94/2.29  # -------------------------------------------------
% 7.94/2.29  # User time                : 0.026 s
% 7.94/2.29  # System time              : 0.007 s
% 7.94/2.29  # Total time               : 0.033 s
% 7.94/2.29  # Maximum resident set size: 7124 pages
% 7.94/2.29  
%------------------------------------------------------------------------------