Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

Time bar (total: 1.4s)

analyze0.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 7 to 6 computations (14.3% saved)

sample493.0ms (36%)

Memory
-7.3MiB live, 843.3MiB allocated
Samples
236.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 100.0ms
ival-add: 44.0ms (43.9% of total)
ival-sub: 42.0ms (41.9% of total)
ival-true: 7.0ms (7% of total)
exact: 5.0ms (5% of total)
ival-assert: 3.0ms (3% of total)
Bogosity

preprocess120.0ms (8.8%)

Memory
-22.5MiB live, 54.2MiB allocated
Algorithm
1×egg-herbie
Rules
176×lower-fma.f64
176×lower-fma.f32
80×lower-*.f64
80×lower-*.f32
60×lower-+.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
12211
27210
317410
425210
526510
045
065
1155
2195
3245
4285
5375
6665
71485
82325
92465
102485
02484
Stop Event
1×iter limit
1×saturated
1×iter limit
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))

explain52.0ms (3.8%)

Memory
22.9MiB live, 104.0MiB allocated
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 x x)
00-0-#s(literal 1 binary64)
00-0-(-.f64 (+.f64 x x) #s(literal 1 binary64))
00-0-x
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
19.0ms512×0valid
Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 9.0ms
ival-add: 5.0ms (56% of total)
ival-sub: 2.0ms (22.4% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

eval0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated
Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Memory
1.5MiB live, 1.5MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Compiler

Compiled 6 to 4 computations (33.3% saved)

simplify14.0ms (1%)

Memory
-1.2MiB live, 36.7MiB allocated
Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(+.f64 x x)
✓cost-diff0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Rules
176×lower-fma.f64
176×lower-fma.f32
80×lower-*.f64
80×lower-*.f32
60×lower-+.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
11510
21910
32410
42810
53710
66610
714810
823210
924610
1024810
02489
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)

localize15.0ms (1.1%)

Memory
3.7MiB live, 43.1MiB allocated
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓accuracy100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓accuracy100.0%
(+.f64 x x)
Samples
9.0ms256×0valid
Compiler

Compiled 12 to 6 computations (50% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (32.7% of total)
ival-add: 1.0ms (32.7% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series2.0ms (0.2%)

Memory
-35.5MiB live, 4.1MiB allocated
Counts
2 → 24
Calls
Call 1
Inputs
#<alt (-.f64 (+.f64 x x) #s(literal 1 binary64))>
#<alt (+.f64 x x)>
Outputs
#<alt -1>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (* 2 x)>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* 2 x)>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
Calls

6 calls:

TimeVariablePointExpression
1.0ms
x
@0
(+ x x)
0.0ms
x
@inf
(- (+ x x) 1)
0.0ms
x
@0
(- (+ x x) 1)
0.0ms
x
@inf
(+ x x)
0.0ms
x
@-inf
(- (+ x x) 1)

simplify12.0ms (0.9%)

Memory
32.2MiB live, 32.2MiB allocated
Algorithm
1×egg-herbie
Rules
120×lower-fma.f64
120×lower-fma.f32
84×lower-*.f64
84×lower-*.f32
56×lower-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01288
12888
26388
311888
413288
518688
622788
725288
826788
927388
1027488
027479
Stop Event
1×iter limit
1×saturated
Counts
24 → 24
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(- (* 2 x) 1)
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* 2 x)
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)

rewrite207.0ms (15.2%)

Memory
-11.2MiB live, 108.7MiB allocated
Algorithm
1×batch-egg-rewrite
Rules
218×lower-fma.f64
218×lower-fma.f32
96×lower-*.f64
96×lower-*.f32
90×lower-/.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
048
068
1368
03037
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 69
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
Outputs
(+.f64 x (+.f64 x #s(literal -1 binary64)))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (+.f64 x x))
(+.f64 (+.f64 x #s(literal -1 binary64)) x)
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(-.f64 (/.f64 (+.f64 x x) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))))
(-.f64 (/.f64 (+.f64 x x) (+.f64 (+.f64 x x) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(expm1.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 (+.f64 x x) (+.f64 x x) #s(literal -1 binary64))
(fma.f64 (+.f64 x x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (+.f64 x x) #s(literal -1 binary64))
(fma.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))) #s(literal -1 binary64))
(fma.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x x)) #s(literal -1 binary64))
(fma.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)) #s(literal -1 binary64))
(fma.f64 (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 4 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 (*.f64 (+.f64 x x) #s(literal 2 binary64)) x #s(literal -1 binary64))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))) (+.f64 (+.f64 x x) #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (+.f64 x x) #s(literal 1 binary64)) (+.f64 (+.f64 x x) #s(literal -1 binary64))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (+.f64 (+.f64 x x) #s(literal 1 binary64)))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (+.f64 (+.f64 x x) (-.f64 #s(literal 1 binary64) (*.f64 (+.f64 x x) #s(literal -1 binary64)))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (-.f64 (+.f64 x x) #s(literal -1 binary64)))
(/.f64 (neg.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))))
(/.f64 (neg.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64))) (neg.f64 (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(/.f64 (fma.f64 x (*.f64 x x) (pow.f64 (+.f64 x #s(literal -1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 (+.f64 x #s(literal -1 binary64)) (+.f64 x #s(literal -1 binary64))) (*.f64 x (+.f64 x #s(literal -1 binary64))))))
(/.f64 (-.f64 (*.f64 x x) (*.f64 (+.f64 x #s(literal -1 binary64)) (+.f64 x #s(literal -1 binary64)))) (-.f64 x (+.f64 x #s(literal -1 binary64))))
(*.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))))
(*.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(*.f64 (+.f64 (+.f64 x x) #s(literal 1 binary64)) (+.f64 (+.f64 x x) #s(literal -1 binary64)))
(+.f64 x x)
(+.f64 (*.f64 (+.f64 x x) x) (*.f64 (+.f64 x x) x))
(+.f64 (*.f64 x (+.f64 x x)) (*.f64 x (+.f64 x x)))
(exp.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(fma.f64 x (+.f64 x x) (*.f64 x (+.f64 x x)))
(fma.f64 (+.f64 x x) x (*.f64 (+.f64 x x) x))
(/.f64 #s(literal 1 binary64) (+.f64 x x))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x x #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))))
(/.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (pow.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (+.f64 x x) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (+.f64 x x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(pow.f64 (+.f64 x x) #s(literal 3 binary64))
(pow.f64 (+.f64 x x) #s(literal 2 binary64))
(*.f64 x #s(literal 2 binary64))
(*.f64 (+.f64 x x) (+.f64 x x))
(*.f64 (+.f64 x x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (+.f64 x x))
(*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x x)))
(*.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)))
(*.f64 (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (*.f64 (+.f64 x x) #s(literal 2 binary64)) x)

eval12.0ms (0.9%)

Memory
-9.1MiB live, 29.9MiB allocated
Compiler

Compiled 906 to 165 computations (81.8% saved)

prune12.0ms (0.9%)

Memory
-7.2MiB live, 34.0MiB allocated
Pruning

3 alts after pruning (2 fresh and 1 done)

PrunedKeptTotal
New91293
Fresh000
Picked011
Done000
Total91394
Accuracy
100.0%
Counts
94 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶49.2%
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
▶52.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 14 to 9 computations (35.7% saved)

simplify13.0ms (0.9%)

Memory
27.2MiB live, 27.2MiB allocated
Algorithm
1×egg-herbie
Localize:

Found 3 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
✓cost-diff128
(*.f64 #s(literal 2 binary64) x)
✓cost-diff0
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Rules
176×lower-fma.f64
176×lower-fma.f32
80×lower-*.f32
78×lower-*.f64
60×lower-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0922
01022
11822
22122
32622
43022
53922
66822
715022
823422
924822
1025022
025020
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
#s(approx (- (+ x x) 1) (+.f64 x x))
(*.f64 #s(literal 2 binary64) x)
(+.f64 x x)
#s(literal 2 binary64)
x

localize21.0ms (1.5%)

Memory
-14.8MiB live, 62.6MiB allocated
Localize:

Found 3 expressions of interest:

NewMetricScoreProgram
✓accuracy100.0%
(*.f64 #s(literal 2 binary64) x)
✓accuracy49.2%
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
✓accuracy52.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Samples
14.0ms256×0valid
Compiler

Compiled 18 to 9 computations (50% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-sub: 2.0ms (34.5% of total)
ival-add: 2.0ms (34.5% of total)
ival-mult: 2.0ms (34.5% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series1.0ms (0.1%)

Memory
2.9MiB live, 2.9MiB allocated
Counts
3 → 36
Calls
Call 1
Inputs
#<alt #s(approx (- (+ x x) 1) #s(literal -1 binary64))>
#<alt (*.f64 #s(literal 2 binary64) x)>
#<alt #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))>
Outputs
#<alt -1>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (* 2 x)>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* 2 x)>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt -1>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (* 2 x)>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* 2 x)>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
Calls

9 calls:

TimeVariablePointExpression
0.0ms
x
@inf
(* 2 x)
0.0ms
x
@-inf
(* 2 x)
0.0ms
x
@0
(- (+ x x) 1)
0.0ms
x
@-inf
(- (+ x x) 1)
0.0ms
x
@-inf
(- (+ x x) 1)

simplify15.0ms (1.1%)

Memory
-8.5MiB live, 29.5MiB allocated
Algorithm
1×egg-herbie
Rules
120×lower-fma.f64
120×lower-fma.f32
84×lower-*.f64
84×lower-*.f32
56×lower-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
012140
128140
263140
3118140
4132140
5186140
6227140
7252140
8267140
9273140
10274140
0274122
Stop Event
1×iter limit
1×saturated
Counts
36 → 36
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(- (* 2 x) 1)
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* 2 x)
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
-1
(- (* 2 x) 1)
(- (* 2 x) 1)
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* 2 x)
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))

rewrite53.0ms (3.8%)

Memory
17.2MiB live, 105.5MiB allocated
Algorithm
1×batch-egg-rewrite
Rules
274×lower-fma.f64
274×lower-fma.f32
106×lower-*.f32
104×lower-*.f64
90×lower-/.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0919
01019
13919
031317
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
3 → 41
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
(*.f64 #s(literal 2 binary64) x)
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
(+.f64 x x)
(+.f64 (*.f64 (+.f64 x x) x) (*.f64 (+.f64 x x) x))
(+.f64 (*.f64 x (+.f64 x x)) (*.f64 x (+.f64 x x)))
(exp.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(fma.f64 x (+.f64 x x) (*.f64 x (+.f64 x x)))
(fma.f64 (+.f64 x x) x (*.f64 (+.f64 x x) x))
(/.f64 #s(literal 1 binary64) (+.f64 x x))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x x #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))))
(/.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (pow.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (+.f64 x x) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (+.f64 x x)) #s(literal 0 binary64))
(pow.f64 (+.f64 x x) #s(literal 2 binary64))
(pow.f64 (+.f64 x x) #s(literal 3 binary64))
(*.f64 x #s(literal 2 binary64))
(*.f64 x (*.f64 #s(literal 2 binary64) (+.f64 x x)))
(*.f64 (+.f64 x x) (+.f64 x x))
(*.f64 (+.f64 x x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (+.f64 x x))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x x)))
(*.f64 (*.f64 x (*.f64 x x)) #s(literal 8 binary64))
(*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))))
(*.f64 (*.f64 x x) #s(literal 4 binary64))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)))
(*.f64 (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (*.f64 (+.f64 x x) x) #s(literal 2 binary64))
(*.f64 (*.f64 (+.f64 x x) #s(literal 2 binary64)) x)
#s(approx (- (+ x x) 1) (+.f64 x x))

eval9.0ms (0.7%)

Memory
-17.2MiB live, 21.9MiB allocated
Compiler

Compiled 585 to 79 computations (86.5% saved)

prune6.0ms (0.4%)

Memory
15.4MiB live, 15.4MiB allocated
Pruning

3 alts after pruning (1 fresh and 2 done)

PrunedKeptTotal
New76177
Fresh000
Picked112
Done011
Total77380
Accuracy
100.0%
Counts
80 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶49.2%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓52.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 14 to 8 computations (42.9% saved)

simplify13.0ms (1%)

Memory
-19.4MiB live, 19.8MiB allocated
Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(+.f64 x x)
✓cost-diff0
#s(approx (- (+ x x) 1) (+.f64 x x))
Rules
176×lower-fma.f64
176×lower-fma.f32
80×lower-*.f64
80×lower-*.f32
60×lower--.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
0713
11613
22013
32513
42913
53813
66713
715013
823413
924813
1025013
025012
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x

localize17.0ms (1.3%)

Memory
-1.7MiB live, 39.6MiB allocated
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓accuracy100.0%
(+.f64 x x)
✓accuracy49.2%
#s(approx (- (+ x x) 1) (+.f64 x x))
Samples
9.0ms256×0valid
Compiler

Compiled 11 to 6 computations (45.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (34.1% of total)
ival-add: 1.0ms (34.1% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series0.0ms (0%)

Memory
0.9MiB live, 0.9MiB allocated
Counts
2 → 24
Calls
Call 1
Inputs
#<alt #s(approx (- (+ x x) 1) (+.f64 x x))>
#<alt (+.f64 x x)>
Outputs
#<alt -1>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (* 2 x)>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* 2 x)>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
Calls

6 calls:

TimeVariablePointExpression
0.0ms
x
@0
(- (+ x x) 1)
0.0ms
x
@-inf
(- (+ x x) 1)
0.0ms
x
@-inf
(+ x x)
0.0ms
x
@inf
(- (+ x x) 1)
0.0ms
x
@inf
(+ x x)

simplify12.0ms (0.9%)

Memory
26.5MiB live, 26.5MiB allocated
Algorithm
1×egg-herbie
Rules
120×lower-fma.f64
120×lower-fma.f32
84×lower-*.f64
84×lower-*.f32
56×lower-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01288
12888
26388
311888
413288
518688
622788
725288
826788
927388
1027488
027479
Stop Event
1×iter limit
1×saturated
Counts
24 → 24
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(- (* 2 x) 1)
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* 2 x)
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)

rewrite100.0ms (7.3%)

Memory
0.7MiB live, 78.5MiB allocated
Algorithm
1×batch-egg-rewrite
Rules
218×lower-fma.f64
218×lower-fma.f32
96×lower-*.f64
96×lower-*.f32
90×lower-/.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0612
0712
13712
030511
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 36
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
(+.f64 (*.f64 (+.f64 x x) x) (*.f64 (+.f64 x x) x))
(+.f64 (*.f64 x (+.f64 x x)) (*.f64 x (+.f64 x x)))
(exp.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(fma.f64 x (+.f64 x x) (*.f64 x (+.f64 x x)))
(fma.f64 (+.f64 x x) x (*.f64 (+.f64 x x) x))
(/.f64 #s(literal 1 binary64) (+.f64 x x))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x x #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))))
(/.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (pow.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (+.f64 x x) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (+.f64 x x)) #s(literal 0 binary64))
(pow.f64 (+.f64 x x) #s(literal 3 binary64))
(pow.f64 (+.f64 x x) #s(literal 2 binary64))
(*.f64 x #s(literal 2 binary64))
(*.f64 #s(literal 1 binary64) (+.f64 x x))
(*.f64 (+.f64 x x) #s(literal 1 binary64))
(*.f64 (+.f64 x x) (+.f64 x x))
(*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x x)))
(*.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)))
(*.f64 (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (*.f64 (+.f64 x x) #s(literal 2 binary64)) x)

eval30.0ms (2.2%)

Memory
-20.5MiB live, 18.5MiB allocated
Compiler

Compiled 498 to 74 computations (85.1% saved)

prune6.0ms (0.4%)

Memory
17.4MiB live, 17.4MiB allocated
Pruning

3 alts after pruning (0 fresh and 3 done)

PrunedKeptTotal
New60060
Fresh000
Picked011
Done022
Total60363
Accuracy
100.0%
Counts
63 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓49.2%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓52.2%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 30 to 15 computations (50% saved)

regimes10.0ms (0.7%)

Memory
-20.2MiB live, 21.4MiB allocated
Counts
4 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Calls

3 calls:

5.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
2.0ms
x
2.0ms
(+.f64 x x)
Results
AccuracySegmentsBranch
100.0%1x
100.0%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
100.0%1(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

regimes6.0ms (0.4%)

Memory
15.9MiB live, 15.9MiB allocated
Counts
3 → 3
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
Calls

3 calls:

2.0ms
x
2.0ms
(+.f64 x x)
2.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
97.7%3x
97.7%3(-.f64 (+.f64 x x) #s(literal 1 binary64))
97.7%3(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

regimes5.0ms (0.4%)

Memory
-22.9MiB live, 16.3MiB allocated
Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Calls

3 calls:

2.0ms
x
1.0ms
(+.f64 x x)
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
52.2%1x
52.2%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
52.2%1(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

bsearch0.0ms (0%)

Memory
1.2MiB live, 1.2MiB allocated
Algorithm
2×left-value
Steps
TimeLeftRight
0.0ms
3.237961804267485e-8
50.34451115592178
0.0ms
-9025.301954725035
-0.0017431599454368091
Compiler

Compiled 9 to 8 computations (11.1% saved)

simplify7.0ms (0.5%)

Memory
23.3MiB live, 23.3MiB allocated
Algorithm
1×egg-herbie
Rules
4×sub-neg_binary64
2×*-commutative_binary64
2×+-commutative_binary64
2×mul-1-neg_binary64
2×1-exp_binary64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01549
12049
22349
32749
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 (+.f64 x x) #s(literal -5000 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 (+.f64 x x) #s(literal 944473296573929/18889465931478580854784 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
(if (<=.f64 (+.f64 x x) #s(literal -5000 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 (+.f64 x x) #s(literal 944473296573929/18889465931478580854784 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

soundness61.0ms (4.4%)

Memory
-9.2MiB live, 109.8MiB allocated
Rules
274×lower-fma.f64
274×lower-fma.f32
120×lower-fma.f64
120×lower-fma.f32
106×lower-*.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0919
01019
13919
031317
01288
12888
26388
311888
413288
518688
622788
725288
826788
927388
1027488
027479
Stop Event
1×done
1×iter limit
1×saturated
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Compiler

Compiled 43 to 20 computations (53.5% saved)

preprocess44.0ms (3.2%)

Memory
-9.2MiB live, 67.3MiB allocated
Compiler

Compiled 72 to 28 computations (61.1% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...