TPTP Problem File: SEU221+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SEU221+1 : TPTP v9.0.0. Released v3.3.0.
% Domain : Set theory
% Problem : MPTP bushy problem t62_funct_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-t62_funct_1 [Urb07]
% Status : Theorem
% Rating : 0.33 v9.0.0, 0.39 v8.2.0, 0.36 v8.1.0, 0.39 v7.5.0, 0.47 v7.4.0, 0.30 v7.3.0, 0.34 v7.2.0, 0.31 v7.1.0, 0.30 v7.0.0, 0.33 v6.4.0, 0.35 v6.3.0, 0.33 v6.2.0, 0.40 v6.1.0, 0.53 v6.0.0, 0.52 v5.5.0, 0.63 v5.4.0, 0.61 v5.3.0, 0.67 v5.2.0, 0.50 v5.1.0, 0.52 v5.0.0, 0.54 v4.1.0, 0.52 v4.0.0, 0.54 v3.7.0, 0.50 v3.5.0, 0.53 v3.4.0, 0.47 v3.3.0
% Syntax : Number of formulae : 39 ( 9 unt; 0 def)
% Number of atoms : 117 ( 12 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 88 ( 10 ~; 1 |; 48 &)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 47 ( 38 !; 9 ?)
% 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(cc2_funct_1,axiom,
! [A] :
( ( relation(A)
& empty(A)
& function(A) )
=> ( relation(A)
& function(A)
& one_to_one(A) ) ) ).
fof(d8_funct_1,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
<=> ! [B,C] :
( ( in(B,relation_dom(A))
& in(C,relation_dom(A))
& apply(A,B) = apply(A,C) )
=> B = C ) ) ) ).
fof(dt_k1_funct_1,axiom,
$true ).
fof(dt_k1_relat_1,axiom,
$true ).
fof(dt_k1_xboole_0,axiom,
$true ).
fof(dt_k2_funct_1,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( relation(function_inverse(A))
& function(function_inverse(A)) ) ) ).
fof(dt_k2_relat_1,axiom,
$true ).
fof(dt_k5_relat_1,axiom,
! [A,B] :
( ( relation(A)
& relation(B) )
=> relation(relation_composition(A,B)) ) ).
fof(dt_m1_subset_1,axiom,
$true ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A) ).
fof(fc10_relat_1,axiom,
! [A,B] :
( ( empty(A)
& relation(B) )
=> ( empty(relation_composition(B,A))
& relation(relation_composition(B,A)) ) ) ).
fof(fc12_relat_1,axiom,
( empty(empty_set)
& relation(empty_set)
& relation_empty_yielding(empty_set) ) ).
fof(fc1_funct_1,axiom,
! [A,B] :
( ( relation(A)
& function(A)
& relation(B)
& function(B) )
=> ( relation(relation_composition(A,B))
& function(relation_composition(A,B)) ) ) ).
fof(fc1_xboole_0,axiom,
empty(empty_set) ).
fof(fc4_relat_1,axiom,
( empty(empty_set)
& relation(empty_set) ) ).
fof(fc5_relat_1,axiom,
! [A] :
( ( ~ empty(A)
& relation(A) )
=> ~ empty(relation_dom(A)) ) ).
fof(fc6_relat_1,axiom,
! [A] :
( ( ~ empty(A)
& relation(A) )
=> ~ empty(relation_rng(A)) ) ).
fof(fc7_relat_1,axiom,
! [A] :
( empty(A)
=> ( empty(relation_dom(A))
& relation(relation_dom(A)) ) ) ).
fof(fc8_relat_1,axiom,
! [A] :
( empty(A)
=> ( empty(relation_rng(A))
& relation(relation_rng(A)) ) ) ).
fof(fc9_relat_1,axiom,
! [A,B] :
( ( empty(A)
& relation(B) )
=> ( empty(relation_composition(A,B))
& relation(relation_composition(A,B)) ) ) ).
fof(rc1_funct_1,axiom,
? [A] :
( relation(A)
& function(A) ) ).
fof(rc1_relat_1,axiom,
? [A] :
( empty(A)
& relation(A) ) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A) ).
fof(rc2_funct_1,axiom,
? [A] :
( relation(A)
& empty(A)
& function(A) ) ).
fof(rc2_relat_1,axiom,
? [A] :
( ~ empty(A)
& relation(A) ) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A) ).
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(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(t54_funct_1,axiom,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> ! [B] :
( ( relation(B)
& function(B) )
=> ( B = function_inverse(A)
<=> ( relation_dom(B) = relation_rng(A)
& ! [C,D] :
( ( ( in(C,relation_rng(A))
& D = apply(B,C) )
=> ( in(D,relation_dom(A))
& C = apply(A,D) ) )
& ( ( in(D,relation_dom(A))
& C = apply(A,D) )
=> ( in(C,relation_rng(A))
& D = apply(B,C) ) ) ) ) ) ) ) ) ).
fof(t57_funct_1,axiom,
! [A,B] :
( ( relation(B)
& function(B) )
=> ( ( one_to_one(B)
& in(A,relation_rng(B)) )
=> ( A = apply(B,apply(function_inverse(B),A))
& A = apply(relation_composition(function_inverse(B),B),A) ) ) ) ).
fof(t62_funct_1,conjecture,
! [A] :
( ( relation(A)
& function(A) )
=> ( one_to_one(A)
=> one_to_one(function_inverse(A)) ) ) ).
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) ) ).
%------------------------------------------------------------------------------