Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, C

start0.0ms (0%)

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

analyze40.0ms (2%)

Memory

-39.9MiB live, 20.3MiB allocated; 31ms 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 7 to 7 computations (0% saved)

sample579.0ms (29%)

Memory

23.3MiB live, 1 011.3MiB allocated; 119ms collecting garbage

Samples

362.0ms

8 256×

valid

Precisions

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

ival-div!: 54.0ms (49.5% of total)

ival-mult!: 53.0ms (48.6% of total)

adjust: 2.0ms (1.8% of total)

Bogosity

explain1.2s (59.4%)

Memory

-59.4MiB live, 178.6MiB allocated; 1.6s collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 y #s(literal 3 binary64))`
-	-	`y`
-	-	`#s(literal 3 binary64)`
-	-	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Samples

186.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult!: 3.0ms (51.6% of total)

ival-div!: 3.0ms (51.6% of total)

adjust: 0.0ms (0% of total)

preprocess19.0ms (1%)

Memory

-31.0MiB live, 19.0MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	32	30
2	56	30
3	82	30
4	111	30
5	127	30

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series6.0ms (0.3%)

Memory

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

Counts

5 → 4

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

Time	Variable		Point	Expression
2.0ms	y	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	x	@	inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	-inf	((/ x (* y 3)) x (* y 3) y 3)
1.0ms	y	@	0	((/ x (* y 3)) x (* y 3) y 3)

rewrite30.0ms (1.5%)

Memory

-4.1MiB live, 42.5MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	35
1	26	35
2	57	35
3	127	35
4	153	35
5	156	35
0	156	35

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

9 → 19

Calls

Call 1

Inputs
(/.f64 x (*.f64 y #s(literal 3 binary64)))
x
(*.f64 y #s(literal 3 binary64))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 3) #s(hole binary64 (* 3 y)))
#s(approx y #s(hole binary64 y))

Outputs
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 (/.f64 x y) #s(literal -3 binary64)))
x
(*.f64 #s(literal -3 binary64) (neg.f64 y))
(*.f64 (neg.f64 y) #s(literal -3 binary64))
(*.f64 #s(literal 3 binary64) y)
(*.f64 y #s(literal 3 binary64))
(neg.f64 (*.f64 #s(literal -3 binary64) y))
y
#s(literal 3 binary64)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (* y 3) (*.f64 #s(literal 3 binary64) y))
#s(approx y y)

eval2.0ms (0.1%)

Memory: 4.2MiB live, 4.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 116 to 41 computations (64.7% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	16	3	19
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	16	4	20

Accuracy

100.0%

Counts

20 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.4%	(/.f64 (/.f64 x y) #s(literal 3 binary64))
▶	99.8%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
▶	99.2%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Compiler

Compiled 26 to 24 computations (7.7% saved)

series5.0ms (0.3%)

Memory

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

Counts

10 → 8

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ x y) 1/3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ (/ x y) 3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite18.0ms (0.9%)

Memory

-33.0MiB live, 14.4MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	100
0	34	100
1	52	100
2	99	100
3	151	100
4	172	100
5	174	100
0	174	100

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

18 → 44

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(/.f64 x y)
x
y
#s(literal 1/3 binary64)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x #s(literal 3 binary64))
#s(literal 3 binary64)
(/.f64 (/.f64 x y) #s(literal 3 binary64))
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ x y) 1/3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x y) #s(hole binary64 (/ x y)))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (/ (/ x y) 3) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 #s(literal -1/3 binary64) y) (neg.f64 x))
(*.f64 #s(literal -1/3 binary64) (/.f64 (neg.f64 x) y))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(*.f64 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.f64 (/.f64 (neg.f64 x) y) #s(literal -1/3 binary64))
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(*.f64 #s(literal 1/3 binary64) (/.f64 x y))
(*.f64 x (/.f64 #s(literal 1/3 binary64) y))
(/.f64 (*.f64 #s(literal 1/3 binary64) x) y)
(/.f64 (*.f64 #s(literal -1/3 binary64) x) (neg.f64 y))
(neg.f64 (*.f64 #s(literal -1/3 binary64) (/.f64 x y)))
(/.f64 (neg.f64 x) (neg.f64 y))
(/.f64 x y)
(neg.f64 (/.f64 (neg.f64 x) y))
x
y
#s(literal 1/3 binary64)
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 (/.f64 x #s(literal -3 binary64)) y))
(/.f64 (neg.f64 x) #s(literal -3 binary64))
(/.f64 x #s(literal 3 binary64))
(neg.f64 (/.f64 x #s(literal -3 binary64)))
#s(literal 3 binary64)
(/.f64 (neg.f64 x) (*.f64 #s(literal -3 binary64) y))
(/.f64 (/.f64 x #s(literal -3 binary64)) (neg.f64 y))
(/.f64 (/.f64 (neg.f64 x) y) #s(literal -3 binary64))
(/.f64 (/.f64 x y) #s(literal 3 binary64))
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 x (*.f64 #s(literal 3 binary64) y))
(neg.f64 (/.f64 (/.f64 x #s(literal -3 binary64)) y))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (* (/ x y) 1/3) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x y) (/.f64 x y))
#s(approx x x)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx y y)

eval4.0ms (0.2%)

Memory: 8.9MiB live, 8.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 417 to 89 computations (78.7% saved)

prune4.0ms (0.2%)

Memory

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

Pruning

5 alts after pruning (2 fresh and 3 done)

	Pruned	Kept	Total
New	45	2	47
Fresh	0	0	0
Picked	1	2	3
Done	0	1	1
Total	46	5	51

Accuracy

100.0%

Counts

51 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.8%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
▶	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.2%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
▶	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 41 to 36 computations (12.2% saved)

series4.0ms (0.2%)

Memory

10.2MiB live, 10.3MiB allocated; 0ms collecting garbage

Counts

9 → 8

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(*.f64 #s(literal 1/3 binary64) x)

Outputs
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ 1/3 y) x) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (* 1/3 x) #s(hole binary64 (* 1/3 x)))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite20.0ms (1%)

Memory

-26.9MiB live, 20.8MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	27	101
0	31	101
1	54	101
2	109	101
3	195	101
4	206	101
5	206	101
0	206	101

Stop Event

1×	iter-limit
1×	saturated
1×	iter-limit

Counts

17 → 37

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(/.f64 #s(literal 1/3 binary64) y)
#s(literal 1/3 binary64)
y
x
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(*.f64 #s(literal 1/3 binary64) x)
#s(approx (/ x (* y 3)) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (* (/ 1/3 y) x) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (/ (/ x 3) y) #s(hole binary64 (* 1/3 (/ x y))))
#s(approx (/ x 3) #s(hole binary64 (* 1/3 x)))
#s(approx (* 1/3 x) #s(hole binary64 (* 1/3 x)))
#s(approx (/ 1/3 y) #s(hole binary64 (/ 1/3 y)))
#s(approx y #s(hole binary64 y))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(*.f64 (/.f64 (neg.f64 x) y) #s(literal -1/3 binary64))
(*.f64 (/.f64 #s(literal -1/3 binary64) y) (neg.f64 x))
(*.f64 (neg.f64 x) (/.f64 #s(literal -1/3 binary64) y))
(*.f64 #s(literal -1/3 binary64) (/.f64 (neg.f64 x) y))
(*.f64 (/.f64 #s(literal 1/3 binary64) y) x)
(*.f64 (/.f64 x y) #s(literal 1/3 binary64))
(*.f64 #s(literal 1/3 binary64) (/.f64 x y))
(*.f64 x (/.f64 #s(literal 1/3 binary64) y))
(/.f64 (*.f64 #s(literal -1/3 binary64) x) (neg.f64 y))
(/.f64 (*.f64 #s(literal 1/3 binary64) x) y)
(neg.f64 (*.f64 (/.f64 #s(literal -1/3 binary64) y) x))
(/.f64 #s(literal -1/3 binary64) (neg.f64 y))
(/.f64 #s(literal 1/3 binary64) y)
(neg.f64 (/.f64 #s(literal -1/3 binary64) y))
#s(literal 1/3 binary64)
y
x
(/.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))) (neg.f64 y))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
(neg.f64 (/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) (neg.f64 y)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(neg.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))))
(*.f64 (neg.f64 x) #s(literal -1/3 binary64))
(*.f64 #s(literal -1/3 binary64) (neg.f64 x))
(*.f64 #s(literal 1/3 binary64) x)
(*.f64 x #s(literal 1/3 binary64))
(neg.f64 (*.f64 #s(literal -1/3 binary64) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (* (/ 1/3 y) x) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx x x)
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
#s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))
(neg.f64 (neg.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x))))
#s(approx (* 1/3 x) (*.f64 #s(literal 1/3 binary64) x))
#s(approx (/ 1/3 y) (/.f64 #s(literal 1/3 binary64) y))
#s(approx y y)

eval3.0ms (0.2%)

Memory: 9.1MiB live, 9.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 425 to 88 computations (79.3% saved)

prune5.0ms (0.3%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	38	0	38
Fresh	0	0	0
Picked	0	2	2
Done	0	3	3
Total	38	5	43

Accuracy

100.0%

Counts

43 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.8%	(/.f64 (/.f64 x #s(literal 3 binary64)) y)
✓	99.6%	(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
✓	99.7%	(/.f64 x (*.f64 y #s(literal 3 binary64)))
✓	99.2%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
✓	99.6%	#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Compiler

Compiled 87 to 58 computations (33.3% saved)

regimes10.0ms (0.5%)

Memory

-23.0MiB live, 25.1MiB allocated; 2ms collecting garbage

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)
(/.f64 (/.f64 x #s(literal 3 binary64)) y)
(/.f64 (/.f64 x y) #s(literal 3 binary64))

Outputs
(/.f64 (/.f64 x #s(literal 3 binary64)) y)

Calls

4 calls:

3.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))
2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	y
2.0ms	x

Results

Accuracy	Segments	Branch
99.8%	1	`(*.f64 y #s(literal 3 binary64))`
99.8%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.8%	1	`x`
99.8%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes7.0ms (0.4%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))
(/.f64 x (*.f64 y #s(literal 3 binary64)))
(/.f64 #s(approx (/ x 3) (*.f64 #s(literal 1/3 binary64) x)) y)

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

Calls

4 calls:

2.0ms	(*.f64 y #s(literal 3 binary64))
2.0ms	x
2.0ms	y
2.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
99.7%	1	`(*.f64 y #s(literal 3 binary64))`
99.7%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.7%	1	`x`
99.7%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes5.0ms (0.3%)

Memory

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

Accuracy

Total -0.3b remaining (-122.2%)

Threshold costs -0.3b (-122.2%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))
#s(approx (/ x (* y 3)) (*.f64 (/.f64 x y) #s(literal 1/3 binary64)))

Outputs
#s(approx (/ x (* y 3)) (*.f64 (/.f64 #s(literal 1/3 binary64) y) x))

Calls

4 calls:

1.0ms	(*.f64 y #s(literal 3 binary64))
1.0ms	x
1.0ms	y
1.0ms	(/.f64 x (*.f64 y #s(literal 3 binary64)))

Results

Accuracy	Segments	Branch
99.6%	1	`(*.f64 y #s(literal 3 binary64))`
99.6%	1	`(/.f64 x (*.f64 y #s(literal 3 binary64)))`
99.6%	1	`x`
99.6%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations4.0ms (0.2%)

Memory

-40.8MiB live, 6.8MiB allocated; 1ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 21 to 14 computations (33.3% saved)

preprocess41.0ms (2%)

Memory

46.8MiB live, 93.4MiB allocated; 3ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 146 to 124 computations (15.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze40.0ms (2%)

sample579.0ms (29%)

explain1.2s (59.4%)

preprocess19.0ms (1%)

series6.0ms (0.3%)

rewrite30.0ms (1.5%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series5.0ms (0.3%)

rewrite18.0ms (0.9%)

eval4.0ms (0.2%)

prune4.0ms (0.2%)

series4.0ms (0.2%)

rewrite20.0ms (1%)

eval3.0ms (0.2%)

prune5.0ms (0.3%)

regimes10.0ms (0.5%)

regimes7.0ms (0.4%)

regimes5.0ms (0.3%)

derivations4.0ms (0.2%)

preprocess41.0ms (2%)

end0.0ms (0%)

Profiling