TSTP Solution File: NUM533+2 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : NUM533+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 %s %d

% Computer : n006.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 10:22:54 EDT 2023

% Result   : Theorem 0.23s 0.69s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : NUM533+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.15/0.36  % Computer : n006.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri Aug 25 11:13:07 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.23/0.63  start to proof:theBenchmark
% 0.23/0.68  %-------------------------------------------
% 0.23/0.68  % File        :CSE---1.6
% 0.23/0.68  % Problem     :theBenchmark
% 0.23/0.68  % Transform   :cnf
% 0.23/0.68  % Format      :tptp:raw
% 0.23/0.68  % Command     :java -jar mcs_scs.jar %d %s
% 0.23/0.68  
% 0.23/0.68  % Result      :Theorem 0.000000s
% 0.23/0.68  % Output      :CNFRefutation 0.000000s
% 0.23/0.68  %-------------------------------------------
% 0.23/0.69  %------------------------------------------------------------------------------
% 0.23/0.69  % File     : NUM533+2 : TPTP v8.1.2. Released v4.0.0.
% 0.23/0.69  % Domain   : Number Theory
% 0.23/0.69  % Problem  : Ramsey's Infinite Theorem 03, 01 expansion
% 0.23/0.69  % Version  : Especial.
% 0.23/0.69  % English  :
% 0.23/0.69  
% 0.23/0.69  % Refs     : [VLP07] Verchinine et al. (2007), System for Automated Deduction
% 0.23/0.69  %          : [Pas08] Paskevich (2008), Email to G. Sutcliffe
% 0.23/0.69  % Source   : [Pas08]
% 0.23/0.69  % Names    : ramsey_03.01 [Pas08]
% 0.23/0.69  
% 0.23/0.69  % Status   : Theorem
% 0.23/0.69  % Rating   : 0.06 v8.1.0, 0.03 v7.1.0, 0.04 v7.0.0, 0.03 v6.4.0, 0.04 v6.1.0, 0.07 v6.0.0, 0.04 v5.5.0, 0.07 v5.4.0, 0.11 v5.3.0, 0.15 v5.2.0, 0.10 v5.1.0, 0.24 v5.0.0, 0.25 v4.1.0, 0.30 v4.0.1, 0.65 v4.0.0
% 0.23/0.69  % Syntax   : Number of formulae    :   15 (   1 unt;   2 def)
% 0.23/0.69  %            Number of atoms       :   51 (   3 equ)
% 0.23/0.69  %            Maximal formula atoms :    9 (   3 avg)
% 0.23/0.69  %            Number of connectives :   39 (   3   ~;   1   |;  12   &)
% 0.23/0.69  %                                         (   2 <=>;  21  =>;   0  <=;   0 <~>)
% 0.23/0.69  %            Maximal formula depth :    8 (   4 avg)
% 0.23/0.69  %            Maximal term depth    :    1 (   1 avg)
% 0.23/0.69  %            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
% 0.23/0.69  %            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
% 0.23/0.69  %            Number of variables   :   21 (  20   !;   1   ?)
% 0.23/0.69  % SPC      : FOF_THM_RFO_SEQ
% 0.23/0.69  
% 0.23/0.69  % Comments : Problem generated by the SAD system [VLP07]
% 0.23/0.69  %------------------------------------------------------------------------------
% 0.23/0.69  fof(mSetSort,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aSet0(W0)
% 0.23/0.69       => $true ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mElmSort,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aElement0(W0)
% 0.23/0.69       => $true ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mEOfElem,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aSet0(W0)
% 0.23/0.69       => ! [W1] :
% 0.23/0.69            ( aElementOf0(W1,W0)
% 0.23/0.69           => aElement0(W1) ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mFinRel,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aSet0(W0)
% 0.23/0.69       => ( isFinite0(W0)
% 0.23/0.69         => $true ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mDefEmp,definition,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( W0 = slcrc0
% 0.23/0.69      <=> ( aSet0(W0)
% 0.23/0.69          & ~ ? [W1] : aElementOf0(W1,W0) ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mEmpFin,axiom,
% 0.23/0.69      isFinite0(slcrc0) ).
% 0.23/0.69  
% 0.23/0.69  fof(mCntRel,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aSet0(W0)
% 0.23/0.69       => ( isCountable0(W0)
% 0.23/0.69         => $true ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mCountNFin,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( ( aSet0(W0)
% 0.23/0.69          & isCountable0(W0) )
% 0.23/0.69       => ~ isFinite0(W0) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mCountNFin_01,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( ( aSet0(W0)
% 0.23/0.69          & isCountable0(W0) )
% 0.23/0.69       => W0 != slcrc0 ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mDefSub,definition,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aSet0(W0)
% 0.23/0.69       => ! [W1] :
% 0.23/0.69            ( aSubsetOf0(W1,W0)
% 0.23/0.69          <=> ( aSet0(W1)
% 0.23/0.69              & ! [W2] :
% 0.23/0.69                  ( aElementOf0(W2,W1)
% 0.23/0.69                 => aElementOf0(W2,W0) ) ) ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mSubFSet,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( ( aSet0(W0)
% 0.23/0.69          & isFinite0(W0) )
% 0.23/0.69       => ! [W1] :
% 0.23/0.69            ( aSubsetOf0(W1,W0)
% 0.23/0.69           => isFinite0(W1) ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mSubRefl,axiom,
% 0.23/0.69      ! [W0] :
% 0.23/0.69        ( aSet0(W0)
% 0.23/0.69       => aSubsetOf0(W0,W0) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(mSubASymm,axiom,
% 0.23/0.69      ! [W0,W1] :
% 0.23/0.69        ( ( aSet0(W0)
% 0.23/0.69          & aSet0(W1) )
% 0.23/0.69       => ( ( aSubsetOf0(W0,W1)
% 0.23/0.69            & aSubsetOf0(W1,W0) )
% 0.23/0.69         => W0 = W1 ) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(m__522,hypothesis,
% 0.23/0.69      ( aSet0(xA)
% 0.23/0.69      & aSet0(xB)
% 0.23/0.69      & aSet0(xC) ) ).
% 0.23/0.69  
% 0.23/0.69  fof(m__,conjecture,
% 0.23/0.69      ( ( ! [W0] :
% 0.23/0.69            ( aElementOf0(W0,xA)
% 0.23/0.69           => aElementOf0(W0,xB) )
% 0.23/0.69        & aSubsetOf0(xA,xB)
% 0.23/0.69        & ! [W0] :
% 0.23/0.69            ( aElementOf0(W0,xB)
% 0.23/0.69           => aElementOf0(W0,xC) )
% 0.23/0.69        & aSubsetOf0(xB,xC) )
% 0.23/0.69     => ( ! [W0] :
% 0.23/0.69            ( aElementOf0(W0,xA)
% 0.23/0.69           => aElementOf0(W0,xC) )
% 0.23/0.69        | aSubsetOf0(xA,xC) ) ) ).
% 0.23/0.69  
% 0.23/0.69  %------------------------------------------------------------------------------
% 0.23/0.69  %-------------------------------------------
% 0.23/0.69  % Proof found
% 0.23/0.69  % SZS status Theorem for theBenchmark
% 0.23/0.69  % SZS output start Proof
% 0.23/0.69  %ClaNum:38(EqnAxiom:14)
% 0.23/0.69  %VarNum:64(SingletonVarNum:24)
% 0.23/0.69  %MaxLitNum:5
% 0.23/0.69  %MaxfuncDepth:1
% 0.23/0.69  %SharedTerms:14
% 0.23/0.69  %goalClause: 19 20 21 22 23 30 31
% 0.23/0.69  %singleGoalClaCount:5
% 0.23/0.69  [15]P1(a1)
% 0.23/0.69  [16]P1(a6)
% 0.23/0.69  [17]P1(a7)
% 0.23/0.69  [18]P4(a2)
% 0.23/0.69  [19]P2(a3,a1)
% 0.23/0.69  [20]P5(a1,a6)
% 0.23/0.69  [21]P5(a6,a7)
% 0.23/0.69  [22]~P2(a3,a7)
% 0.23/0.69  [23]~P5(a1,a7)
% 0.23/0.69  [24]P1(x241)+~E(x241,a2)
% 0.23/0.69  [27]~P1(x271)+P5(x271,x271)
% 0.23/0.69  [30]~P2(x301,a1)+P2(x301,a6)
% 0.23/0.69  [31]~P2(x311,a6)+P2(x311,a7)
% 0.23/0.69  [28]~P2(x282,x281)+~E(x281,a2)
% 0.23/0.69  [25]~P1(x251)+~P6(x251)+~E(x251,a2)
% 0.23/0.69  [26]~P4(x261)+~P6(x261)+~P1(x261)
% 0.23/0.69  [29]~P1(x291)+P2(f4(x291),x291)+E(x291,a2)
% 0.23/0.69  [32]~P5(x321,x322)+P1(x321)+~P1(x322)
% 0.23/0.69  [33]~P2(x331,x332)+P3(x331)+~P1(x332)
% 0.23/0.69  [34]~P4(x342)+~P5(x341,x342)+P4(x341)+~P1(x342)
% 0.23/0.69  [37]~P1(x371)+~P1(x372)+P5(x371,x372)+P2(f5(x372,x371),x371)
% 0.23/0.69  [38]~P1(x381)+~P1(x382)+P5(x381,x382)+~P2(f5(x382,x381),x382)
% 0.23/0.69  [36]~P1(x362)+~P5(x363,x362)+P2(x361,x362)+~P2(x361,x363)
% 0.23/0.69  [35]~P1(x352)+~P1(x351)+~P5(x352,x351)+~P5(x351,x352)+E(x351,x352)
% 0.23/0.69  %EqnAxiom
% 0.23/0.69  [1]E(x11,x11)
% 0.23/0.69  [2]E(x22,x21)+~E(x21,x22)
% 0.23/0.69  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.23/0.69  [4]~E(x41,x42)+E(f4(x41),f4(x42))
% 0.23/0.69  [5]~E(x51,x52)+E(f5(x51,x53),f5(x52,x53))
% 0.23/0.69  [6]~E(x61,x62)+E(f5(x63,x61),f5(x63,x62))
% 0.23/0.69  [7]~P1(x71)+P1(x72)+~E(x71,x72)
% 0.23/0.69  [8]P2(x82,x83)+~E(x81,x82)+~P2(x81,x83)
% 0.23/0.69  [9]P2(x93,x92)+~E(x91,x92)+~P2(x93,x91)
% 0.23/0.69  [10]P5(x102,x103)+~E(x101,x102)+~P5(x101,x103)
% 0.23/0.69  [11]P5(x113,x112)+~E(x111,x112)+~P5(x113,x111)
% 0.23/0.69  [12]~P4(x121)+P4(x122)+~E(x121,x122)
% 0.23/0.69  [13]~P6(x131)+P6(x132)+~E(x131,x132)
% 0.23/0.69  [14]~P3(x141)+P3(x142)+~E(x141,x142)
% 0.23/0.69  
% 0.23/0.69  %-------------------------------------------
% 0.23/0.69  cnf(40,plain,
% 0.23/0.69     ($false),
% 0.23/0.69     inference(scs_inference,[],[19,22,31,30]),
% 0.23/0.69     ['proof']).
% 0.23/0.69  % SZS output end Proof
% 0.23/0.69  % Total time :0.000000s
%------------------------------------------------------------------------------