%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET920+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:15 EDT 2022

% Result   : Theorem 7.19s 2.40s
% Output   : CNFRefutation 7.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (   9 unt;   0 nHn;  12 RR)
%            Number of literals    :   25 (  11 equ;  12 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   6 sgn)

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

cnf(i_0_20,negated_conjecture,
    set_intersection2(unordered_pair(esk5_0,esk6_0),esk7_0) = unordered_pair(esk5_0,esk6_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eeltfoiw/lgb.p',i_0_20) ).

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

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

cnf(i_0_19,negated_conjecture,
    ~ in(esk5_0,esk7_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eeltfoiw/lgb.p',i_0_19) ).

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

cnf(c_0_27,negated_conjecture,
    set_intersection2(unordered_pair(esk5_0,esk6_0),esk7_0) = unordered_pair(esk5_0,esk6_0),
    i_0_20 ).

cnf(c_0_28,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    i_0_3 ).

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

cnf(c_0_30,negated_conjecture,
    set_intersection2(esk7_0,unordered_pair(esk5_0,esk6_0)) = unordered_pair(esk5_0,esk6_0),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_8 ).

cnf(c_0_32,negated_conjecture,
    ( in(X1,esk7_0)
    | ~ in(X1,unordered_pair(esk5_0,esk6_0)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).

cnf(c_0_34,negated_conjecture,
    ~ in(esk5_0,esk7_0),
    i_0_19 ).

cnf(c_0_35,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET920+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 14:53:58 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.21/0.45  # ENIGMATIC: Selected complete mode:
% 7.19/2.40  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.19/2.40  # No SInE strategy applied
% 7.19/2.40  # Trying AutoSched0 for 150 seconds
% 7.19/2.40  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.19/2.40  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.19/2.40  #
% 7.19/2.40  # Preprocessing time       : 0.013 s
% 7.19/2.40  # Presaturation interreduction done
% 7.19/2.40  
% 7.19/2.40  # Proof found!
% 7.19/2.40  # SZS status Theorem
% 7.19/2.40  # SZS output start CNFRefutation
% See solution above
% 7.19/2.40  # Training examples: 0 positive, 0 negative
% 7.19/2.40  
% 7.19/2.40  # -------------------------------------------------
% 7.19/2.40  # User time                : 0.014 s
% 7.19/2.40  # System time              : 0.005 s
% 7.19/2.40  # Total time               : 0.019 s
% 7.19/2.40  # Maximum resident set size: 7124 pages
% 7.19/2.40  
%------------------------------------------------------------------------------