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