TPTP Problem File: MGT076+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Domain : Management
% Problem : [800,infinity) [400,infinity): higher lower-bound subsumes
% Version : Especial.
% English : width gteq 800 => [800, infinity)
% width gteq 400 => [400, infinity)
% [800, infinity) subseteq [400, infinity)
% since less(v400, v800) => ∀X. X>=800 => X>=400.
% Refs : [MC+26] Mustafa et al. (2026), Axis Decomposition for ODRL
% Source : [MC+26]
% Names : ODRL311-1.p [MC+26]
% Status : Theorem
% Rating : ? v9.3.1
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 88 ( 26 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 63 ( 10 ~; 9 |; 23 &)
% ( 8 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 0 prp; 1-4 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 58 ( 56 !; 2 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Requires MGT002+0.ax + MGT002+2.ax.
% Bugfixes : v9.3.1 - $distinct expanded to inequalities.
%--------------------------------------------------------------------------
include('Axioms/MGT002+0.ax').
include('Axioms/MGT002+2.ax').
%--------------------------------------------------------------------------
%----Named constants and ordering
%----v0 = domain lower bound (excluded); v400, v800 = constraint values
fof(val_v0,axiom,
val(v0) ).
fof(val_v400,axiom,
val(v400) ).
fof(val_v800,axiom,
val(v800) ).
fof(ord_v0_v400,axiom,
less(v0,v400) ).
fof(ord_v0_v800,axiom,
less(v0,v800) ).
fof(ord_v400_v800,axiom,
less(v400,v800) ).
fof(distinct,axiom,
( v0 != v400
& v0 != v800
& v400 != v800 ) ).
fof(odrl311,conjecture,
! [X] :
( leq(v800,X)
=> leq(v400,X) ) ).
%--------------------------------------------------------------------------