let compute_One_2 subgraph (s,t) str =
  let subgraph =
    GraphInnermost.Dp_graph.fold_vertex
    (fun v l ->
      (GraphInnermost.Dp_graph.V.label v) :: l
    )
    subgraph
    []
  in
  let uts = ut_component ((s,t)::subgraph) in
  let constraints =
    List.map
      (fun (s,t) ->
            Printf.sprintf
              "\t%s >= %s"
              (Debug.pprint_term s)
              (Debug.pprint_term t)
      )
      subgraph
  in
  let conj = Util.string_of_strlist constraints "/\\ " in
   let uts_constraints =
      List.map
        (fun (s,t) ->
              Printf.sprintf
                "\t%s >= %s"
                (Debug.pprint_term s)
                (Debug.pprint_term t)
        )
        (RuleSet.elements uts)
    in
    let uts_conj = Util.string_of_strlist uts_constraints "/\\ " in
    Printf.sprintf
      "(ordering_solve (order_constraints %s_algebra \"%s\"))"
      str
      (Util.string_of_strlist
        [conj; uts_conj;
          Printf.sprintf "%s > %s" (Debug.pprint_term s) (Debug.pprint_term t)]
        "/\\"
      )