TSTP Solution File: COL013-1 by Faust---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : COL013-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art10.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May  6 11:31:21 EDT 2009

% Result   : Unsatisfiable 0.0s
% Output   : Refutation 0.0s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   6 unt;   0 def)
%            Number of atoms       :    6 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    7 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_fixed_point,plain,
    ! [A] : ~ $equal(apply(combinator,A),A),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL013-1.tptp',unknown),
    [] ).

cnf(168399192,plain,
    ~ $equal(apply(combinator,A),A),
    inference(rewrite,[status(thm)],[prove_fixed_point]),
    [] ).

fof(l_definition,plain,
    ! [A,B] : $equal(apply(apply(l,A),B),apply(A,apply(B,B))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL013-1.tptp',unknown),
    [] ).

cnf(168394536,plain,
    $equal(apply(apply(l,A),B),apply(A,apply(B,B))),
    inference(rewrite,[status(thm)],[l_definition]),
    [] ).

cnf(176188616,plain,
    ~ $equal(apply(apply(l,combinator),A),apply(A,A)),
    inference(paramodulation,[status(thm)],[168399192,168394536,theory(equality)]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(equality_resolution,[status(thm)],[176188616]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_fixed_point,plain,(~$equal(apply(combinator,A),A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL013-1.tptp',unknown),[]).
% 
% cnf(168399192,plain,(~$equal(apply(combinator,A),A)),inference(rewrite,[status(thm)],[prove_fixed_point]),[]).
% 
% fof(l_definition,plain,($equal(apply(apply(l,A),B),apply(A,apply(B,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL013-1.tptp',unknown),[]).
% 
% cnf(168394536,plain,($equal(apply(apply(l,A),B),apply(A,apply(B,B)))),inference(rewrite,[status(thm)],[l_definition]),[]).
% 
% cnf(176188616,plain,(~$equal(apply(apply(l,combinator),A),apply(A,A))),inference(paramodulation,[status(thm)],[168399192,168394536,theory(equality)]),[]).
% 
% cnf(contradiction,plain,$false,inference(equality_resolution,[status(thm)],[176188616]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------