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

% Computer : n021.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:12 EDT 2022

% Result   : Theorem 7.59s 2.32s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   16 (  11 unt;   0 nHn;  14 RR)
%            Number of literals    :   23 (   7 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( subset(unordered_pair(X1,X2),X3)
    | ~ in(X2,X3)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6adgrnw5/lgb.p',i_0_9) ).

cnf(i_0_13,negated_conjecture,
    in(esk5_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6adgrnw5/lgb.p',i_0_13) ).

cnf(i_0_14,negated_conjecture,
    in(esk3_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6adgrnw5/lgb.p',i_0_14) ).

cnf(i_0_12,negated_conjecture,
    set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0) != unordered_pair(esk3_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6adgrnw5/lgb.p',i_0_12) ).

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

cnf(i_0_8,plain,
    ( set_intersection2(X1,X2) = X1
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6adgrnw5/lgb.p',i_0_8) ).

cnf(c_0_21,plain,
    ( subset(unordered_pair(X1,X2),X3)
    | ~ in(X2,X3)
    | ~ in(X1,X3) ),
    i_0_9 ).

cnf(c_0_22,negated_conjecture,
    in(esk5_0,esk4_0),
    i_0_13 ).

cnf(c_0_23,negated_conjecture,
    ( subset(unordered_pair(X1,esk5_0),esk4_0)
    | ~ in(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    in(esk3_0,esk4_0),
    i_0_14 ).

cnf(c_0_25,negated_conjecture,
    set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0) != unordered_pair(esk3_0,esk5_0),
    i_0_12 ).

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

cnf(c_0_27,plain,
    ( set_intersection2(X1,X2) = X1
    | ~ subset(X1,X2) ),
    i_0_8 ).

cnf(c_0_28,negated_conjecture,
    subset(unordered_pair(esk3_0,esk5_0),esk4_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    set_intersection2(esk4_0,unordered_pair(esk3_0,esk5_0)) != unordered_pair(esk3_0,esk5_0),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 04:58:09 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.59/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.32  # No SInE strategy applied
% 7.59/2.32  # Trying AutoSched0 for 150 seconds
% 7.59/2.32  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_AE_CS_SP_PI_S0S
% 7.59/2.32  # and selection function SelectComplexG.
% 7.59/2.32  #
% 7.59/2.32  # Preprocessing time       : 0.013 s
% 7.59/2.32  
% 7.59/2.32  # Proof found!
% 7.59/2.32  # SZS status Theorem
% 7.59/2.32  # SZS output start CNFRefutation
% See solution above
% 7.59/2.32  # Training examples: 0 positive, 0 negative
% 7.59/2.32  
% 7.59/2.32  # -------------------------------------------------
% 7.59/2.32  # User time                : 0.011 s
% 7.59/2.32  # System time              : 0.007 s
% 7.59/2.32  # Total time               : 0.018 s
% 7.59/2.32  # Maximum resident set size: 7124 pages
% 7.59/2.32  
%------------------------------------------------------------------------------