TPTP Problem File: ARI732=1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ARI732=1 : TPTP v7.4.0. Released v6.3.0.
% Domain : Arithmetic
% Problem : If X is an integer and 5*X+Y is an integer, then Y is an integer
% Version : Especial.
% English :
% Refs : [Wal14] Waldmann (2014), Email to Geoff Sutcliffe
% Source : [Wal14]
% Names :
% Status : Theorem
% Rating : 0.60 v7.4.0, 0.67 v7.3.0, 0.75 v7.1.0, 0.67 v6.4.0, 0.33 v6.3.0
% Syntax : Number of formulae : 1 ( 0 unit; 0 type)
% Number of atoms : 3 ( 0 equality)
% Maximal formula depth : 5 ( 5 average)
% Number of connectives : 2 ( 0 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% ( 0 ~|; 0 ~&)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 propositional; 0-1 arity)
% Number of functors : 3 ( 1 constant; 0-2 arity)
% Number of variables : 2 ( 0 sgn; 2 !; 0 ?)
% ( 2 :; 0 !>; 0 ?*)
% Maximal term depth : 3 ( 2 average)
% Arithmetic symbols : 6 ( 1 prd; 2 fun; 1 num; 2 var)
% SPC : TF0_THM_NEQ_ARI
% Comments :
%------------------------------------------------------------------------------
tff(prove,conjecture,(
! [X: $real,Y: $real] :
( ( $is_int(X)
& $is_int($sum($product(5.0,X),Y)) )
=> $is_int(Y) ) )).
%------------------------------------------------------------------------------