TPTP Problem File: ITP010+2.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ITP010+2 : TPTP v8.2.0. Bugfixed v7.5.0.
% Domain : Interactive Theorem Proving
% Problem : HOL4 set theory export of thm_2Ecardinal_2ECARD__NOT__LE.p, bushy mode
% Version : [BG+19] axioms.
% English :
% Refs : [BG+19] Brown et al. (2019), GRUNGE: A Grand Unified ATP Chall
% : [Gau19] Gauthier (2019), Email to Geoff Sutcliffe
% Source : [BG+19]
% Names : thm_2Ecardinal_2ECARD__NOT__LE.p [Gau19]
% : HL404501+2.p [TPAP]
% Status : Theorem
% Rating : 0.14 v8.1.0, 0.11 v7.5.0
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 182 ( 7 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 170 ( 29 ~; 14 |; 14 &)
% ( 34 <=>; 79 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 64 ( 64 !; 0 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
% Bugfixes : v7.5.0 - Bugfixes in axioms and export.
%------------------------------------------------------------------------------
include('Axioms/ITP001/ITP001+2.ax').
%------------------------------------------------------------------------------
fof(mem_c_2Ebool_2ET,axiom,
mem(c_2Ebool_2ET,bool) ).
fof(ax_true_p,axiom,
p(c_2Ebool_2ET) ).
fof(mem_c_2Ecardinal_2Ecardleq,axiom,
! [A_27a] :
( ne(A_27a)
=> ! [A_27b] :
( ne(A_27b)
=> mem(c_2Ecardinal_2Ecardleq(A_27a,A_27b),arr(arr(A_27a,bool),arr(arr(A_27b,bool),bool))) ) ) ).
fof(mem_c_2Ebool_2EF,axiom,
mem(c_2Ebool_2EF,bool) ).
fof(ax_false_p,axiom,
~ p(c_2Ebool_2EF) ).
fof(mem_c_2Emin_2E_3D_3D_3E,axiom,
mem(c_2Emin_2E_3D_3D_3E,arr(bool,arr(bool,bool))) ).
fof(ax_imp_p,axiom,
! [Q] :
( mem(Q,bool)
=> ! [R] :
( mem(R,bool)
=> ( p(ap(ap(c_2Emin_2E_3D_3D_3E,Q),R))
<=> ( p(Q)
=> p(R) ) ) ) ) ).
fof(mem_c_2Ebool_2E_5C_2F,axiom,
mem(c_2Ebool_2E_5C_2F,arr(bool,arr(bool,bool))) ).
fof(ax_or_p,axiom,
! [Q] :
( mem(Q,bool)
=> ! [R] :
( mem(R,bool)
=> ( p(ap(ap(c_2Ebool_2E_5C_2F,Q),R))
<=> ( p(Q)
| p(R) ) ) ) ) ).
fof(mem_c_2Ebool_2E_2F_5C,axiom,
mem(c_2Ebool_2E_2F_5C,arr(bool,arr(bool,bool))) ).
fof(ax_and_p,axiom,
! [Q] :
( mem(Q,bool)
=> ! [R] :
( mem(R,bool)
=> ( p(ap(ap(c_2Ebool_2E_2F_5C,Q),R))
<=> ( p(Q)
& p(R) ) ) ) ) ).
fof(mem_c_2Ebool_2E_7E,axiom,
mem(c_2Ebool_2E_7E,arr(bool,bool)) ).
fof(ax_neg_p,axiom,
! [Q] :
( mem(Q,bool)
=> ( p(ap(c_2Ebool_2E_7E,Q))
<=> ~ p(Q) ) ) ).
fof(mem_c_2Emin_2E_3D,axiom,
! [A_27a] :
( ne(A_27a)
=> mem(c_2Emin_2E_3D(A_27a),arr(A_27a,arr(A_27a,bool))) ) ).
fof(ax_eq_p,axiom,
! [A] :
( ne(A)
=> ! [X] :
( mem(X,A)
=> ! [Y] :
( mem(Y,A)
=> ( p(ap(ap(c_2Emin_2E_3D(A),X),Y))
<=> X = Y ) ) ) ) ).
fof(mem_c_2Ebool_2E_21,axiom,
! [A_27a] :
( ne(A_27a)
=> mem(c_2Ebool_2E_21(A_27a),arr(arr(A_27a,bool),bool)) ) ).
fof(ax_all_p,axiom,
! [A] :
( ne(A)
=> ! [Q] :
( mem(Q,arr(A,bool))
=> ( p(ap(c_2Ebool_2E_21(A),Q))
<=> ! [X] :
( mem(X,A)
=> p(ap(Q,X)) ) ) ) ) ).
fof(conj_thm_2Ebool_2ETRUTH,axiom,
$true ).
fof(conj_thm_2Ebool_2EFALSITY,axiom,
! [V0t] :
( mem(V0t,bool)
=> ( $false
=> p(V0t) ) ) ).
fof(conj_thm_2Ebool_2EFORALL__SIMP,axiom,
! [A_27a] :
( ne(A_27a)
=> ! [V0t] :
( mem(V0t,bool)
=> ( ! [V1x] :
( mem(V1x,A_27a)
=> p(V0t) )
<=> p(V0t) ) ) ) ).
fof(conj_thm_2Ebool_2EIMP__CLAUSES,axiom,
! [V0t] :
( mem(V0t,bool)
=> ( ( ( $true
=> p(V0t) )
<=> p(V0t) )
& ( ( p(V0t)
=> $true )
<=> $true )
& ( ( $false
=> p(V0t) )
<=> $true )
& ( ( p(V0t)
=> p(V0t) )
<=> $true )
& ( ( p(V0t)
=> $false )
<=> ~ p(V0t) ) ) ) ).
fof(conj_thm_2Ebool_2ENOT__CLAUSES,axiom,
( ! [V0t] :
( mem(V0t,bool)
=> ( ~ ~ p(V0t)
<=> p(V0t) ) )
& ( ~ $true
<=> $false )
& ( ~ $false
<=> $true ) ) ).
fof(conj_thm_2Ebool_2EREFL__CLAUSE,axiom,
! [A_27a] :
( ne(A_27a)
=> ! [V0x] :
( mem(V0x,A_27a)
=> ( V0x = V0x
<=> $true ) ) ) ).
fof(conj_thm_2Ebool_2EEQ__CLAUSES,axiom,
! [V0t] :
( mem(V0t,bool)
=> ( ( ( $true
<=> p(V0t) )
<=> p(V0t) )
& ( ( p(V0t)
<=> $true )
<=> p(V0t) )
& ( ( $false
<=> p(V0t) )
<=> ~ p(V0t) )
& ( ( p(V0t)
<=> $false )
<=> ~ p(V0t) ) ) ) ).
fof(conj_thm_2Ecardinal_2ECARD__LE__TOTAL,axiom,
! [A_27a] :
( ne(A_27a)
=> ! [A_27b] :
( ne(A_27b)
=> ! [V0s] :
( mem(V0s,arr(A_27a,bool))
=> ! [V1t] :
( mem(V1t,arr(A_27b,bool))
=> ( p(ap(ap(c_2Ecardinal_2Ecardleq(A_27a,A_27b),V0s),V1t))
| p(ap(ap(c_2Ecardinal_2Ecardleq(A_27b,A_27a),V1t),V0s)) ) ) ) ) ) ).
fof(conj_thm_2Esat_2ENOT__NOT,axiom,
! [V0t] :
( mem(V0t,bool)
=> ( ~ ~ p(V0t)
<=> p(V0t) ) ) ).
fof(conj_thm_2Esat_2EAND__INV__IMP,axiom,
! [V0A] :
( mem(V0A,bool)
=> ( p(V0A)
=> ( ~ p(V0A)
=> $false ) ) ) ).
fof(conj_thm_2Esat_2EOR__DUAL2,axiom,
! [V0A] :
( mem(V0A,bool)
=> ! [V1B] :
( mem(V1B,bool)
=> ( ( ~ ( p(V0A)
| p(V1B) )
=> $false )
<=> ( ( p(V0A)
=> $false )
=> ( ~ p(V1B)
=> $false ) ) ) ) ) ).
fof(conj_thm_2Esat_2EOR__DUAL3,axiom,
! [V0A] :
( mem(V0A,bool)
=> ! [V1B] :
( mem(V1B,bool)
=> ( ( ~ ( ~ p(V0A)
| p(V1B) )
=> $false )
<=> ( p(V0A)
=> ( ~ p(V1B)
=> $false ) ) ) ) ) ).
fof(conj_thm_2Esat_2EAND__INV2,axiom,
! [V0A] :
( mem(V0A,bool)
=> ( ( ~ p(V0A)
=> $false )
=> ( ( p(V0A)
=> $false )
=> $false ) ) ) ).
fof(conj_thm_2Esat_2Edc__eq,axiom,
! [V0p] :
( mem(V0p,bool)
=> ! [V1q] :
( mem(V1q,bool)
=> ! [V2r] :
( mem(V2r,bool)
=> ( ( p(V0p)
<=> ( p(V1q)
<=> p(V2r) ) )
<=> ( ( p(V0p)
| p(V1q)
| p(V2r) )
& ( p(V0p)
| ~ p(V2r)
| ~ p(V1q) )
& ( p(V1q)
| ~ p(V2r)
| ~ p(V0p) )
& ( p(V2r)
| ~ p(V1q)
| ~ p(V0p) ) ) ) ) ) ) ).
fof(conj_thm_2Esat_2Edc__neg,axiom,
! [V0p] :
( mem(V0p,bool)
=> ! [V1q] :
( mem(V1q,bool)
=> ( ( p(V0p)
<=> ~ p(V1q) )
<=> ( ( p(V0p)
| p(V1q) )
& ( ~ p(V1q)
| ~ p(V0p) ) ) ) ) ) ).
fof(conj_thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
! [A_27a] :
( ne(A_27a)
=> ! [A_27b] :
( ne(A_27b)
=> ! [V0s] :
( mem(V0s,arr(A_27a,bool))
=> ! [V1t] :
( mem(V1t,arr(A_27b,bool))
=> ( ~ p(ap(ap(c_2Ecardinal_2Ecardleq(A_27a,A_27b),V0s),V1t))
<=> ~ p(ap(ap(c_2Ecardinal_2Ecardleq(A_27a,A_27b),V0s),V1t)) ) ) ) ) ) ).
%------------------------------------------------------------------------------