TSTP Solution File: ITP010+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : ITP010+1 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n003.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 03:10:23 EDT 2023

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

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

tff(decl_23,type,
    s: ( $i * $i ) > $i ).

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

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

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

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

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

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

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

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

tff(decl_32,type,
    c_2Ebool_2E_2F_5C_2E2: ( $i * $i ) > $i ).

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

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

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

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

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

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

tff(decl_39,type,
    c_2Ebool_2E_2F_5C_2E0: $i ).

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

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

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

tff(decl_43,type,
    c_2Emin_2E_3D_2E0: $i ).

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

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

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

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

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

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

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

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

fof(thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
    ! [X1,X2,X15,X16] :
      ( ~ p(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X16))))
    <=> ~ p(s(tyop_2Emin_2Ebool,c_2Ecardinal_2Ecardleq_2E2(s(tyop_2Emin_2Efun(X1,tyop_2Emin_2Ebool),X15),s(tyop_2Emin_2Efun(X2,tyop_2Emin_2Ebool),X16)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm_2Ecardinal_2ECARD__NOT__LE) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1,X2,X15,X16] : $true,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thm_2Ecardinal_2ECARD__NOT__LE])]) ).

fof(c_0_2,negated_conjecture,
    ~ $true,
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

cnf(c_0_3,negated_conjecture,
    $false,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : ITP010+1 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.14/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n003.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun Aug 27 16:27:10 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.60  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.60  % Total time : 0.011000 s
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time : 0.015000 s
%------------------------------------------------------------------------------