support for low-level interaction
Parent topic: Home
Call this up with (verify ...)
.
attempt an equality (or equivalence) substitution
same as (lisp x)
add an abbreviation
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.
add a new hypothesis
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
forward chain from an implication in the hyps
create a ``free variable''
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
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
prettyprint the current term
print the result of evaluating the given form
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
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 toxae THEN
auxiliary to then
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 rewrite rules
``succeed'' without doing anything
simplify with lemmas
split the current goal into cases
same as SHOW-REWRITES
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
expand and (maybe) simplify function call at the current subterm
expand function call at the current subterm, without simplifying
defthm
event with an :
instructions
parameter supplied. Such an event can be replayed later in a new
ACL2 session with the ``proof-checker'' loaded.
Individual proof-checker commands have already been listed above.
Among them are proof-checker commands help
, help-long
, more
, and
more!
, which behave respectively like the ACL2 functions :
doc
,
:
doc!
, :
more
, and :
more!
.