TPTP Problem File: ARI684_1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ARI684_1 : TPTP v9.0.0. Released v6.3.0.
% Domain : Arithmetic
% Problem : Expand polynomial a * (a + b) * c
% Version : Especial.
% English :
% Refs : [BHS07] Beckert et al. (2007), Verification of Object-Oriented
% : [Rue14] Ruemmer (2014), Email to Geoff Sutcliffe
% Source : [Rue14]
% Names : simplify0b.pri [BHS07]
% : poly_simplify0b.p [Rue14]
% Status : Theorem
% Rating : 0.00 v8.2.0, 0.12 v7.5.0, 0.20 v7.4.0, 0.25 v7.3.0, 0.17 v7.0.0, 0.43 v6.4.0, 0.33 v6.3.0
% Syntax : Number of formulae : 4 ( 1 unt; 3 typ; 0 def)
% Number of atoms : 1 ( 1 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 : 4 ( 2 avg)
% Number arithmetic : 8 ( 0 atm; 8 fun; 0 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 ( 3 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(a_type,type,
a: $int ).
tff(b_type,type,
b: $int ).
tff(c_type,type,
c: $int ).
tff(conj,conjecture,
$product($product(a,$sum(a,b)),c) = $sum($product($product(a,a),c),$product($product(a,b),c)) ).
%------------------------------------------------------------------------------