TPTP Problem File: NUN088+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : NUN088+1 : TPTP v8.2.0. Released v7.3.0.
% Domain : Number Theory
% Problem : Robinson arithmetic: 0 != 1
% Version : Especial.
% English :
% Refs : [BBJ03] Boolos et al. (2003), Computability and Logic
% : [Smi07] Smith (2007), An Introduction to Goedel's Theorems
% : [Lam18] Lampert (2018), Email to Geoff Sutcliffe
% Source : [Lam18]
% Names : zerounidone [Lam18]
% Status : Theorem
% Rating : 0.00 v7.3.0
% Syntax : Number of formulae : 19 ( 1 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 98 ( 38 ~; 29 |; 31 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 5 usr; 0 prp; 1-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 70 ( 50 !; 20 ?)
% SPC : FOF_THM_RFO_NEQ
% Comments : Translated to FOL without equality.
%------------------------------------------------------------------------------
include('Axioms/NUM009+0.ax').
%------------------------------------------------------------------------------
fof(zerounidone,conjecture,
! [Y1] :
( ! [Y2] :
( ~ id(Y2,Y1)
| ~ r1(Y2) )
| ! [Y3] :
( ~ r1(Y3)
| ~ r2(Y3,Y1) ) ) ).
%------------------------------------------------------------------------------