TPTP Problem File: SET035-4.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SET035-4 : TPTP v9.0.0. Released v1.0.0.
% Domain : Set Theory
% Problem : Maps for composition
% Version : [BL+86] axioms.
% English :
% Refs : [BL+86] Boyer et al. (1986), Set Theory in First-Order Logic:
% Source : [BL+86]
% Names : Lemma 20 [BL+86]
% Status : Unknown
% Rating : 1.00 v2.0.0
% Syntax : Number of clauses : 144 ( 14 unt; 20 nHn; 121 RR)
% Number of literals : 358 ( 47 equ; 198 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 0 prp; 1-5 aty)
% Number of functors : 65 ( 65 usr; 12 con; 0-5 aty)
% Number of variables : 320 ( 28 sgn)
% SPC : CNF_UNK_RFO_SEQ_NHN
% Comments :
%--------------------------------------------------------------------------
%----Include Godel's set axioms
include('Axioms/SET003-0.ax').
%--------------------------------------------------------------------------
cnf(one_mapping,hypothesis,
maps(function1,a,b) ).
cnf(another_mapping,hypothesis,
maps(function2,c,d) ).
cnf(prove_maps_for_composition,negated_conjecture,
~ maps(compose(function2,function1),a,d) ).
%--------------------------------------------------------------------------