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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

1.0MiB live, 1.0MiB 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
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 9 computations (0% saved)

sample726.0ms (41.4%)

Memory

59.0MiB live, 1 525.8MiB allocated; 307ms collecting garbage

Samples

417.0ms

8 256×

valid

Precisions

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

ival-div: 82.0ms (41.1% of total)

ival-mult: 55.0ms (27.5% of total)

ival-add: 45.0ms (22.5% of total)

exact: 7.0ms (3.5% of total)

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

ival-assert: 3.0ms (1.5% of total)

adjust: 2.0ms (1% of total)

Bogosity

explain97.0ms (5.5%)

Memory

-18.1MiB live, 179.4MiB allocated; 26ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))`
-	-	`(/.f64 #s(literal 1 binary64) #s(literal 2 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`y`
-	-	`#s(literal 1 binary64)`
-	-	`(+.f64 x y)`
-	-	`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

50.0ms

512×

valid

Compiler

Compiled 45 to 25 computations (44.4% saved)

Precisions

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

ival-div: 3.0ms (29% of total)

ival-add: 3.0ms (29% of total)

ival-mult: 3.0ms (29% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess261.0ms (14.9%)

Memory

13.6MiB live, 202.3MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	29
1	53	29
2	173	25
3	722	25
4	1691	25
5	5931	25
0	7	5
0	11	5
1	22	5
2	36	5
3	61	5
4	142	5
5	454	5
6	4055	5
0	8118	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(sort x y)

Compiler

Compiled 7 to 7 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))

Compiler

Compiled 7 to 7 computations (0% saved)

series3.0ms (0.2%)

Memory

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

Counts

7 → 14

Calls

Call 1

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

Outputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
y
(+ x y)
x
(* 1/2 x)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* x (+ 1 (/ y x)))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(* y (+ 1/2 (* 1/2 (/ x y))))
(* y (+ 1 (/ x y)))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(* -1 (* y (- (* -1 (/ x y)) 1)))

Calls

6 calls:

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

simplify93.0ms (5.3%)

Memory

7.1MiB live, 51.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	48
1	113	48
2	257	48
3	727	48
4	3126	48
5	6898	48
0	8003	48

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 12

Calls

Call 1

Inputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
y
(+ x y)
x
(* 1/2 x)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* x (+ 1 (/ y x)))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(* y (+ 1/2 (* 1/2 (/ x y))))
(* y (+ 1 (/ x y)))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(* -1 (* y (- (* -1 (/ x y)) 1)))

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

rewrite114.0ms (6.5%)

Memory

-23.0MiB live, 29.9MiB allocated; 42ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	13
0	11	13
1	36	13
0	200	13

Stop Event

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

Counts

7 → 31

Calls

Call 1

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

Outputs
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (+.f64 y x))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 x y)) #s(literal 1/2 binary64)) (-.f64 x y))
(/.f64 (.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) #s(literal 1/2 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (.f64 #s(literal 1/2 binary64) (.f64 (+.f64 y x) (-.f64 x y))) (-.f64 x y))
(/.f64 (.f64 #s(literal 1/2 binary64) (+.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 (.f64 x #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64))) (.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64)))) (-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))))
(/.f64 (+.f64 (pow.f64 (.f64 x #s(literal 1/2 binary64)) #s(literal 3 binary64)) (pow.f64 (.f64 y #s(literal 1/2 binary64)) #s(literal 3 binary64))) (fma.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64)) (-.f64 (.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))) (.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))))))
(fma.f64 y #s(literal 1/2 binary64) (*.f64 x #s(literal 1/2 binary64)))
(fma.f64 x #s(literal 1/2 binary64) (*.f64 y #s(literal 1/2 binary64)))
(fma.f64 #s(literal 1/2 binary64) y (*.f64 x #s(literal 1/2 binary64)))
(fma.f64 #s(literal 1/2 binary64) x (*.f64 y #s(literal 1/2 binary64)))
(-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 (neg.f64 y) #s(literal 1/2 binary64)))
(-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 #s(literal -1/2 binary64) y))
(+.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64)))
(+.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64)))
#s(literal 1/2 binary64)
#s(literal 1 binary64)
#s(literal 2 binary64)
(/.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

eval3.0ms (0.2%)

Memory: 4.8MiB live, 4.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 434 to 97 computations (77.6% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	32	3	35
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	33	3	36

Accuracy

100.0%

Counts

36 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
▶	51.7%	#s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) y))
▶	48.9%	#s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 27 to 25 computations (7.4% saved)

series3.0ms (0.2%)

Memory

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

Counts

9 → 14

Calls

Call 1

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

Outputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
(* 1/2 x)
x
y
(+ x y)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* x (+ 1 (/ y x)))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(* y (+ 1/2 (* 1/2 (/ x y))))
(* y (+ 1 (/ x y)))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(* -1 (* y (- (* -1 (/ x y)) 1)))

Calls

6 calls:

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

simplify142.0ms (8.1%)

Memory

-29.5MiB live, 62.0MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	38	48
1	113	48
2	257	48
3	727	48
4	3126	48
5	6898	48
0	8003	48

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 12

Calls

Call 1

Inputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
(* 1/2 x)
x
y
(+ x y)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* x (+ 1 (/ y x)))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(* y (+ 1/2 (* 1/2 (/ x y))))
(* y (+ 1 (/ x y)))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(* -1 (* y (- (* -1 (/ x y)) 1)))

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

rewrite55.0ms (3.2%)

Memory

7.9MiB live, 55.4MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	35
0	18	35
1	48	35
0	261	35

Stop Event

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

Counts

9 → 43

Calls

Call 1

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

Outputs
#s(approx (* (/ 1 2) (+ x y)) (*.f64 x #s(literal 1/2 binary64)))
(*.f64 x #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
#s(approx (* (/ 1 2) (+ x y)) (*.f64 y #s(literal 1/2 binary64)))
(*.f64 y #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) y)
y
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (+.f64 y x))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 x y)) #s(literal 1/2 binary64)) (-.f64 x y))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 y x)) #s(literal 1/2 binary64)) (-.f64 y x))
(/.f64 (.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) #s(literal 1/2 binary64)) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) #s(literal 1/2 binary64)) (fma.f64 x (-.f64 x y) (.f64 y y)))
(/.f64 (.f64 #s(literal 1/2 binary64) (.f64 (+.f64 y x) (-.f64 x y))) (-.f64 x y))
(/.f64 (.f64 #s(literal 1/2 binary64) (.f64 (+.f64 y x) (-.f64 y x))) (-.f64 y x))
(/.f64 (.f64 #s(literal 1/2 binary64) (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y (-.f64 y x) (.f64 x x)))
(/.f64 (.f64 #s(literal 1/2 binary64) (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 x (-.f64 x y) (.f64 y y)))
(/.f64 (-.f64 (.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64))) (.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64)))) (-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))))
(/.f64 (+.f64 (pow.f64 (.f64 x #s(literal 1/2 binary64)) #s(literal 3 binary64)) (pow.f64 (.f64 y #s(literal 1/2 binary64)) #s(literal 3 binary64))) (fma.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64)) (-.f64 (.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))) (.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64))))))
(fma.f64 y #s(literal 1/2 binary64) (*.f64 x #s(literal 1/2 binary64)))
(fma.f64 x #s(literal 1/2 binary64) (*.f64 y #s(literal 1/2 binary64)))
(fma.f64 #s(literal 1/2 binary64) y (*.f64 x #s(literal 1/2 binary64)))
(fma.f64 #s(literal 1/2 binary64) x (*.f64 y #s(literal 1/2 binary64)))
(-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 (neg.f64 y) #s(literal 1/2 binary64)))
(-.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 #s(literal -1/2 binary64) y))
(+.f64 (.f64 y #s(literal 1/2 binary64)) (.f64 x #s(literal 1/2 binary64)))
(+.f64 (.f64 x #s(literal 1/2 binary64)) (.f64 y #s(literal 1/2 binary64)))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 y x))) (neg.f64 (-.f64 y x)))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y (-.f64 y x) (*.f64 x x))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (-.f64 x y) (*.f64 y y))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (*.f64 (+.f64 y x) (-.f64 y x)) (-.f64 y x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y (-.f64 y x) (*.f64 x x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 x (-.f64 x y) (*.f64 y y)))
(-.f64 (/.f64 (.f64 x x) (-.f64 x y)) (/.f64 (.f64 y y) (-.f64 x y)))
(-.f64 (/.f64 (.f64 y y) (-.f64 y x)) (/.f64 (.f64 x x) (-.f64 y x)))
(+.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 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 x (-.f64 x y) (.f64 y y))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x y) (.f64 y y))))
(+.f64 y x)
(+.f64 x y)

eval5.0ms (0.3%)

Memory: 12.2MiB live, 12.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 647 to 118 computations (81.8% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	51	0	51
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	51	3	54

Accuracy

100.0%

Counts

54 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
✓	51.7%	#s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) y))
✓	48.9%	#s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 61 to 44 computations (27.9% saved)

regimes39.0ms (2.2%)

Memory

-20.1MiB live, 32.7MiB allocated; 5ms collecting garbage

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

33.0ms	x
2.0ms	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
2.0ms	y
2.0ms	(+.f64 x y)

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x y)`
100.0%	1	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 12 to 14 computations (-16.7% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

4 calls:

1.0ms	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
1.0ms	x
1.0ms	(+.f64 x y)
1.0ms	y

Results

Accuracy	Segments	Branch
97.2%	2	`(+.f64 x y)`
97.2%	2	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))`
86.2%	2	`x`
85.3%	2	`y`

Compiler

Compiled 12 to 14 computations (-16.7% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

1.0ms	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))
1.0ms	x
1.0ms	y
1.0ms	(+.f64 x y)

Results

Accuracy	Segments	Branch
48.9%	1	`y`
48.9%	1	`x`
48.9%	1	`(+.f64 x y)`
48.9%	1	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))`

Compiler

Compiled 12 to 14 computations (-16.7% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-3.0038939299584904e-250	2.6249155070674753e-291

Compiler

Compiled 10 to 12 computations (-20% saved)

simplify65.0ms (3.7%)

Memory

-6.2MiB live, 40.0MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	42
1	33	42
2	62	42
3	237	42
4	1199	42
5	4907	42

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

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

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

Outputs

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

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

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

derivations96.0ms (5.5%)

Memory

-0.9MiB live, 41.2MiB allocated; 18ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 48 to 22 computations (54.2% saved)

preprocess35.0ms (2%)

Memory: -5.3MiB live, 40.1MiB allocated; 10ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 130 to 78 computations (40% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample726.0ms (41.4%)

explain97.0ms (5.5%)

preprocess261.0ms (14.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.2%)

simplify93.0ms (5.3%)

rewrite114.0ms (6.5%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series3.0ms (0.2%)

simplify142.0ms (8.1%)

rewrite55.0ms (3.2%)

eval5.0ms (0.3%)

prune3.0ms (0.2%)

regimes39.0ms (2.2%)

regimes5.0ms (0.3%)

regimes4.0ms (0.2%)

bsearch0.0ms (0%)

simplify65.0ms (3.7%)

derivations96.0ms (5.5%)

preprocess35.0ms (2%)

end0.0ms (0%)

Profiling