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