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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n004.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.17s 0.64s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.35  % Computer : n004.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Fri Aug 25 14:42:08 EDT 2023
% 0.12/0.35  % CPUTime    : 
% 0.17/0.61  start to proof:theBenchmark
% 0.17/0.64  %-------------------------------------------
% 0.17/0.64  % File        :CSE---1.6
% 0.17/0.64  % Problem     :theBenchmark
% 0.17/0.64  % Transform   :cnf
% 0.17/0.64  % Format      :tptp:raw
% 0.17/0.64  % Command     :java -jar mcs_scs.jar %d %s
% 0.17/0.64  
% 0.17/0.64  % Result      :Theorem 0.000000s
% 0.17/0.64  % Output      :CNFRefutation 0.000000s
% 0.17/0.64  %-------------------------------------------
% 0.17/0.64  %------------------------------------------------------------------------------
% 0.17/0.64  % File     : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% 0.17/0.64  % Domain   : Number Theory
% 0.17/0.64  % Problem  : Ramsey's Infinite Theorem 01, 01 expansion
% 0.17/0.64  % Version  : Especial.
% 0.17/0.64  % English  :
% 0.17/0.64  
% 0.17/0.64  % Refs     : [VLP07] Verchinine et al. (2007), System for Automated Deduction
% 0.17/0.64  %          : [Pas08] Paskevich (2008), Email to G. Sutcliffe
% 0.17/0.64  % Source   : [Pas08]
% 0.17/0.64  % Names    : ramsey_01.01 [Pas08]
% 0.17/0.64  
% 0.17/0.64  % Status   : Theorem
% 0.17/0.64  % Rating   : 0.03 v7.1.0, 0.04 v7.0.0, 0.03 v6.4.0, 0.04 v6.3.0, 0.00 v6.2.0, 0.04 v6.1.0, 0.10 v6.0.0, 0.09 v5.5.0, 0.04 v5.4.0, 0.11 v5.3.0, 0.15 v5.2.0, 0.05 v5.1.0, 0.10 v5.0.0, 0.17 v4.1.0, 0.22 v4.0.1, 0.61 v4.0.0
% 0.17/0.64  % Syntax   : Number of formulae    :    9 (   1 unt;   1 def)
% 0.17/0.64  %            Number of atoms       :   24 (   2 equ)
% 0.17/0.64  %            Maximal formula atoms :    4 (   2 avg)
% 0.17/0.64  %            Number of connectives :   19 (   4   ~;   0   |;   4   &)
% 0.17/0.64  %                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
% 0.17/0.64  %            Maximal formula depth :    7 (   4 avg)
% 0.17/0.64  %            Maximal term depth    :    1 (   1 avg)
% 0.17/0.64  %            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
% 0.17/0.64  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.17/0.64  %            Number of variables   :   11 (   9   !;   2   ?)
% 0.17/0.64  % SPC      : FOF_THM_RFO_SEQ
% 0.17/0.64  
% 0.17/0.64  % Comments : Problem generated by the SAD system [VLP07]
% 0.17/0.64  %------------------------------------------------------------------------------
% 0.17/0.64  fof(mSetSort,axiom,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( aSet0(W0)
% 0.17/0.64       => $true ) ).
% 0.17/0.64  
% 0.17/0.64  fof(mElmSort,axiom,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( aElement0(W0)
% 0.17/0.64       => $true ) ).
% 0.17/0.64  
% 0.17/0.64  fof(mEOfElem,axiom,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( aSet0(W0)
% 0.17/0.64       => ! [W1] :
% 0.17/0.64            ( aElementOf0(W1,W0)
% 0.17/0.64           => aElement0(W1) ) ) ).
% 0.17/0.64  
% 0.17/0.64  fof(mFinRel,axiom,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( aSet0(W0)
% 0.17/0.64       => ( isFinite0(W0)
% 0.17/0.64         => $true ) ) ).
% 0.17/0.64  
% 0.17/0.64  fof(mDefEmp,definition,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( W0 = slcrc0
% 0.17/0.64      <=> ( aSet0(W0)
% 0.17/0.64          & ~ ? [W1] : aElementOf0(W1,W0) ) ) ).
% 0.17/0.64  
% 0.17/0.64  fof(mEmpFin,axiom,
% 0.17/0.64      isFinite0(slcrc0) ).
% 0.17/0.64  
% 0.17/0.64  fof(mCntRel,axiom,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( aSet0(W0)
% 0.17/0.64       => ( isCountable0(W0)
% 0.17/0.64         => $true ) ) ).
% 0.17/0.64  
% 0.17/0.64  fof(mCountNFin,axiom,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( ( aSet0(W0)
% 0.17/0.64          & isCountable0(W0) )
% 0.17/0.64       => ~ isFinite0(W0) ) ).
% 0.17/0.64  
% 0.17/0.64  fof(m__,conjecture,
% 0.17/0.64      ! [W0] :
% 0.17/0.64        ( ( aSet0(W0)
% 0.17/0.64          & isCountable0(W0) )
% 0.17/0.64       => ~ ( ~ ? [W1] : aElementOf0(W1,W0)
% 0.17/0.64            & W0 = slcrc0 ) ) ).
% 0.17/0.64  
% 0.17/0.64  %------------------------------------------------------------------------------
% 0.17/0.64  %-------------------------------------------
% 0.17/0.64  % Proof found
% 0.17/0.64  % SZS status Theorem for theBenchmark
% 0.17/0.64  % SZS output start Proof
% 0.17/0.66  %ClaNum:20(EqnAxiom:10)
% 0.17/0.66  %VarNum:17(SingletonVarNum:8)
% 0.17/0.66  %MaxLitNum:3
% 0.17/0.66  %MaxfuncDepth:1
% 0.17/0.66  %SharedTerms:6
% 0.17/0.66  %goalClause: 11 12 14 15
% 0.17/0.66  %singleGoalClaCount:4
% 0.17/0.66  [11]E(a1,a3)
% 0.17/0.66  [12]P1(a1)
% 0.17/0.66  [13]P4(a3)
% 0.17/0.66  [14]P5(a1)
% 0.17/0.66  [15]~P2(x151,a1)
% 0.17/0.66  [16]P1(x161)+~E(x161,a3)
% 0.17/0.66  [18]~P2(x182,x181)+~E(x181,a3)
% 0.17/0.66  [17]~P4(x171)+~P5(x171)+~P1(x171)
% 0.17/0.66  [19]~P1(x191)+P2(f2(x191),x191)+E(x191,a3)
% 0.17/0.66  [20]~P2(x201,x202)+P3(x201)+~P1(x202)
% 0.17/0.66  %EqnAxiom
% 0.17/0.66  [1]E(x11,x11)
% 0.17/0.66  [2]E(x22,x21)+~E(x21,x22)
% 0.17/0.66  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.17/0.66  [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 0.17/0.66  [5]~P1(x51)+P1(x52)+~E(x51,x52)
% 0.17/0.66  [6]~P4(x61)+P4(x62)+~E(x61,x62)
% 0.17/0.66  [7]~P5(x71)+P5(x72)+~E(x71,x72)
% 0.17/0.66  [8]P2(x82,x83)+~E(x81,x82)+~P2(x81,x83)
% 0.17/0.66  [9]P2(x93,x92)+~E(x91,x92)+~P2(x93,x91)
% 0.17/0.66  [10]~P3(x101)+P3(x102)+~E(x101,x102)
% 0.17/0.66  
% 0.17/0.66  %-------------------------------------------
% 0.17/0.67  cnf(25,plain,
% 0.17/0.67     ($false),
% 0.17/0.67     inference(scs_inference,[],[11,12,14,13,2,7,6,5,17]),
% 0.17/0.67     ['proof']).
% 0.17/0.67  % SZS output end Proof
% 0.17/0.67  % Total time :0.000000s
%------------------------------------------------------------------------------