%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN409+1 : TPTP v3.4.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art02.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:29 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 2 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 36 ( 7 avg)
% Number of connectives : 59 ( 20 ~; 28 |; 11 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-1 aty)
% Number of variables : 8 ( 3 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kalish246,plain,
! [A,E,F] :
( ( f(A)
| f(A)
| f(E) )
& ( ~ f(y_nn_1(A))
| f(A)
| f(E) )
& ( f(A)
| ~ f(z_nn_2(A))
| f(E) )
& ( ~ f(y_nn_1(A))
| ~ f(z_nn_2(A))
| f(E) )
& ( f(A)
| f(A)
| f(F) )
& ( ~ f(y_nn_1(A))
| f(A)
| f(F) )
& ( f(A)
| ~ f(z_nn_2(A))
| f(F) )
& ( ~ f(y_nn_1(A))
| ~ f(z_nn_2(A))
| f(F) )
& ( f(A)
| f(A)
| ~ f(x(A)) )
& ( ~ f(y_nn_1(A))
| f(A)
| ~ f(x(A)) )
& ( f(A)
| ~ f(z_nn_2(A))
| ~ f(x(A)) )
& ( ~ f(y_nn_1(A))
| ~ f(z_nn_2(A))
| ~ f(x(A)) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN409+1.tptp',unknown),
[] ).
cnf(165648152,plain,
( f(A)
| f(F) ),
inference(rewrite,[status(thm)],[kalish246]),
[] ).
cnf(165630032,plain,
( f(A)
| ~ f(x(A)) ),
inference(rewrite,[status(thm)],[kalish246]),
[] ).
cnf(191763928,plain,
f(A),
inference(resolution,[status(thm)],[165630032,165648152]),
[] ).
cnf(165611600,plain,
( ~ f(y_nn_1(A))
| ~ f(z_nn_2(A))
| ~ f(x(A)) ),
inference(rewrite,[status(thm)],[kalish246]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[165648152,191763928,165611600,191763928]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish246,plain,(((f(A)|f(A)|f(E))&(~f(y_nn_1(A))|f(A)|f(E))&(f(A)|~f(z_nn_2(A))|f(E))&(~f(y_nn_1(A))|~f(z_nn_2(A))|f(E))&(f(A)|f(A)|f(F))&(~f(y_nn_1(A))|f(A)|f(F))&(f(A)|~f(z_nn_2(A))|f(F))&(~f(y_nn_1(A))|~f(z_nn_2(A))|f(F))&(f(A)|f(A)|~f(x(A)))&(~f(y_nn_1(A))|f(A)|~f(x(A)))&(f(A)|~f(z_nn_2(A))|~f(x(A)))&(~f(y_nn_1(A))|~f(z_nn_2(A))|~f(x(A))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN409+1.tptp',unknown),[]).
%
% cnf(165648152,plain,(f(A)|f(F)),inference(rewrite,[status(thm)],[kalish246]),[]).
%
% cnf(165630032,plain,(f(A)|~f(x(A))),inference(rewrite,[status(thm)],[kalish246]),[]).
%
% cnf(191763928,plain,(f(A)),inference(resolution,[status(thm)],[165630032,165648152]),[]).
%
% cnf(165611600,plain,(~f(y_nn_1(A))|~f(z_nn_2(A))|~f(x(A))),inference(rewrite,[status(thm)],[kalish246]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[165648152,191763928,165611600,191763928]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------