%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN397+1 : TPTP v3.4.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.17-1.2142_FC4
% CPULimit : 600s
% DateTime : Wed May 6 17:53:01 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 19 ( 8 ~; 8 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 11 ( 8 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kalish204,plain,
! [D,A] :
( ( ~ f(D)
| ~ f(A) )
& ( f(x(A))
| ~ f(A) )
& ( ~ f(D)
| f(y_nn_1(A)) )
& ( f(x(A))
| f(y_nn_1(A)) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN397+1.tptp',unknown),
[] ).
cnf(162043648,plain,
( ~ f(D)
| f(y_nn_1(A)) ),
inference(rewrite,[status(thm)],[kalish204]),
[] ).
cnf(162037200,plain,
( f(x(A))
| f(y_nn_1(A)) ),
inference(rewrite,[status(thm)],[kalish204]),
[] ).
cnf(177666144,plain,
( f(y_nn_1(A))
| f(y_nn_1(D)) ),
inference(resolution,[status(thm)],[162043648,162037200]),
[] ).
cnf(162052768,plain,
( ~ f(D)
| ~ f(A) ),
inference(rewrite,[status(thm)],[kalish204]),
[] ).
cnf(177696576,plain,
~ f(F),
inference(resolution,[status(thm)],[162052768,162043648]),
[] ).
cnf(177702568,plain,
f(y_nn_1(D)),
inference(resolution,[status(thm)],[177666144,177696576]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[177702568,177696576]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish204,plain,(((~f(D)|~f(A))&(f(x(A))|~f(A))&(~f(D)|f(y_nn_1(A)))&(f(x(A))|f(y_nn_1(A))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN397+1.tptp',unknown),[]).
%
% cnf(162043648,plain,(~f(D)|f(y_nn_1(A))),inference(rewrite,[status(thm)],[kalish204]),[]).
%
% cnf(162037200,plain,(f(x(A))|f(y_nn_1(A))),inference(rewrite,[status(thm)],[kalish204]),[]).
%
% cnf(177666144,plain,(f(y_nn_1(A))|f(y_nn_1(D))),inference(resolution,[status(thm)],[162043648,162037200]),[]).
%
% cnf(162052768,plain,(~f(D)|~f(A)),inference(rewrite,[status(thm)],[kalish204]),[]).
%
% cnf(177696576,plain,(~f(F)),inference(resolution,[status(thm)],[162052768,162043648]),[]).
%
% cnf(177702568,plain,(f(y_nn_1(D))),inference(resolution,[status(thm)],[177666144,177696576]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[177702568,177696576]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------