anchor.diff:  	    "          => -(11) divF 5 = -(3) "
   	    "             => 14 divF -(5) = -(3) "
   	    "                => 11 divF -(5) = -(3) => -(14) divF -(5) = 2 => -(5) ~= 0"
  -	    " "
  +	    (:optional "")
   	    " theorem Integer.divF_examples is "
   	    "    14 divF 5 = 2 "
   	    "    && 11 divF 5 = 2 "
  
positive.code: 	    "             && 14 divR -(5) = -(3) "
  	    "                && 11 divR -(5) = -(2) "
  	    "                   && -(14) divR -(5) = 3 && -(11) divR -(5) = 2"
  	    " "
  	    " conjecture Integer.modR_examples_Obligation_subtype is "
  	    "    14 modR 5 = -(1) => 11 modR 5 = 1 => true"
  	    " "
  	    " conjecture Integer.modR_examples_Obligation_subtype0 is "
  	    "    14 modR 5 = -(1) => 11 modR 5 = 1 => -(14) modR 5 = 1 => true"
  	    " "
  	    " conjecture Integer.modR_examples_Obligation_subtype1 is "
  	    "    14 modR 5 = -(1) "
  	    "    => 11 modR 5 = 1 "
  	    "       => -(14) modR 5 = 1 => -(11) modR 5 = -(1) => -(5) ~= 0"
  	    " "
  	    " conjecture Integer.modR_examples_Obligation_subtype2 is "
  	    "    14 modR 5 = -(1) "
  	    "    => 11 modR 5 = 1 "
  	    "       => -(14) modR 5 = 1 "
  	    "          => -(11) modR 5 = -(1) => 14 modR -(5) = -(1) => -(5) ~= 0"
  	    " "
  	    " conjecture Integer.modR_examples_Obligation_subtype3 is "
  	    "    14 modR 5 = -(1) "
  	    "    => 11 modR 5 = 1 "
  	    "       => -(14) modR 5 = 1 "
  	    "          => -(11) modR 5 = -(1) "
  	    "             => 14 modR -(5) = -(1) => 11 modR -(5) = 1 => -(5) ~= 0"
  	    " "
  	    " conjecture Integer.modR_examples_Obligation_subtype4 is "
  	    "    14 modR 5 = -(1) "
  	    "    => 11 modR 5 = 1 "
  
negative.code: 	    "        && (fa(i_1 : Int, j_2 : Int) "
  	    "             (negative? i_1 "
  	    "             => times(i_1, j_2) = times(isucc i_1, j_2) - j_2))"
  	    (:optional "")
  	    " op  * infixl 27 : Int * Int -> Int = "
  	    "   the (times : Int * Int -> Int) "
  	    "    (fa(j : Int) times(zero, j) = zero) "
  