rover_prover 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 6a7050bef420f0cc3f96200719297c7f30b5f25c677ce14c678c7b12117a8026
+  data.tar.gz: bd3a374772ab8996e65821b575a14b47711c341ade5551eff58241fca424e151
+SHA512:
+  metadata.gz: 61deceed57fe3fd5c6c5eed18e6891f3b2ed40656b2d0aff9680ab551384c1877a6f59d53c6ebdc0bceecf1ab6dba6b55f229c3844cd39dc91e29fc3a161a804
+  data.tar.gz: 68c79dcc633ddb5b70f9b8303ce151ea82bcf2564b54d02d79f45807935a6ab3285b5c3c657038244abd7b568b53fb0970729faf88bf16214281c226814061df

data/.gitignore

@@ -0,0 +1 @@
+Gemfile.lock

data/.rspec

@@ -0,0 +1 @@
+--require spec_helper

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at liukoki@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+git_source(:github) {|repo_name| "https://github.com/#{repo_name}" }
+
+gem "rspec"
+gem "rltk"

data/Gemfile.lock

@@ -0,0 +1,32 @@
+GEM
+  remote: https://rubygems.org/
+  specs:
+    diff-lcs (1.3)
+    ffi (1.11.1)
+    filigree (0.4.1)
+    rltk (3.0.1)
+      ffi (>= 1.0.0)
+      filigree (>= 0.2.0)
+    rspec (3.8.0)
+      rspec-core (~> 3.8.0)
+      rspec-expectations (~> 3.8.0)
+      rspec-mocks (~> 3.8.0)
+    rspec-core (3.8.0)
+      rspec-support (~> 3.8.0)
+    rspec-expectations (3.8.3)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-mocks (3.8.0)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-support (3.8.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  rltk
+  rspec
+
+BUNDLED WITH
+   2.0.1

data/LICENSE.txt

@@ -0,0 +1,31 @@
+The MIT License (MIT)
+
+Copyright (c) 2019 Koki Ryu
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+Copyright (C) 2014 Stephan Boyer
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+

data/README.md

@@ -0,0 +1,98 @@
+![Rover](./logo.png)
+Rover is an automated theorem prover for first-order logic written in Ruby.It is translation of [theorem-prover](https://github.com/stepchowfun/theorem-prover) from Python.
+For any provable formula, this program is guaranteed to find the proof (eventually). However, as a consequence of the negative answer to Hilbert's *Entscheidungsproblem*, there are some unprovable formulae that will cause this program to loop forever.
+
+
+To get started, please `gem install rover_prover`:
+
+```
+$ rover_prover
+Rover: First-Order Logic Theorem Prover
+2019 Koki Ryu
+2014 Stephan Boyer
+Terms:
+
+  x               (variable)
+  f(term, ...)    (function)
+
+Formulae:
+
+  P(term)        (predicate)
+  not P          (complement)
+  P or Q         (disjunction)
+  P and Q        (conjunction)
+  P implies Q    (implication)
+  forall x. P    (universal quantification)
+  exists x. P    (existential quantification)
+
+Enter formulae at the prompt. The following commands are also available for manipulating axioms:
+
+  axioms              (list axioms)
+  lemmas              (list lemmas)
+  axiom <formula>     (add an axiom)
+  lemma <formula>     (prove and add a lemma)
+  remove <formula>    (remove an axiom or lemma)
+  reset               (remove all axioms and lemmas)
+
+Enter 'exit' command to exit the prompt.
+
+Rover>
+```
+
+Example session:
+```
+Rover> P or not P
+0.  ⊢ (P ∨ ¬P)
+1.  ⊢ P, ¬P
+2. P ⊢ P
+Formula proven: (P ∨ ¬P)
+
+Rover> P and not P
+0.  ⊢ (P ∧ ¬P)
+1.  ⊢ ¬P
+2. P ⊢
+Formula unprovable: (P ∧ ¬P)
+
+Rover> forall x. P(x) implies (Q(x) implies P(x))
+0.  ⊢ (∀x. (P(x) -> (Q(x) -> P(x))))
+1.  ⊢ (P(v1) -> (Q(v1) -> P(v1)))
+2. P(v1) ⊢ (Q(v1) -> P(v1))
+3. P(v1), Q(v1) ⊢ P(v1)
+Formula proven: (∀x. (P(x) -> (Q(x) -> P(x))))
+
+Rover> exists x. (P(x) implies forall y. P(y))
+0.  ⊢ (∃x. (P(x) -> (∀y. P(y))))
+1.  ⊢ (∃x. (P(x) -> (∀y. P(y)))), (P(t1) -> (∀y. P(y)))
+2.  ⊢ (∃x. (P(x) -> (∀y. P(y)))), (P(t1) -> (∀y. P(y))), (P(t2) -> (∀y. P(y)))
+3. P(t1) ⊢ (∃x. (P(x) -> (∀y. P(y)))), (P(t2) -> (∀y. P(y))), (∀y. P(y))
+4. P(t1) ⊢ (∃x. (P(x) -> (∀y. P(y)))), (P(t2) -> (∀y. P(y))), (∀y. P(y)), (P(t3) -> (∀y. P(y)))
+5. P(t1), P(t2) ⊢ (∃x. (P(x) -> (∀y. P(y)))), (∀y. P(y)), (P(t3) -> (∀y. P(y))), (∀y. P(y))
+6. P(t1), P(t2) ⊢ (∃x. (P(x) -> (∀y. P(y)))), (P(t3) -> (∀y. P(y))), (∀y. P(y)), P(v1)
+7. P(t1), P(t2) ⊢ (∃x. (P(x) -> (∀y. P(y)))), (P(t3) -> (∀y. P(y))), (∀y. P(y)), P(v1), (P(t4) -> (∀y. P(y)))
+8. P(t1), P(t2), P(t3) ⊢ (∃x. (P(x) -> (∀y. P(y)))), (∀y. P(y)), P(v1), (P(t4) -> (∀y. P(y))), (∀y. P(y))
+9. P(t1), P(t2), P(t3) ⊢ (∃x. (P(x) -> (∀y. P(y)))), P(v1), (P(t4) -> (∀y. P(y))), (∀y. P(y)), P(v2)
+10. P(t1), P(t2), P(t3) ⊢ (∃x. (P(x) -> (∀y. P(y)))), P(v1), (P(t4) -> (∀y. P(y))), (∀y. P(y)), P(v2), (P(t5) -> (∀y. P(y)))
+11. P(t1), P(t2), P(t3), P(t4) ⊢ (∃x. (P(x) -> (∀y. P(y)))), P(v1), (∀y. P(y)), P(v2), (P(t5) -> (∀y. P(y))), (∀y. P(y))
+t4 = v1
+Formula proven: (∃x. (P(x) -> (∀y. P(y))))
+
+Rover> axiom forall x. Equals(x, x)
+Axiom added: (∀x. Equals(x, x))
+
+Rover> axioms
+(∀x. Equals(x, x))
+
+Rover> lemma Equals(a, a)
+0. (∀x. Equals(x, x)) ⊢ Equals(a, a)
+1. (∀x. Equals(x, x)), Equals(t1, t1) ⊢ Equals(a, a)
+t1 = a
+Lemma proven: Equals(a, a)
+
+Rover> lemmas
+Equals(a, a)
+
+Rover> remove forall x. Equals(x, x)
+Axiom removed: (∀x. Equals(x, x))
+Dependent axioms are also removed:
+Equals(a, a)
+```

data/Rakefile

@@ -0,0 +1,2 @@
+require "bundler/gem_tasks"
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "rover_prover"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/exe/rover_prover

@@ -0,0 +1,5 @@
+#!/usr/bin/env ruby
+
+require_relative '../lib/rover_prover.rb'
+
+RoverProver::Main.run

data/lib/rover_prover/language/expression.rb

@@ -0,0 +1,33 @@
+module Expression
+  def free_variables
+    raise NotImplementedError
+  end
+
+  def free_unification_terms
+    raise NotImplementedError
+  end
+
+  def replace(old, new)
+    raise NotImplementedError
+  end
+
+  def occurs(unification_term)
+    raise NotImplementedError
+  end
+
+  def to_s
+    raise NotImplementedError
+  end
+
+  def set_instantiation_time(time)
+    raise NotImplementedError
+  end
+
+  def eql?(term)
+    raise NotImplementedError
+  end
+
+  def unify(term)
+    nil
+  end
+end

data/lib/rover_prover/language/formula/and.rb

@@ -0,0 +1,41 @@
+require_relative '../formula.rb'
+
+class And < Formula
+  attr_reader :formula_a, :formula_b
+
+  def initialize(formula_a, formula_b)
+    @formula_a = formula_a
+    @formula_b = formula_b
+  end
+
+  def free_variables
+    @formula_a.free_variables | @formula_b.free_variables
+  end
+
+  def free_unification_terms
+    @formula_a.free_unification_terms | @formula_b.free_unification_terms
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    And.new(@formula_a.replace(old, new), @formula_b.replace(old, new))
+  end
+
+  def occurs(unification_term)
+    @formula_a.occurs(unification_term) || @formula_b.occurs(unification_term)
+  end
+
+  def set_instantiation_time(time)
+    @formula_a.set_instantiation_time(time)
+    @formula_b.set_instantiation_time(time)
+  end
+
+  def to_s
+    "(#{@formula_a.to_s} ∧ #{@formula_b.to_s})"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(And)
+    @formula_a.eql?(exp.formula_a) && @formula_b.eql?(exp.formula_b)
+  end
+end

data/lib/rover_prover/language/formula/for_all.rb

@@ -0,0 +1,44 @@
+require_relative '../formula.rb'
+
+class ForAll < Formula
+  attr_reader :variable, :formula
+
+  def initialize(variable, formula)
+    @variable = variable
+    @formula = formula
+  end
+
+  def free_variables
+    @formula.free_variables.reject{ |var| var.eql?(@variable) }
+  end
+
+  def free_unification_terms
+    @formula.free_unification_terms
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    ForAll.new(
+      @variable.replace(old, new),
+      @formula.replace(old, new)
+    )
+  end
+
+  def occurs(unification_term)
+    @formula.occurs(unification_term)
+  end
+
+  def set_instantiation_time(time)
+    @variable.set_instantiation_time(time)
+    @formula.set_instantiation_time(time)
+  end
+
+  def to_s
+    "(∀#{@variable.to_s}. #{@formula.to_s})"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(ForAll)
+    @variable.eql?(exp.variable) && @formula.eql?(exp.formula)
+  end
+end

data/lib/rover_prover/language/formula/formulae.rb

@@ -0,0 +1,7 @@
+require_relative 'and.rb'
+require_relative 'implies.rb'
+require_relative 'or.rb'
+require_relative 'there_exists.rb'
+require_relative 'for_all.rb'
+require_relative 'not.rb'
+require_relative 'predicate.rb'

data/lib/rover_prover/language/formula/implies.rb

@@ -0,0 +1,41 @@
+require_relative '../formula.rb'
+
+class Implies < Formula
+  attr_reader :formula_a, :formula_b
+
+  def initialize(formula_a, formula_b)
+    @formula_a = formula_a
+    @formula_b = formula_b
+  end
+
+  def free_variables
+    @formula_a.free_variables | @formula_b.free_variables
+  end
+
+  def free_unification_terms
+    @formula_a.free_unification_terms | @formula_b.free_unification_terms
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    Implies.new(@formula_a.replace(old, new), @formula_b.replace(old, new))
+  end
+
+  def occurs(unification_term)
+    @formula_a.occurs(unification_term) || @formula_b.occurs(unification_term)
+  end
+
+  def set_instantiation_time(time)
+    @formula_a.set_instantiation_time(time)
+    @formula_b.set_instantiation_time(time)
+  end
+
+  def to_s
+    "(#{@formula_a.to_s} -> #{@formula_b.to_s})"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(Implies)
+    @formula_a.eql?(exp.formula_a) && @formula_b.eql?(exp.formula_b)
+  end
+end

data/lib/rover_prover/language/formula/not.rb

@@ -0,0 +1,39 @@
+require_relative '../formula.rb'
+
+class Not < Formula
+  attr_reader :formula
+
+  def initialize(formula)
+    @formula = formula
+  end
+
+  def free_variables
+    @formula.free_variables
+  end
+
+  def free_unification_terms
+    @formula.free_unification_terms
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    Not.new(@formula.replace(old, new))
+  end
+
+  def set_instantiation_time(time)
+    @formula.set_instantiation_time(time)
+  end
+
+  def occurs(unification_term)
+    @formula.occurs(unification_term)
+  end
+
+  def to_s
+    "¬#{@formula.to_s}"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(Not)
+    @formula.eql?(exp.formula)
+  end
+end

data/lib/rover_prover/language/formula/or.rb

@@ -0,0 +1,41 @@
+require_relative '../formula.rb'
+
+class Or < Formula
+  attr_reader :formula_a, :formula_b
+
+  def initialize(formula_a, formula_b)
+    @formula_a = formula_a
+    @formula_b = formula_b
+  end
+
+  def free_variables
+    @formula_a.free_variables | @formula_b.free_variables
+  end
+
+  def free_unification_terms
+    @formula_a.free_unification_terms | @formula_b.free_unification_terms
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    Or.new(@formula_a.replace(old, new), @formula_b.replace(old, new))
+  end
+
+  def occurs(unification_term)
+    @formula_a.occurs(unification_term) || @formula_b.occurs(unification_term)
+  end
+
+  def set_instantiation_time(time)
+    @formula_a.set_instantiation_time(time)
+    @formula_b.set_instantiation_time(time)
+  end
+
+  def to_s
+    "(#{@formula_a.to_s} ∨ #{@formula_b.to_s})"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(Or)
+    @formula_a.eql?(exp.formula_a) && @formula_b.eql?(exp.formula_b)
+  end
+end

data/lib/rover_prover/language/formula/predicate.rb

@@ -0,0 +1,64 @@
+require_relative '../formula.rb'
+
+class Predicate < Formula
+  attr_reader :name, :terms
+
+  def initialize(name, terms)
+    @name = name
+    @terms = terms
+  end
+
+  def free_variables
+    @terms.map(&:free_variables).flatten.uniq
+  end
+
+  def free_unification_terms
+    @terms.map(&:free_unification_terms).flatten.uniq
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    Predicate.new(@name, @terms.map { |term| term.replace(old, new) })
+  end
+
+  def set_instantiation_time(time)
+    @terms.each{ |term| term.set_instantiation_time(time) }
+  end
+
+  def occurs(unification_term)
+    @terms.any? { |term| term.occurs(unification_term) }
+  end
+
+  def to_s
+    terms_s = @terms.empty? ? "" : "(#{@terms.map(&:to_s).join(', ')})"
+    "#{@name}#{terms_s}"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(Predicate)
+    return false unless @name == exp.name
+    return false unless @terms.length == exp.terms.length
+    @terms.zip(exp.terms).all? { |t1, t2| t1.eql?(t2) }
+  end
+
+  def unify(term)
+    return term.unify(self) if term.is_a?(UnificationTerm)
+    return nil unless term.is_a?(Predicate)
+    return nil unless @name == term.name
+    return nil unless @terms.length == term.terms.length
+    term_pair = @terms.zip(term.terms)
+    subst = {}
+
+    term_pair.each do |term_a, term_b|
+      subst.each do |k, v| 
+        term_a = term_a.replace(k, v)
+        term_b = term_b.replace(k, v)
+      end
+      sub = term_a.unify(term_b)
+      return nil if sub == nil
+      subst.merge!(sub)
+    end
+    subst
+  end
+
+end

data/lib/rover_prover/language/formula/there_exists.rb

@@ -0,0 +1,42 @@
+class ThereExists < Formula
+  attr_reader :variable, :formula
+
+  def initialize(variable, formula)
+    @variable = variable
+    @formula = formula
+  end
+
+  def free_variables
+    @formula.free_variables.reject{ |var| var.eql?(@variable) }
+  end
+
+  def free_unification_terms
+    @formula.free_unification_terms
+  end
+
+  def replace(old, new)
+    return new if eql?(old)
+    ThereExists.new(
+      @variable.replace(old, new),
+      @formula.replace(old, new)
+    )
+  end
+
+  def occurs(unification_term)
+    @formula.occurs(unification_term)
+  end
+
+  def set_instantiation_time(time)
+    @variable.set_instantiation_time(time)
+    @formula.set_instantiation_time(time)
+  end
+
+  def to_s
+    "(∃#{@variable.to_s}. #{@formula.to_s})"
+  end
+
+  def eql?(exp)
+    return false unless exp.is_a?(ThereExists)
+    @variable.eql?(exp.variable) && @formula.eql?(exp.formula)
+  end
+end

data/lib/rover_prover/language/formula.rb

@@ -0,0 +1,5 @@
+require_relative 'expression.rb'
+
+class Formula
+  include Expression
+end