%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET958+1 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n025.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:23:06 EDT 2024 % Result : Theorem 13.25s 13.33s % Output : CNFRefutation 13.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SET958+1 : TPTP v8.2.0. Released v3.2.0. % 0.04/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n025.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 : Sun Jun 23 17:43:54 EDT 2024 % 0.13/0.34 % CPUTime : % 0.54/0.59 start to proof:theBenchmark % 13.25/13.33 %------------------------------------------- % 13.25/13.33 % File :CSE---1.7 % 13.25/13.33 % Problem :theBenchmark % 13.25/13.33 % Transform :cnf % 13.25/13.33 % Format :tptp:raw % 13.25/13.33 % Command :java -jar mcs_scs.jar %d %s % 13.25/13.33 % 13.25/13.33 % Result :Theorem 12.700000s % 13.25/13.33 % Output :CNFRefutation 12.700000s % 13.25/13.33 %------------------------------------------- % 13.25/13.33 %------------------------------------------------------------------------------ % 13.25/13.33 % File : SET958+1 : TPTP v8.2.0. Released v3.2.0. % 13.25/13.33 % Domain : Set theory % 13.25/13.33 % Problem : Basic properties of sets, theorem 111 % 13.25/13.33 % Version : [Urb06] axioms : Especial. % 13.25/13.33 % English : % 13.25/13.33 % 13.25/13.33 % Refs : [Byl90] Bylinski (1990), Some Basic Properties of Sets % 13.25/13.33 % : [Urb06] Urban (2006), Email to G. Sutcliffe % 13.25/13.33 % Source : [Urb06] % 13.25/13.33 % Names : zfmisc_1__t111_zfmisc_1 [Urb06] % 13.25/13.33 % 13.25/13.33 % Status : Theorem % 13.25/13.33 % Rating : 0.17 v8.1.0, 0.19 v7.5.0, 0.22 v7.4.0, 0.10 v7.3.0, 0.14 v7.2.0, 0.10 v7.1.0, 0.13 v6.4.0, 0.19 v6.3.0, 0.12 v6.2.0, 0.16 v6.1.0, 0.20 v6.0.0, 0.09 v5.5.0, 0.19 v5.4.0, 0.21 v5.3.0, 0.37 v5.2.0, 0.15 v5.1.0, 0.14 v5.0.0, 0.12 v4.1.0, 0.17 v3.7.0, 0.05 v3.5.0, 0.11 v3.4.0, 0.26 v3.3.0, 0.21 v3.2.0 % 13.25/13.33 % Syntax : Number of formulae : 9 ( 6 unt; 0 def) % 13.25/13.33 % Number of atoms : 16 ( 3 equ) % 13.25/13.33 % Maximal formula atoms : 5 ( 1 avg) % 13.25/13.33 % Number of connectives : 12 ( 5 ~; 0 |; 2 &) % 13.25/13.33 % ( 1 <=>; 4 =>; 0 <=; 0 <~>) % 13.25/13.33 % Maximal formula depth : 11 ( 4 avg) % 13.25/13.33 % Maximal term depth : 3 ( 1 avg) % 13.25/13.33 % Number of predicates : 4 ( 3 usr; 0 prp; 1-2 aty) % 13.25/13.33 % Number of functors : 3 ( 3 usr; 0 con; 1-2 aty) % 13.25/13.33 % Number of variables : 22 ( 20 !; 2 ?) % 13.25/13.33 % SPC : FOF_THM_RFO_SEQ % 13.25/13.33 % 13.25/13.33 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 13.25/13.33 % library, www.mizar.org % 13.25/13.33 %------------------------------------------------------------------------------ % 13.25/13.33 fof(antisymmetry_r2_hidden,axiom, % 13.25/13.33 ! [A,B] : % 13.25/13.33 ( in(A,B) % 13.25/13.33 => ~ in(B,A) ) ). % 13.25/13.33 % 13.25/13.33 fof(commutativity_k2_tarski,axiom, % 13.25/13.33 ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) ). % 13.25/13.33 % 13.25/13.33 fof(d3_tarski,axiom, % 13.25/13.33 ! [A,B] : % 13.25/13.33 ( subset(A,B) % 13.25/13.33 <=> ! [C] : % 13.25/13.33 ( in(C,A) % 13.25/13.33 => in(C,B) ) ) ). % 13.25/13.33 % 13.25/13.33 fof(d5_tarski,axiom, % 13.25/13.33 ! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) ). % 13.25/13.33 % 13.25/13.33 fof(fc1_zfmisc_1,axiom, % 13.25/13.33 ! [A,B] : ~ empty(ordered_pair(A,B)) ). % 13.25/13.33 % 13.25/13.33 fof(rc1_xboole_0,axiom, % 13.25/13.33 ? [A] : empty(A) ). % 13.25/13.33 % 13.25/13.33 fof(rc2_xboole_0,axiom, % 13.25/13.33 ? [A] : ~ empty(A) ). % 13.25/13.33 % 13.25/13.33 fof(reflexivity_r1_tarski,axiom, % 13.25/13.33 ! [A,B] : subset(A,A) ). % 13.25/13.33 % 13.25/13.33 fof(t111_zfmisc_1,conjecture, % 13.25/13.33 ! [A,B] : % 13.25/13.33 ( ( ! [C] : % 13.25/13.33 ~ ( in(C,A) % 13.25/13.33 & ! [D,E] : C != ordered_pair(D,E) ) % 13.25/13.33 & ! [C,D] : % 13.25/13.33 ( in(ordered_pair(C,D),A) % 13.25/13.33 => in(ordered_pair(C,D),B) ) ) % 13.25/13.33 => subset(A,B) ) ). % 13.25/13.33 % 13.25/13.33 %------------------------------------------------------------------------------ % 13.25/13.33 %------------------------------------------- % 13.25/13.33 % Proof found % 13.25/13.33 % SZS status Theorem for theBenchmark % 13.25/13.33 % SZS output start Proof % 13.25/13.34 %ClaNum:27(EqnAxiom:15) % 13.25/13.34 %VarNum:40(SingletonVarNum:17) % 13.25/13.34 %MaxLitNum:3 % 13.25/13.34 %MaxfuncDepth:3 % 13.25/13.34 %SharedTerms:7 % 13.25/13.34 %goalClause: 20 26 27 % 13.25/13.34 %singleGoalClaCount:1 % 13.25/13.34 [16]P1(a1) % 13.25/13.34 [19]~P1(a4) % 13.25/13.34 [20]~P2(a5,a6) % 13.25/13.34 [17]P2(x171,x171) % 13.25/13.34 [18]E(f3(x181,x182),f3(x182,x181)) % 13.25/13.34 [21]~P1(f3(f3(x211,x212),f7(x211))) % 13.25/13.34 [26]~P3(x261,a5)+E(f3(f3(f8(x261),f9(x261)),f7(f8(x261))),x261) % 13.25/13.34 [22]~P3(x222,x221)+~P3(x221,x222) % 13.25/13.34 [23]P2(x231,x232)+P3(f2(x231,x232),x231) % 13.25/13.34 [25]P2(x251,x252)+~P3(f2(x251,x252),x252) % 13.25/13.34 [27]P3(f3(f3(x271,x272),f7(x271)),a6)+~P3(f3(f3(x271,x272),f7(x271)),a5) % 13.25/13.34 [24]~P2(x243,x242)+P3(x241,x242)+~P3(x241,x243) % 13.25/13.34 %EqnAxiom % 13.25/13.34 [1]E(x11,x11) % 13.25/13.34 [2]E(x22,x21)+~E(x21,x22) % 13.25/13.34 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 13.25/13.34 [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43)) % 13.25/13.34 [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52)) % 13.25/13.34 [6]~E(x61,x62)+E(f7(x61),f7(x62)) % 13.25/13.34 [7]~E(x71,x72)+E(f8(x71),f8(x72)) % 13.25/13.34 [8]~E(x81,x82)+E(f9(x81),f9(x82)) % 13.25/13.34 [9]~E(x91,x92)+E(f2(x91,x93),f2(x92,x93)) % 13.25/13.34 [10]~E(x101,x102)+E(f2(x103,x101),f2(x103,x102)) % 13.25/13.34 [11]~P1(x111)+P1(x112)+~E(x111,x112) % 13.25/13.34 [12]P2(x122,x123)+~E(x121,x122)+~P2(x121,x123) % 13.25/13.34 [13]P2(x133,x132)+~E(x131,x132)+~P2(x133,x131) % 13.25/13.34 [14]P3(x142,x143)+~E(x141,x142)+~P3(x141,x143) % 13.25/13.34 [15]P3(x153,x152)+~E(x151,x152)+~P3(x153,x151) % 13.25/13.34 % 13.25/13.34 %------------------------------------------- % 13.25/13.34 cnf(40,plain, % 13.25/13.34 (~E(x401,a5)+~P3(f2(x401,a6),a6)), % 13.25/13.34 inference(scs_inference,[],[20,25,12])). % 13.25/13.34 cnf(41,plain, % 13.25/13.34 (~P3(f2(a5,a6),a6)), % 13.25/13.34 inference(equality_inference,[],[40])). % 13.25/13.34 cnf(162,plain, % 13.25/13.34 (~E(x1621,a6)+P3(f2(a5,x1621),a5)), % 13.25/13.34 inference(scs_inference,[],[20,23,13])). % 13.25/13.34 cnf(163,plain, % 13.25/13.34 (P3(f2(a5,a6),a5)), % 13.25/13.34 inference(equality_inference,[],[162])). % 13.25/13.34 cnf(164,plain, % 13.25/13.34 (P3(x1641,a5)+~E(f2(a5,a6),x1641)), % 13.25/13.34 inference(scs_inference,[],[163,14])). % 13.25/13.34 cnf(260,plain, % 13.25/13.34 (~E(f2(a5,a6),f3(f3(x2601,x2602),f7(x2601)))+P3(f3(f3(x2601,x2602),f7(x2601)),a6)), % 13.25/13.34 inference(scs_inference,[],[164,27])). % 13.25/13.34 cnf(261,plain, % 13.25/13.34 (~E(f3(f3(x2611,x2612),f7(x2611)),f2(a5,a6))+P3(f3(f3(x2611,x2612),f7(x2611)),a6)), % 13.25/13.34 inference(scs_inference,[],[260,2])). % 13.25/13.34 cnf(1301,plain, % 13.25/13.34 (~E(f3(f3(x13011,x13012),f7(x13011)),f2(a5,a6))), % 13.25/13.34 inference(scs_inference,[],[41,261,14])). % 13.25/13.34 cnf(1302,plain, % 13.25/13.34 ($false), % 13.25/13.34 inference(scs_inference,[],[163,1301,26]), % 13.25/13.34 ['proof']). % 13.25/13.34 % SZS output end Proof % 13.25/13.34 % Total time :12.700000s %------------------------------------------------------------------------------