File: int.why

package info (click to toggle)
why3 1.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 45,028 kB
  • sloc: xml: 185,443; ml: 111,224; ansic: 3,998; sh: 2,578; makefile: 2,568; java: 865; python: 720; javascript: 290; lisp: 205; pascal: 173
file content (22 lines) | stat: -rw-r--r-- 635 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
theory Test
  use int.Int
  goal G1 : 5 * 10 = 50
  goal G2 : forall x:int. x + x - x + x  = 2 * x

  goal CompatOrderAdd  : forall x y z : int. x <= y -> x + z <= y + z
  goal CompatOrderMult : forall x y z : int. x <= y -> 0 <= z -> x * z <= y * z

  goal InvMult : forall x y : int. (-x) * y = - (x * y) = x * (-y)
  goal InvSquare : forall x : int. x * x = (-x) * (-x)
  goal ZeroMult : forall x : int. x * 0 = 0 = 0 * x
  goal SquareNonNeg1 : forall x : int. x <= 0 -> 0 <= x * x
  goal SquareNonNeg : forall x : int. 0 <= x * x
  goal ZeroLessOne : 0 <= 1
end

theory MinMax
  use int.MinMax

  goal G : min 1 (min 3 2) = 1

end