TPTP Problem File: ANA011-2.rm
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : ANA011-2 : TPTP v9.0.0. Released v3.2.0.
% Domain : Analysis
% Problem : Problem about Big-O notation
% Version : [Pau06] axioms : Reduced > Especial.
% English :
% Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% Source : [Pau06]
% Names :
% Status : Unsatisfiable
% Rating : 0.29 v3.2.0
% Syntax : Number of clauses : 9 ( 0 non-Horn; 4 unit; 6 RR)
% Number of atoms : 17 ( 2 equality)
% Maximal clause size : 4 ( 2 average)
% Number of predicates : 5 ( 0 propositional; 1-3 arity)
% Number of functors : 8 ( 3 constant; 0-3 arity)
% Number of variables : 26 ( 20 singleton)
% Maximal term depth : 5 ( 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. This version has only the necessary
% axioms.
% Bugfixes : v3.3.0 - Removed - duplicate of ANA010-2
%------------------------------------------------------------------------------