%------------------------------------------------------------------------------
% File     : CSR108+5 : TPTP v9.0.0. Bugfixed v7.3.0.
% Domain   : Commonsense Reasoning
% Problem  : Defines a new predicate of 10 arguments
% Version  : Especial.
% English  :

% Refs     : [NP01]  Niles & Pease (2001), Towards A Standard Upper Ontology
%          : [Sie07] Siegel (2007), Email to G. Sutcliffe
% Source   : [Sie07]
% Names    : TQG44

% Status   : ContradictoryAxioms
% Rating   : 0.73 v9.0.0, 0.75 v7.5.0, 0.84 v7.4.0, 0.29 v7.3.0
% Syntax   : Number of formulae    : 16773 (11436 unt;   0 def)
%            Number of atoms       : 38576 (1489 equ)
%            Maximal formula atoms :   23 (   2 avg)
%            Number of connectives : 22726 ( 923   ~; 115   |;10365   &)
%                                         ( 137 <=>;11186  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   3 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :  488 ( 487 usr;   0 prp; 1-10 aty)
%            Number of functors    : 9448 (9001 usr;9313 con; 0-8 aty)
%            Number of variables   : 13120 (11627   !;1493   ?)
% SPC      : FOF_CAX_RFO_SEQ

% Comments : 
% Bugfixes : v4.0.1 - Bugfixes in CSR003 axiom files.
%          : v4.1.0 - Bugfixes in CSR003 axiom files.
%          : v5.3.0 - Bugfixes in CSR003 axiom files.
%          : v5.4.0 - Bugfixes in CSR003 axiom files.
%          : v7.3.0 - Bugfixes in CSR003 axiom files.
%------------------------------------------------------------------------------
%----Include axioms from SUMO_MILO
include('Axioms/CSR003+1.ax').
%------------------------------------------------------------------------------
fof(local_1,axiom,
    s__instance(s__testPred44_1_M,s__Predicate) ).

fof(local_2,axiom,
    s__valence(s__testPred44_1_M,n10) ).

fof(local_3,axiom,
    s__domain(s__testPred44_1_M,n1,s__Entity) ).

fof(local_4,axiom,
    s__domain(s__testPred44_1_M,n2,s__Entity) ).

fof(local_5,axiom,
    s__domain(s__testPred44_1_M,n3,s__Entity) ).

fof(local_6,axiom,
    s__domain(s__testPred44_1_M,n4,s__Entity) ).

fof(local_7,axiom,
    s__domain(s__testPred44_1_M,n5,s__Entity) ).

fof(local_8,axiom,
    s__domain(s__testPred44_1_M,n6,s__Entity) ).

fof(local_9,axiom,
    s__domain(s__testPred44_1_M,n7,s__Entity) ).

fof(local_10,axiom,
    s__domain(s__testPred44_1_M,n8,s__Entity) ).

fof(local_11,axiom,
    s__domain(s__testPred44_1_M,n9,s__Entity) ).

fof(local_12,axiom,
    s__domain(s__testPred44_1_M,n10,s__Entity) ).

fof(local_13,axiom,
    s__instance(s__Entity44_1,s__Entity) ).

fof(local_14,axiom,
    s__instance(s__Entity44_2,s__Entity) ).

fof(local_15,axiom,
    s__instance(s__Entity44_3,s__Entity) ).

fof(local_16,axiom,
    s__instance(s__Entity44_4,s__Entity) ).

fof(local_17,axiom,
    s__instance(s__Entity44_5,s__Entity) ).

fof(local_18,axiom,
    s__instance(s__Entity44_6,s__Entity) ).

fof(local_19,axiom,
    s__instance(s__Entity44_7,s__Entity) ).

fof(local_20,axiom,
    s__instance(s__Entity44_8,s__Entity) ).

fof(local_21,axiom,
    s__instance(s__Entity44_9,s__Entity) ).

fof(local_22,axiom,
    s__instance(s__Entity44_10,s__Entity) ).

fof(local_23,axiom,
    s__testPred44_1__10(s__Entity44_1,s__Entity44_2,s__Entity44_3,s__Entity44_4,s__Entity44_5,s__Entity44_6,s__Entity44_7,s__Entity44_8,s__Entity44_9,s__Entity44_10) ).

fof(local_24,axiom,
    ! [V_ARG1,V_ARG2,V_ARG3,V_ARG4,V_ARG5,V_ARG6,V_ARG7,V_ARG8,V_ARG9,V_ARG10] :
      ( s__testPred44_1__10(V_ARG1,V_ARG2,V_ARG3,V_ARG4,V_ARG5,V_ARG6,V_ARG7,V_ARG8,V_ARG9,V_ARG10)
     => ( s__instance(V_ARG1,s__Amphibian)
        & s__instance(V_ARG2,s__Bird)
        & s__instance(V_ARG9,s__Mammal)
        & s__instance(V_ARG10,s__Reptile) ) ) ).

fof(prove_from_SUMO_MILO,conjecture,
    ( s__instance(s__Entity44_1,s__Animal)
    & s__instance(s__Entity44_2,s__Animal)
    & s__instance(s__Entity44_9,s__Animal)
    & s__instance(s__Entity44_10,s__Animal) ) ).

%------------------------------------------------------------------------------