%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SEU165+1 : TPTP v8.2.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n021.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 15:01:29 EDT 2024 % Result : Theorem 21.07s 21.09s % Output : CNFRefutation 21.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU165+1 : TPTP v8.2.0. Released v3.3.0. % 0.04/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n021.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 : Fri Jun 21 17:11:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.55/0.60 start to proof:theBenchmark % 21.07/21.08 %------------------------------------------- % 21.07/21.08 % File :CSE---1.7 % 21.07/21.08 % Problem :theBenchmark % 21.07/21.08 % Transform :cnf % 21.07/21.08 % Format :tptp:raw % 21.07/21.08 % Command :java -jar mcs_scs.jar %d %s % 21.07/21.08 % 21.07/21.08 % Result :Theorem 20.460000s % 21.07/21.08 % Output :CNFRefutation 20.460000s % 21.07/21.08 %------------------------------------------- % 21.07/21.09 %------------------------------------------------------------------------------ % 21.07/21.09 % File : SEU165+1 : TPTP v8.2.0. Released v3.3.0. % 21.07/21.09 % Domain : Set theory % 21.07/21.09 % Problem : MPTP bushy problem t106_zfmisc_1 % 21.07/21.09 % Version : [Urb07] axioms : Especial. % 21.07/21.09 % English : % 21.07/21.09 % 21.07/21.09 % Refs : [Ban01] Bancerek et al. (2001), On the Characterizations of Co % 21.07/21.09 % : [Urb07] Urban (2006), Email to G. Sutcliffe % 21.07/21.09 % Source : [Urb07] % 21.07/21.09 % Names : bushy-t106_zfmisc_1 [Urb07] % 21.07/21.09 % 21.07/21.09 % Status : Theorem % 21.07/21.09 % Rating : 0.06 v7.4.0, 0.03 v7.2.0, 0.00 v6.4.0, 0.04 v6.2.0, 0.08 v6.1.0, 0.07 v6.0.0, 0.04 v5.5.0, 0.00 v5.4.0, 0.07 v5.3.0, 0.11 v5.2.0, 0.00 v4.1.0, 0.04 v4.0.1, 0.09 v4.0.0, 0.12 v3.7.0, 0.05 v3.3.0 % 21.07/21.09 % Syntax : Number of formulae : 12 ( 9 unt; 0 def) % 21.07/21.09 % Number of atoms : 17 ( 2 equ) % 21.07/21.09 % Maximal formula atoms : 3 ( 1 avg) % 21.07/21.09 % Number of connectives : 8 ( 3 ~; 0 |; 2 &) % 21.07/21.09 % ( 2 <=>; 1 =>; 0 <=; 0 <~>) % 21.07/21.09 % Maximal formula depth : 7 ( 3 avg) % 21.07/21.09 % Maximal term depth : 3 ( 1 avg) % 21.07/21.09 % Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty) % 21.07/21.09 % Number of functors : 4 ( 4 usr; 0 con; 1-2 aty) % 21.07/21.09 % Number of variables : 18 ( 16 !; 2 ?) % 21.07/21.09 % SPC : FOF_THM_RFO_SEQ % 21.07/21.09 % 21.07/21.09 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 21.07/21.09 % library, www.mizar.org % 21.07/21.09 %------------------------------------------------------------------------------ % 21.07/21.09 fof(commutativity_k2_tarski,axiom, % 21.07/21.09 ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A) ). % 21.07/21.09 % 21.07/21.09 fof(dt_k1_tarski,axiom, % 21.07/21.09 $true ). % 21.07/21.09 % 21.07/21.09 fof(dt_k2_tarski,axiom, % 21.07/21.09 $true ). % 21.07/21.09 % 21.07/21.09 fof(rc1_xboole_0,axiom, % 21.07/21.09 ? [A] : empty(A) ). % 21.07/21.09 % 21.07/21.09 fof(rc2_xboole_0,axiom, % 21.07/21.09 ? [A] : ~ empty(A) ). % 21.07/21.09 % 21.07/21.09 fof(antisymmetry_r2_hidden,axiom, % 21.07/21.09 ! [A,B] : % 21.07/21.09 ( in(A,B) % 21.07/21.09 => ~ in(B,A) ) ). % 21.07/21.09 % 21.07/21.09 fof(dt_k2_zfmisc_1,axiom, % 21.07/21.09 $true ). % 21.07/21.09 % 21.07/21.09 fof(dt_k4_tarski,axiom, % 21.07/21.09 $true ). % 21.07/21.09 % 21.07/21.09 fof(fc1_zfmisc_1,axiom, % 21.07/21.09 ! [A,B] : ~ empty(ordered_pair(A,B)) ). % 21.07/21.09 % 21.07/21.09 fof(d5_tarski,axiom, % 21.07/21.09 ! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) ). % 21.07/21.09 % 21.07/21.09 fof(t106_zfmisc_1,conjecture, % 21.07/21.09 ! [A,B,C,D] : % 21.07/21.09 ( in(ordered_pair(A,B),cartesian_product2(C,D)) % 21.07/21.09 <=> ( in(A,C) % 21.07/21.09 & in(B,D) ) ) ). % 21.07/21.09 % 21.07/21.09 fof(l55_zfmisc_1,axiom, % 21.07/21.09 ! [A,B,C,D] : % 21.07/21.09 ( in(ordered_pair(A,B),cartesian_product2(C,D)) % 21.07/21.09 <=> ( in(A,C) % 21.07/21.09 & in(B,D) ) ) ). % 21.07/21.09 % 21.07/21.09 %------------------------------------------------------------------------------ % 21.07/21.09 %------------------------------------------- % 21.07/21.09 % Proof found % 21.07/21.09 % SZS status Theorem for theBenchmark % 21.07/21.09 % SZS output start Proof % 21.07/21.09 %ClaNum:22(EqnAxiom:11) % 21.07/21.09 %VarNum:34(SingletonVarNum:18) % 21.07/21.09 %MaxLitNum:3 % 21.07/21.09 %MaxfuncDepth:2 % 21.07/21.09 %SharedTerms:18 % 21.07/21.09 %goalClause: 17 18 20 % 21.07/21.09 [12]P1(a1) % 21.07/21.09 [14]~P1(a4) % 21.07/21.09 [13]E(f3(x131,x132),f3(x132,x131)) % 21.07/21.09 [15]~P1(f3(f3(x151,x152),f5(x151))) % 21.07/21.09 [17]P2(a6,a7)+P2(f3(f3(a6,a8),f5(a6)),f2(a7,a9)) % 21.07/21.09 [18]P2(a8,a9)+P2(f3(f3(a6,a8),f5(a6)),f2(a7,a9)) % 21.07/21.09 [16]~P2(x162,x161)+~P2(x161,x162) % 21.07/21.09 [21]P2(x211,x212)+~P2(f3(f3(x213,x211),f5(x213)),f2(x214,x212)) % 21.07/21.09 [22]P2(x221,x222)+~P2(f3(f3(x221,x223),f5(x221)),f2(x222,x224)) % 21.07/21.09 [20]~P2(a6,a7)+~P2(a8,a9)+~P2(f3(f3(a6,a8),f5(a6)),f2(a7,a9)) % 21.07/21.09 [19]~P2(x192,x194)+~P2(x191,x193)+P2(f3(f3(x191,x192),f5(x191)),f2(x193,x194)) % 21.07/21.09 %EqnAxiom % 21.07/21.09 [1]E(x11,x11) % 21.07/21.09 [2]E(x22,x21)+~E(x21,x22) % 21.07/21.09 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 21.07/21.09 [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43)) % 21.07/21.09 [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52)) % 21.07/21.09 [6]~E(x61,x62)+E(f2(x61,x63),f2(x62,x63)) % 21.07/21.09 [7]~E(x71,x72)+E(f2(x73,x71),f2(x73,x72)) % 21.07/21.09 [8]~E(x81,x82)+E(f5(x81),f5(x82)) % 21.07/21.09 [9]~P1(x91)+P1(x92)+~E(x91,x92) % 21.07/21.09 [10]P2(x102,x103)+~E(x101,x102)+~P2(x101,x103) % 21.07/21.09 [11]P2(x113,x112)+~E(x111,x112)+~P2(x113,x111) % 21.07/21.09 % 21.07/21.09 %------------------------------------------- % 21.07/21.10 cnf(67,plain, % 21.07/21.10 (~P2(f3(x671,x672),x673)+P2(f3(x672,x671),x673)), % 21.07/21.10 inference(scs_inference,[],[13,2,10])). % 21.07/21.10 cnf(201,plain, % 21.07/21.10 (~P2(f3(f5(a6),f3(a6,a8)),f2(a7,a9))+~P2(a6,a7)+~P2(a8,a9)), % 21.07/21.10 inference(scs_inference,[],[67,20])). % 21.07/21.10 cnf(830,plain, % 21.07/21.10 (P2(a6,a7)), % 21.07/21.10 inference(scs_inference,[],[17,22])). % 21.07/21.10 cnf(835,plain, % 21.07/21.10 (~P2(a8,a9)+~P2(f3(f5(a6),f3(a6,a8)),f2(a7,a9))), % 21.07/21.10 inference(scs_inference,[],[830,201])). % 21.07/21.10 cnf(870,plain, % 21.07/21.10 (~P2(f3(f5(a6),f3(a6,a8)),f2(a7,a9))+~P2(f3(f3(x8701,a8),f5(x8701)),f2(x8702,a9))), % 21.07/21.10 inference(scs_inference,[],[835,21])). % 21.07/21.10 cnf(890,plain, % 21.07/21.10 (~P2(f3(f3(a6,a8),f5(a6)),f2(a7,a9))+~P2(f3(f3(x8901,a8),f5(x8901)),f2(x8902,a9))), % 21.07/21.10 inference(scs_inference,[],[870,67])). % 21.07/21.10 cnf(891,plain, % 21.07/21.10 (P2(a8,a9)), % 21.07/21.10 inference(scs_inference,[],[890,18])). % 21.07/21.10 cnf(894,plain, % 21.07/21.10 (~P2(f3(f5(a6),f3(a6,a8)),f2(a7,a9))), % 21.07/21.10 inference(scs_inference,[],[891,835])). % 21.07/21.10 cnf(911,plain, % 21.07/21.10 ($false), % 21.07/21.10 inference(scs_inference,[],[891,830,894,67,19]), % 21.07/21.10 ['proof']). % 21.07/21.10 % SZS output end Proof % 21.07/21.10 % Total time :20.460000s %------------------------------------------------------------------------------