%==============================================================================
% Project:    SLP - An Interpreter for Super Logic Programs / Static Semantics
% Module:     testC.txt
% Purpose:    This is a test for positive reduction
% Last Change:13.10.2001
% Language:   SLP
% Author:     Stefan Brass
% Email:      Stefan.Brass@informatik.uni-giessen.de, sbrass@sis.pitt.edu
% Address:    Universitaet Giessen, Arndtstr. 2, 35392 Giessen, Germany
% Copyright:  (c) 2001 by Stefan Brass
% Licence:    Distributed under the conditions of the GNU Public Licence.
%==============================================================================

% This is a test for positive reduction.

q :- not p.
r :- not s.
t :- not(s & u).
p | q | w.
p | q.
r | x.

% s and u do not appear in any rule head.
% w does not appear at all in the program after the elimination of nonminimal
% conditional facts.

% The result should be:
%	q :- not p.
%	t :- not(s & u).
%	p | q.
%	r.

$v.