TPTP Problem File: FLD030-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : FLD030-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% Domain : Field Theory (Ordered fields)
% Problem : Compatibility of multiplication and equality relation
% Version : [Dra93] axioms : Especial.
% Theorem formulation : Functional with glxx axiom set.
% English :
% Refs : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% Source : [Dra93]
% Names :
% Status : Unsatisfiable
% Rating : 0.00 v5.5.0, 0.12 v5.4.0, 0.10 v5.2.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.1, 0.20 v4.0.0, 0.14 v3.4.0, 0.25 v3.3.0, 0.33 v3.1.0, 0.17 v2.7.0, 0.00 v2.6.0, 0.33 v2.5.0, 0.00 v2.4.0, 0.00 v2.3.0, 0.33 v2.2.1, 0.00 v2.1.0
% Syntax : Number of clauses : 32 ( 8 unt; 3 nHn; 32 RR)
% Number of literals : 78 ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% SPC : CNF_UNS_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(d_is_defined,hypothesis,
defined(d) ).
cnf(a_equals_d_4,negated_conjecture,
equalish(a,d) ).
cnf(multiply_not_equal_to_multiply_5,negated_conjecture,
~ equalish(multiply(d,b),multiply(a,b)) ).
%--------------------------------------------------------------------------