Major Section: PROOF-CHECKER
This documentation section contains documentation for individual
commands that can be given inside the interactive proof-checker loop
that is entered using verify
.
attempt an equality (or equivalence) substitution
same as (lisp x)
add an abbreviation
same as apply-linear
apply a linear rule
call the ACL2 theorem prover's simplifier
prove the current goal using bdds
move backward one argument in the enclosing term
insert matching ``bookends'' comments
split into two cases
change to another goal.
change to another goal.
same as clause-processor
add a new hypothesis
use a clause-processor
display instructions from the current interactive session
display instructions from the current interactive session
insert a comment
same as contrapose
switch a hypothesis with the conclusion, negating both
move top-level hypotheses to the conclusion
move to the indicated subterm
run the given instructions
run the given instructions, halting once there is a ``failure''
run the given instructions, halting once there is a ``failure''
drop top-level hypotheses
move to the indicated subterm
call the ACL2 theorem prover's elimination process
attempt an equality (or congruence-based) substitution
exit after possibly saving the state
exit the interactive proof-checker
expand the current function call without simplification
cause a failure
require completion of instructions; save error if inside :
hints
forward chain from an implication in the hyps
create a ``free variable''
show the generated equivalence relation maintained at the current subterm
perform a generalization
list the names of goals on the stack
proof-checker help facility
proof-checker help facility
same as help!
print the hypotheses
illegal instruction
set the current proof-checker theory
generate subgoals using induction
print the runes (definitions, lemmas, ...) used
evaluate the given form in Lisp
proof-checker help facility
proof-checker help facility
run the given instructions, and ``succeed'' if and only if they ``fail''
used for interpreting control-d
run instructions with output
move forward one argument in the enclosing term
run the first instruction; if (and only if) it ``fails'', run the
second
prettyprint the current term
prettyprint the conclusion, highlighting the current term
print the rules for a given name
prettyprint the current term
print the rules for a given name
print the result of evaluating the given form
print all the conclusions of (as yet unproved) goals
print all the (as yet unproved) goals
print the original goal
repeatedly apply promote
move antecedents of conclusion's implies
term to top-level
hypotheses
run the given instructions, reverting to existing state upon
failure
call the ACL2 theorem prover to prove the current goal
print the most recent proof attempt from inside the proof-checker
print the most recent proof attempt from inside the proof-checker
print the most recent proof attempt from inside the proof-checker
substitute for a ``free variable''
run instructions without output
same as rewrite
call the ACL2 theorem prover's simplifier
call the ACL2 prover without induction, after going into
induction
remove one or more abbreviations
repeat the given instruction until it ``fails''
auxiliary to repeat
replay one or more instructions
remove the effect of an UNDO command
drop all but the indicated top-level hypotheses
re-enter the proof-checker
apply a rewrite rule
auxiliary to THEN
auxiliary to then
print the runes (definitions, lemmas, ...) used
simplify the current subterm
simplify propositionally
save the proof-checker state (state-stack)
run the given list of instructions according to a multitude of
options
display the current abbreviations
display the applicable linear rules
display the applicable rewrite rules
display the applicable type-prescription rules
``succeed'' without doing anything
simplify with lemmas
same as SHOW-LINEARS
split the current goal into cases
same as SHOW-REWRITES
same as SHOW-TYPE-PRESCRIPTIONS
run the given instructions, and ``succeed''
print the top-level hypotheses and the current subterm
apply one instruction to current goal and another to new subgoals
move to the top of the goal
display the type-alist from the current context
undo some instructions
remove a proof-checker state
move to the parent (or some ancestor) of the current subterm
use a lemma instance
execute the indicated instructions and combine all the new goals
same as induct, but create a single goal
combine goals into a single goal
expand and (maybe) simplify function call at the current subterm
expand function call at the current subterm, without simplifying