A resolution theorem prover capable of proving most logical statements specified in first-order logic.
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
Lisp
Quicklisp
Clone the repo.
-
Add
lib/agent
asagent
to~/quicklisp/local-projects
-
Add
src
asrtp
to~/quicklisp/local-projects
-
Run
sbcl --noinform --noprint --disable-debugger --eval '(ql:quickload "rtp" :silent t)' --eval '(in-package :rtp)' --eval '(run-simulator)' --eval '(cl-user::quit)'
-
Input filename (e.g.
marcus
,robot
, etc.) of file inbases
-
Input theorem to prove (e.g.
(grows John Carrots)
)
- Connor Langlois - ConnorLanglois
This project is not licensed.