%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SEU264+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 : n026.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:02:08 EDT 2024 % Result : Theorem 0.61s 0.67s % Output : CNFRefutation 0.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU264+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 : n026.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 14:31:38 EDT 2024 % 0.12/0.33 % CPUTime : % 0.49/0.61 start to proof:theBenchmark % 0.61/0.66 %------------------------------------------- % 0.61/0.66 % File :CSE---1.7 % 0.61/0.66 % Problem :theBenchmark % 0.61/0.66 % Transform :cnf % 0.61/0.66 % Format :tptp:raw % 0.61/0.66 % Command :java -jar mcs_scs.jar %d %s % 0.61/0.66 % 0.61/0.66 % Result :Theorem 0.020000s % 0.61/0.66 % Output :CNFRefutation 0.020000s % 0.61/0.66 %------------------------------------------- % 0.61/0.66 %------------------------------------------------------------------------------ % 0.61/0.66 % File : SEU264+1 : TPTP v8.2.0. Released v3.3.0. % 0.61/0.66 % Domain : Set theory % 0.61/0.66 % Problem : MPTP bushy problem t16_relset_1 % 0.61/0.66 % Version : [Urb07] axioms : Especial. % 0.61/0.66 % English : % 0.61/0.66 % 0.61/0.66 % Refs : [Ban01] Bancerek et al. (2001), On the Characterizations of Co % 0.61/0.66 % : [Urb07] Urban (2006), Email to G. Sutcliffe % 0.61/0.66 % Source : [Urb07] % 0.61/0.66 % Names : bushy-t16_relset_1 [Urb07] % 0.61/0.66 % 0.61/0.66 % Status : Theorem % 0.61/0.66 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v5.5.0, 0.04 v5.4.0, 0.09 v5.3.0, 0.17 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.11 v4.0.0, 0.10 v3.7.0, 0.00 v3.3.0 % 0.61/0.66 % Syntax : Number of formulae : 18 ( 10 unt; 0 def) % 0.61/0.66 % Number of atoms : 30 ( 0 equ) % 0.61/0.66 % Maximal formula atoms : 3 ( 1 avg) % 0.61/0.66 % Number of connectives : 12 ( 0 ~; 0 |; 2 &) % 0.61/0.66 % ( 2 <=>; 8 =>; 0 <=; 0 <~>) % 0.61/0.66 % Maximal formula depth : 7 ( 4 avg) % 0.61/0.66 % Maximal term depth : 3 ( 1 avg) % 0.61/0.66 % Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty) % 0.61/0.66 % Number of functors : 4 ( 4 usr; 0 con; 1-2 aty) % 0.61/0.66 % Number of variables : 35 ( 32 !; 3 ?) % 0.61/0.66 % SPC : FOF_THM_RFO_NEQ % 0.61/0.66 % 0.61/0.66 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 0.61/0.66 % library, www.mizar.org % 0.61/0.66 %------------------------------------------------------------------------------ % 0.61/0.66 fof(cc1_relset_1,axiom, % 0.61/0.66 ! [A,B,C] : % 0.61/0.66 ( element(C,powerset(cartesian_product2(A,B))) % 0.61/0.66 => relation(C) ) ). % 0.61/0.66 % 0.61/0.66 fof(dt_k1_relat_1,axiom, % 0.61/0.66 $true ). % 0.61/0.66 % 0.61/0.66 fof(dt_k1_zfmisc_1,axiom, % 0.61/0.66 $true ). % 0.61/0.66 % 0.61/0.66 fof(dt_k2_relat_1,axiom, % 0.61/0.66 $true ). % 0.61/0.66 % 0.61/0.66 fof(dt_k2_zfmisc_1,axiom, % 0.61/0.66 $true ). % 0.61/0.66 % 0.61/0.66 fof(dt_m1_relset_1,axiom, % 0.61/0.66 $true ). % 0.61/0.66 % 0.61/0.66 fof(dt_m1_subset_1,axiom, % 0.61/0.66 $true ). % 0.61/0.66 % 0.61/0.66 fof(dt_m2_relset_1,axiom, % 0.61/0.66 ! [A,B,C] : % 0.61/0.66 ( relation_of2_as_subset(C,A,B) % 0.61/0.66 => element(C,powerset(cartesian_product2(A,B))) ) ). % 0.61/0.66 % 0.61/0.66 fof(existence_m1_relset_1,axiom, % 0.61/0.66 ! [A,B] : % 0.61/0.67 ? [C] : relation_of2(C,A,B) ). % 0.61/0.67 % 0.61/0.67 fof(existence_m1_subset_1,axiom, % 0.61/0.67 ! [A] : % 0.61/0.67 ? [B] : element(B,A) ). % 0.61/0.67 % 0.61/0.67 fof(existence_m2_relset_1,axiom, % 0.61/0.67 ! [A,B] : % 0.61/0.67 ? [C] : relation_of2_as_subset(C,A,B) ). % 0.61/0.67 % 0.61/0.67 fof(redefinition_m2_relset_1,axiom, % 0.61/0.67 ! [A,B,C] : % 0.61/0.67 ( relation_of2_as_subset(C,A,B) % 0.61/0.67 <=> relation_of2(C,A,B) ) ). % 0.61/0.67 % 0.61/0.67 fof(reflexivity_r1_tarski,axiom, % 0.61/0.67 ! [A,B] : subset(A,A) ). % 0.61/0.67 % 0.61/0.67 fof(t12_relset_1,axiom, % 0.61/0.67 ! [A,B,C] : % 0.61/0.67 ( relation_of2_as_subset(C,A,B) % 0.61/0.67 => ( subset(relation_dom(C),A) % 0.61/0.67 & subset(relation_rng(C),B) ) ) ). % 0.61/0.67 % 0.61/0.67 fof(t14_relset_1,axiom, % 0.61/0.67 ! [A,B,C,D] : % 0.61/0.67 ( relation_of2_as_subset(D,C,A) % 0.61/0.67 => ( subset(relation_rng(D),B) % 0.61/0.67 => relation_of2_as_subset(D,C,B) ) ) ). % 0.61/0.67 % 0.61/0.67 fof(t16_relset_1,conjecture, % 0.61/0.67 ! [A,B,C,D] : % 0.61/0.67 ( relation_of2_as_subset(D,C,A) % 0.61/0.67 => ( subset(A,B) % 0.61/0.67 => relation_of2_as_subset(D,C,B) ) ) ). % 0.61/0.67 % 0.61/0.67 fof(t1_xboole_1,axiom, % 0.61/0.67 ! [A,B,C] : % 0.61/0.67 ( ( subset(A,B) % 0.61/0.67 & subset(B,C) ) % 0.61/0.67 => subset(A,C) ) ). % 0.61/0.67 % 0.61/0.67 fof(t3_subset,axiom, % 0.61/0.67 ! [A,B] : % 0.61/0.67 ( element(A,powerset(B)) % 0.61/0.67 <=> subset(A,B) ) ). % 0.61/0.67 % 0.61/0.67 %------------------------------------------------------------------------------ % 0.61/0.67 %------------------------------------------- % 0.61/0.67 % Proof found % 0.61/0.67 % SZS status Theorem for theBenchmark % 0.61/0.67 % SZS output start Proof % 0.61/0.67 %ClaNum:17(EqnAxiom:0) % 0.61/0.67 %VarNum:66(SingletonVarNum:35) % 0.61/0.67 %MaxLitNum:3 % 0.61/0.67 %MaxfuncDepth:2 % 0.61/0.67 %SharedTerms:7 % 0.61/0.67 %goalClause: 1 4 7 % 0.61/0.67 %singleGoalClaCount:3 % 0.61/0.67 [1]P1(a1,a6) % 0.61/0.67 [4]P3(a7,a8,a1) % 0.61/0.67 [7]~P3(a7,a8,a6) % 0.61/0.67 [2]P1(x21,x21) % 0.61/0.67 [3]P2(f2(x31),x31) % 0.61/0.67 [5]P3(f5(x51,x52),x51,x52) % 0.61/0.67 [6]P4(f3(x61,x62),x61,x62) % 0.61/0.67 [8]~P1(x81,x82)+P2(x81,f9(x82)) % 0.61/0.67 [9]P1(x91,x92)+~P2(x91,f9(x92)) % 0.61/0.67 [14]~P4(x141,x142,x143)+P3(x141,x142,x143) % 0.61/0.67 [15]~P3(x151,x152,x153)+P4(x151,x152,x153) % 0.61/0.67 [11]~P3(x111,x112,x113)+P1(f10(x111),x112) % 0.61/0.67 [12]~P3(x121,x123,x122)+P1(f11(x121),x122) % 0.61/0.67 [13]P5(x131)+~P2(x131,f9(f4(x132,x133))) % 0.61/0.67 [16]~P3(x161,x162,x163)+P2(x161,f9(f4(x162,x163))) % 0.61/0.67 [10]~P1(x101,x103)+P1(x101,x102)+~P1(x103,x102) % 0.61/0.67 [17]P3(x171,x172,x173)+~P3(x171,x172,x174)+~P1(f11(x171),x173) % 0.61/0.67 %EqnAxiom % 0.61/0.67 % 0.61/0.67 %------------------------------------------- % 0.61/0.67 cnf(18,plain, % 0.61/0.67 (~P4(a7,a8,a6)), % 0.61/0.67 inference(scs_inference,[],[7,14])). % 0.61/0.67 cnf(35,plain, % 0.61/0.67 (~P1(f11(a7),a6)), % 0.61/0.67 inference(scs_inference,[],[18,4,15,17])). % 0.61/0.67 cnf(50,plain, % 0.61/0.67 (P2(f11(a7),f9(a1))), % 0.61/0.67 inference(scs_inference,[],[4,8,12])). % 0.61/0.67 cnf(51,plain, % 0.61/0.67 (P1(f11(a7),a1)), % 0.61/0.67 inference(scs_inference,[],[50,9])). % 0.61/0.67 cnf(54,plain, % 0.61/0.67 ($false), % 0.62/0.67 inference(scs_inference,[],[1,35,51,10]), % 0.62/0.67 ['proof']). % 0.62/0.67 % SZS output end Proof % 0.62/0.67 % Total time :0.020000s %------------------------------------------------------------------------------