TPTP Problem File: BOO006-4.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : BOO006-4 : TPTP v8.2.0. Released v1.1.0.
% Domain : Boolean Algebra
% Problem : Multiplication is bounded (X * 0 = 0)
% Version : [Ver94] (equality) axioms.
% English :
% Refs : [Ver94] Veroff (1994), Problem Set
% Source : [Ver94]
% Names : TB [Ver94]
% Status : Unsatisfiable
% Rating : 0.05 v8.2.0, 0.04 v8.1.0, 0.10 v7.5.0, 0.08 v7.4.0, 0.13 v7.3.0, 0.11 v7.1.0, 0.06 v7.0.0, 0.11 v6.4.0, 0.16 v6.3.0, 0.12 v6.2.0, 0.14 v6.1.0, 0.12 v6.0.0, 0.24 v5.5.0, 0.21 v5.4.0, 0.00 v5.1.0, 0.13 v5.0.0, 0.07 v4.1.0, 0.09 v4.0.1, 0.07 v4.0.0, 0.08 v3.7.0, 0.00 v2.1.0, 0.13 v2.0.0
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 1 RR)
% Number of literals : 9 ( 9 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% SPC : CNF_UNS_RFO_PEQ_UEQ
% Comments :
%--------------------------------------------------------------------------
%----Include boolean algebra axioms for equality formulation
include('Axioms/BOO004-0.ax').
%--------------------------------------------------------------------------
cnf(prove_right_identity,negated_conjecture,
multiply(a,additive_identity) != additive_identity ).
%--------------------------------------------------------------------------