TSTP Solution File: COM021+4 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COM021+4 : 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 : n009.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 : Wed Aug 30 18:36:21 EDT 2023

% Result   : Theorem 0.54s 0.61s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   50
% Syntax   : Number of formulae    :   61 (   5 unt;  47 typ;   0 def)
%            Number of atoms       :   96 (  22 equ)
%            Maximal formula atoms :   25 (   6 avg)
%            Number of connectives :   95 (  13   ~;  40   |;  42   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   61 (  29   >;  32   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   37 (  37 usr;  18 con; 0-4 aty)
%            Number of variables   :    9 (   1 sgn;   2   !;   6   ?;   0   :)

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

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

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

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

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

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

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

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

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

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

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

tff(decl_33,type,
    xa: $i ).

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

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

tff(decl_36,type,
    xu: $i ).

tff(decl_37,type,
    xv: $i ).

tff(decl_38,type,
    xw: $i ).

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

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

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

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

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

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

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

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

tff(decl_47,type,
    esk7_1: $i > $i ).

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

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

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

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

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

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

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

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

tff(decl_56,type,
    esk16_3: ( $i * $i * $i ) > $i ).

tff(decl_57,type,
    esk17_3: ( $i * $i * $i ) > $i ).

tff(decl_58,type,
    esk18_3: ( $i * $i * $i ) > $i ).

tff(decl_59,type,
    esk19_3: ( $i * $i * $i ) > $i ).

tff(decl_60,type,
    esk20_0: $i ).

tff(decl_61,type,
    esk21_0: $i ).

tff(decl_62,type,
    esk22_0: $i ).

tff(decl_63,type,
    esk23_0: $i ).

tff(decl_64,type,
    esk24_0: $i ).

tff(decl_65,type,
    esk25_0: $i ).

tff(decl_66,type,
    esk26_0: $i ).

tff(decl_67,type,
    esk27_0: $i ).

tff(decl_68,type,
    esk28_0: $i ).

fof(m__850,hypothesis,
    ( aElement0(xx)
    & ( xb = xx
      | ( ( aReductOfIn0(xx,xb,xR)
          | ? [X1] :
              ( aElement0(X1)
              & aReductOfIn0(X1,xb,xR)
              & sdtmndtplgtdt0(X1,xR,xx) ) )
        & sdtmndtplgtdt0(xb,xR,xx) ) )
    & sdtmndtasgtdt0(xb,xR,xx)
    & ( xd = xx
      | ( ( aReductOfIn0(xx,xd,xR)
          | ? [X1] :
              ( aElement0(X1)
              & aReductOfIn0(X1,xd,xR)
              & sdtmndtplgtdt0(X1,xR,xx) ) )
        & sdtmndtplgtdt0(xd,xR,xx) ) )
    & sdtmndtasgtdt0(xd,xR,xx) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__850) ).

fof(m__818,hypothesis,
    ( aElement0(xd)
    & ( xw = xd
      | ( ( aReductOfIn0(xd,xw,xR)
          | ? [X1] :
              ( aElement0(X1)
              & aReductOfIn0(X1,xw,xR)
              & sdtmndtplgtdt0(X1,xR,xd) ) )
        & sdtmndtplgtdt0(xw,xR,xd) ) )
    & sdtmndtasgtdt0(xw,xR,xd)
    & ~ ? [X1] : aReductOfIn0(X1,xd,xR)
    & aNormalFormOfIn0(xd,xw,xR) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__818) ).

fof(m__,conjecture,
    ( xb = xd
    | aReductOfIn0(xd,xb,xR)
    | ? [X1] :
        ( aElement0(X1)
        & aReductOfIn0(X1,xb,xR)
        & sdtmndtplgtdt0(X1,xR,xd) )
    | sdtmndtplgtdt0(xb,xR,xd)
    | sdtmndtasgtdt0(xb,xR,xd) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(c_0_3,hypothesis,
    ( aElement0(xx)
    & ( aElement0(esk27_0)
      | aReductOfIn0(xx,xb,xR)
      | xb = xx )
    & ( aReductOfIn0(esk27_0,xb,xR)
      | aReductOfIn0(xx,xb,xR)
      | xb = xx )
    & ( sdtmndtplgtdt0(esk27_0,xR,xx)
      | aReductOfIn0(xx,xb,xR)
      | xb = xx )
    & ( sdtmndtplgtdt0(xb,xR,xx)
      | xb = xx )
    & sdtmndtasgtdt0(xb,xR,xx)
    & ( aElement0(esk28_0)
      | aReductOfIn0(xx,xd,xR)
      | xd = xx )
    & ( aReductOfIn0(esk28_0,xd,xR)
      | aReductOfIn0(xx,xd,xR)
      | xd = xx )
    & ( sdtmndtplgtdt0(esk28_0,xR,xx)
      | aReductOfIn0(xx,xd,xR)
      | xd = xx )
    & ( sdtmndtplgtdt0(xd,xR,xx)
      | xd = xx )
    & sdtmndtasgtdt0(xd,xR,xx) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__850])])]) ).

fof(c_0_4,hypothesis,
    ! [X81] :
      ( aElement0(xd)
      & ( aElement0(esk26_0)
        | aReductOfIn0(xd,xw,xR)
        | xw = xd )
      & ( aReductOfIn0(esk26_0,xw,xR)
        | aReductOfIn0(xd,xw,xR)
        | xw = xd )
      & ( sdtmndtplgtdt0(esk26_0,xR,xd)
        | aReductOfIn0(xd,xw,xR)
        | xw = xd )
      & ( sdtmndtplgtdt0(xw,xR,xd)
        | xw = xd )
      & sdtmndtasgtdt0(xw,xR,xd)
      & ~ aReductOfIn0(X81,xd,xR)
      & aNormalFormOfIn0(xd,xw,xR) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__818])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ( xb = xd
      | aReductOfIn0(xd,xb,xR)
      | ? [X1] :
          ( aElement0(X1)
          & aReductOfIn0(X1,xb,xR)
          & sdtmndtplgtdt0(X1,xR,xd) )
      | sdtmndtplgtdt0(xb,xR,xd)
      | sdtmndtasgtdt0(xb,xR,xd) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_6,hypothesis,
    ( aReductOfIn0(esk28_0,xd,xR)
    | aReductOfIn0(xx,xd,xR)
    | xd = xx ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,hypothesis,
    ~ aReductOfIn0(X1,xd,xR),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ! [X84] :
      ( xb != xd
      & ~ aReductOfIn0(xd,xb,xR)
      & ( ~ aElement0(X84)
        | ~ aReductOfIn0(X84,xb,xR)
        | ~ sdtmndtplgtdt0(X84,xR,xd) )
      & ~ sdtmndtplgtdt0(xb,xR,xd)
      & ~ sdtmndtasgtdt0(xb,xR,xd) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,hypothesis,
    ( sdtmndtplgtdt0(xb,xR,xx)
    | xb = xx ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_10,hypothesis,
    xx = xd,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    xb != xd,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ sdtmndtplgtdt0(xb,xR,xd),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_11]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : COM021+4 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n009.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   : Tue Aug 29 12:40:50 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.50/0.58  start to proof: theBenchmark
% 0.54/0.61  % Version  : CSE_E---1.5
% 0.54/0.61  % Problem  : theBenchmark.p
% 0.54/0.61  % Proof found
% 0.54/0.61  % SZS status Theorem for theBenchmark.p
% 0.54/0.61  % SZS output start Proof
% See solution above
% 0.54/0.61  % Total time : 0.026000 s
% 0.54/0.61  % SZS output end Proof
% 0.54/0.61  % Total time : 0.030000 s
%------------------------------------------------------------------------------