TPTP Problem File: DAT033_1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : DAT033_1 : TPTP v9.0.0. Released v5.0.0.
% Domain : Data Structures
% Problem : Count changes are consistent with adding and removal
% Version : [PW06] axioms.
% English :
% Refs : [PW06] Prevosto & Waldmann (2006), SPASS+T
% : [Wal10] Waldmann (2010), Email to Geoff Sutcliffe
% Source : [Wal10]
% Names : (56) [PW06]
% Status : Theorem
% Rating : 0.00 v7.5.0, 0.10 v7.4.0, 0.00 v6.2.0, 0.25 v6.1.0, 0.33 v6.0.0, 0.43 v5.5.0, 0.56 v5.4.0, 0.50 v5.1.0, 0.20 v5.0.0
% Syntax : Number of formulae : 19 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 52 ( 11 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 16 ( 5 ~; 1 |; 1 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 28 ( 28 fml; 0 var)
% Number arithmetic : 23 ( 1 atm; 2 fun; 8 num; 12 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 0 prp; 1-2 aty)
% Number of functors : 10 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 24 !; 0 ?; 24 :)
% SPC : TF0_THM_EQU_ARI
% Comments :
%------------------------------------------------------------------------------
%----Includes axioms for collections with counting
include('Axioms/DAT002_0.ax').
include('Axioms/DAT002=1.ax').
%------------------------------------------------------------------------------
tff(co1,conjecture,
! [U: collection] :
( ( count(add(5,U)) = count(add(3,U)) )
=> ( count(remove(5,U)) = count(remove(3,U)) ) ) ).
%------------------------------------------------------------------------------