1 include "logic/equality.ma".
3 (* Inclusion of: SYN305-1.p *)
5 (* -------------------------------------------------------------------------- *)
7 (* File : SYN305-1 : TPTP v3.7.0. Released v1.2.0. *)
9 (* Domain : Syntactic *)
11 (* Problem : Problem for testing satisfiability *)
13 (* Version : Especial. *)
17 (* Refs : [BCP94] Bourely et al. (1994), A Method for Building Models Au *)
19 (* Source : [BCP94] *)
21 (* Names : Example 3 [BCP94] *)
23 (* Status : Satisfiable *)
25 (* Rating : 0.67 v2.4.0, 0.33 v2.2.1, 0.25 v2.2.0, 0.67 v2.1.0, 0.00 v2.0.0 *)
27 (* Syntax : Number of clauses : 3 ( 0 non-Horn; 3 unit; 1 RR) *)
29 (* Number of atoms : 3 ( 3 equality) *)
31 (* Maximal clause size : 1 ( 1 average) *)
33 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
35 (* Number of functors : 3 ( 0 constant; 1-1 arity) *)
37 (* Number of variables : 3 ( 0 singleton) *)
39 (* Maximal term depth : 3 ( 2 average) *)
43 (* -------------------------------------------------------------------------- *)
49 ∀H0:∀X:Univ.eq Univ (f (g2 X)) X.
50 ∀H1:∀X:Univ.eq Univ (f (g1 X)) X.∃X:Univ.eq Univ (g1 X) (g2 X))
59 napply (ex_intro ? ? ? ?) ##[
63 ntry (nassumption) ##;
66 (* -------------------------------------------------------------------------- *)