%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n028.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  : 300s
% DateTime : Thu Aug 31 16:22:37 EDT 2023

% Result   : Theorem 0.20s 0.61s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   37 (  10 unt;  17 typ;   0 def)
%            Number of atoms       :   40 (   9 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   34 (  14   ~;  11   |;   5   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  12   >;  12   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-3 aty)
%            Number of variables   :   30 (   2 sgn;  21   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    in: ( $i * $i ) > $o ).

tff(decl_23,type,
    set_union2: ( $i * $i ) > $i ).

tff(decl_24,type,
    set_intersection2: ( $i * $i ) > $i ).

tff(decl_25,type,
    subset: ( $i * $i ) > $o ).

tff(decl_26,type,
    empty_set: $i ).

tff(decl_27,type,
    disjoint: ( $i * $i ) > $o ).

tff(decl_28,type,
    empty: $i > $o ).

tff(decl_29,type,
    esk1_1: $i > $i ).

tff(decl_30,type,
    esk2_3: ( $i * $i * $i ) > $i ).

tff(decl_31,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_32,type,
    esk4_3: ( $i * $i * $i ) > $i ).

tff(decl_33,type,
    esk5_0: $i ).

tff(decl_34,type,
    esk6_0: $i ).

tff(decl_35,type,
    esk7_0: $i ).

tff(decl_36,type,
    esk8_0: $i ).

tff(decl_37,type,
    esk9_2: ( $i * $i ) > $i ).

tff(decl_38,type,
    esk10_2: ( $i * $i ) > $i ).

fof(t28_xboole_1,conjecture,
    ! [X1,X2] :
      ( subset(X1,X2)
     => set_intersection2(X1,X2) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).

fof(t19_xboole_1,lemma,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X1,X3) )
     => subset(X1,set_intersection2(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : subset(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(d10_xboole_0,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

fof(t17_xboole_1,lemma,
    ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2] :
        ( subset(X1,X2)
       => set_intersection2(X1,X2) = X1 ),
    inference(assume_negation,[status(cth)],[t28_xboole_1]) ).

fof(c_0_6,lemma,
    ! [X58,X59,X60] :
      ( ~ subset(X58,X59)
      | ~ subset(X58,X60)
      | subset(X58,set_intersection2(X59,X60)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])]) ).

fof(c_0_7,negated_conjecture,
    ( subset(esk7_0,esk8_0)
    & set_intersection2(esk7_0,esk8_0) != esk7_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_8,lemma,
    ( subset(X1,set_intersection2(X2,X3))
    | ~ subset(X1,X2)
    | ~ subset(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    subset(esk7_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X51] : subset(X51,X51),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).

fof(c_0_11,plain,
    ! [X11,X12] :
      ( ( subset(X11,X12)
        | X11 != X12 )
      & ( subset(X12,X11)
        | X11 != X12 )
      & ( ~ subset(X11,X12)
        | ~ subset(X12,X11)
        | X11 = X12 ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).

cnf(c_0_12,negated_conjecture,
    ( subset(esk7_0,set_intersection2(X1,esk8_0))
    | ~ subset(esk7_0,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,lemma,
    ! [X56,X57] : subset(set_intersection2(X56,X57),X56),
    inference(variable_rename,[status(thm)],[t17_xboole_1]) ).

cnf(c_0_15,plain,
    ( X1 = X2
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    subset(esk7_0,set_intersection2(esk7_0,esk8_0)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,lemma,
    subset(set_intersection2(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    set_intersection2(esk7_0,esk8_0) != esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n028.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Wed Aug 23 14:29:18 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.59  start to proof: theBenchmark
% 0.20/0.61  % Version  : CSE_E---1.5
% 0.20/0.61  % Problem  : theBenchmark.p
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark.p
% 0.20/0.61  % SZS output start Proof
% See solution above
% 0.20/0.61  % Total time : 0.012000 s
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time : 0.015000 s
%------------------------------------------------------------------------------