%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SEU306+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 : n016.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:24:18 EDT 2023

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

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

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

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

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

tff(decl_26,type,
    v2_membered: $i > $o ).

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

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

tff(decl_29,type,
    element: ( $i * $i ) > $o ).

tff(decl_30,type,
    v1_xcmplx_0: $i > $o ).

tff(decl_31,type,
    v1_xreal_0: $i > $o ).

tff(decl_32,type,
    v1_rat_1: $i > $o ).

tff(decl_33,type,
    v1_int_1: $i > $o ).

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

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

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

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

tff(decl_38,type,
    one_sorted_str: $i > $o ).

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

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

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

tff(decl_42,type,
    esk2_1: $i > $i ).

tff(decl_43,type,
    esk3_1: $i > $i ).

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

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

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

fof(t12_pre_topc,conjecture,
    ! [X1] :
      ( one_sorted_str(X1)
     => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_pre_topc) ).

fof(d3_pre_topc,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_pre_topc) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1] :
        ( one_sorted_str(X1)
       => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    inference(assume_negation,[status(cth)],[t12_pre_topc]) ).

fof(c_0_3,negated_conjecture,
    ( one_sorted_str(esk6_0)
    & cast_as_carrier_subset(esk6_0) != the_carrier(esk6_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X59] :
      ( ~ one_sorted_str(X59)
      | cast_as_carrier_subset(X59) = the_carrier(X59) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).

cnf(c_0_5,negated_conjecture,
    cast_as_carrier_subset(esk6_0) != the_carrier(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    one_sorted_str(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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.00/0.12  % Problem    : SEU306+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 : n016.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   : Wed Aug 23 22:44:08 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.59  start to proof: theBenchmark
% 0.19/0.61  % Version  : CSE_E---1.5
% 0.19/0.61  % Problem  : theBenchmark.p
% 0.19/0.61  % Proof found
% 0.19/0.61  % SZS status Theorem for theBenchmark.p
% 0.19/0.61  % SZS output start Proof
% See solution above
% 0.19/0.61  % Total time : 0.013000 s
% 0.19/0.61  % SZS output end Proof
% 0.19/0.61  % Total time : 0.016000 s
%------------------------------------------------------------------------------