%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET883+1 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n001.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:22:53 EDT 2024 % Result : Theorem 0.50s 0.61s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET883+1 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n001.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 11:45:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.50/0.57 start to proof:theBenchmark % 0.50/0.60 %------------------------------------------- % 0.50/0.60 % File :CSE---1.7 % 0.50/0.60 % Problem :theBenchmark % 0.50/0.60 % Transform :cnf % 0.50/0.60 % Format :tptp:raw % 0.50/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.60 % 0.50/0.60 % Result :Theorem 0.000000s % 0.50/0.60 % Output :CNFRefutation 0.000000s % 0.50/0.60 %------------------------------------------- % 0.50/0.61 %------------------------------------------------------------------------------ % 0.50/0.61 % File : SET883+1 : TPTP v8.2.0. Released v3.2.0. % 0.50/0.61 % Domain : Set theory % 0.50/0.61 % Problem : subset(singleton(A),singleton(B)) => A = B % 0.50/0.61 % Version : [Urb06] axioms : Especial. % 0.50/0.61 % English : % 0.50/0.61 % 0.50/0.61 % Refs : [Byl90] Bylinski (1990), Some Basic Properties of Sets % 0.50/0.61 % : [Urb06] Urban (2006), Email to G. Sutcliffe % 0.50/0.61 % Source : [Urb06] % 0.50/0.61 % Names : zfmisc_1__t24_zfmisc_1 [Urb06] % 0.50/0.61 % 0.50/0.61 % Status : Theorem % 0.50/0.61 % Rating : 0.00 v6.4.0, 0.04 v6.1.0, 0.07 v6.0.0, 0.09 v5.5.0, 0.04 v5.3.0, 0.11 v5.2.0, 0.05 v5.0.0, 0.04 v3.7.0, 0.05 v3.3.0, 0.00 v3.2.0 % 0.50/0.61 % Syntax : Number of formulae : 5 ( 3 unt; 0 def) % 0.50/0.61 % Number of atoms : 7 ( 2 equ) % 0.50/0.61 % Maximal formula atoms : 2 ( 1 avg) % 0.50/0.61 % Number of connectives : 3 ( 1 ~; 0 |; 0 &) % 0.50/0.61 % ( 0 <=>; 2 =>; 0 <=; 0 <~>) % 0.50/0.61 % Maximal formula depth : 4 ( 3 avg) % 0.50/0.61 % Maximal term depth : 2 ( 1 avg) % 0.50/0.61 % Number of predicates : 3 ( 2 usr; 0 prp; 1-2 aty) % 0.50/0.61 % Number of functors : 1 ( 1 usr; 0 con; 1-1 aty) % 0.50/0.61 % Number of variables : 8 ( 6 !; 2 ?) % 0.50/0.61 % SPC : FOF_THM_RFO_SEQ % 0.50/0.61 % 0.50/0.61 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 0.50/0.61 % library, www.mizar.org % 0.50/0.61 %------------------------------------------------------------------------------ % 0.50/0.61 fof(reflexivity_r1_tarski,axiom, % 0.50/0.61 ! [A,B] : subset(A,A) ). % 0.50/0.61 % 0.50/0.61 fof(rc1_xboole_0,axiom, % 0.50/0.61 ? [A] : empty(A) ). % 0.50/0.61 % 0.50/0.61 fof(rc2_xboole_0,axiom, % 0.50/0.61 ? [A] : ~ empty(A) ). % 0.50/0.61 % 0.50/0.61 fof(t24_zfmisc_1,conjecture, % 0.50/0.61 ! [A,B] : % 0.50/0.61 ( subset(singleton(A),singleton(B)) % 0.50/0.61 => A = B ) ). % 0.50/0.61 % 0.50/0.61 fof(t6_zfmisc_1,axiom, % 0.50/0.61 ! [A,B] : % 0.50/0.61 ( subset(singleton(A),singleton(B)) % 0.50/0.61 => A = B ) ). % 0.50/0.61 % 0.50/0.61 %------------------------------------------------------------------------------ % 0.50/0.61 %------------------------------------------- % 0.50/0.61 % Proof found % 0.50/0.61 % SZS status Theorem for theBenchmark % 0.50/0.61 % SZS output start Proof % 0.50/0.61 %ClaNum:13(EqnAxiom:7) % 0.50/0.61 %VarNum:6(SingletonVarNum:3) % 0.50/0.61 %MaxLitNum:2 % 0.50/0.61 %MaxfuncDepth:1 % 0.50/0.61 %SharedTerms:10 % 0.50/0.61 %goalClause: 10 11 % 0.50/0.61 %singleGoalClaCount:2 % 0.50/0.61 [8]P1(a1) % 0.50/0.61 [11]~E(a5,a2) % 0.50/0.61 [12]~P1(a3) % 0.50/0.61 [10]P2(f4(a2),f4(a5)) % 0.50/0.61 [9]P2(x91,x91) % 0.50/0.61 [13]E(x131,x132)+~P2(f4(x131),f4(x132)) % 0.50/0.61 %EqnAxiom % 0.50/0.61 [1]E(x11,x11) % 0.50/0.61 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.61 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.61 [4]~E(x41,x42)+E(f4(x41),f4(x42)) % 0.50/0.61 [5]~P1(x51)+P1(x52)+~E(x51,x52) % 0.50/0.61 [6]P2(x62,x63)+~E(x61,x62)+~P2(x61,x63) % 0.50/0.61 [7]P2(x73,x72)+~E(x71,x72)+~P2(x73,x71) % 0.50/0.61 % 0.50/0.61 %------------------------------------------- % 0.50/0.61 cnf(16,plain, % 0.50/0.61 ($false), % 0.50/0.61 inference(scs_inference,[],[10,11,13,2]), % 0.50/0.61 ['proof']). % 0.50/0.61 % SZS output end Proof % 0.50/0.61 % Total time :0.000000s %------------------------------------------------------------------------------