1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
|
<html>
<head><title>ACL2-PC_colon__colon_REDUCE.html -- ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h3>ACL2-PC::REDUCE</h3>(atomic macro)
<code> </code>call the ACL2 theorem prover's simplifier
<pre>Major Section: <a href="PROOF-CHECKER-COMMANDS.html">PROOF-CHECKER-COMMANDS</a>
</pre><p>
<pre>
Examples:
reduce -- attempt to prove the current goal without using induction
(reduce ("Subgoal 2" :by foo) ("Subgoal 1" :use bar))
-- attempt to prove the current goal without using
induction, with the indicated hints
<p>
General Form:
(reduce &rest hints)
</pre>
Attempt to prove the current goal without using induction, using the
indicated hints (if any). A subgoal will be created for each goal
that would have been pushed for proof by induction in an ordinary
proof.<p>
Notice that unlike <code>prove</code>, the arguments to <code>reduce</code> are spread out,
and are all hints.<p>
<code>Reduce</code> is similar to <code>bash</code> in that neither of these allows induction.
But <code>bash</code> only allows simplification, while <code>reduce</code> allows processes
<code>eliminate-destructors</code>, <code>fertilize</code>, <code>generalize</code>, and
<code>eliminate-irrelevance</code>.<p>
<strong>Note:</strong> Induction will be used to the extent that it is ordered
explicitly in the hints.
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a> <a href="acl2-doc-index.html"><img src="index.gif"></a>
</body>
</html>
|
