Metrics for Data.Random.Distribution.T:$ccdf from random-fu-0.2.6.2

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze11.0ms (0.5%)

Memory

45.2MiB live, 45.2MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 9 to 7 computations (22.2% saved)

sample886.0ms (45.7%)

Memory

33.3MiB live, 1 392.6MiB allocated; 265ms collecting garbage

Samples

619.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 287.0ms

ival-add: 151.0ms (52.5% of total)

ival-div: 125.0ms (43.5% of total)

ival-true: 6.0ms (2.1% of total)

ival-assert: 4.0ms (1.4% of total)

adjust: 2.0ms (0.7% of total)

Bogosity

explain65.0ms (3.3%)

Memory

-33.1MiB live, 131.7MiB allocated; 34ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
1	-	-	`(/.f64 (+.f64 x y) (+.f64 y y))`
0	-	-	`(+.f64 y y)`
0	-	-	`y`
0	-	-	`(+.f64 x y)`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 (+.f64 x y) (+.f64 y y))`	n/o	1	0
↳	`(+.f64 y y)`	overflow	1

Confusion

	Predicted +	Predicted -
+	1	0
-	0	255

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	255

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	255
1	1

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

35.0ms

512×

valid

Compiler

Compiled 41 to 19 computations (53.7% saved)

Precisions

Click to see histograms. Total time spent on operations: 19.0ms

ival-add: 15.0ms (78.3% of total)

ival-div: 4.0ms (20.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess169.0ms (8.7%)

Memory

-17.5MiB live, 264.9MiB allocated; 27ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	41
1	39	39
2	108	39
3	262	35
4	506	35
5	1296	35
6	4428	35
0	5	7
0	8	7
1	14	7
2	24	7
3	41	7
4	73	7
5	172	7
6	1251	7
7	7699	7
0	8015	7

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) (+.f64 y y))

Outputs
(/.f64 (+.f64 x y) (+.f64 y y))
(/.f64 (+.f64 y x) (*.f64 #s(literal 2 binary64) y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.0MiB live, 1.0MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.6%	(/.f64 (+.f64 x y) (+.f64 y y))

Compiler

Compiled 7 to 5 computations (28.6% saved)

series6.0ms (0.3%)

Memory

20.0MiB live, 20.0MiB allocated; 0ms collecting garbage

Counts

5 → 15

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) (+.f64 y y))
(+.f64 x y)
x
y
(+.f64 y y)

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 1/2))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx y #s(hole binary64 y))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	inf	((/ (+ x y) (+ y y)) (+ x y) x y (+ y y))
1.0ms	x	@	-inf	((/ (+ x y) (+ y y)) (+ x y) x y (+ y y))
1.0ms	y	@	-inf	((/ (+ x y) (+ y y)) (+ x y) x y (+ y y))
1.0ms	x	@	inf	((/ (+ x y) (+ y y)) (+ x y) x y (+ y y))
1.0ms	y	@	0	((/ (+ x y) (+ y y)) (+ x y) x y (+ y y))

simplify128.0ms (6.6%)

Memory

15.3MiB live, 247.8MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	51	125
1	125	125
2	287	125
3	882	125
4	4139	125
0	8189	117

Stop Event

1×	iter limit
1×	node limit

Counts

15 → 15

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 1/2))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx y #s(hole binary64 y))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 1/2))
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) y)
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx (+ x y) (+.f64 y x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (/ (+ x y) (+ y y)) (*.f64 (/.f64 x y) #s(literal 1/2 binary64)))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) x)
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (+ x y) (+.f64 y x))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
#s(approx y #s(hole binary64 y))
#s(approx y y)
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ y y) (*.f64 #s(literal 2 binary64) y))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (+ x y) (+.f64 y x))

rewrite46.0ms (2.3%)

Memory

-35.1MiB live, 71.3MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	15
0	8	15
1	36	15
0	267	15

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

5 → 44

Calls

Call 1

Inputs
(/.f64 (+.f64 x y) (+.f64 y y))
(+.f64 x y)
x
y
(+.f64 y y)

Outputs
(*.f64 (/.f64 (+.f64 y x) #s(literal 0 binary64)) #s(literal 0 binary64))
(.f64 (/.f64 (+.f64 y x) (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (/.f64 (+.f64 y x) #s(literal 2 binary64)) y)
(/.f64 (-.f64 (.f64 (/.f64 x (.f64 #s(literal -2 binary64) y)) (/.f64 x (.f64 #s(literal -2 binary64) y))) (.f64 (/.f64 y (.f64 #s(literal -2 binary64) y)) (/.f64 y (.f64 #s(literal -2 binary64) y)))) (-.f64 (/.f64 x (.f64 #s(literal -2 binary64) y)) (/.f64 y (.f64 #s(literal -2 binary64) y))))
(/.f64 (+.f64 (pow.f64 (/.f64 x (.f64 #s(literal -2 binary64) y)) #s(literal 3 binary64)) (pow.f64 (/.f64 y (.f64 #s(literal -2 binary64) y)) #s(literal 3 binary64))) (fma.f64 (/.f64 x (.f64 #s(literal -2 binary64) y)) (/.f64 x (.f64 #s(literal -2 binary64) y)) (-.f64 (.f64 (/.f64 y (.f64 #s(literal -2 binary64) y)) (/.f64 y (.f64 #s(literal -2 binary64) y))) (.f64 (/.f64 x (.f64 #s(literal -2 binary64) y)) (/.f64 y (.f64 #s(literal -2 binary64) y))))))
(/.f64 (neg.f64 (neg.f64 (+.f64 y x))) (*.f64 #s(literal -2 binary64) y))
(/.f64 (fma.f64 x (.f64 #s(literal -2 binary64) y) (.f64 (.f64 #s(literal -2 binary64) y) y)) (.f64 (.f64 #s(literal -2 binary64) y) (.f64 #s(literal -2 binary64) y)))
(/.f64 (.f64 (+.f64 y x) (-.f64 x y)) (.f64 (-.f64 x y) (*.f64 #s(literal -2 binary64) y)))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (.f64 (fma.f64 y (-.f64 y x) (.f64 x x)) (*.f64 #s(literal -2 binary64) y)))
(/.f64 (neg.f64 (+.f64 y x)) (*.f64 #s(literal -2 binary64) y))
(/.f64 (+.f64 y x) (*.f64 #s(literal -2 binary64) y))
(neg.f64 (*.f64 (/.f64 (+.f64 y x) #s(literal 0 binary64)) #s(literal 0 binary64)))
(fma.f64 (/.f64 x #s(literal 0 binary64)) #s(literal 0 binary64) (/.f64 y (*.f64 #s(literal -2 binary64) y)))
(fma.f64 (/.f64 x (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)) (/.f64 y (.f64 #s(literal -2 binary64) y)))
(fma.f64 (/.f64 y #s(literal 0 binary64)) #s(literal 0 binary64) (/.f64 x (*.f64 #s(literal -2 binary64) y)))
(fma.f64 (/.f64 y (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)) (/.f64 x (.f64 #s(literal -2 binary64) y)))
(+.f64 (/.f64 y (.f64 #s(literal -2 binary64) y)) (/.f64 x (.f64 #s(literal -2 binary64) y)))
(+.f64 (/.f64 x (.f64 #s(literal -2 binary64) y)) (/.f64 y (.f64 #s(literal -2 binary64) y)))
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y y (-.f64 (.f64 x x) (.f64 y x))))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y (-.f64 y x) (*.f64 x x)))
(-.f64 (/.f64 (.f64 x x) (-.f64 x y)) (/.f64 (.f64 y y) (-.f64 x y)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x))))
(+.f64 y x)
(+.f64 x y)
x
y
(*.f64 #s(literal -2 binary64) y)
(*.f64 #s(literal 2 binary64) (neg.f64 y))
(*.f64 #s(literal 2 binary64) y)
(*.f64 y #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y #s(literal 0 binary64)))
(neg.f64 (*.f64 #s(literal -2 binary64) y))
(-.f64 (/.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 (.f64 y y) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))))
(+.f64 (neg.f64 y) (neg.f64 y))
(+.f64 y y)

eval5.0ms (0.3%)

Memory: 10.5MiB live, 10.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 743 to 154 computations (79.3% saved)

prune2.0ms (0.1%)

Memory

6.6MiB live, 6.6MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	54	3	57
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	55	3	58

Accuracy

100.0%

Counts

58 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	48.1%	(/.f64 #s(approx (+ x y) x) (+.f64 y y))
▶	99.9%	#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
▶	52.6%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 32 to 22 computations (31.3% saved)

series6.0ms (0.3%)

Memory

13.2MiB live, 13.2MiB allocated; 0ms collecting garbage

Counts

10 → 22

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
(fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64))
(/.f64 #s(literal 1/2 binary64) y)
y
x
(/.f64 #s(approx (+ x y) x) (+.f64 y y))
#s(approx (+ x y) x)
(+.f64 y y)

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 1/2))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 1/2))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* x (+ (* 1/2 (/ 1 y)) (* 1/2 (/ 1 x))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (/ 1/2 y) #s(hole binary64 (/ 1/2 y)))
#s(approx y #s(hole binary64 y))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	-inf	((/ (+ x y) (+ y y)) 1/2 (/ (+ x y) (+ y y)) (+ (* (/ 1/2 y) x) 1/2) (/ 1/2 y) y x (/ (+ x y) (+ y y)) (+ x y) (+ y y))
1.0ms	y	@	0	((/ (+ x y) (+ y y)) 1/2 (/ (+ x y) (+ y y)) (+ (* (/ 1/2 y) x) 1/2) (/ 1/2 y) y x (/ (+ x y) (+ y y)) (+ x y) (+ y y))
1.0ms	y	@	inf	((/ (+ x y) (+ y y)) 1/2 (/ (+ x y) (+ y y)) (+ (* (/ 1/2 y) x) 1/2) (/ 1/2 y) y x (/ (+ x y) (+ y y)) (+ x y) (+ y y))
1.0ms	x	@	-inf	((/ (+ x y) (+ y y)) 1/2 (/ (+ x y) (+ y y)) (+ (* (/ 1/2 y) x) 1/2) (/ 1/2 y) y x (/ (+ x y) (+ y y)) (+ x y) (+ y y))
1.0ms	x	@	inf	((/ (+ x y) (+ y y)) 1/2 (/ (+ x y) (+ y y)) (+ (* (/ 1/2 y) x) 1/2) (/ 1/2 y) y x (/ (+ x y) (+ y y)) (+ x y) (+ y y))

simplify194.0ms (10%)

Memory

-36.0MiB live, 110.0MiB allocated; 28ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	63	214
1	150	214
2	324	214
3	929	214
4	4278	214
0	8440	196

Stop Event

1×	iter limit
1×	node limit

Counts

22 → 22

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 1/2))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 1/2))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* x (+ (* 1/2 (/ 1 y)) (* 1/2 (/ 1 x))))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (/ 1/2 y) #s(hole binary64 (/ 1/2 y)))
#s(approx y #s(hole binary64 y))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 1/2))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(literal 1/2 binary64))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 1/2))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(literal 1/2 binary64))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (+ 1/2 (* 1/2 (/ x y)))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (+ x y) #s(hole binary64 y))
#s(approx (+ x y) y)
#s(approx (+ x y) #s(hole binary64 (+ x y)))
#s(approx (+ x y) (+.f64 y x))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (*.f64 (/.f64 x y) #s(literal 1/2 binary64)))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (*.f64 (/.f64 x y) #s(literal 1/2 binary64)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* x (+ (* 1/2 (/ 1 x)) (* 1/2 (/ 1 y))))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx (+ x y) #s(hole binary64 x))
#s(approx (+ x y) x)
#s(approx (+ x y) #s(hole binary64 (* x (+ 1 (/ y x)))))
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (* x (+ (* 1/2 (/ 1 y)) (* 1/2 (/ 1 x))))))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx (+ x y) #s(hole binary64 (* -1 (* x (- (* -1 (/ y x)) 1)))))
#s(approx (+ x y) (+.f64 y x))
#s(approx (/ (+ x y) (+ y y)) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) #s(hole binary64 (/ (+ (* 1/2 x) (* 1/2 y)) y)))
#s(approx (+ (* (/ 1/2 y) x) 1/2) (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)))
#s(approx (/ 1/2 y) #s(hole binary64 (/ 1/2 y)))
#s(approx (/ 1/2 y) (/.f64 #s(literal 1/2 binary64) y))
#s(approx y #s(hole binary64 y))
#s(approx y y)
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ y y) (*.f64 #s(literal 2 binary64) y))
#s(approx (+ x y) #s(hole binary64 (* y (+ 1 (/ x y)))))
#s(approx (+ x y) (+.f64 y x))
#s(approx (+ x y) #s(hole binary64 (* -1 (* y (- (* -1 (/ x y)) 1)))))
#s(approx (+ x y) (+.f64 y x))

rewrite85.0ms (4.4%)

Memory

-6.3MiB live, 38.5MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	52
0	18	52
1	70	52
0	469	52

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

10 → 47

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
(fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64))
(/.f64 #s(literal 1/2 binary64) y)
y
x
(/.f64 #s(approx (+ x y) x) (+.f64 y y))
#s(approx (+ x y) x)
(+.f64 y y)

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
(/.f64 (-.f64 #s(literal 1/4 binary64) (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64))) (-.f64 #s(literal 1/2 binary64) (.f64 (/.f64 #s(literal 1/2 binary64) y) x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)) #s(literal 1/4 binary64))) (neg.f64 (-.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 1/2 binary64))))
(/.f64 (neg.f64 (+.f64 #s(literal 1/8 binary64) (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 3 binary64)))) (neg.f64 (fma.f64 #s(literal 1/2 binary64) (-.f64 #s(literal 1/2 binary64) (.f64 (/.f64 #s(literal 1/2 binary64) y) x)) (pow.f64 (*.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)) #s(literal 1/4 binary64)) (-.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 1/2 binary64)))
(/.f64 (+.f64 #s(literal 1/8 binary64) (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 3 binary64))) (+.f64 #s(literal 1/4 binary64) (-.f64 (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)) (.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 1/2 binary64)))))
(/.f64 (+.f64 #s(literal 1/8 binary64) (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 3 binary64))) (fma.f64 #s(literal 1/2 binary64) (-.f64 #s(literal 1/2 binary64) (.f64 (/.f64 #s(literal 1/2 binary64) y) x)) (pow.f64 (*.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64))))
(fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64))
(fma.f64 #s(literal 1/2 binary64) (/.f64 x y) #s(literal 1/2 binary64))
(fma.f64 x (/.f64 #s(literal 1/2 binary64) y) #s(literal 1/2 binary64))
(-.f64 (/.f64 (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)) (-.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 1/2 binary64))) (/.f64 #s(literal 1/4 binary64) (-.f64 (*.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 1/2 binary64))))
(-.f64 #s(literal 1/2 binary64) (*.f64 (neg.f64 (/.f64 #s(literal 1/2 binary64) y)) x))
(-.f64 #s(literal 1/2 binary64) (*.f64 (neg.f64 x) (/.f64 #s(literal 1/2 binary64) y)))
(+.f64 (/.f64 (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 3 binary64)) (fma.f64 #s(literal 1/2 binary64) (-.f64 #s(literal 1/2 binary64) (.f64 (/.f64 #s(literal 1/2 binary64) y) x)) (pow.f64 (.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)))) (/.f64 #s(literal 1/8 binary64) (fma.f64 #s(literal 1/2 binary64) (-.f64 #s(literal 1/2 binary64) (.f64 (/.f64 #s(literal 1/2 binary64) y) x)) (pow.f64 (*.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 2 binary64)))))
(+.f64 (*.f64 (/.f64 #s(literal 1/2 binary64) y) x) #s(literal 1/2 binary64))
(+.f64 #s(literal 1/2 binary64) (*.f64 (/.f64 #s(literal 1/2 binary64) y) x))
(/.f64 #s(literal -1/2 binary64) (neg.f64 y))
(/.f64 #s(literal 1/2 binary64) (neg.f64 (neg.f64 y)))
(/.f64 #s(literal 1/2 binary64) y)
(neg.f64 (/.f64 #s(literal -1/2 binary64) y))
(neg.f64 (/.f64 #s(literal 1/2 binary64) (neg.f64 y)))
y
x
(*.f64 (/.f64 #s(approx (+ x y) x) #s(literal 0 binary64)) #s(literal 0 binary64))
(.f64 (/.f64 #s(approx (+ x y) x) (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (/.f64 #s(approx (+ x y) x) #s(literal 2 binary64)) y)
(/.f64 (neg.f64 (neg.f64 #s(approx (+ x y) x))) (*.f64 #s(literal -2 binary64) y))
(/.f64 (neg.f64 #s(approx (+ x y) x)) (*.f64 #s(literal -2 binary64) y))
(/.f64 #s(approx (+ x y) x) (*.f64 #s(literal -2 binary64) y))
(neg.f64 (*.f64 (/.f64 #s(approx (+ x y) x) #s(literal 0 binary64)) #s(literal 0 binary64)))
#s(approx (+ x y) x)
(*.f64 #s(literal -2 binary64) y)
(*.f64 #s(literal 2 binary64) (neg.f64 y))
(*.f64 #s(literal 2 binary64) y)
(*.f64 y #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y #s(literal 0 binary64)))
(neg.f64 (*.f64 #s(literal -2 binary64) y))
(-.f64 (/.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 (.f64 y y) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))))
(+.f64 (neg.f64 y) (neg.f64 y))
(+.f64 y y)

eval11.0ms (0.6%)

Memory: 11.8MiB live, 11.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 980 to 166 computations (83.1% saved)

prune4.0ms (0.2%)

Memory

7.5MiB live, 7.5MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	64	0	64
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	64	3	67

Accuracy

100.0%

Counts

67 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	48.1%	(/.f64 #s(approx (+ x y) x) (+.f64 y y))
✓	99.9%	#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
✓	52.6%	#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Compiler

Compiled 71 to 37 computations (47.9% saved)

regimes6.0ms (0.3%)

Memory

9.5MiB live, 9.5MiB allocated; 0ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
(/.f64 #s(approx (+ x y) x) (+.f64 y y))
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
(/.f64 (+.f64 x y) (+.f64 y y))

Outputs
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))

Calls

3 calls:

2.0ms	y
2.0ms	x
1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))

Results

Accuracy	Segments	Branch
99.9%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`
99.9%	1	`x`
99.9%	1	`y`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes4.0ms (0.2%)

Memory

5.8MiB live, 5.8MiB allocated; 0ms collecting garbage

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
(/.f64 #s(approx (+ x y) x) (+.f64 y y))

Outputs
(/.f64 #s(approx (+ x y) x) (+.f64 y y))
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))
(/.f64 #s(approx (+ x y) x) (+.f64 y y))

Calls

3 calls:

1.0ms	y
1.0ms	x
1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))

Results

Accuracy	Segments	Branch
97.3%	3	`(/.f64 (+.f64 x y) (+.f64 y y))`
76.6%	3	`x`
78.8%	3	`y`

Compiler

Compiled 9 to 9 computations (0% saved)

regimes3.0ms (0.2%)

Memory

6.1MiB live, 6.1MiB allocated; 0ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Outputs
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Calls

3 calls:

1.0ms	x
1.0ms	y
1.0ms	(/.f64 (+.f64 x y) (+.f64 y y))

Results

Accuracy	Segments	Branch
52.6%	1	`x`
52.6%	1	`y`
52.6%	1	`(/.f64 (+.f64 x y) (+.f64 y y))`

Compiler

Compiled 9 to 9 computations (0% saved)

bsearch1.0ms (0%)

Memory

1.1MiB live, 1.1MiB allocated; 0ms collecting garbage

Algorithm

2×	left-value

Steps

Time	Left	Right
0.0ms	0.5970178345549346	14599150.016608328
0.0ms	-1266933.0502468555	0.0

Compiler

Compiled 10 to 10 computations (0% saved)

simplify47.0ms (2.4%)

Memory

-35.3MiB live, 56.6MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	62
1	32	62
2	44	62
3	70	62
4	157	62
5	1050	62

Stop Event

1×	node limit

Calls

Call 1

Inputs

#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))

(if (<=.f64 (/.f64 (+.f64 x y) (+.f64 y y)) #s(literal -1000000 binary64)) (/.f64 #s(approx (+ x y) x) (+.f64 y y)) (if (<=.f64 (/.f64 (+.f64 x y) (+.f64 y y)) #s(literal 1 binary64)) #s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64)) (/.f64 #s(approx (+ x y) x) (+.f64 y y))))

#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

Outputs
#s(approx (/ (+ x y) (+ y y)) (fma.f64 (/.f64 #s(literal 1/2 binary64) y) x #s(literal 1/2 binary64)))
(if (<=.f64 (/.f64 (+.f64 x y) (+.f64 y y)) #s(literal -1000000 binary64)) (/.f64 #s(approx (+ x y) x) (+.f64 y y)) (if (<=.f64 (/.f64 (+.f64 x y) (+.f64 y y)) #s(literal 1 binary64)) #s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64)) (/.f64 #s(approx (+ x y) x) (+.f64 y y))))
(if (or (<=.f64 (/.f64 (+.f64 x y) (+.f64 y y)) #s(literal -1000000 binary64)) (not (<=.f64 (/.f64 (+.f64 x y) (+.f64 y y)) #s(literal 1 binary64)))) (/.f64 #s(approx (+ x y) x) (+.f64 y y)) #s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64)))
#s(approx (/ (+ x y) (+ y y)) #s(literal 1/2 binary64))

derivations242.0ms (12.5%)

Memory

-2.0MiB live, 146.0MiB allocated; 12ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 62 to 22 computations (64.5% saved)

preprocess22.0ms (1.1%)

Memory: 34.6MiB live, 81.6MiB allocated; 3ms collecting garbage
Compiler: Compiled 152 to 66 computations (56.6% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze11.0ms (0.5%)

sample886.0ms (45.7%)

explain65.0ms (3.3%)

preprocess169.0ms (8.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.3%)

simplify128.0ms (6.6%)

rewrite46.0ms (2.3%)

eval5.0ms (0.3%)

prune2.0ms (0.1%)

series6.0ms (0.3%)

simplify194.0ms (10%)

rewrite85.0ms (4.4%)

eval11.0ms (0.6%)

prune4.0ms (0.2%)

regimes6.0ms (0.3%)

regimes4.0ms (0.2%)

regimes3.0ms (0.2%)

bsearch1.0ms (0%)

simplify47.0ms (2.4%)

derivations242.0ms (12.5%)

preprocess22.0ms (1.1%)

end0.0ms (0%)

Profiling