TSTP Solution File: RNG095+2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : RNG095+2 : 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 : n021.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 13:49:06 EDT 2023

% Result   : Theorem 0.19s 0.59s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   32
% Syntax   : Number of formulae    :   44 (   5 unt;  29 typ;   0 def)
%            Number of atoms       :   38 (   7 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   40 (  17   ~;  12   |;  10   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   46 (  23   >;  23   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   24 (  24 usr;   6 con; 0-4 aty)
%            Number of variables   :   15 (   0 sgn;   4   !;   6   ?;   0   :)

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

tff(decl_23,type,
    sz00: $i ).

tff(decl_24,type,
    sz10: $i ).

tff(decl_25,type,
    smndt0: $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(decl_45,type,
    esk8_3: ( $i * $i * $i ) > $i ).

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

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

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

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

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

fof(m__,conjecture,
    ? [X1,X2] :
      ( aElementOf0(X1,xI)
      & aElementOf0(X2,xJ)
      & sdtpldt0(X1,X2) = sz10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(m__1205_03,hypothesis,
    ! [X1] :
      ( aElement0(X1)
     => ( ? [X2,X3] :
            ( aElementOf0(X2,xI)
            & aElementOf0(X3,xJ)
            & sdtpldt0(X2,X3) = X1 )
        & aElementOf0(X1,sdtpldt1(xI,xJ)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1205_03) ).

fof(mSortsC_01,axiom,
    aElement0(sz10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X1,X2] :
        ( aElementOf0(X1,xI)
        & aElementOf0(X2,xJ)
        & sdtpldt0(X1,X2) = sz10 ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_4,negated_conjecture,
    ! [X84,X85] :
      ( ~ aElementOf0(X84,xI)
      | ~ aElementOf0(X85,xJ)
      | sdtpldt0(X84,X85) != sz10 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

fof(c_0_5,hypothesis,
    ! [X81] :
      ( ( aElementOf0(esk12_1(X81),xI)
        | ~ aElement0(X81) )
      & ( aElementOf0(esk13_1(X81),xJ)
        | ~ aElement0(X81) )
      & ( sdtpldt0(esk12_1(X81),esk13_1(X81)) = X81
        | ~ aElement0(X81) )
      & ( aElementOf0(X81,sdtpldt1(xI,xJ))
        | ~ aElement0(X81) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1205_03])])])]) ).

cnf(c_0_6,negated_conjecture,
    ( ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xJ)
    | sdtpldt0(X1,X2) != sz10 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,hypothesis,
    ( sdtpldt0(esk12_1(X1),esk13_1(X1)) = X1
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    aElement0(sz10),
    inference(split_conjunct,[status(thm)],[mSortsC_01]) ).

cnf(c_0_9,hypothesis,
    ( aElementOf0(esk12_1(X1),xI)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ aElementOf0(esk13_1(sz10),xJ)
    | ~ aElementOf0(esk12_1(sz10),xI) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])]),c_0_8])]) ).

cnf(c_0_11,hypothesis,
    aElementOf0(esk12_1(sz10),xI),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_12,hypothesis,
    ( aElementOf0(esk13_1(X1),xJ)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    ~ aElementOf0(esk13_1(sz10),xJ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_14,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : RNG095+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sun Aug 27 02:08:42 EDT 2023
% 0.19/0.33  % CPUTime  : 
% 0.19/0.55  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.028000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.031000 s
%------------------------------------------------------------------------------