TPTP Problem File: FLD067-2.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : FLD067-2 : TPTP v9.0.0. Bugfixed v2.1.0.
% Domain : Field Theory (Ordered fields)
% Problem : Side change in an order relation, part 1
% Version : [Dra93] axioms : Especial.
% Theorem formulation : Relational with glxx axiom set.
% English :
% Refs : [Dra93] Draeger (1993), Anwendung des Theorembeweisers SETHEO
% Source : [Dra93]
% Names :
% Status : Unsatisfiable
% Rating : 0.27 v9.0.0, 0.08 v8.2.0, 0.14 v7.5.0, 0.17 v7.1.0, 0.50 v7.0.0, 0.12 v6.4.0, 0.25 v6.3.0, 0.14 v6.2.0, 0.22 v6.1.0, 0.29 v5.5.0, 0.38 v5.4.0, 0.40 v5.2.0, 0.20 v5.1.0, 0.27 v5.0.0, 0.43 v4.1.0, 0.25 v4.0.1, 0.20 v4.0.0, 0.29 v3.4.0, 0.25 v3.3.0, 0.33 v2.7.0, 0.12 v2.6.0, 0.33 v2.5.0, 0.20 v2.4.0, 0.40 v2.3.0, 0.67 v2.2.1, 0.67 v2.1.0
% Syntax : Number of clauses : 33 ( 9 unt; 3 nHn; 33 RR)
% Number of literals : 79 ( 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(u_is_defined,hypothesis,
defined(u) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b) ).
cnf(add_equals_u_5,negated_conjecture,
equalish(add(b,additive_inverse(a)),u) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(additive_identity,u) ).
%--------------------------------------------------------------------------