%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : COL053-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:32:47 EDT 2009
% Result : Unsatisfiable 0.1s
% Output : Refutation 0.1s
% 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 : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_bird_exists,plain,
! [A] : ~ $equal(response(a,response(b,response(c,f(A)))),response(A,f(A))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL053-1.tptp',unknown),
[] ).
cnf(168320280,plain,
~ $equal(response(a,response(b,response(c,f(A)))),response(A,f(A))),
inference(rewrite,[status(thm)],[prove_bird_exists]),
[] ).
fof(composer_exists,plain,
! [A,B,C] : $equal(response(A,response(B,C)),response(compose(A,B),C)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL053-1.tptp',unknown),
[] ).
cnf(168315304,plain,
$equal(response(A,response(B,C)),response(compose(A,B),C)),
inference(rewrite,[status(thm)],[composer_exists]),
[] ).
cnf(176113736,plain,
~ $equal(response(compose(a,b),response(c,f(A))),response(A,f(A))),
inference(paramodulation,[status(thm)],[168320280,168315304,theory(equality)]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[176113736,168315304]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_bird_exists,plain,(~$equal(response(a,response(b,response(c,f(A)))),response(A,f(A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL053-1.tptp',unknown),[]).
%
% cnf(168320280,plain,(~$equal(response(a,response(b,response(c,f(A)))),response(A,f(A)))),inference(rewrite,[status(thm)],[prove_bird_exists]),[]).
%
% fof(composer_exists,plain,($equal(response(A,response(B,C)),response(compose(A,B),C))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL053-1.tptp',unknown),[]).
%
% cnf(168315304,plain,($equal(response(A,response(B,C)),response(compose(A,B),C))),inference(rewrite,[status(thm)],[composer_exists]),[]).
%
% cnf(176113736,plain,(~$equal(response(compose(a,b),response(c,f(A))),response(A,f(A)))),inference(paramodulation,[status(thm)],[168320280,168315304,theory(equality)]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[176113736,168315304]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------