2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 (* $Id: orderings.ml 9869 2009-06-11 22:52:38Z denes $ *)
21 (t Terms.bag * int * t Terms.substitution * int list) list
24 | Timeout of int * t Terms.bag
25 type bag = t Terms.bag * int
26 val empty_state : state
27 val size_of_state : state -> int * int
28 val bag_of_state :state -> bag
29 val replace_bag : state -> bag -> state
30 (* we suppose input has been already saturated *)
31 val mk_passive : bag -> input * input -> bag * t Terms.unit_clause
32 val mk_goal : bag -> input * input -> bag * t Terms.unit_clause
33 val forward_infer_step :
35 t Terms.unit_clause ->
49 g_passives:t Terms.unit_clause list ->
50 passives:t Terms.unit_clause list -> szsontology
52 state -> input* input -> szsontology
54 state -> input* input -> szsontology
64 module Paramod ( B : Orderings.Blob ) : Paramod
65 with type t = B.t and type input = B.input