TPTP Problem File: MGT106+1.p

View Solutions - Solve Problem

%--------------------------------------------------------------------------
% File     : MGT106+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Domain   : Management
% Problem  : intra-policy Box2D: width lteq 600 AND gteq 800 empty
% Version  : Especial.
% English  : width (0,600] intersection [800,infinity) = null.
%            Single policy asserts width =< 600 AND >= 800 simultaneously.
%            Contradiction via fresh witness w: in_lopen(w,v0,v600) forces
%            leq(w,v600), and leq(v800,w) with less(v600,v800) gives 
%            less(w,v800) and less(v800,w) - irreflexivity closes the
%            proof.

% Refs     : [MC+26] Mustafa et al. (2026), Axis Decomposition for ODRL
% Source   : [MC+26]
% Names    : ODRL765-1.p [MC+26]

% Status   : Unsatisfiable
% Rating   : ? v9.3.1
% Syntax   : Number of formulae    :   36 (  15 unt;   0 def)
%            Number of atoms       :   88 (  26 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   62 (  10   ~;   9   |;  23   &)
%                                         (   8 <=>;  12  =>;   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    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   57 (  55   !;   2   ?)
% SPC      : FOF_UNS_RFO_SEQ

% Comments : intra-policy self-contradiction.
% Bugfixes : v9.3.1 - $distinct expanded to inequalities.
%--------------------------------------------------------------------------
include('Axioms/MGT002+0.ax').
include('Axioms/MGT002+2.ax').
%--------------------------------------------------------------------------
%----Named constants and ordering 
fof(val_v0,axiom,
    val(v0) ).

fof(val_v600,axiom,
    val(v600) ).

fof(val_v800,axiom,
    val(v800) ).

fof(ord_v0_v600,axiom,
    less(v0,v600) ).

fof(ord_v600_v800,axiom,
    less(v600,v800) ).

fof(distinct,axiom,
    ( v0 != v600
    & v0 != v800
    & v600 != v800 ) ).

fof(wit_val,axiom,
    val(w) ).

fof(wit_in_lopen,axiom,
    in_lopen(w,v0,v600) ).

fof(wit_leq,axiom,
    leq(v800,w) ).

%----No conjecture - contradiction in axioms 
%--------------------------------------------------------------------------