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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : COM018+1 : 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 : n007.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:19 EDT 2023

% Result   : Theorem 0.18s 0.55s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   36
% Syntax   : Number of formulae    :   45 (   9 unt;  31 typ;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   21 (   9   ~;   6   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   46 (  24   >;  22   *;   0   +;   0  <<)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   21 (  21 usr;   7 con; 0-4 aty)
%            Number of variables   :   11 (   1 sgn;   5   !;   3   ?;   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,
    esk1_3: ( $i * $i * $i ) > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(m__,conjecture,
    ? [X1] : aNormalFormOfIn0(X1,xw,xR),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(mTermNF,axiom,
    ! [X1] :
      ( ( aRewritingSystem0(X1)
        & isTerminating0(X1) )
     => ! [X2] :
          ( aElement0(X2)
         => ? [X3] : aNormalFormOfIn0(X3,X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTermNF) ).

fof(m__656_01,hypothesis,
    ( isLocallyConfluent0(xR)
    & isTerminating0(xR) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656_01) ).

fof(m__656,hypothesis,
    aRewritingSystem0(xR),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__656) ).

fof(m__799,hypothesis,
    ( aElement0(xw)
    & sdtmndtasgtdt0(xu,xR,xw)
    & sdtmndtasgtdt0(xv,xR,xw) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__799) ).

fof(c_0_5,negated_conjecture,
    ~ ? [X1] : aNormalFormOfIn0(X1,xw,xR),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_6,negated_conjecture,
    ! [X61] : ~ aNormalFormOfIn0(X61,xw,xR),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_7,plain,
    ! [X54,X55] :
      ( ~ aRewritingSystem0(X54)
      | ~ isTerminating0(X54)
      | ~ aElement0(X55)
      | aNormalFormOfIn0(esk13_2(X54,X55),X55,X54) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTermNF])])])]) ).

cnf(c_0_8,negated_conjecture,
    ~ aNormalFormOfIn0(X1,xw,xR),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( aNormalFormOfIn0(esk13_2(X1,X2),X2,X1)
    | ~ aRewritingSystem0(X1)
    | ~ isTerminating0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,hypothesis,
    isTerminating0(xR),
    inference(split_conjunct,[status(thm)],[m__656_01]) ).

cnf(c_0_11,hypothesis,
    aRewritingSystem0(xR),
    inference(split_conjunct,[status(thm)],[m__656]) ).

cnf(c_0_12,hypothesis,
    aElement0(xw),
    inference(split_conjunct,[status(thm)],[m__799]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : COM018+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n007.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:51:28 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.18/0.53  start to proof: theBenchmark
% 0.18/0.55  % Version  : CSE_E---1.5
% 0.18/0.55  % Problem  : theBenchmark.p
% 0.18/0.55  % Proof found
% 0.18/0.55  % SZS status Theorem for theBenchmark.p
% 0.18/0.55  % SZS output start Proof
% See solution above
% 0.18/0.55  % Total time : 0.011000 s
% 0.18/0.55  % SZS output end Proof
% 0.18/0.55  % Total time : 0.013000 s
%------------------------------------------------------------------------------