Metrics for Data.Colour.CIE.Chromaticity:chromaCoords from colour-2.3.3

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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 7 to 7 computations (0% saved)

sample672.0ms (34.7%)

Memory

-13.3MiB live, 504.0MiB allocated; 150ms collecting garbage

Samples

381.0ms	8 249×	0	valid
0.0ms	4×	2	valid
0.0ms	3×	1	valid

Precisions

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

ival-sub: 85.0ms (83.7% of total)

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

exact: 5.0ms (4.9% of total)

adjust: 3.0ms (3% of total)

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

Bogosity

explain58.0ms (3%)

Memory

24.6MiB live, 68.0MiB allocated; 8ms collecting garbage

FPErrors

Click to see full error table

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

31.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-sub: 5.0ms (84.2% 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)

preprocess269.0ms (13.9%)

Memory

-19.0MiB live, 174.5MiB allocated; 34ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	31
1	21	31
2	27	31
3	51	31
4	138	26
5	677	25
6	4110	25
7	7779	25
0	5	5
0	7	5
1	11	5
2	15	5
3	29	5
4	74	5
5	359	5
6	3120	5
7	6967	5
0	8691	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) x) y)

Outputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)

Symmetry

(sort x y)

Compiler

Compiled 5 to 5 computations (0% 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

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (-.f64 #s(literal 1 binary64) x) y)

Compiler

Compiled 5 to 5 computations (0% saved)

series2.0ms (0.1%)

Memory

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

Counts

5 → 16

Calls

Call 1

Inputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
y

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

Calls

6 calls:

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

simplify118.0ms (6.1%)

Memory

-6.0MiB live, 39.1MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	37	62
1	100	52
2	301	52
3	930	52
4	4108	52
0	8277	52

Stop Event

1×	iter limit
1×	node limit

Counts

16 → 14

Calls

Call 1

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

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

rewrite69.0ms (3.6%)

Memory

-4.2MiB live, 40.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	37	11
0	299	11

Stop Event

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

Counts

5 → 20

Calls

Call 1

Inputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
y

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

eval3.0ms (0.1%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 352 to 83 computations (76.4% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (4 fresh and 1 done)

	Pruned	Kept	Total
New	23	4	27
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	23	5	28

Accuracy

100.0%

Counts

28 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
▶	64.0%	(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
▶	60.2%	#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
▶	39.2%	#s(approx (- (- 1 x) y) (neg.f64 y))
▶	37.5%	#s(approx (- (- 1 x) y) (neg.f64 x))

Compiler

Compiled 37 to 34 computations (8.1% saved)

series2.0ms (0.1%)

Memory

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

Counts

11 → 16

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) (neg.f64 x))
(neg.f64 x)
x
#s(approx (- (- 1 x) y) (neg.f64 y))
(neg.f64 y)
y
#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
#s(approx (- 1 x) #s(literal 1 binary64))

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

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	-inf	((- (- 1 x) y) (neg x) x (- (- 1 x) y) (neg y) y (- (- 1 x) y) (- 1 x) 1 (- (- 1 x) y) (- 1 x))
0.0ms	y	@	-inf	((- (- 1 x) y) (neg x) x (- (- 1 x) y) (neg y) y (- (- 1 x) y) (- 1 x) 1 (- (- 1 x) y) (- 1 x))
0.0ms	x	@	inf	((- (- 1 x) y) (neg x) x (- (- 1 x) y) (neg y) y (- (- 1 x) y) (- 1 x) 1 (- (- 1 x) y) (- 1 x))
0.0ms	y	@	inf	((- (- 1 x) y) (neg x) x (- (- 1 x) y) (neg y) y (- (- 1 x) y) (- 1 x) 1 (- (- 1 x) y) (- 1 x))
0.0ms	x	@	0	((- (- 1 x) y) (neg x) x (- (- 1 x) y) (neg y) y (- (- 1 x) y) (- 1 x) 1 (- (- 1 x) y) (- 1 x))

simplify107.0ms (5.5%)

Memory

-1.0MiB live, 58.2MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	37	58
1	100	52
2	300	52
3	930	52
4	4095	52
0	8284	52

Stop Event

1×	iter limit
1×	node limit

Counts

16 → 14

Calls

Call 1

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

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

rewrite74.0ms (3.8%)

Memory

-14.6MiB live, 32.7MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	47
0	17	47
1	57	47
0	396	47

Stop Event

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

Counts

11 → 23

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) (neg.f64 x))
(neg.f64 x)
x
#s(approx (- (- 1 x) y) (neg.f64 y))
(neg.f64 y)
y
#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
(-.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
#s(approx (- 1 x) #s(literal 1 binary64))

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

eval3.0ms (0.2%)

Memory: 6.6MiB live, 6.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 479 to 79 computations (83.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (1 fresh and 5 done)

	Pruned	Kept	Total
New	30	1	31
Fresh	0	0	0
Picked	0	4	4
Done	0	1	1
Total	30	6	36

Accuracy

100.0%

Counts

36 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
✓	64.0%	(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
✓	60.2%	#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
✓	39.2%	#s(approx (- (- 1 x) y) (neg.f64 y))
✓	37.5%	#s(approx (- (- 1 x) y) (neg.f64 x))
▶	25.8%	#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))

Compiler

Compiled 48 to 42 computations (12.5% saved)

series1.0ms (0%)

Memory

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

Counts

3 → 14

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- 1 x) #s(literal 1 binary64))
#s(literal 1 binary64)

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

Calls

6 calls:

Time	Variable		Point	Expression
0.0ms	x	@	inf	((- (- 1 x) y) (- 1 x) 1)
0.0ms	x	@	-inf	((- (- 1 x) y) (- 1 x) 1)
0.0ms	y	@	inf	((- (- 1 x) y) (- 1 x) 1)
0.0ms	y	@	-inf	((- (- 1 x) y) (- 1 x) 1)
0.0ms	x	@	0	((- (- 1 x) y) (- 1 x) 1)

simplify154.0ms (8%)

Memory

-13.1MiB live, 76.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	37	56
1	100	50
2	300	50
3	930	50
4	4095	50
0	8284	50

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

Calls

Call 1

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

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

rewrite50.0ms (2.6%)

Memory

8.5MiB live, 73.8MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	17
0	7	17
1	37	17
0	299	17

Stop Event

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

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- 1 x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- 1 x) #s(literal 1 binary64))
#s(literal 1 binary64)

eval1.0ms (0%)

Memory: 1.6MiB live, 1.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 91 to 20 computations (78% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

6 alts after pruning (0 fresh and 6 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	5	5
Total	9	6	15

Accuracy

100.0%

Counts

15 → 6

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
✓	64.0%	(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
✓	60.2%	#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
✓	39.2%	#s(approx (- (- 1 x) y) (neg.f64 y))
✓	37.5%	#s(approx (- (- 1 x) y) (neg.f64 x))
✓	25.8%	#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))

Compiler

Compiled 96 to 58 computations (39.6% saved)

regimes51.0ms (2.7%)

Memory

-26.9MiB live, 19.5MiB allocated; 6ms collecting garbage

Counts

6 → 1

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- (- 1 x) y) (neg.f64 x))
#s(approx (- (- 1 x) y) (neg.f64 y))
#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
(-.f64 (-.f64 #s(literal 1 binary64) x) y)

Outputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)

Calls

4 calls:

44.0ms	x
3.0ms	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
2.0ms	y
2.0ms	(-.f64 #s(literal 1 binary64) x)

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 #s(literal 1 binary64) x)`
100.0%	1	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes8.0ms (0.4%)

Memory

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

Counts

5 → 2

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- (- 1 x) y) (neg.f64 x))
#s(approx (- (- 1 x) y) (neg.f64 y))
#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))
(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)

Outputs
(-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y)
#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))

Calls

4 calls:

2.0ms	y
2.0ms	x
2.0ms	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
2.0ms	(-.f64 #s(literal 1 binary64) x)

Results

Accuracy	Segments	Branch
94.1%	2	`(-.f64 #s(literal 1 binary64) x)`
98.2%	2	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`
94.1%	2	`x`
94.1%	2	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes2.0ms (0.1%)

Memory

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

Counts

4 → 2

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- (- 1 x) y) (neg.f64 x))
#s(approx (- (- 1 x) y) (neg.f64 y))
#s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x))

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

Calls

1 calls:

2.0ms

(-.f64 (-.f64 #s(literal 1 binary64) x) y)

Results

Accuracy	Segments	Branch
97.0%	2	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`

Compiler

Compiled 5 to 5 computations (0% saved)

regimes2.0ms (0.1%)

Memory

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

Counts

3 → 3

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- (- 1 x) y) (neg.f64 x))
#s(approx (- (- 1 x) y) (neg.f64 y))

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

Calls

1 calls:

1.0ms

(-.f64 (-.f64 #s(literal 1 binary64) x) y)

Results

Accuracy	Segments	Branch
96.2%	3	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`

Compiler

Compiled 5 to 5 computations (0% saved)

regimes5.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))
#s(approx (- (- 1 x) y) (neg.f64 x))

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

Calls

4 calls:

1.0ms	y
1.0ms	x
1.0ms	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
1.0ms	(-.f64 #s(literal 1 binary64) x)

Results

Accuracy	Segments	Branch
45.9%	3	`y`
59.1%	2	`(-.f64 #s(literal 1 binary64) x)`
59.1%	2	`x`
59.1%	2	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`

Compiler

Compiled 10 to 13 computations (-30% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))

Outputs
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))

Calls

4 calls:

1.0ms	y
1.0ms	x
1.0ms	(-.f64 (-.f64 #s(literal 1 binary64) x) y)
1.0ms	(-.f64 #s(literal 1 binary64) x)

Results

Accuracy	Segments	Branch
25.8%	1	`y`
25.8%	1	`(-.f64 #s(literal 1 binary64) x)`
25.8%	1	`x`
25.8%	1	`(-.f64 (-.f64 #s(literal 1 binary64) x) y)`

Compiler

Compiled 10 to 13 computations (-30% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	0.9999999999999934	1.0

Compiler

Compiled 8 to 10 computations (-25% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-1.021225033378225	0.9980762980007438

Compiler

Compiled 8 to 10 computations (-25% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

2×	left-value

Steps

Time	Left	Right
0.0ms	1.0000015786530727	3.049364059582504
0.0ms	-1.021225033378225	0.9980762980007438

Compiler

Compiled 8 to 10 computations (-25% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	1.0000015786530727	3.049364059582504

Compiler

Compiled 8 to 10 computations (-25% saved)

simplify42.0ms (2.1%)

Memory

-1.9MiB live, 44.5MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	135
1	39	135
2	46	135
3	72	135
4	232	135
5	2217	135

Stop Event

1×	node limit

Calls

Call 1

Inputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 9007199254740933/9007199254740992 binary64)) (-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -1 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -1 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) (if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 2 binary64)) #s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64))) #s(approx (- (- 1 x) y) (neg.f64 x))))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 2 binary64)) #s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64))) #s(approx (- (- 1 x) y) (neg.f64 x)))
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))

Outputs
(-.f64 (-.f64 #s(literal 1 binary64) x) y)
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 9007199254740933/9007199254740992 binary64)) (-.f64 #s(approx (- 1 x) #s(literal 1 binary64)) y) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -1 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) #s(approx (- (- 1 x) y) (-.f64 #s(literal 1 binary64) x)))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal -1 binary64)) #s(approx (- (- 1 x) y) (neg.f64 y)) (if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 2 binary64)) #s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64))) #s(approx (- (- 1 x) y) (neg.f64 x))))
(if (<=.f64 (-.f64 (-.f64 #s(literal 1 binary64) x) y) #s(literal 2 binary64)) #s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64))) #s(approx (- (- 1 x) y) (neg.f64 x)))
#s(approx (- (- 1 x) y) #s(approx (- 1 x) #s(literal 1 binary64)))

derivations186.0ms (9.6%)

Memory

-27.9MiB live, 159.5MiB allocated; 21ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 135 to 26 computations (80.7% saved)

preprocess42.0ms (2.2%)

Memory: 11.1MiB live, 57.4MiB allocated; 4ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 300 to 82 computations (72.7% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample672.0ms (34.7%)

explain58.0ms (3%)

preprocess269.0ms (13.9%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify118.0ms (6.1%)

rewrite69.0ms (3.6%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

series2.0ms (0.1%)

simplify107.0ms (5.5%)

rewrite74.0ms (3.8%)

eval3.0ms (0.2%)

prune2.0ms (0.1%)

series1.0ms (0%)

simplify154.0ms (8%)

rewrite50.0ms (2.6%)

eval1.0ms (0%)

prune2.0ms (0.1%)

regimes51.0ms (2.7%)

regimes8.0ms (0.4%)

regimes2.0ms (0.1%)

regimes2.0ms (0.1%)

regimes5.0ms (0.3%)

regimes4.0ms (0.2%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

bsearch0.0ms (0%)

simplify42.0ms (2.1%)

derivations186.0ms (9.6%)

preprocess42.0ms (2.2%)

end0.0ms (0%)

Profiling