1 set "baseuri" "cic:/matita/TPTP/COL083-1".
2 include "logic/equality.ma".
3 (* Inclusion of: COL083-1.p *)
4 (* -------------------------------------------------------------------------- *)
5 (* File : COL083-1 : TPTP v3.1.1. Released v2.6.0. *)
6 (* Domain : Combinatory Logic *)
7 (* Problem : Compatible Birds, part 1 *)
8 (* Version : Especial. *)
10 (* Refs : [Smu85] Smullyan (1978), To Mock a Mocking Bird and Other Logi *)
13 (* Status : Unsatisfiable *)
14 (* Rating : 0.00 v2.6.0 *)
15 (* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 1 RR) *)
16 (* Number of atoms : 3 ( 3 equality) *)
17 (* Maximal clause size : 1 ( 1 average) *)
18 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
19 (* Number of functors : 4 ( 2 constant; 0-2 arity) *)
20 (* Number of variables : 6 ( 2 singleton) *)
21 (* Maximal term depth : 3 ( 2 average) *)
22 (* Comments : A UEQ part of COL054-1 *)
23 (* -------------------------------------------------------------------------- *)
24 theorem prove_birds_are_compatible_1:
27 \forall compose:\forall _:Univ.\forall _:Univ.Univ.
28 \forall mocking_bird:Univ.
29 \forall response:\forall _:Univ.\forall _:Univ.Univ.
30 \forall H0:\forall A:Univ.\forall B:Univ.\forall C:Univ.eq Univ (response (compose A B) C) (response A (response B C)).
31 \forall H1:\forall A:Univ.eq Univ (response mocking_bird A) (response A A).\exist A:Univ.\exist B:Univ.eq Univ (response a A) B
38 autobatch paramodulation timeout=100.
46 (* -------------------------------------------------------------------------- *)