%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET947+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 : 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 : Mon Jun 24 14:23:04 EDT 2024 % Result : Theorem 116.10s 116.29s % Output : CNFRefutation 116.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SET947+1 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n019.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Sun Jun 23 16:35:09 EDT 2024 % 0.11/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 116.10/116.28 %------------------------------------------- % 116.10/116.28 % File :CSE---1.7 % 116.10/116.28 % Problem :theBenchmark % 116.10/116.28 % Transform :cnf % 116.10/116.28 % Format :tptp:raw % 116.10/116.28 % Command :java -jar mcs_scs.jar %d %s % 116.10/116.28 % 116.10/116.28 % Result :Theorem 115.600000s % 116.10/116.28 % Output :CNFRefutation 115.600000s % 116.10/116.28 %------------------------------------------- % 116.10/116.29 %------------------------------------------------------------------------------ % 116.10/116.29 % File : SET947+1 : TPTP v8.2.0. Released v3.2.0. % 116.10/116.29 % Domain : Set theory % 116.10/116.29 % Problem : subset(A,powerset(union(A))) % 116.10/116.29 % Version : [Urb06] axioms : Especial. % 116.10/116.29 % English : % 116.10/116.29 % 116.10/116.29 % Refs : [Byl90] Bylinski (1990), Some Basic Properties of Sets % 116.10/116.29 % : [Urb06] Urban (2006), Email to G. Sutcliffe % 116.10/116.29 % Source : [Urb06] % 116.10/116.29 % Names : zfmisc_1__t100_zfmisc_1 [Urb06] % 116.10/116.29 % 116.10/116.29 % Status : Theorem % 116.10/116.29 % Rating : 0.14 v8.1.0, 0.17 v7.5.0, 0.19 v7.4.0, 0.10 v7.2.0, 0.07 v7.1.0, 0.04 v7.0.0, 0.07 v6.4.0, 0.12 v6.3.0, 0.08 v6.2.0, 0.12 v6.1.0, 0.27 v6.0.0, 0.26 v5.5.0, 0.22 v5.4.0, 0.18 v5.3.0, 0.19 v5.2.0, 0.00 v5.0.0, 0.12 v4.1.0, 0.13 v4.0.0, 0.12 v3.7.0, 0.10 v3.5.0, 0.11 v3.3.0, 0.14 v3.2.0 % 116.10/116.29 % Syntax : Number of formulae : 8 ( 4 unt; 0 def) % 116.10/116.29 % Number of atoms : 14 ( 1 equ) % 116.10/116.29 % Maximal formula atoms : 3 ( 1 avg) % 116.10/116.29 % Number of connectives : 8 ( 2 ~; 0 |; 0 &) % 116.10/116.29 % ( 3 <=>; 3 =>; 0 <=; 0 <~>) % 116.10/116.29 % Maximal formula depth : 6 ( 4 avg) % 116.10/116.29 % Maximal term depth : 3 ( 1 avg) % 116.10/116.29 % Number of predicates : 4 ( 3 usr; 0 prp; 1-2 aty) % 116.10/116.29 % Number of functors : 2 ( 2 usr; 0 con; 1-1 aty) % 116.10/116.29 % Number of variables : 15 ( 13 !; 2 ?) % 116.10/116.29 % SPC : FOF_THM_RFO_SEQ % 116.10/116.29 % 116.10/116.29 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 116.10/116.29 % library, www.mizar.org % 116.10/116.29 %------------------------------------------------------------------------------ % 116.10/116.29 fof(antisymmetry_r2_hidden,axiom, % 116.10/116.29 ! [A,B] : % 116.10/116.29 ( in(A,B) % 116.10/116.29 => ~ in(B,A) ) ). % 116.10/116.29 % 116.10/116.29 fof(d1_zfmisc_1,axiom, % 116.10/116.29 ! [A,B] : % 116.10/116.29 ( B = powerset(A) % 116.10/116.29 <=> ! [C] : % 116.10/116.29 ( in(C,B) % 116.10/116.29 <=> subset(C,A) ) ) ). % 116.10/116.29 % 116.10/116.29 fof(d3_tarski,axiom, % 116.10/116.29 ! [A,B] : % 116.10/116.29 ( subset(A,B) % 116.10/116.29 <=> ! [C] : % 116.10/116.29 ( in(C,A) % 116.10/116.29 => in(C,B) ) ) ). % 116.10/116.29 % 116.10/116.29 fof(l50_zfmisc_1,axiom, % 116.10/116.29 ! [A,B] : % 116.10/116.29 ( in(A,B) % 116.10/116.29 => subset(A,union(B)) ) ). % 116.10/116.29 % 116.10/116.29 fof(rc1_xboole_0,axiom, % 116.10/116.29 ? [A] : empty(A) ). % 116.10/116.29 % 116.10/116.29 fof(rc2_xboole_0,axiom, % 116.10/116.29 ? [A] : ~ empty(A) ). % 116.10/116.29 % 116.10/116.29 fof(reflexivity_r1_tarski,axiom, % 116.10/116.29 ! [A,B] : subset(A,A) ). % 116.10/116.29 % 116.10/116.29 fof(t100_zfmisc_1,conjecture, % 116.10/116.29 ! [A] : subset(A,powerset(union(A))) ). % 116.10/116.29 % 116.10/116.29 %------------------------------------------------------------------------------ % 116.10/116.29 %------------------------------------------- % 116.10/116.29 % Proof found % 116.10/116.29 % SZS status Theorem for theBenchmark % 116.10/116.29 % SZS output start Proof % 116.10/116.29 %ClaNum:27(EqnAxiom:14) % 116.10/116.29 %VarNum:54(SingletonVarNum:22) % 116.10/116.29 %MaxLitNum:3 % 116.10/116.29 %MaxfuncDepth:2 % 116.10/116.29 %SharedTerms:8 % 116.10/116.29 %goalClause: 18 % 116.10/116.29 %singleGoalClaCount:1 % 116.10/116.29 [15]P1(a1) % 116.10/116.29 [17]~P1(a4) % 116.10/116.29 [18]~P2(a5,f7(f6(a5))) % 116.10/116.29 [16]P2(x161,x161) % 116.10/116.29 [20]~P3(x202,x201)+~P3(x201,x202) % 116.10/116.29 [19]~P3(x191,x192)+P2(x191,f6(x192)) % 116.10/116.29 [23]P2(x231,x232)+P3(f2(x231,x232),x231) % 116.10/116.29 [25]P2(x251,x252)+~P3(f2(x251,x252),x252) % 116.10/116.29 [26]P3(f3(x262,x261),x261)+P2(f3(x262,x261),x262)+E(x261,f7(x262)) % 116.10/116.29 [27]~P3(f3(x272,x271),x271)+~P2(f3(x272,x271),x272)+E(x271,f7(x272)) % 116.10/116.29 [24]~P2(x243,x242)+P3(x241,x242)+~P3(x241,x243) % 116.10/116.29 [21]~P2(x211,x213)+P3(x211,x212)+~E(x212,f7(x213)) % 116.10/116.29 [22]~P3(x221,x223)+P2(x221,x222)+~E(x223,f7(x222)) % 116.10/116.29 %EqnAxiom % 116.10/116.29 [1]E(x11,x11) % 116.10/116.29 [2]E(x22,x21)+~E(x21,x22) % 116.10/116.29 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 116.10/116.29 [4]~E(x41,x42)+E(f6(x41),f6(x42)) % 116.10/116.29 [5]~E(x51,x52)+E(f7(x51),f7(x52)) % 116.10/116.29 [6]~E(x61,x62)+E(f3(x61,x63),f3(x62,x63)) % 116.10/116.29 [7]~E(x71,x72)+E(f3(x73,x71),f3(x73,x72)) % 116.10/116.29 [8]~E(x81,x82)+E(f2(x81,x83),f2(x82,x83)) % 116.10/116.29 [9]~E(x91,x92)+E(f2(x93,x91),f2(x93,x92)) % 116.10/116.29 [10]~P1(x101)+P1(x102)+~E(x101,x102) % 116.10/116.29 [11]P2(x112,x113)+~E(x111,x112)+~P2(x111,x113) % 116.10/116.29 [12]P2(x123,x122)+~E(x121,x122)+~P2(x123,x121) % 116.10/116.29 [13]P3(x132,x133)+~E(x131,x132)+~P3(x131,x133) % 116.10/116.29 [14]P3(x143,x142)+~E(x141,x142)+~P3(x143,x141) % 116.10/116.29 % 116.10/116.29 %------------------------------------------- % 116.10/116.30 cnf(28,plain, % 116.10/116.30 (~P2(x281,x282)+P3(x281,f7(x282))), % 116.10/116.30 inference(equality_inference,[],[21])). % 116.10/116.30 cnf(47,plain, % 116.10/116.30 (P2(f2(a5,f7(f6(a5))),f6(a5))), % 116.10/116.30 inference(scs_inference,[],[18,19,23])). % 116.10/116.30 cnf(264,plain, % 116.10/116.30 (~P2(f2(a5,f7(f6(a5))),f6(a5))), % 116.10/116.30 inference(scs_inference,[],[18,28,25])). % 116.10/116.30 cnf(2998,plain, % 116.10/116.30 ($false), % 116.10/116.30 inference(scs_inference,[],[264,47]), % 116.10/116.30 ['proof']). % 116.10/116.30 % SZS output end Proof % 116.10/116.30 % Total time :115.600000s %------------------------------------------------------------------------------