Metrics for Main:bigenough1 from B

start0.0ms (0%)

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

Compiler

Compiled 7 to 5 computations (28.6% saved)

sample568.0ms (35.7%)

Memory

-2.6MiB live, 872.1MiB allocated; 195ms collecting garbage

Samples

327.0ms

8 256×

valid

Precisions

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

ival-add: 84.0ms (52.3% of total)

ival-mult: 67.0ms (41.7% of total)

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

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

adjust: 2.0ms (1.2% of total)

Bogosity

explain52.0ms (3.3%)

Memory

27.3MiB live, 79.5MiB allocated; 20ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 x (*.f64 x x))`
-	-	`(*.f64 x x)`
-	-	`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

16.0ms

512×

valid

Compiler

Compiled 27 to 13 computations (51.9% saved)

Precisions

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

ival-mult: 4.0ms (58.4% of total)

ival-add: 2.0ms (29.2% of total)

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

adjust: 0.0ms (0% of total)

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

preprocess258.0ms (16.2%)

Memory

-1.4MiB live, 295.4MiB allocated; 49ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	18
1	32	17
2	79	15
3	125	15
4	220	15
5	542	15
6	1517	15
7	7495	15
0	3	5
0	5	5
1	15	5
2	39	5
3	76	5
4	129	5
5	338	5
6	1182	5
0	8208	4

Stop Event

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

Calls

Call 1

Inputs
(+.f64 x (*.f64 x x))

Outputs
(+.f64 x (*.f64 x x))
(fma.f64 x x x)

Compiler

Compiled 5 to 3 computations (40% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 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 x (*.f64 x x))

Compiler

Compiled 5 to 3 computations (40% saved)

series2.0ms (0.1%)

Memory

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

Counts

3 → 6

Calls

Call 1

Inputs
(+.f64 x (*.f64 x x))
x
(*.f64 x x)

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

Calls

3 calls:

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

simplify194.0ms (12.2%)

Memory

-19.7MiB live, 165.6MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	48
1	45	48
2	126	48
3	391	48
4	2144	48
5	7644	48
0	8923	42

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

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

rewrite40.0ms (2.5%)

Memory

21.4MiB live, 65.0MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	3	9
0	5	9
1	29	9
0	219	8

Stop Event

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

Counts

3 → 38

Calls

Call 1

Inputs
(+.f64 x (*.f64 x x))
x
(*.f64 x x)

Outputs
(*.f64 (+.f64 #s(literal 1 binary64) x) x)
(*.f64 x (+.f64 #s(literal 1 binary64) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x x)) (-.f64 (.f64 x x) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 x) x) #s(literal 3 binary64))) (fma.f64 x x (+.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x (*.f64 (neg.f64 x) x)))))
(/.f64 (neg.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64)))) (neg.f64 (-.f64 x (.f64 x x))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(/.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64))) (-.f64 x (.f64 x x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64))) (+.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 (*.f64 x x) (pow.f64 x #s(literal 3 binary64)))))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64))) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64))))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) x)
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) x)
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) x)
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) x)
(fma.f64 (neg.f64 x) (neg.f64 x) x)
(fma.f64 (fabs.f64 x) (fabs.f64 x) x)
(fma.f64 x x x)
(-.f64 (/.f64 (.f64 x x) (-.f64 x (.f64 x x))) (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 x (*.f64 x x))))
(-.f64 x (*.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 x (*.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 x (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))) (/.f64 (pow.f64 x #s(literal 6 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(+.f64 (*.f64 x x) x)
(+.f64 x (*.f64 (neg.f64 (neg.f64 x)) x))
(+.f64 x (*.f64 x x))
x
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))

eval4.0ms (0.3%)

Memory: 6.6MiB live, 6.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 430 to 106 computations (75.3% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	44	3	47
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	45	3	48

Accuracy

100.0%

Counts

48 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x x x)
▶	50.3%	#s(approx (+ x (* x x)) (*.f64 x x))
▶	53.1%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 20 to 11 computations (45% saved)

series51.0ms (3.2%)

Memory

-54.7MiB live, 7.0MiB allocated; 11ms collecting garbage

Counts

5 → 10

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
x
#s(approx (+ x (* x x)) (*.f64 x x))
(*.f64 x x)
(fma.f64 x x x)

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

Calls

3 calls:

Time	Variable		Point	Expression
42.0ms	x	@	0	((+ x (* x x)) x (+ x (* x x)) (* x x) (+ (* x x) x))
8.0ms	x	@	inf	((+ x (* x x)) x (+ x (* x x)) (* x x) (+ (* x x) x))
1.0ms	x	@	-inf	((+ x (* x x)) x (+ x (* x x)) (* x x) (+ (* x x) x))

simplify175.0ms (11%)

Memory

22.2MiB live, 208.6MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	86
1	51	86
2	132	86
3	397	86
4	2157	86
5	7650	86
0	8929	74

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 10

Calls

Call 1

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

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

rewrite45.0ms (2.9%)

Memory

3.8MiB live, 96.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	24
0	9	22
1	40	22
0	298	22

Stop Event

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

Counts

5 → 44

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
x
#s(approx (+ x (* x x)) (*.f64 x x))
(*.f64 x x)
(fma.f64 x x x)

Outputs
#s(approx (+ x (* x x)) x)
x
#s(approx (+ x (* x x)) (*.f64 x x))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 x x)
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(*.f64 (+.f64 #s(literal 1 binary64) x) x)
(*.f64 x (+.f64 #s(literal 1 binary64) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 (neg.f64 x) x) #s(literal 3 binary64))) (fma.f64 x x (+.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x (*.f64 (neg.f64 x) x)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x x))) (neg.f64 (-.f64 (.f64 x x) x)))
(/.f64 (neg.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64)))) (neg.f64 (-.f64 x (.f64 x x))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (-.f64 x (*.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 x x)) (-.f64 (.f64 x x) x))
(/.f64 (-.f64 (.f64 x x) (pow.f64 x #s(literal 4 binary64))) (-.f64 x (.f64 x x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x (-.f64 x (*.f64 x x)) (pow.f64 x #s(literal 4 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) (pow.f64 x #s(literal 3 binary64))) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64))))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) x)
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) x)
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) x)
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) x)
(fma.f64 (neg.f64 x) (neg.f64 x) x)
(fma.f64 (fabs.f64 x) (fabs.f64 x) x)
(fma.f64 x x x)
(-.f64 (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 (.f64 x x) x)) (/.f64 (.f64 x x) (-.f64 (*.f64 x x) x)))
(-.f64 (/.f64 (.f64 x x) (-.f64 x (.f64 x x))) (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 x (*.f64 x x))))
(-.f64 x (*.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 x (*.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 x (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 6 binary64)) (fma.f64 x (-.f64 x (.f64 x x)) (pow.f64 x #s(literal 4 binary64)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x (.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))) (/.f64 (pow.f64 x #s(literal 6 binary64)) (-.f64 (fma.f64 x x (pow.f64 x #s(literal 4 binary64))) (pow.f64 x #s(literal 3 binary64)))))
(+.f64 (*.f64 x x) x)
(+.f64 x (*.f64 (neg.f64 (neg.f64 x)) x))
(+.f64 x (*.f64 x x))

eval5.0ms (0.3%)

Memory: 22.0MiB live, 22.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 634 to 122 computations (80.8% saved)

prune5.0ms (0.3%)

Memory

-35.9MiB live, 10.5MiB allocated; 3ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	59	0	59
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	59	3	62

Accuracy

100.0%

Counts

62 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x x x)
✓	50.3%	#s(approx (+ x (* x x)) (*.f64 x x))
✓	53.1%	#s(approx (+ x (* x x)) x)

Compiler

Compiled 45 to 19 computations (57.8% saved)

regimes4.0ms (0.2%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))
(fma.f64 x x x)
(+.f64 x (*.f64 x x))

Outputs
(fma.f64 x x x)

Calls

2 calls:

2.0ms	(+.f64 x (*.f64 x x))
2.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x (*.f64 x x))`
100.0%	1	`x`

Compiler

Compiled 6 to 4 computations (33.3% saved)

regimes3.0ms (0.2%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))

Outputs
#s(approx (+ x (* x x)) x)
#s(approx (+ x (* x x)) (*.f64 x x))

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 x (*.f64 x x))

Results

Accuracy	Segments	Branch
98.4%	2	`(+.f64 x (*.f64 x x))`
98.4%	3	`x`

Compiler

Compiled 6 to 4 computations (33.3% saved)

regimes2.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x (* x x)) x)

Outputs
#s(approx (+ x (* x x)) x)

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 x (*.f64 x x))

Results

Accuracy	Segments	Branch
53.1%	1	`x`
53.1%	1	`(+.f64 x (*.f64 x x))`

Compiler

Compiled 6 to 4 computations (33.3% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	0.08683211373582565	4.5776440663217395

Compiler

Compiled 8 to 7 computations (12.5% saved)

simplify58.0ms (3.7%)

Memory

-36.3MiB live, 66.8MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	35
1	21	35
2	45	35
3	82	35
4	135	35
5	430	35
6	2499	35

Stop Event

1×	node limit

Calls

Call 1

Inputs
(fma.f64 x x x)
(if (<=.f64 (+.f64 x (.f64 x x)) #s(literal 3602879701896397/36028797018963968 binary64)) #s(approx (+ x ( x x)) x) #s(approx (+ x (* x x)) (*.f64 x x)))
#s(approx (+ x (* x x)) x)

Outputs
(fma.f64 x x x)
(if (<=.f64 (+.f64 x (.f64 x x)) #s(literal 3602879701896397/36028797018963968 binary64)) #s(approx (+ x ( x x)) x) #s(approx (+ x (* x x)) (*.f64 x x)))
#s(approx (+ x (* x x)) x)

derivations105.0ms (6.6%)

Memory

-0.7MiB live, 90.0MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 35 to 11 computations (68.6% saved)

preprocess14.0ms (0.9%)

Memory: 20.9MiB live, 21.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 80 to 28 computations (65% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample568.0ms (35.7%)

explain52.0ms (3.3%)

preprocess258.0ms (16.2%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify194.0ms (12.2%)

rewrite40.0ms (2.5%)

eval4.0ms (0.3%)

prune2.0ms (0.1%)

series51.0ms (3.2%)

simplify175.0ms (11%)

rewrite45.0ms (2.9%)

eval5.0ms (0.3%)

prune5.0ms (0.3%)

regimes4.0ms (0.2%)

regimes3.0ms (0.2%)

regimes2.0ms (0.1%)

bsearch0.0ms (0%)

simplify58.0ms (3.7%)

derivations105.0ms (6.6%)

preprocess14.0ms (0.9%)

end0.0ms (0%)

Profiling