Une nouvelle version du portail de gestion des comptes externes sera mise en production lundi 09 août. Elle permettra d'allonger la validité d'un compte externe jusqu'à 3 ans. Pour plus de détails sur cette version consulter : https://doc-si.inria.fr/x/FCeS

Commit 74208e03 authored by MARCHE Claude's avatar MARCHE Claude
Browse files

upgrade provers in (part of) the sessions

parent a0c76576
......@@ -3,16 +3,16 @@
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="CVC3" version="2.4.1" timelimit="5" memlimit="1000"/>
<prover id="1" name="Alt-Ergo" version="0.95.1" timelimit="5" memlimit="1000"/>
<prover id="2" name="Z3" version="3.2" timelimit="5" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="0.99.1" timelimit="5" memlimit="1000"/>
<file name="../add_list.mlw" expanded="true">
<theory name="SumList" sum="d41d8cd98f00b204e9800998ecf8427e">
</theory>
<theory name="AddListRec" sum="d67dc47228a231353998af4e0d24050a" expanded="true">
<goal name="WP_parameter sum" expl="VC for sum" expanded="true">
<proof prover="0"><result status="valid" time="0.01"/></proof>
<proof prover="1"><result status="valid" time="0.02"/></proof>
<proof prover="2"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="51"/></proof>
</goal>
<goal name="WP_parameter main" expl="VC for main" expanded="true">
<proof prover="0"><result status="valid" time="0.02"/></proof>
......
......@@ -2,9 +2,9 @@
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Alt-Ergo" version="0.95.1" timelimit="5" memlimit="0"/>
<prover id="1" name="Z3" version="3.2" timelimit="5" memlimit="1000"/>
<prover id="2" name="Alt-Ergo" version="0.95.2" timelimit="5" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="0.99.1" timelimit="5" memlimit="0"/>
<file name="../arm.mlw" expanded="true">
<theory name="M" sum="d97450a6c255beed8bf40f7d503e79cd" expanded="true">
<goal name="WP_parameter insertion_sort" expl="VC for insertion_sort">
......@@ -37,7 +37,7 @@
<proof prover="2"><result status="valid" time="0.02" steps="22"/></proof>
</goal>
<goal name="WP_parameter insertion_sort.10" expl="10. loop invariant preservation">
<proof prover="2"><result status="valid" time="1.14" steps="80"/></proof>
<proof prover="2"><result status="valid" time="1.65" steps="80"/></proof>
</goal>
<goal name="WP_parameter insertion_sort.11" expl="11. loop variant decrease">
<proof prover="2"><result status="valid" time="0.02" steps="24"/></proof>
......@@ -61,11 +61,11 @@
</theory>
<theory name="InsertionSortExample" sum="035a2f3e51417e24f6e447e2c9f5b21b" expanded="true">
<goal name="WP_parameter path_init_l2" expl="VC for path_init_l2">
<proof prover="0" memlimit="1000"><result status="valid" time="0.02" steps="19"/></proof>
<proof prover="1"><result status="valid" time="0.14"/></proof>
<proof prover="3" memlimit="1000"><result status="valid" time="0.02" steps="17"/></proof>
</goal>
<goal name="WP_parameter path_l2_exit" expl="VC for path_l2_exit">
<proof prover="0" timelimit="10"><result status="valid" time="0.01" steps="9"/></proof>
<proof prover="3" timelimit="10"><result status="valid" time="0.01" steps="10"/></proof>
</goal>
</theory>
</file>
......
......@@ -3,11 +3,11 @@
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="CVC3" version="2.4.1" timelimit="10" memlimit="0"/>
<prover id="1" name="Alt-Ergo" version="0.95.1" timelimit="10" memlimit="0"/>
<prover id="2" name="Alt-Ergo" version="0.99.1" timelimit="10" memlimit="0"/>
<file name="../assigning_meanings_to_programs.mlw">
<theory name="Sum" sum="de5b5ac815e310c038a383137b72227a" expanded="true">
<goal name="WP_parameter sum" expl="VC for sum" expanded="true">
<proof prover="1"><result status="valid" time="0.02" steps="21"/></proof>
<proof prover="2"><result status="valid" time="0.02" steps="21"/></proof>
</goal>
</theory>
<theory name="Division" sum="d23c114c7ff9509b0b89b152002ffc98" expanded="true">
......
......@@ -2,87 +2,87 @@
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Alt-Ergo" version="0.95.1" timelimit="10" memlimit="1000"/>
<prover id="1" name="Alt-Ergo" version="0.95.2" timelimit="5" memlimit="1000"/>
<prover id="2" name="CVC4" version="1.3" timelimit="6" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="0.99.1" timelimit="10" memlimit="1000"/>
<file name="../balance.mlw" expanded="true">
<theory name="Roberval" sum="d41d8cd98f00b204e9800998ecf8427e">
</theory>
<theory name="Puzzle8" sum="7bd261b5c4cef46f4acc04f8507db7d7">
<goal name="WP_parameter solve3" expl="VC for solve3">
<proof prover="0"><result status="valid" time="0.02" steps="47"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="41"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="52"/></proof>
</goal>
<goal name="WP_parameter solve8" expl="VC for solve8">
<transf name="split_goal_wp">
<goal name="WP_parameter solve8.1" expl="1. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="7"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="7"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="7"/></proof>
</goal>
<goal name="WP_parameter solve8.2" expl="2. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="5"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="5"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="5"/></proof>
</goal>
<goal name="WP_parameter solve8.3" expl="3. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="7"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="7"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="7"/></proof>
</goal>
<goal name="WP_parameter solve8.4" expl="4. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="9"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="9"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="9"/></proof>
</goal>
<goal name="WP_parameter solve8.5" expl="5. index in array bounds">
<proof prover="0"><result status="valid" time="0.03" steps="11"/></proof>
<proof prover="1"><result status="valid" time="0.00" steps="11"/></proof>
<proof prover="3"><result status="valid" time="0.03" steps="11"/></proof>
</goal>
<goal name="WP_parameter solve8.6" expl="6. index in array bounds">
<proof prover="0"><result status="valid" time="0.00" steps="13"/></proof>
<proof prover="1"><result status="valid" time="0.00" steps="13"/></proof>
<proof prover="3"><result status="valid" time="0.00" steps="13"/></proof>
</goal>
<goal name="WP_parameter solve8.7" expl="7. precondition">
<proof prover="1" timelimit="6"><result status="valid" time="0.03" steps="15"/></proof>
</goal>
<goal name="WP_parameter solve8.8" expl="8. precondition">
<proof prover="0"><result status="valid" time="0.01" steps="18"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="18"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="18"/></proof>
</goal>
<goal name="WP_parameter solve8.9" expl="9. precondition">
<proof prover="0"><result status="valid" time="0.02" steps="72"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="78"/></proof>
<proof prover="1"><result status="valid" time="0.14" steps="78"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="70"/></proof>
</goal>
<goal name="WP_parameter solve8.10" expl="10. precondition">
<proof prover="0"><result status="valid" time="0.04" steps="18"/></proof>
<proof prover="1"><result status="valid" time="0.10" steps="18"/></proof>
<proof prover="3"><result status="valid" time="0.04" steps="18"/></proof>
</goal>
<goal name="WP_parameter solve8.11" expl="11. precondition">
<proof prover="0"><result status="valid" time="0.03" steps="91"/></proof>
<proof prover="1"><result status="valid" time="0.05" steps="97"/></proof>
<proof prover="3"><result status="valid" time="0.16" steps="102"/></proof>
</goal>
<goal name="WP_parameter solve8.12" expl="12. index in array bounds">
<proof prover="0"><result status="valid" time="0.01" steps="21"/></proof>
<proof prover="1"><result status="valid" time="0.01" steps="21"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="21"/></proof>
</goal>
<goal name="WP_parameter solve8.13" expl="13. index in array bounds">
<proof prover="0"><result status="valid" time="0.02" steps="20"/></proof>
<proof prover="1"><result status="valid" time="0.02" steps="20"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="20"/></proof>
</goal>
<goal name="WP_parameter solve8.14" expl="14. precondition">
<proof prover="1" timelimit="6"><result status="valid" time="0.02" steps="22"/></proof>
</goal>
<goal name="WP_parameter solve8.15" expl="15. postcondition">
<proof prover="0"><result status="valid" time="0.13" steps="82"/></proof>
<proof prover="1"><result status="valid" time="0.02" steps="82"/></proof>
<proof prover="1"><result status="valid" time="0.20" steps="82"/></proof>
<proof prover="3"><result status="valid" time="0.13" steps="87"/></proof>
</goal>
<goal name="WP_parameter solve8.16" expl="16. postcondition">
<proof prover="0"><result status="valid" time="0.20" steps="143"/></proof>
<proof prover="1"><result status="valid" time="0.27" steps="143"/></proof>
<proof prover="1"><result status="valid" time="0.45" steps="143"/></proof>
<proof prover="3"><result status="valid" time="0.41" steps="155"/></proof>
</goal>
</transf>
</goal>
</theory>
<theory name="Puzzle12" sum="e4074fbfee82e2d49008a68498e7c5d6" expanded="true">
<goal name="WP_parameter solve12" expl="VC for solve12" expanded="true">
<proof prover="2"><result status="valid" time="0.29"/></proof>
<proof prover="2"><result status="valid" time="0.68"/></proof>
</goal>
</theory>
</file>
......
......@@ -2,8 +2,6 @@
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Coq" version="8.4pl4" timelimit="5" memlimit="4000"/>
<prover id="1" name="Eprover" version="1.6" timelimit="5" memlimit="1000"/>
<prover id="2" name="CVC3" version="2.4.1" timelimit="15" memlimit="1000"/>
<prover id="3" name="Z3" version="4.3.1" timelimit="10" memlimit="1000"/>
<prover id="4" name="Spass" version="3.7" timelimit="5" memlimit="1000"/>
......@@ -13,36 +11,38 @@
<prover id="8" name="Alt-Ergo" version="0.99.1" timelimit="5" memlimit="1000"/>
<prover id="9" name="CVC4" version="1.4" timelimit="5" memlimit="1000"/>
<prover id="10" name="Z3" version="4.3.2" timelimit="5" memlimit="1000"/>
<prover id="11" name="Eprover" version="1.8-001" timelimit="5" memlimit="1000"/>
<prover id="12" name="Coq" version="8.4pl6" timelimit="5" memlimit="4000"/>
<file name="../bellman_ford.mlw" expanded="true">
<theory name="Graph" sum="a445091f6d55fb03cbfd6988f8e23631">
<goal name="vertices_cardinal_pos">
<proof prover="6" timelimit="10" memlimit="0"><result status="valid" time="0.01" steps="5"/></proof>
</goal>
<goal name="path_in_vertices">
<proof prover="0" timelimit="10" memlimit="0" edited="bf_Graph_path_in_vertices_2.v"><result status="valid" time="1.04"/></proof>
<proof prover="12" timelimit="10" memlimit="0" edited="bf_Graph_path_in_vertices_2.v"><result status="valid" time="1.70"/></proof>
</goal>
<goal name="long_path_decomposition_pigeon1">
<proof prover="0" timelimit="8" memlimit="1000" edited="bellman_ford_Graph_long_path_decomposition_pigeon1_1.v"><result status="valid" time="1.55"/></proof>
<proof prover="12" timelimit="8" memlimit="1000" edited="bellman_ford_Graph_long_path_decomposition_pigeon1_1.v"><result status="valid" time="2.47"/></proof>
</goal>
<goal name="long_path_decomposition_pigeon2">
<proof prover="6"><result status="valid" time="0.06" steps="46"/></proof>
</goal>
<goal name="long_path_decomposition_pigeon3">
<proof prover="0" timelimit="7" memlimit="1000" edited="bellman_ford_Graph_long_path_decomposition_pigeon3_1.v"><result status="valid" time="1.80"/></proof>
<proof prover="12" timelimit="7" memlimit="1000" edited="bellman_ford_Graph_long_path_decomposition_pigeon3_1.v"><result status="valid" time="3.45"/></proof>
</goal>
<goal name="long_path_decomposition">
<proof prover="0" memlimit="1000" edited="bellman_ford_Graph_long_path_decomposition_1.v"><result status="valid" time="1.47"/></proof>
<proof prover="12" memlimit="1000" edited="bellman_ford_Graph_long_path_decomposition_1.v"><result status="valid" time="2.94"/></proof>
</goal>
<goal name="simple_path">
<proof prover="0" timelimit="10" memlimit="0" edited="bf_Graph_simple_path_1.v"><result status="valid" time="2.22"/></proof>
<proof prover="12" timelimit="10" memlimit="0" edited="bf_Graph_simple_path_1.v"><result status="valid" time="3.78"/></proof>
</goal>
<goal name="key_lemma_1">
<proof prover="0" timelimit="10" memlimit="0" edited="bf_Graph_key_lemma_1_1.v"><result status="valid" time="3.34"/></proof>
<proof prover="12" timelimit="10" memlimit="0" edited="bf_Graph_key_lemma_1_1.v"><result status="valid" time="5.38"/></proof>
</goal>
</theory>
<theory name="BellmanFord" sum="00f154fefe471aee2a2d873c070061de" expanded="true">
<goal name="key_lemma_2">
<proof prover="0" edited="bf_WP_BellmanFord_key_lemma_2_1.v"><result status="valid" time="7.88"/></proof>
<proof prover="12" edited="bf_WP_BellmanFord_key_lemma_2_1.v"><result status="valid" time="30.19"/></proof>
</goal>
<goal name="WP_parameter relax" expl="VC for relax">
<transf name="split_goal_wp">
......@@ -51,20 +51,20 @@
<goal name="WP_parameter relax.1.1" expl="1. postcondition">
<transf name="split_goal_wp">
<goal name="WP_parameter relax.1.1.1" expl="1. postcondition">
<proof prover="0" timelimit="10" memlimit="0" edited="bf_WP_BellmanFord_WP_parameter_relax_7.v"><result status="valid" time="1.91"/></proof>
<proof prover="12" timelimit="10" memlimit="0" edited="bf_WP_BellmanFord_WP_parameter_relax_7.v"><result status="valid" time="2.88"/></proof>
</goal>
<goal name="WP_parameter relax.1.1.2" expl="2. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.22"/></proof>
</goal>
<goal name="WP_parameter relax.1.1.3" expl="3. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.42"/></proof>
<proof prover="2" memlimit="0"><result status="valid" time="0.68"/></proof>
</goal>
<goal name="WP_parameter relax.1.1.4" expl="4. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.25"/></proof>
<proof prover="6" timelimit="18" memlimit="0"><result status="valid" time="0.89" steps="880"/></proof>
<proof prover="2" memlimit="0"><result status="valid" time="0.54"/></proof>
<proof prover="6" timelimit="18" memlimit="0"><result status="valid" time="1.72" steps="880"/></proof>
</goal>
<goal name="WP_parameter relax.1.1.5" expl="5. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.45"/></proof>
<proof prover="2" memlimit="0"><result status="valid" time="1.18"/></proof>
</goal>
</transf>
</goal>
......@@ -79,11 +79,11 @@
<proof prover="6" timelimit="15" memlimit="0"><result status="valid" time="0.04" steps="69"/></proof>
</goal>
<goal name="WP_parameter relax.2.1.2" expl="2. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.28"/></proof>
<proof prover="6" timelimit="15" memlimit="0"><result status="valid" time="0.28" steps="408"/></proof>
<proof prover="2" memlimit="0"><result status="valid" time="0.49"/></proof>
<proof prover="6" timelimit="15" memlimit="0"><result status="valid" time="0.61" steps="408"/></proof>
</goal>
<goal name="WP_parameter relax.2.1.3" expl="3. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.28"/></proof>
<proof prover="2" memlimit="0"><result status="valid" time="0.74"/></proof>
</goal>
<goal name="WP_parameter relax.2.1.4" expl="4. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.08"/></proof>
......@@ -105,9 +105,9 @@
<goal name="WP_parameter bellman_ford.1.1" expl="1. assertion">
<transf name="split_goal_wp">
<goal name="WP_parameter bellman_ford.1.1.1" expl="1. assertion">
<proof prover="1"><result status="valid" time="0.11"/></proof>
<proof prover="4"><result status="valid" time="2.59"/></proof>
<proof prover="4"><result status="valid" time="5.25"/></proof>
<proof prover="7"><result status="valid" time="0.16"/></proof>
<proof prover="11"><result status="valid" time="0.11"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.1.1.2" expl="2. assertion">
<proof prover="6"><result status="valid" time="0.03" steps="48"/></proof>
......@@ -132,10 +132,10 @@
<proof prover="6" timelimit="10" memlimit="0"><result status="valid" time="0.01" steps="12"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.4" expl="4. exceptional postcondition">
<proof prover="0" memlimit="1000" edited="bf_WP_BellmanFord_WP_parameter_bellman_ford_20.v"><result status="valid" time="2.09"/></proof>
<proof prover="12" memlimit="1000" edited="bf_WP_BellmanFord_WP_parameter_bellman_ford_20.v"><result status="valid" time="3.68"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.5" expl="5. loop invariant preservation">
<proof prover="8"><result status="valid" time="0.86" steps="638"/></proof>
<proof prover="8"><result status="valid" time="2.18" steps="633"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.6" expl="6. loop variant decrease">
<proof prover="6" timelimit="10" memlimit="0"><result status="valid" time="0.02" steps="18"/></proof>
......@@ -146,7 +146,7 @@
<goal name="WP_parameter bellman_ford.8" expl="8. postcondition">
<transf name="split_goal_wp">
<goal name="WP_parameter bellman_ford.8.1" expl="1. postcondition">
<proof prover="2" memlimit="0"><result status="valid" time="0.07"/></proof>
<proof prover="2" memlimit="0"><result status="valid" time="0.23"/></proof>
<proof prover="3"><result status="valid" time="0.03"/></proof>
<proof prover="6"><result status="valid" time="0.06" steps="103"/></proof>
</goal>
......@@ -164,8 +164,8 @@
<goal name="WP_parameter bellman_ford.9.1" expl="1. loop invariant init">
<transf name="split_goal_wp">
<goal name="WP_parameter bellman_ford.9.1.1" expl="1. loop invariant init">
<proof prover="1"><result status="valid" time="0.12"/></proof>
<proof prover="7"><result status="valid" time="0.16"/></proof>
<proof prover="11"><result status="valid" time="0.12"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.9.1.2" expl="2. loop invariant init">
<proof prover="6"><result status="valid" time="0.03" steps="57"/></proof>
......@@ -216,11 +216,11 @@
<proof prover="6" timelimit="10"><result status="valid" time="0.05" steps="94"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.14.2.1.2" expl="2. VC for bellman_ford">
<proof prover="2" timelimit="5"><result status="valid" time="0.68"/></proof>
<proof prover="6" timelimit="10"><result status="valid" time="1.50" steps="544"/></proof>
<proof prover="2" timelimit="5"><result status="valid" time="0.93"/></proof>
<proof prover="6" timelimit="10"><result status="valid" time="2.38" steps="544"/></proof>
</goal>
<goal name="WP_parameter bellman_ford.14.2.1.3" expl="3. VC for bellman_ford">
<proof prover="2"><result status="valid" time="14.31"/></proof>
<proof prover="2"><result status="valid" time="21.90"/></proof>
<metas>
<ts_pos name="real" arity="0" id="2"
ip_theory="BuiltIn">
......@@ -246,17 +246,17 @@
<ip_library name="Mark"/>
<ip_qualid name="&apos;mark"/>
</ts_pos>
<ts_pos name="ref" arity="1" id="5092"
<ts_pos name="ref" arity="1" id="5093"
ip_theory="Ref">
<ip_library name="ref"/>
<ip_qualid name="ref"/>
</ts_pos>
<ts_pos name="t" arity="1" id="5242"
<ts_pos name="t" arity="1" id="5243"
ip_theory="Impset">
<ip_library name="impset"/>
<ip_qualid name="t"/>
</ts_pos>
<ts_pos name="distmap" arity="0" id="5334"
<ts_pos name="distmap" arity="0" id="5335"
ip_theory="BellmanFord">
<ip_qualid name="distmap"/>
</ts_pos>
......@@ -266,570 +266,567 @@
<ip_library name="BuiltIn"/>
<ip_qualid name="infix ="/>
</ls_pos>
<ls_pos name="zero" id="445"
<ls_pos name="zero" id="446"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="zero"/>
</ls_pos>
<ls_pos name="one" id="446"
<ls_pos name="one" id="447"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="one"/>
</ls_pos>
<ls_pos name="infix &lt;" id="447"
<ls_pos name="infix &lt;" id="448"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix &lt;"/>
</ls_pos>
<ls_pos name="infix &gt;" id="450"
<ls_pos name="infix &gt;" id="451"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix &gt;"/>
</ls_pos>
<ls_pos name="infix +" id="1616"
<ls_pos name="infix +" id="1617"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix +"/>
</ls_pos>
<ls_pos name="prefix -" id="1617"
<ls_pos name="prefix -" id="1618"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="prefix -"/>
</ls_pos>
<ls_pos name="infix *" id="1618"
<ls_pos name="infix *" id="1619"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="infix *"/>
</ls_pos>
<ls_pos name="add" id="2367"
<ls_pos name="add" id="2368"
ip_theory="IntInf">
<ip_library name="int"/>
<ip_qualid name="add"/>
</ls_pos>
<ls_pos name="lt" id="2386"
<ls_pos name="lt" id="2387"
ip_theory="IntInf">
<ip_library name="int"/>
<ip_qualid name="lt"/>
</ls_pos>
<ls_pos name="le" id="2405"
<ls_pos name="le" id="2406"
ip_theory="IntInf">
<ip_library name="int"/>
<ip_qualid name="le"/>
</ls_pos>
<ls_pos name="mem" id="2490"
<ls_pos name="mem" id="2491"
ip_theory="Mem">
<ip_library name="list"/>
<ip_qualid name="mem"/>
</ls_pos>
<ls_pos name="mem" id="2817"
<ls_pos name="mem" id="2818"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="mem"/>
</ls_pos>
<ls_pos name="infix ==" id="2820"
<ls_pos name="infix ==" id="2821"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="infix =="/>
</ls_pos>
<ls_pos name="subset" id="2838"
<ls_pos name="subset" id="2839"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="subset"/>
</ls_pos>
<ls_pos name="empty" id="2859"
<ls_pos name="empty" id="2860"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="empty"/>
</ls_pos>
<ls_pos name="is_empty" id="2861"
<ls_pos name="is_empty" id="2862"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="is_empty"/>
</ls_pos>
<ls_pos name="add" id="2871"
<ls_pos name="add" id="2872"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="add"/>
</ls_pos>
<ls_pos name="singleton" id="2877"
<ls_pos name="singleton" id="2878"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="singleton"/>
</ls_pos>
<ls_pos name="remove" id="2882"
<ls_pos name="remove" id="2883"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="remove"/>
</ls_pos>
<ls_pos name="union" id="2900"
<ls_pos name="union" id="2901"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="union"/>
</ls_pos>
<ls_pos name="inter" id="2907"
<ls_pos name="inter" id="2908"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="inter"/>
</ls_pos>
<ls_pos name="diff" id="2914"
<ls_pos name="diff" id="2915"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="diff"/>
</ls_pos>
<ls_pos name="choose" id="2926"
<ls_pos name="choose" id="2927"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="choose"/>
</ls_pos>
<ls_pos name="cardinal" id="2930"
<ls_pos name="cardinal" id="2931"
ip_theory="Fset">
<ip_library name="set"/>
<ip_qualid name="cardinal"/>
</ls_pos>
<ls_pos name="get" id="3140"
<ls_pos name="get" id="3141"
ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="get"/>
</ls_pos>
<ls_pos name="set" id="3143"
<ls_pos name="set" id="3144"
ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="set"/>
</ls_pos>
<ls_pos name="mixfix [&lt;-]" id="3163"
<ls_pos name="mixfix [&lt;-]" id="3164"
ip_theory="Map">
<ip_library name="map"/>
<ip_qualid name="mixfix [&lt;-]"/>
</ls_pos>
<ls_pos name="const" id="3195"
<ls_pos name="const" id="3196"
ip_theory="Const">
<ip_library name="map"/>
<ip_qualid name="const"/>
</ls_pos>
<ls_pos name="infix ++" id="3852"
<ls_pos name="infix ++" id="3853"
ip_theory="Append">
<ip_library name="list"/>
<ip_qualid name="infix ++"/>
</ls_pos>
<ls_pos name="vertices" id="4522"
<ls_pos name="vertices" id="4523"
ip_theory="Graph">
<ip_qualid name="vertices"/>
</ls_pos>
<ls_pos name="edges" id="4523"
<ls_pos name="edges" id="4524"
ip_theory="Graph">
<ip_qualid name="edges"/>
</ls_pos>
<ls_pos name="s" id="4538" ip_theory="Graph">
<ls_pos name="s" id="4539" ip_theory="Graph">
<ip_qualid name="s"/>
</ls_pos>
<ls_pos name="weight" id="4792"
<ls_pos name="weight" id="4793"
ip_theory="Graph">
<ip_qualid name="weight"/>
</ls_pos>
<ls_pos name="pigeon_set" id="4929"
<ls_pos name="pigeon_set" id="4930"
ip_theory="Graph">
<ip_qualid name="Pigeonhole"/>
<ip_qualid name="pigeon_set"/>
</ls_pos>
<ls_pos name="negative_cycle" id="5067"
<ls_pos name="negative_cycle" id="5068"
ip_theory="Graph">
<ip_qualid name="negative_cycle"/>
</ls_pos>
<ls_pos name="prefix !" id="5098"
<ls_pos name="prefix !" id="5099"
ip_theory="Ref">
<ip_library name="ref"/>
<ip_qualid name="prefix !"/>
</ls_pos>
<ls_pos name="initialize_single_source" id="5335"
<ls_pos name="initialize_single_source" id="5336"
ip_theory="BellmanFord">
<ip_qualid name="initialize_single_source"/>
</ls_pos>
<ls_pos name="inv1" id="5341"
<ls_pos name="inv1" id="5342"
ip_theory="BellmanFord">
<ip_qualid name="inv1"/>
</ls_pos>
<ls_pos name="inv2" id="5397"
<ls_pos name="inv2" id="5398"
ip_theory="BellmanFord">
<ip_qualid name="inv2"/>
</ls_pos>
<pr_pos name="Assoc" id="1619"
<pr_pos name="Assoc" id="1620"
ip_theory="Int">
<ip_library name="int"/>
<ip_qualid name="CommutativeGroup"/>
<ip_qualid name="Assoc"/>
</pr_pos>
<pr_pos name="Unit_def_l" id="1626"