%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU134+1 : 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 : n027.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:39 EDT 2023

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

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

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

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

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

tff(decl_26,type,
    set_difference: ( $i * $i ) > $i ).

tff(decl_27,type,
    esk1_0: $i ).

tff(decl_28,type,
    esk2_0: $i ).

tff(decl_29,type,
    esk3_0: $i ).

tff(decl_30,type,
    esk4_0: $i ).

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

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

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2] :
        ( set_difference(X1,X2) = empty_set
      <=> subset(X1,X2) ),
    inference(assume_negation,[status(cth)],[t37_xboole_1]) ).

fof(c_0_3,plain,
    ! [X17,X18] :
      ( ( set_difference(X17,X18) != empty_set
        | subset(X17,X18) )
      & ( ~ subset(X17,X18)
        | set_difference(X17,X18) = empty_set ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])]) ).

fof(c_0_4,negated_conjecture,
    ( ( set_difference(esk3_0,esk4_0) != empty_set
      | ~ subset(esk3_0,esk4_0) )
    & ( set_difference(esk3_0,esk4_0) = empty_set
      | subset(esk3_0,esk4_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( set_difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ( set_difference(esk3_0,esk4_0) = empty_set
    | subset(esk3_0,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( set_difference(esk3_0,esk4_0) != empty_set
    | ~ subset(esk3_0,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    set_difference(esk3_0,esk4_0) = empty_set,
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ subset(esk3_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).

cnf(c_0_10,plain,
    ( subset(X1,X2)
    | set_difference(X1,X2) != empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU134+1 : 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.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Thu Aug 24 01:35:47 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.60  % Version  : CSE_E---1.5
% 0.21/0.60  % Problem  : theBenchmark.p
% 0.21/0.60  % Proof found
% 0.21/0.60  % SZS status Theorem for theBenchmark.p
% 0.21/0.60  % SZS output start Proof
% See solution above
% 0.21/0.60  % Total time : 0.007000 s
% 0.21/0.60  % SZS output end Proof
% 0.21/0.60  % Total time : 0.009000 s
%------------------------------------------------------------------------------