TPTP Problem File: SEU373+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU373+1 : TPTP v8.2.0. Released v3.3.0.
% Domain : Set theory
% Problem : MPTP bushy problem t19_yellow_6
% 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-t19_yellow_6 [Urb07]
% Status : Theorem
% Rating : 0.17 v8.2.0, 0.14 v8.1.0, 0.06 v7.4.0, 0.07 v7.1.0, 0.09 v7.0.0, 0.07 v6.4.0, 0.12 v6.3.0, 0.08 v6.1.0, 0.13 v5.5.0, 0.11 v5.4.0, 0.14 v5.3.0, 0.19 v5.2.0, 0.05 v5.1.0, 0.10 v5.0.0, 0.12 v4.1.0, 0.13 v4.0.0, 0.17 v3.7.0, 0.05 v3.4.0, 0.16 v3.3.0
% Syntax : Number of formulae : 59 ( 14 unt; 0 def)
% Number of atoms : 140 ( 4 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 12 ~; 1 |; 39 &)
% ( 4 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-4 aty)
% Number of variables : 98 ( 80 !; 18 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Translated by MPTP 0.2 from the original problem in the Mizar
% library, www.mizar.org
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ) ).
fof(cc1_funct_1,axiom,
! [A] :
( empty(A)
=> function(A) ) ).
fof(cc1_relat_1,axiom,
! [A] :
( empty(A)
=> relation(A) ) ).
fof(cc1_relset_1,axiom,
! [A,B,C] :
( element(C,powerset(cartesian_product2(A,B)))
=> relation(C) ) ).
fof(cc2_funct_1,axiom,
! [A] :
( ( relation(A)
& empty(A)
& function(A) )
=> ( relation(A)
& function(A)
& one_to_one(A) ) ) ).
fof(d13_yellow_0,axiom,
! [A] :
( rel_str(A)
=> ! [B] :
( rel_str(B)
=> ( subrelstr(B,A)
<=> ( subset(the_carrier(B),the_carrier(A))
& subset(the_InternalRel(B),the_InternalRel(A)) ) ) ) ) ).
fof(d8_yellow_6,axiom,
! [A] :
( one_sorted_str(A)
=> ! [B] :
( net_str(B,A)
=> ! [C] :
( net_str(C,A)
=> ( subnetstr(C,A,B)
<=> ( subrelstr(C,B)
& the_mapping(A,C) = relation_dom_restr_as_relation_of(the_carrier(B),the_carrier(A),the_mapping(A,B),the_carrier(C)) ) ) ) ) ) ).
fof(dt_k1_xboole_0,axiom,
$true ).
fof(dt_k1_zfmisc_1,axiom,
$true ).
fof(dt_k2_zfmisc_1,axiom,
$true ).
fof(dt_k7_relat_1,axiom,
! [A,B] :
( relation(A)
=> relation(relation_dom_restriction(A,B)) ) ).
fof(dt_k8_relset_1,axiom,
! [A,B,C,D] :
( relation_of2(C,A,B)
=> relation_of2_as_subset(relation_dom_restr_as_relation_of(A,B,C,D),A,B) ) ).
fof(dt_l1_orders_2,axiom,
! [A] :
( rel_str(A)
=> one_sorted_str(A) ) ).
fof(dt_l1_struct_0,axiom,
$true ).
fof(dt_l1_waybel_0,axiom,
! [A] :
( one_sorted_str(A)
=> ! [B] :
( net_str(B,A)
=> rel_str(B) ) ) ).
fof(dt_m1_relset_1,axiom,
$true ).
fof(dt_m1_subset_1,axiom,
$true ).
fof(dt_m1_yellow_0,axiom,
! [A] :
( rel_str(A)
=> ! [B] :
( subrelstr(B,A)
=> rel_str(B) ) ) ).
fof(dt_m1_yellow_6,axiom,
! [A,B] :
( ( one_sorted_str(A)
& net_str(B,A) )
=> ! [C] :
( subnetstr(C,A,B)
=> net_str(C,A) ) ) ).
fof(dt_m2_relset_1,axiom,
! [A,B,C] :
( relation_of2_as_subset(C,A,B)
=> element(C,powerset(cartesian_product2(A,B))) ) ).
fof(dt_u1_orders_2,axiom,
! [A] :
( rel_str(A)
=> relation_of2_as_subset(the_InternalRel(A),the_carrier(A),the_carrier(A)) ) ).
fof(dt_u1_struct_0,axiom,
$true ).
fof(dt_u1_waybel_0,axiom,
! [A,B] :
( ( one_sorted_str(A)
& net_str(B,A) )
=> ( function(the_mapping(A,B))
& quasi_total(the_mapping(A,B),the_carrier(B),the_carrier(A))
& relation_of2_as_subset(the_mapping(A,B),the_carrier(B),the_carrier(A)) ) ) ).
fof(existence_l1_orders_2,axiom,
? [A] : rel_str(A) ).
fof(existence_l1_struct_0,axiom,
? [A] : one_sorted_str(A) ).
fof(existence_l1_waybel_0,axiom,
! [A] :
( one_sorted_str(A)
=> ? [B] : net_str(B,A) ) ).
fof(existence_m1_relset_1,axiom,
! [A,B] :
? [C] : relation_of2(C,A,B) ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A) ).
fof(existence_m1_yellow_0,axiom,
! [A] :
( rel_str(A)
=> ? [B] : subrelstr(B,A) ) ).
fof(existence_m1_yellow_6,axiom,
! [A,B] :
( ( one_sorted_str(A)
& net_str(B,A) )
=> ? [C] : subnetstr(C,A,B) ) ).
fof(existence_m2_relset_1,axiom,
! [A,B] :
? [C] : relation_of2_as_subset(C,A,B) ).
fof(fc12_relat_1,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ) ).
fof(fc13_relat_1,axiom,
! [A,B] :
( ( relation(A)
& relation_empty_yielding(A) )
=> ( relation(relation_dom_restriction(A,B))
& relation_empty_yielding(relation_dom_restriction(A,B)) ) ) ).
fof(fc1_subset_1,axiom,
! [A] : ~ empty(powerset(A)) ).
fof(fc4_funct_1,axiom,
! [A,B] :
( ( relation(A)
& function(A) )
=> ( relation(relation_dom_restriction(A,B))
& function(relation_dom_restriction(A,B)) ) ) ).
fof(fc4_relat_1,axiom,
( empty(empty_set)
& relation(empty_set) ) ).
fof(fc4_subset_1,axiom,
! [A,B] :
( ( ~ empty(A)
& ~ empty(B) )
=> ~ empty(cartesian_product2(A,B)) ) ).
fof(rc1_funct_1,axiom,
? [A] :
( relation(A)
& function(A) ) ).
fof(rc1_pboole,axiom,
? [A] :
( relation(A)
& relation_empty_yielding(A)
& function(A) ) ).
fof(rc1_relat_1,axiom,
? [A] :
( empty(A)
& relation(A) ) ).
fof(rc1_subset_1,axiom,
! [A] :
( ~ empty(A)
=> ? [B] :
( element(B,powerset(A))
& ~ empty(B) ) ) ).
fof(rc2_funct_1,axiom,
? [A] :
( relation(A)
& empty(A)
& function(A) ) ).
fof(rc2_relat_1,axiom,
? [A] :
( ~ empty(A)
& relation(A) ) ).
fof(rc2_subset_1,axiom,
! [A] :
? [B] :
( element(B,powerset(A))
& empty(B) ) ).
fof(rc3_funct_1,axiom,
? [A] :
( relation(A)
& function(A)
& one_to_one(A) ) ).
fof(rc3_relat_1,axiom,
? [A] :
( relation(A)
& relation_empty_yielding(A) ) ).
fof(rc4_funct_1,axiom,
? [A] :
( relation(A)
& relation_empty_yielding(A)
& function(A) ) ).
fof(redefinition_k8_relset_1,axiom,
! [A,B,C,D] :
( relation_of2(C,A,B)
=> relation_dom_restr_as_relation_of(A,B,C,D) = relation_dom_restriction(C,D) ) ).
fof(redefinition_m2_relset_1,axiom,
! [A,B,C] :
( relation_of2_as_subset(C,A,B)
<=> relation_of2(C,A,B) ) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A) ).
fof(t19_yellow_6,conjecture,
! [A] :
( one_sorted_str(A)
=> ! [B] :
( net_str(B,A)
=> ! [C] :
( subnetstr(C,A,B)
=> subset(the_carrier(C),the_carrier(B)) ) ) ) ).
fof(t1_subset,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ) ).
fof(t2_subset,axiom,
! [A,B] :
( element(A,B)
=> ( empty(B)
| in(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(t5_subset,axiom,
! [A,B,C] :
~ ( in(A,B)
& element(B,powerset(C))
& empty(C) ) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( in(A,B)
& empty(B) ) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(A)
& A != B
& empty(B) ) ).
%------------------------------------------------------------------------------