TPTP Problem File: ARI163_1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ARI163_1 : TPTP v9.0.0. Released v5.0.0.
% Domain : Arithmetic
% Problem : Integer: Between -1 and 1 must be 0
% Version : Especial.
% English :
% Refs :
% Source : [TPTP]
% Names :
% Status : Theorem
% Rating : 0.12 v7.5.0, 0.10 v7.4.0, 0.12 v7.3.0, 0.17 v7.0.0, 0.00 v6.3.0, 0.14 v6.2.0, 0.50 v6.1.0, 0.44 v6.0.0, 0.43 v5.5.0, 0.44 v5.4.0, 0.50 v5.3.0, 0.60 v5.2.0, 0.83 v5.1.0, 0.80 v5.0.0
% Syntax : Number of formulae : 1 ( 0 unt; 0 typ; 0 def)
% Number of atoms : 3 ( 1 equ)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 2 ( 0 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 8 ( 2 atm; 1 fun; 4 num; 1 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 0 prp; 2-2 aty)
% Number of functors : 4 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 1 ( 1 !; 0 ?; 1 :)
% SPC : TF0_THM_EQU_ARI
% Comments :
%------------------------------------------------------------------------------
tff(sum_something_0_samething,conjecture,
! [X: $int] :
( ( $less(-1,X)
& $less(X,1) )
=> ( $sum(21,X) = 21 ) ) ).
%------------------------------------------------------------------------------