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

% Computer : n023.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:33 EDT 2023

% Result   : Theorem 0.44s 0.60s
% Output   : CNFRefutation 0.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   29
% Syntax   : Number of formulae    :   34 (   3 unt;  28 typ;   0 def)
%            Number of atoms       :   15 (   3 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   17 (   8   ~;   2   |;   5   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   39 (  24   >;  15   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;   4 con; 0-3 aty)
%            Number of variables   :    6 (   1 sgn;   3   !;   2   ?;   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,
    sdtpldt0: ( $i * $i ) > $i ).

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

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

tff(decl_32,type,
    sz00: $i ).

tff(decl_33,type,
    szszuzczcdt0: $i > $i ).

tff(decl_34,type,
    sdtlseqdt0: ( $i * $i ) > $o ).

tff(decl_35,type,
    iLess0: ( $i * $i ) > $o ).

tff(decl_36,type,
    sbrdtbr0: $i > $i ).

tff(decl_37,type,
    szmzizndt0: $i > $i ).

tff(decl_38,type,
    szmzazxdt0: $i > $i ).

tff(decl_39,type,
    slbdtrb0: $i > $i ).

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

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

tff(decl_42,type,
    esk3_3: ( $i * $i * $i ) > $i ).

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

tff(decl_44,type,
    esk5_1: $i > $i ).

tff(decl_45,type,
    esk6_2: ( $i * $i ) > $i ).

tff(decl_46,type,
    esk7_2: ( $i * $i ) > $i ).

tff(decl_47,type,
    esk8_2: ( $i * $i ) > $i ).

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

tff(decl_49,type,
    esk10_0: $i ).

fof(m__,conjecture,
    ( ( aSet0(slbdtrb0(sz00))
      & ! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00)) )
   => ( ~ ? [X1] : aElementOf0(X1,slbdtrb0(sz00))
      | slbdtrb0(sz00) = slcrc0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( aSet0(slbdtrb0(sz00))
        & ! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00)) )
     => ( ~ ? [X1] : aElementOf0(X1,slbdtrb0(sz00))
        | slbdtrb0(sz00) = slcrc0 ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_2,negated_conjecture,
    ! [X103] :
      ( aSet0(slbdtrb0(sz00))
      & ~ aElementOf0(X103,slbdtrb0(sz00))
      & aElementOf0(esk10_0,slbdtrb0(sz00))
      & slbdtrb0(sz00) != slcrc0 ),
    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(esk10_0,slbdtrb0(sz00)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ~ aElementOf0(X1,slbdtrb0(sz00)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_3,c_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : NUM540+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n023.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Fri Aug 25 16:45:27 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.44/0.58  start to proof: theBenchmark
% 0.44/0.60  % Version  : CSE_E---1.5
% 0.44/0.60  % Problem  : theBenchmark.p
% 0.44/0.60  % Proof found
% 0.44/0.60  % SZS status Theorem for theBenchmark.p
% 0.44/0.60  % SZS output start Proof
% See solution above
% 0.44/0.60  % Total time : 0.012000 s
% 0.44/0.60  % SZS output end Proof
% 0.44/0.60  % Total time : 0.016000 s
%------------------------------------------------------------------------------