TPTP Problem File: FLD044-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : FLD044-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% Domain : Field Theory (Ordered fields)
% Problem : Compatibility of multiplication and additive inverses
% Version : [Dra93] axioms : Especial.
% Theorem formulation : Functional with glxx axiom set.
% English :
% Refs : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% Source : [Dra93]
% Names :
% Status : Unknown
% Rating : 1.00 v2.1.0
% Syntax : Number of clauses : 30 ( 6 unt; 3 nHn; 30 RR)
% Number of literals : 76 ( 0 equ; 45 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% SPC : CNF_UNK_RFO_NEQ_NHN
% Comments :
% Bugfixes : v2.1.0 - Bugfix in FLD001-0.ax
%--------------------------------------------------------------------------
include('Axioms/FLD001-0.ax').
%--------------------------------------------------------------------------
cnf(a_is_defined,hypothesis,
defined(a) ).
cnf(b_is_defined,hypothesis,
defined(b) ).
cnf(multiply_not_equal_to_additive_inverse_3,negated_conjecture,
~ equalish(multiply(additive_inverse(a),b),additive_inverse(multiply(a,b))) ).
%--------------------------------------------------------------------------