| 1 |
%-------------------------------------------------------------------------- |
| 2 |
% File : BOO004-0 : TPTP v5.5.0. Released v1.0.0. |
| 3 |
% Domain : Boolean Algebra |
| 4 |
% Axioms : Boolean algebra (equality) axioms |
| 5 |
% Version : [Ver94] (equality) axioms. |
| 6 |
% English : |
| 7 |
|
| 8 |
% Refs : [Ver94] Veroff (1994), Problem Set |
| 9 |
% Source : [Ver94] |
| 10 |
% Names : |
| 11 |
|
| 12 |
% Status : Satisfiable |
| 13 |
% Syntax : Number of clauses : 8 ( 0 non-Horn; 8 unit; 0 RR) |
| 14 |
% Number of atoms : 8 ( 8 equality) |
| 15 |
% Maximal clause size : 1 ( 1 average) |
| 16 |
% Number of predicates : 1 ( 0 propositional; 2-2 arity) |
| 17 |
% Number of functors : 5 ( 2 constant; 0-2 arity) |
| 18 |
% Number of variables : 14 ( 0 set.singleton) |
| 19 |
% Maximal term depth : 3 ( 2 average) |
| 20 |
% SPC : |
| 21 |
|
| 22 |
% Comments : |
| 23 |
%-------------------------------------------------------------------------- |
| 24 |
cnf(commutativity_of_add,axiom, |
| 25 |
( add(X,Y) = add(Y,X) )). |
| 26 |
|
| 27 |
cnf(commutativity_of_multiply,axiom, |
| 28 |
( multiply(X,Y) = multiply(Y,X) )). |
| 29 |
|
| 30 |
cnf(distributivity1,axiom, |
| 31 |
( add(X,multiply(Y,Z)) = multiply(add(X,Y),add(X,Z)) )). |
| 32 |
|
| 33 |
cnf(distributivity2,axiom, |
| 34 |
( multiply(X,add(Y,Z)) = add(multiply(X,Y),multiply(X,Z)) )). |
| 35 |
|
| 36 |
cnf(additive_id1,axiom, |
| 37 |
( add(X,additive_identity) = X )). |
| 38 |
|
| 39 |
cnf(multiplicative_id1,axiom, |
| 40 |
( multiply(X,multiplicative_identity) = X )). |
| 41 |
|
| 42 |
cnf(additive_inverse1,axiom, |
| 43 |
( add(X,inverse(X)) = multiplicative_identity )). |
| 44 |
|
| 45 |
cnf(multiplicative_inverse1,axiom, |
| 46 |
( multiply(X,inverse(X)) = additive_identity )). |
| 47 |
|
| 48 |
%-------------------------------------------------------------------------- |