TPTP Problem File: ANA040-1.rm

View Solutions - Solve Problem

%------------------------------------------------------------------------------
% File     : ANA040-1 : TPTP v8.2.0. Released v3.2.0.
% Domain   : Analysis
% Problem  : Problem about Big-O notation
% Version  : [Pau06] axioms : Especial.
% English  :

% Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source   : [Pau06]
% Names    : BigO__bigo_refl [Pau06]

% Status   : Unsatisfiable
% Rating   : 0.57 v3.2.0
% Syntax   : Number of clauses     : 2784 ( 248 non-Horn; 646 unit;1975 RR)
%            Number of atoms       : 6116 (1279 equality)
%            Maximal clause size   :    7 (   2 average)
%            Number of predicates  :   87 (   0 propositional; 1-3 arity)
%            Number of functors    :  237 (  45 constant; 0-18 arity)
%            Number of variables   : 5799 (1183 singleton)
%            Maximal term depth    :    8 (   1 average)

% Comments : The problems in the [Pau06] collection each have very many axioms,
%            of which only a small selection are required for the refutation.
%            The mission is to find those few axioms, after which a refutation
%            can be quite easily found.
% Bugfixes : v3.3.0 - Removed - duplicate of ANA007-1
%------------------------------------------------------------------------------