%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET591+3 : TPTP v8.2.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n028.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 14:21:52 EDT 2024 % Result : Theorem 0.52s 0.61s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET591+3 : TPTP v8.2.0. Released v2.2.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n028.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 Jun 23 14:32:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.52/0.61 %------------------------------------------- % 0.52/0.61 % File :CSE---1.7 % 0.52/0.61 % Problem :theBenchmark % 0.52/0.61 % Transform :cnf % 0.52/0.61 % Format :tptp:raw % 0.52/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.61 % 0.52/0.61 % Result :Theorem 0.020000s % 0.52/0.61 % Output :CNFRefutation 0.020000s % 0.52/0.61 %------------------------------------------- % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 % File : SET591+3 : TPTP v8.2.0. Released v2.2.0. % 0.52/0.61 % Domain : Set Theory % 0.52/0.61 % Problem : If X (= Y \ X, then X = the empty set % 0.52/0.61 % Version : [Try90] axioms : Reduced > Incomplete. % 0.52/0.61 % English : If X is a subset of the difference of Y and X, then X is the % 0.52/0.61 % empty set. % 0.52/0.61 % 0.52/0.61 % Refs : [ILF] The ILF Group (1998), The ILF System: A Tool for the Int % 0.52/0.61 % : [Try90] Trybulec (1990), Tarski Grothendieck Set Theory % 0.52/0.61 % : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of % 0.52/0.61 % Source : [ILF] % 0.52/0.61 % Names : BOOLE (50) [TS89] % 0.52/0.61 % 0.52/0.61 % Status : Theorem % 0.52/0.61 % Rating : 0.08 v8.1.0, 0.06 v7.4.0, 0.07 v7.2.0, 0.03 v7.1.0, 0.04 v7.0.0, 0.07 v6.4.0, 0.08 v6.3.0, 0.12 v6.2.0, 0.08 v6.1.0, 0.07 v6.0.0, 0.13 v5.5.0, 0.07 v5.4.0, 0.04 v5.3.0, 0.11 v5.2.0, 0.00 v5.0.0, 0.04 v4.1.0, 0.09 v4.0.0, 0.08 v3.7.0, 0.05 v3.3.0, 0.00 v3.2.0, 0.09 v3.1.0, 0.00 v2.5.0, 0.12 v2.4.0, 0.25 v2.3.0, 0.33 v2.2.1 % 0.52/0.61 % Syntax : Number of formulae : 7 ( 2 unt; 0 def) % 0.52/0.61 % Number of atoms : 15 ( 2 equ) % 0.52/0.61 % Maximal formula atoms : 3 ( 2 avg) % 0.52/0.61 % Number of connectives : 11 ( 3 ~; 0 |; 2 &) % 0.52/0.61 % ( 4 <=>; 2 =>; 0 <=; 0 <~>) % 0.52/0.61 % Maximal formula depth : 7 ( 5 avg) % 0.52/0.61 % Maximal term depth : 2 ( 1 avg) % 0.52/0.61 % Number of predicates : 4 ( 3 usr; 0 prp; 1-2 aty) % 0.52/0.61 % Number of functors : 2 ( 2 usr; 1 con; 0-2 aty) % 0.52/0.61 % Number of variables : 14 ( 14 !; 0 ?) % 0.52/0.61 % SPC : FOF_THM_RFO_SEQ % 0.52/0.61 % 0.52/0.61 % Comments : % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 %---- line(tarski - df(3),1832749) % 0.52/0.61 fof(subset_defn,axiom, % 0.52/0.61 ! [B,C] : % 0.52/0.61 ( subset(B,C) % 0.52/0.61 <=> ! [D] : % 0.52/0.61 ( member(D,B) % 0.52/0.61 => member(D,C) ) ) ). % 0.52/0.61 % 0.52/0.61 %---- line(boole - df(4),1833078) % 0.52/0.61 fof(difference_defn,axiom, % 0.52/0.61 ! [B,C,D] : % 0.52/0.61 ( member(D,difference(B,C)) % 0.52/0.61 <=> ( member(D,B) % 0.52/0.61 & ~ member(D,C) ) ) ). % 0.52/0.61 % 0.52/0.61 %---- line(hidden - axiom66,1832636) % 0.52/0.61 fof(empty_set_defn,axiom, % 0.52/0.61 ! [B] : ~ member(B,empty_set) ). % 0.52/0.61 % 0.52/0.61 %---- line(boole - df(8),1833103) % 0.52/0.61 fof(equal_defn,axiom, % 0.52/0.61 ! [B,C] : % 0.52/0.61 ( B = C % 0.52/0.61 <=> ( subset(B,C) % 0.52/0.61 & subset(C,B) ) ) ). % 0.52/0.61 % 0.52/0.61 %---- property(reflexivity,op(subset,2,predicate)) % 0.52/0.61 fof(reflexivity_of_subset,axiom, % 0.52/0.61 ! [B] : subset(B,B) ). % 0.52/0.61 % 0.52/0.61 %---- line(hidden - axiom68,1832628) % 0.52/0.61 fof(empty_defn,axiom, % 0.52/0.61 ! [B] : % 0.52/0.61 ( empty(B) % 0.52/0.61 <=> ! [C] : ~ member(C,B) ) ). % 0.52/0.61 % 0.52/0.61 %---- line(boole - th(50),1833476) % 0.52/0.61 fof(prove_th50,conjecture, % 0.52/0.61 ! [B,C] : % 0.52/0.61 ( subset(B,difference(C,B)) % 0.52/0.61 => B = empty_set ) ). % 0.52/0.61 % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 %------------------------------------------- % 0.52/0.61 % Proof found % 0.52/0.61 % SZS status Theorem for theBenchmark % 0.52/0.61 % SZS output start Proof % 0.52/0.61 %ClaNum:28(EqnAxiom:13) % 0.52/0.61 %VarNum:52(SingletonVarNum:25) % 0.52/0.61 %MaxLitNum:3 % 0.52/0.61 %MaxfuncDepth:1 % 0.52/0.61 %SharedTerms:6 % 0.52/0.61 %goalClause: 15 16 % 0.52/0.61 %singleGoalClaCount:2 % 0.52/0.61 [16]~E(a3,a1) % 0.52/0.61 [15]P1(a1,f2(a6,a1)) % 0.52/0.61 [14]P1(x141,x141) % 0.52/0.61 [17]~P2(x171,a3) % 0.52/0.61 [20]P3(x201)+P2(f4(x201),x201) % 0.52/0.61 [19]~E(x191,x192)+P1(x191,x192) % 0.52/0.61 [21]~P3(x211)+~P2(x212,x211) % 0.52/0.61 [23]P1(x231,x232)+P2(f5(x231,x232),x231) % 0.52/0.61 [27]P1(x271,x272)+~P2(f5(x271,x272),x272) % 0.52/0.61 [26]P2(x261,x262)+~P2(x261,f2(x262,x263)) % 0.52/0.61 [28]~P2(x281,x282)+~P2(x281,f2(x283,x282)) % 0.52/0.61 [22]~P1(x222,x221)+~P1(x221,x222)+E(x221,x222) % 0.52/0.61 [24]~P2(x241,x243)+P2(x241,x242)+~P1(x243,x242) % 0.52/0.61 [25]~P2(x251,x253)+P2(x251,x252)+P2(x251,f2(x253,x252)) % 0.52/0.61 %EqnAxiom % 0.52/0.61 [1]E(x11,x11) % 0.52/0.61 [2]E(x22,x21)+~E(x21,x22) % 0.52/0.61 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.52/0.61 [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43)) % 0.52/0.61 [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52)) % 0.52/0.61 [6]~E(x61,x62)+E(f4(x61),f4(x62)) % 0.52/0.61 [7]~E(x71,x72)+E(f5(x71,x73),f5(x72,x73)) % 0.52/0.61 [8]~E(x81,x82)+E(f5(x83,x81),f5(x83,x82)) % 0.52/0.61 [9]P1(x92,x93)+~E(x91,x92)+~P1(x91,x93) % 0.52/0.61 [10]P1(x103,x102)+~E(x101,x102)+~P1(x103,x101) % 0.52/0.61 [11]P2(x112,x113)+~E(x111,x112)+~P2(x111,x113) % 0.52/0.61 [12]P2(x123,x122)+~E(x121,x122)+~P2(x123,x121) % 0.52/0.61 [13]~P3(x131)+P3(x132)+~E(x131,x132) % 0.52/0.61 % 0.52/0.61 %------------------------------------------- % 0.52/0.62 cnf(31,plain, % 0.52/0.62 (~P2(x311,a3)), % 0.52/0.62 inference(rename_variables,[],[17])). % 0.52/0.62 cnf(36,plain, % 0.52/0.62 (~P1(a1,a3)), % 0.52/0.62 inference(scs_inference,[],[16,17,31,20,23,22])). % 0.52/0.62 cnf(60,plain, % 0.52/0.62 (~P2(f5(a1,a3),f2(x601,a1))), % 0.52/0.62 inference(scs_inference,[],[36,28,23])). % 0.52/0.62 cnf(64,plain, % 0.52/0.62 ($false), % 0.52/0.62 inference(scs_inference,[],[15,36,60,24,23]), % 0.52/0.62 ['proof']). % 0.52/0.62 % SZS output end Proof % 0.52/0.62 % Total time :0.020000s %------------------------------------------------------------------------------