%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LAT388+1 : 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 : n010.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 06:02:24 EDT 2023

% Result   : Theorem 0.19s 0.59s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   44 (   6 unt;  37 typ;   0 def)
%            Number of atoms       :    8 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    4 (   3   ~;   0   |;   1   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   58 (  31   >;  27   *;   0   +;   0  <<)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-3 aty)
%            Number of functors    :   22 (  22 usr;   6 con; 0-3 aty)
%            Number of variables   :    4 (   1 sgn;   1   !;   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,
    isEmpty0: $i > $o ).

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

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

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

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

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

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

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

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

tff(decl_34,type,
    szDzozmdt0: $i > $i ).

tff(decl_35,type,
    szRzazndt0: $i > $i ).

tff(decl_36,type,
    isOn0: ( $i * $i ) > $o ).

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

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

tff(decl_39,type,
    isMonotone0: $i > $o ).

tff(decl_40,type,
    xU: $i ).

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

tff(decl_42,type,
    xS: $i ).

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

tff(decl_44,type,
    xT: $i ).

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

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

tff(decl_47,type,
    xp: $i ).

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

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

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

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

tff(decl_52,type,
    esk5_3: ( $i * $i * $i ) > $i ).

tff(decl_53,type,
    esk6_3: ( $i * $i * $i ) > $i ).

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

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

tff(decl_56,type,
    esk9_1: $i > $i ).

tff(decl_57,type,
    esk10_1: $i > $i ).

tff(decl_58,type,
    esk11_1: $i > $i ).

fof(m__,conjecture,
    ? [X1] : aSupremumOfIn0(X1,xT,xS),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__1330,hypothesis,
    ( aFixedPointOf0(xp,xf)
    & aSupremumOfIn0(xp,xT,xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1] : aSupremumOfIn0(X1,xT,xS),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_3,negated_conjecture,
    ! [X74] : ~ aSupremumOfIn0(X74,xT,xS),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

cnf(c_0_4,hypothesis,
    aSupremumOfIn0(xp,xT,xS),
    inference(split_conjunct,[status(thm)],[m__1330]) ).

cnf(c_0_5,negated_conjecture,
    ~ aSupremumOfIn0(X1,xT,xS),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n010.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   : Thu Aug 24 04:37:35 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.19/0.59  % Version  : CSE_E---1.5
% 0.19/0.59  % Problem  : theBenchmark.p
% 0.19/0.59  % Proof found
% 0.19/0.59  % SZS status Theorem for theBenchmark.p
% 0.19/0.59  % SZS output start Proof
% See solution above
% 0.19/0.59  % Total time : 0.006000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.010000 s
%------------------------------------------------------------------------------