2 include "logic/equality.ma".
3 (* Inclusion of: LCL112-2.p *)
4 (* -------------------------------------------------------------------------- *)
5 (* File : LCL112-2 : TPTP v3.1.1. Released v1.0.0. *)
6 (* Domain : Logic Calculi (Many valued sentential) *)
7 (* Problem : MV-29 depends on the Meredith system *)
8 (* Version : [McC92] axioms. *)
9 (* Theorem formulation : Wajsberg algebra formulation *)
10 (* English : An axiomatisation of the many valued sentential calculus *)
11 (* is {MV-1,MV-2,MV-3,MV-5} by Meredith. Wajsberg presented *)
12 (* an equality axiomatisation. Show that MV-29 depends on the *)
13 (* Wajsberg axiomatisation. *)
14 (* Refs : [FRT84] Font et al. (1984), Wajsberg Algebras *)
15 (* : [MW92] McCune & Wos (1992), Experiments in Automated Deductio *)
16 (* : [LW92] Lusk & Wos (1992), Benchmark Problems in Which Equalit *)
17 (* : [McC92] McCune (1992), Email to G. Sutcliffe *)
18 (* Source : [McC92] *)
19 (* Names : MV1.2 [LW92] *)
20 (* Status : Unsatisfiable *)
21 (* Rating : 0.00 v2.2.1, 0.22 v2.2.0, 0.29 v2.1.0, 0.25 v2.0.0 *)
22 (* Syntax : Number of clauses : 5 ( 0 non-Horn; 5 unit; 1 RR) *)
23 (* Number of atoms : 5 ( 5 equality) *)
24 (* Maximal clause size : 1 ( 1 average) *)
25 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
26 (* Number of functors : 4 ( 2 constant; 0-2 arity) *)
27 (* Number of variables : 8 ( 0 singleton) *)
28 (* Maximal term depth : 4 ( 2 average) *)
30 (* -------------------------------------------------------------------------- *)
31 (* ----Include Wajsberg algebra axioms *)
32 (* Inclusion of: Axioms/LCL001-0.ax *)
33 (* -------------------------------------------------------------------------- *)
34 (* File : LCL001-0 : TPTP v3.1.1. Released v1.0.0. *)
35 (* Domain : Logic Calculi (Wajsberg Algebras) *)
36 (* Axioms : Wajsberg algebra axioms *)
37 (* Version : [Bon91] (equality) axioms. *)
39 (* Refs : [FRT84] Font et al. (1984), Wajsberg Algebras *)
40 (* : [Bon91] Bonacina (1991), Problems in Lukasiewicz Logic *)
41 (* : [MW92] McCune & Wos (1992), Experiments in Automated Deductio *)
43 (* Names : MV Sentential Calculus [MW92] *)
45 (* Syntax : Number of clauses : 4 ( 0 non-Horn; 4 unit; 0 RR) *)
46 (* Number of literals : 4 ( 4 equality) *)
47 (* Maximal clause size : 1 ( 1 average) *)
48 (* Number of predicates : 1 ( 0 propositional; 2-2 arity) *)
49 (* Number of functors : 3 ( 1 constant; 0-2 arity) *)
50 (* Number of variables : 8 ( 0 singleton) *)
51 (* Maximal term depth : 4 ( 2 average) *)
53 (* -------------------------------------------------------------------------- *)
54 (* -------------------------------------------------------------------------- *)
55 (* -------------------------------------------------------------------------- *)
58 \forall implies:\forall _:Univ.\forall _:Univ.Univ.
59 \forall not:\forall _:Univ.Univ.
62 \forall H0:\forall X:Univ.\forall Y:Univ.eq Univ (implies (implies (not X) (not Y)) (implies Y X)) truth.
63 \forall H1:\forall X:Univ.\forall Y:Univ.eq Univ (implies (implies X Y) Y) (implies (implies Y X) X).
64 \forall H2:\forall X:Univ.\forall Y:Univ.\forall Z:Univ.eq Univ (implies (implies X Y) (implies (implies Y Z) (implies X Z))) truth.
65 \forall H3:\forall X:Univ.eq Univ (implies truth X) X.eq Univ (implies x (not (not x))) truth
68 autobatch paramodulation timeout=100;
72 (* -------------------------------------------------------------------------- *)