1 include "logic/equality.ma".
3 (* Inclusion of: LCL112-2.p *)
5 (* -------------------------------------------------------------------------- *)
7 (* File : LCL112-2 : TPTP v3.7.0. Released v1.0.0. *)
9 (* Domain : Logic Calculi (Many valued sentential) *)
11 (* Problem : MV-29 depends on the Meredith system *)
13 (* Version : [McC92] axioms. *)
15 (* Theorem formulation : Wajsberg algebra formulation *)
17 (* English : An axiomatisation of the many valued sentential calculus *)
19 (* is {MV-1,MV-2,MV-3,MV-5} by Meredith. Wajsberg presented *)
21 (* an equality axiomatisation. Show that MV-29 depends on the *)
23 (* Wajsberg axiomatisation. *)
25 (* Refs : [FRT84] Font et al. (1984), Wajsberg Algebras *)
27 (* : [MW92] McCune & Wos (1992), Experiments in Automated Deductio *)
29 (* : [LW92] Lusk & Wos (1992), Benchmark Problems in Which Equalit *)
31 (* : [McC92] McCune (1992), Email to G. Sutcliffe *)
33 (* Source : [McC92] *)
35 (* Names : MV1.2 [LW92] *)
37 (* Status : Unsatisfiable *)
39 (* Rating : 0.00 v2.2.1, 0.22 v2.2.0, 0.29 v2.1.0, 0.25 v2.0.0 *)
41 (* Syntax : Number of clauses : 5 ( 0 non-Horn; 5 unit; 1 RR) *)
43 (* Number of atoms : 5 ( 5 equality) *)
45 (* Maximal clause size : 1 ( 1 average) *)
47 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
49 (* Number of functors : 4 ( 2 constant; 0-2 arity) *)
51 (* Number of variables : 8 ( 0 singleton) *)
53 (* Maximal term depth : 4 ( 2 average) *)
57 (* -------------------------------------------------------------------------- *)
59 (* ----Include Wajsberg algebra axioms *)
61 (* Inclusion of: Axioms/LCL001-0.ax *)
63 (* -------------------------------------------------------------------------- *)
65 (* File : LCL001-0 : TPTP v3.7.0. Released v1.0.0. *)
67 (* Domain : Logic Calculi (Wajsberg Algebras) *)
69 (* Axioms : Wajsberg algebra axioms *)
71 (* Version : [Bon91] (equality) axioms. *)
75 (* Refs : [FRT84] Font et al. (1984), Wajsberg Algebras *)
77 (* : [Bon91] Bonacina (1991), Problems in Lukasiewicz Logic *)
79 (* : [MW92] McCune & Wos (1992), Experiments in Automated Deductio *)
83 (* Names : MV Sentential Calculus [MW92] *)
87 (* Syntax : Number of clauses : 4 ( 0 non-Horn; 4 unit; 0 RR) *)
89 (* Number of atoms : 4 ( 4 equality) *)
91 (* Maximal clause size : 1 ( 1 average) *)
93 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
95 (* Number of functors : 3 ( 1 constant; 0-2 arity) *)
97 (* Number of variables : 8 ( 0 singleton) *)
99 (* Maximal term depth : 4 ( 2 average) *)
103 (* -------------------------------------------------------------------------- *)
105 (* -------------------------------------------------------------------------- *)
107 (* -------------------------------------------------------------------------- *)
108 ntheorem prove_mv_29:
109 (∀Univ:Type.∀X:Univ.∀Y:Univ.∀Z:Univ.
110 ∀implies:∀_:Univ.∀_:Univ.Univ.
114 ∀H0:∀X:Univ.∀Y:Univ.eq Univ (implies (implies (not X) (not Y)) (implies Y X)) truth.
115 ∀H1:∀X:Univ.∀Y:Univ.eq Univ (implies (implies X Y) Y) (implies (implies Y X) X).
116 ∀H2:∀X:Univ.∀Y:Univ.∀Z:Univ.eq Univ (implies (implies X Y) (implies (implies Y Z) (implies X Z))) truth.
117 ∀H3:∀X:Univ.eq Univ (implies truth X) X.eq Univ (implies x (not (not x))) truth)
131 nauto by H0,H1,H2,H3 ##;
132 ntry (nassumption) ##;
135 (* -------------------------------------------------------------------------- *)