predicates([<]).


:-option(special_relations(off)).
:-sama([2]). % positive strategy

% These two flag settings cause Saturate
% to behave as if chaining did not have any
% ordering restrictions: we basically hyperresolve
% with the facts into the transitivity axiom for <.
% This takes about 100 times longer to saturate
% than with ordered chaining (cf. examples oc15).
% In general, unordered chaining will be of
% the complexity O(n^3) on this type of example
% whereas ordered chaining will perform linearly
% with *any* choice of the reduction ordering.

X<Y, Y<Z -> X<Z.

1<2.
2<3.
3<4.
4<5.
5<6.
6<7.
7<8.
8<9.
9<10.
10<11.
11<12.
12<13.
13<14.
14<15.

% 1<15 -> [].


first_predicate_precedence([<]).
precedence( [1,7,2,6,3,9,4,10,5,12,13,11,14,15,8] ).  % random
:-satp(all).