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

% Computer : n014.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 10:38:29 EDT 2023

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

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

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

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

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

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

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

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

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

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

tff(decl_31,type,
    xC: $i ).

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

tff(decl_33,type,
    esk2_2: ( $i * $i ) > $i ).

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

fof(m__,conjecture,
    ( ( ! [X1] :
          ( aElementOf0(X1,xA)
         => aElementOf0(X1,xB) )
      & aSubsetOf0(xA,xB)
      & ! [X1] :
          ( aElementOf0(X1,xB)
         => aElementOf0(X1,xC) )
      & aSubsetOf0(xB,xC) )
   => ( ! [X1] :
          ( aElementOf0(X1,xA)
         => aElementOf0(X1,xC) )
      | aSubsetOf0(xA,xC) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X1] :
            ( aElementOf0(X1,xA)
           => aElementOf0(X1,xB) )
        & aSubsetOf0(xA,xB)
        & ! [X1] :
            ( aElementOf0(X1,xB)
           => aElementOf0(X1,xC) )
        & aSubsetOf0(xB,xC) )
     => ( ! [X1] :
            ( aElementOf0(X1,xA)
           => aElementOf0(X1,xC) )
        | aSubsetOf0(xA,xC) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_2,negated_conjecture,
    ! [X22,X23] :
      ( ( ~ aElementOf0(X22,xA)
        | aElementOf0(X22,xB) )
      & aSubsetOf0(xA,xB)
      & ( ~ aElementOf0(X23,xB)
        | aElementOf0(X23,xC) )
      & aSubsetOf0(xB,xC)
      & aElementOf0(esk3_0,xA)
      & ~ aElementOf0(esk3_0,xC)
      & ~ aSubsetOf0(xA,xC) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( aElementOf0(X1,xB)
    | ~ aElementOf0(X1,xA) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    aElementOf0(esk3_0,xA),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ aElementOf0(esk3_0,xC),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( aElementOf0(X1,xC)
    | ~ aElementOf0(X1,xB) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    aElementOf0(esk3_0,xB),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : NUM533+2 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n014.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    : 300
% 0.12/0.34  % DateTime   : Fri Aug 25 11:13:03 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.20/0.55  start to proof: theBenchmark
% 0.20/0.56  % Version  : CSE_E---1.5
% 0.20/0.56  % Problem  : theBenchmark.p
% 0.20/0.56  % Proof found
% 0.20/0.56  % SZS status Theorem for theBenchmark.p
% 0.20/0.56  % SZS output start Proof
% See solution above
% 0.20/0.57  % Total time : 0.006000 s
% 0.20/0.57  % SZS output end Proof
% 0.20/0.57  % Total time : 0.009000 s
%------------------------------------------------------------------------------