TPTP Problem File: FLD081-3.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : FLD081-3 : TPTP v9.0.0. Bugfixed v2.1.0.
% Domain : Field Theory (Ordered fields)
% Problem : Two-sided multiplication of two order relations
% Version : [Dra93] axioms : Especial.
% Theorem formulation : Functional with re 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 : 35 ( 12 unt; 3 nHn; 35 RR)
% Number of literals : 86 ( 0 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 4 usr; 0 prp; 1-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% SPC : CNF_UNK_RFO_NEQ_NHN
% Comments :
% Bugfixes : v2.1.0 - Bugfix in FLD002-0.ax
%--------------------------------------------------------------------------
include('Axioms/FLD002-0.ax').
%--------------------------------------------------------------------------
cnf(a_is_defined,hypothesis,
defined(a) ).
cnf(b_is_defined,hypothesis,
defined(b) ).
cnf(c_is_defined,hypothesis,
defined(c) ).
cnf(d_is_defined,hypothesis,
defined(d) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,a) ).
cnf(less_or_equal_6,negated_conjecture,
less_or_equal(a,b) ).
cnf(less_or_equal_7,negated_conjecture,
less_or_equal(additive_identity,c) ).
cnf(less_or_equal_8,negated_conjecture,
less_or_equal(c,d) ).
cnf(not_less_or_equal_9,negated_conjecture,
~ less_or_equal(multiply(a,c),multiply(d,b)) ).
%--------------------------------------------------------------------------