TPTP Problem File: SEU321+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU321+1 : TPTP v8.2.0. Released v3.3.0.
% Domain : Set theory
% Problem : MPTP bushy problem l40_tops_1
% Version : [Urb07] axioms : Especial.
% English :
% Refs : [Ban01] Bancerek et al. (2001), On the Characterizations of Co
% : [Urb07] Urban (2006), Email to G. Sutcliffe
% Source : [Urb07]
% Names : bushy-l40_tops_1 [Urb07]
% Status : Theorem
% Rating : 0.22 v8.2.0, 0.19 v8.1.0, 0.11 v7.5.0, 0.12 v7.4.0, 0.13 v7.3.0, 0.14 v7.2.0, 0.10 v7.1.0, 0.13 v7.0.0, 0.10 v6.4.0, 0.15 v6.3.0, 0.17 v6.2.0, 0.20 v6.1.0, 0.30 v6.0.0, 0.13 v5.5.0, 0.22 v5.4.0, 0.29 v5.3.0, 0.33 v5.2.0, 0.20 v5.1.0, 0.19 v5.0.0, 0.21 v4.1.0, 0.26 v4.0.0, 0.29 v3.7.0, 0.25 v3.5.0, 0.26 v3.3.0
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 133 ( 4 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 107 ( 16 ~; 1 |; 46 &)
% ( 2 <=>; 42 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 67 ( 62 !; 5 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% library, www.mizar.org
%------------------------------------------------------------------------------
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A) ).
fof(rc5_struct_0,axiom,
! [A] :
( ( ~ empty_carrier(A)
& one_sorted_str(A) )
=> ? [B] :
( element(B,powerset(the_carrier(A)))
& ~ empty(B) ) ) ).
fof(cc1_membered,axiom,
! [A] :
( v5_membered(A)
=> v4_membered(A) ) ).
fof(cc2_membered,axiom,
! [A] :
( v4_membered(A)
=> v3_membered(A) ) ).
fof(cc3_membered,axiom,
! [A] :
( v3_membered(A)
=> v2_membered(A) ) ).
fof(cc4_membered,axiom,
! [A] :
( v2_membered(A)
=> v1_membered(A) ) ).
fof(rc1_membered,axiom,
? [A] :
( ~ empty(A)
& v1_membered(A)
& v2_membered(A)
& v3_membered(A)
& v4_membered(A)
& v5_membered(A) ) ).
fof(cc10_membered,axiom,
! [A] :
( v1_membered(A)
=> ! [B] :
( element(B,A)
=> v1_xcmplx_0(B) ) ) ).
fof(cc11_membered,axiom,
! [A] :
( v2_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& v1_xreal_0(B) ) ) ) ).
fof(cc12_membered,axiom,
! [A] :
( v3_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& v1_xreal_0(B)
& v1_rat_1(B) ) ) ) ).
fof(cc13_membered,axiom,
! [A] :
( v4_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& v1_xreal_0(B)
& v1_int_1(B)
& v1_rat_1(B) ) ) ) ).
fof(cc14_membered,axiom,
! [A] :
( v5_membered(A)
=> ! [B] :
( element(B,A)
=> ( v1_xcmplx_0(B)
& natural(B)
& v1_xreal_0(B)
& v1_int_1(B)
& v1_rat_1(B) ) ) ) ).
fof(cc15_membered,axiom,
! [A] :
( empty(A)
=> ( v1_membered(A)
& v2_membered(A)
& v3_membered(A)
& v4_membered(A)
& v5_membered(A) ) ) ).
fof(cc16_membered,axiom,
! [A] :
( v1_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> v1_membered(B) ) ) ).
fof(cc17_membered,axiom,
! [A] :
( v2_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B) ) ) ) ).
fof(cc18_membered,axiom,
! [A] :
( v3_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B)
& v3_membered(B) ) ) ) ).
fof(cc19_membered,axiom,
! [A] :
( v4_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B)
& v3_membered(B)
& v4_membered(B) ) ) ) ).
fof(cc20_membered,axiom,
! [A] :
( v5_membered(A)
=> ! [B] :
( element(B,powerset(A))
=> ( v1_membered(B)
& v2_membered(B)
& v3_membered(B)
& v4_membered(B)
& v5_membered(B) ) ) ) ).
fof(t2_subset,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(A,B) ) ) ).
fof(t5_subset,axiom,
! [A,B,C] :
~ ( in(A,B)
& element(B,powerset(C))
& empty(C) ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(A)
& A != B
& empty(B) ) ).
fof(involutiveness_k3_subset_1,axiom,
! [A,B] :
( element(B,powerset(A))
=> subset_complement(A,subset_complement(A,B)) = B ) ).
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ) ).
fof(existence_l1_struct_0,axiom,
? [A] : one_sorted_str(A) ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A) ).
fof(dt_k1_xboole_0,axiom,
$true ).
fof(dt_k1_zfmisc_1,axiom,
$true ).
fof(dt_k3_subset_1,axiom,
! [A,B] :
( element(B,powerset(A))
=> element(subset_complement(A,B),powerset(A)) ) ).
fof(dt_l1_struct_0,axiom,
$true ).
fof(dt_m1_subset_1,axiom,
$true ).
fof(dt_u1_struct_0,axiom,
$true ).
fof(rc3_struct_0,axiom,
? [A] :
( one_sorted_str(A)
& ~ empty_carrier(A) ) ).
fof(fc1_struct_0,axiom,
! [A] :
( ( ~ empty_carrier(A)
& one_sorted_str(A) )
=> ~ empty(the_carrier(A)) ) ).
fof(fc6_membered,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ) ).
fof(t1_subset,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ) ).
fof(t3_subset,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ) ).
fof(t4_subset,axiom,
! [A,B,C] :
( ( in(A,B)
& element(B,powerset(C)) )
=> element(A,C) ) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ) ).
fof(l40_tops_1,conjecture,
! [A] :
( ( ~ empty_carrier(A)
& one_sorted_str(A) )
=> ! [B] :
( element(B,powerset(the_carrier(A)))
=> ! [C] :
( element(C,the_carrier(A))
=> ( in(C,subset_complement(the_carrier(A),B))
<=> ~ in(C,B) ) ) ) ) ).
fof(t50_subset_1,axiom,
! [A] :
( A != empty_set
=> ! [B] :
( element(B,powerset(A))
=> ! [C] :
( element(C,A)
=> ( ~ in(C,B)
=> in(C,subset_complement(A,B)) ) ) ) ) ).
fof(t54_subset_1,axiom,
! [A,B,C] :
( element(C,powerset(A))
=> ~ ( in(B,subset_complement(A,C))
& in(B,C) ) ) ).
%------------------------------------------------------------------------------