TPTP Problem File: MGT071+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : MGT071+1 : TPTP v9.3.1. Released v9.3.0.
% Domain : Management
% Problem : Conflict verdict implies no joint witness
% Version : Especial.
% English : If axis_conflict holds for two closed intervals then no
% value belongs to both. Establishes Conflict is never a false
% positive (prop:no-false-verdict, Conflict direction).
% Refs : [MC+26] Mustafa et al. (2026), Axis Decomposition for ODRL
% Source : [MC+26]
% Names : NFV001+1.p [MC+26]
% Status : Theorem
% Rating : 0.04 v9.3.0
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 110 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 77 ( 8 ~; 10 |; 30 &)
% ( 17 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 0 prp; 1-9 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 103 ( 100 !; 3 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Hard tier - prop:no-false-verdict Conflict direction.
% : axis_conflict given as hypothesis; prover derives emptiness.
%--------------------------------------------------------------------------
include('Axioms/MGT002+0.ax').
include('Axioms/MGT002+2.ax').
include('Axioms/MGT002+6.ax').
%--------------------------------------------------------------------------
%----Domain constants: n0 < n5 < n10 < n15
fof(order_0_5,hypothesis,
less(n0,n5) ).
fof(order_5_10,hypothesis,
less(n5,n10) ).
fof(order_10_15,hypothesis,
less(n10,n15) ).
%----The two intervals [n0,n5] and [n10,n15] are disjoint on this axis.
%----axis_conflict is defined in AXIS000 Section B as the absence of a
%----shared witness; we assert it here directly as a ground hypothesis to
%----exercise the no-false-verdict claim independently of the criterion
%---- proof.
fof(conflict_hyp,hypothesis,
axis_conflict(n0,n5,n10,n15) ).
%----Conjecture: no value lies in both intervals.
%----Conflict => no request simultaneously satisfies both constraint sets.
fof(no_false_conflict,conjecture,
~ ? [X] :
( in_closed(X,n0,n5)
& in_closed(X,n10,n15) ) ).
%--------------------------------------------------------------------------