## TPTP Problem File: ARI707=1.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : ARI707=1 : TPTP v8.0.0. Released v6.3.0.
% Domain   : Arithmetic
% Problem  : Simple rewriting: d*d + c = 2*d*d implies c*d*d = c*c
% Version  : Especial.
% English  :

% Refs     : [BHS07] Beckert et al. (2007), Verification of Object-Oriented
%          : [Rue14] Ruemmer (2014), Email to Geoff Sutcliffe
% Source   : [Rue14]
% Names    : simplify4.pri [BHS07]
%          : poly_simplify4.p [Rue14]

% Status   : Theorem
% Rating   : 0.38 v7.5.0, 0.40 v7.4.0, 0.38 v7.3.0, 0.33 v7.0.0, 0.43 v6.4.0, 0.33 v6.3.0
% Syntax   : Number of formulae    :    4 (   2 unt;   2 typ;   0 def)
%            Number of atoms       :    2 (   2 equ)
%            Maximal formula atoms :    1 (   0 avg)
%            Number of connectives :    0 (   0   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    1 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number arithmetic     :    8 (   0 atm;   7 fun;   1 num;   0 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    5 (   2 usr;   3 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)
% SPC      : TF0_THM_EQU_ARI

% Comments : KeY arithmetic regression test, http://www.key-project.org
%------------------------------------------------------------------------------
tff(d_type,type,
d: \$int ).

tff(c_type,type,
c: \$int ).

tff(eq,axiom,
\$sum(\$product(d,d),c) = \$product(\$product(2,d),d) ).

tff(conj,conjecture,
\$product(\$product(c,d),d) = \$product(c,c) ).

%------------------------------------------------------------------------------
```