TSTP Solution File: SYN398+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN398+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:03 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 ( 3 unt; 0 def)
% Number of atoms : 331 ( 0 equ)
% Maximal formula atoms : 324 ( 55 avg)
% Number of connectives : 434 ( 109 ~; 245 |; 80 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 87 ( 16 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 5 ( 3 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kalish215,plain,
! [A,D] :
( ( p
| p
| p
| ~ f(y_nn_1(A)) )
& ( f(D)
| p
| p
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| p
| p
| ~ f(y_nn_1(A)) )
& ( p
| f(D)
| p
| ~ f(y_nn_1(A)) )
& ( f(D)
| f(D)
| p
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| f(D)
| p
| ~ f(y_nn_1(A)) )
& ( p
| ~ p
| p
| ~ f(y_nn_1(A)) )
& ( f(D)
| ~ p
| p
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| ~ p
| p
| ~ f(y_nn_1(A)) )
& ( p
| p
| f(A)
| ~ f(y_nn_1(A)) )
& ( f(D)
| p
| f(A)
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| p
| f(A)
| ~ f(y_nn_1(A)) )
& ( p
| f(D)
| f(A)
| ~ f(y_nn_1(A)) )
& ( f(D)
| f(D)
| f(A)
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| f(D)
| f(A)
| ~ f(y_nn_1(A)) )
& ( p
| ~ p
| f(A)
| ~ f(y_nn_1(A)) )
& ( f(D)
| ~ p
| f(A)
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| ~ p
| f(A)
| ~ f(y_nn_1(A)) )
& ( p
| p
| ~ p
| ~ f(y_nn_1(A)) )
& ( f(D)
| p
| ~ p
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| p
| ~ p
| ~ f(y_nn_1(A)) )
& ( p
| f(D)
| ~ p
| ~ f(y_nn_1(A)) )
& ( f(D)
| f(D)
| ~ p
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| f(D)
| ~ p
| ~ f(y_nn_1(A)) )
& ( p
| ~ p
| ~ p
| ~ f(y_nn_1(A)) )
& ( f(D)
| ~ p
| ~ p
| ~ f(y_nn_1(A)) )
& ( ~ f(x(A))
| ~ p
| ~ p
| ~ f(y_nn_1(A)) )
& ( p
| p
| p
| p )
& ( f(D)
| p
| p
| p )
& ( ~ f(x(A))
| p
| p
| p )
& ( p
| f(D)
| p
| p )
& ( f(D)
| f(D)
| p
| p )
& ( ~ f(x(A))
| f(D)
| p
| p )
& ( p
| ~ p
| p
| p )
& ( f(D)
| ~ p
| p
| p )
& ( ~ f(x(A))
| ~ p
| p
| p )
& ( p
| p
| f(A)
| p )
& ( f(D)
| p
| f(A)
| p )
& ( ~ f(x(A))
| p
| f(A)
| p )
& ( p
| f(D)
| f(A)
| p )
& ( f(D)
| f(D)
| f(A)
| p )
& ( ~ f(x(A))
| f(D)
| f(A)
| p )
& ( p
| ~ p
| f(A)
| p )
& ( f(D)
| ~ p
| f(A)
| p )
& ( ~ f(x(A))
| ~ p
| f(A)
| p )
& ( p
| p
| ~ p
| p )
& ( f(D)
| p
| ~ p
| p )
& ( ~ f(x(A))
| p
| ~ p
| p )
& ( p
| f(D)
| ~ p
| p )
& ( f(D)
| f(D)
| ~ p
| p )
& ( ~ f(x(A))
| f(D)
| ~ p
| p )
& ( p
| ~ p
| ~ p
| p )
& ( f(D)
| ~ p
| ~ p
| p )
& ( ~ f(x(A))
| ~ p
| ~ p
| p )
& ( p
| p
| p
| f(A) )
& ( f(D)
| p
| p
| f(A) )
& ( ~ f(x(A))
| p
| p
| f(A) )
& ( p
| f(D)
| p
| f(A) )
& ( f(D)
| f(D)
| p
| f(A) )
& ( ~ f(x(A))
| f(D)
| p
| f(A) )
& ( p
| ~ p
| p
| f(A) )
& ( f(D)
| ~ p
| p
| f(A) )
& ( ~ f(x(A))
| ~ p
| p
| f(A) )
& ( p
| p
| f(A)
| f(A) )
& ( f(D)
| p
| f(A)
| f(A) )
& ( ~ f(x(A))
| p
| f(A)
| f(A) )
& ( p
| f(D)
| f(A)
| f(A) )
& ( f(D)
| f(D)
| f(A)
| f(A) )
& ( ~ f(x(A))
| f(D)
| f(A)
| f(A) )
& ( p
| ~ p
| f(A)
| f(A) )
& ( f(D)
| ~ p
| f(A)
| f(A) )
& ( ~ f(x(A))
| ~ p
| f(A)
| f(A) )
& ( p
| p
| ~ p
| f(A) )
& ( f(D)
| p
| ~ p
| f(A) )
& ( ~ f(x(A))
| p
| ~ p
| f(A) )
& ( p
| f(D)
| ~ p
| f(A) )
& ( f(D)
| f(D)
| ~ p
| f(A) )
& ( ~ f(x(A))
| f(D)
| ~ p
| f(A) )
& ( p
| ~ p
| ~ p
| f(A) )
& ( f(D)
| ~ p
| ~ p
| f(A) )
& ( ~ f(x(A))
| ~ p
| ~ p
| f(A) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN398+1.tptp',unknown),
[] ).
cnf(172251088,plain,
( p
| f(A) ),
inference(rewrite,[status(thm)],[kalish215]),
[] ).
cnf(172256696,plain,
p,
inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish215,172251088]),
[] ).
cnf(172244792,plain,
( f(D)
| f(A) ),
inference(rewrite,[status(thm)],[kalish215]),
[] ).
cnf(172261392,plain,
~ p,
inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish215,172244792]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[172256696,172261392]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish215,plain,(((p|p|p|~f(y_nn_1(A)))&(f(D)|p|p|~f(y_nn_1(A)))&(~f(x(A))|p|p|~f(y_nn_1(A)))&(p|f(D)|p|~f(y_nn_1(A)))&(f(D)|f(D)|p|~f(y_nn_1(A)))&(~f(x(A))|f(D)|p|~f(y_nn_1(A)))&(p|~p|p|~f(y_nn_1(A)))&(f(D)|~p|p|~f(y_nn_1(A)))&(~f(x(A))|~p|p|~f(y_nn_1(A)))&(p|p|f(A)|~f(y_nn_1(A)))&(f(D)|p|f(A)|~f(y_nn_1(A)))&(~f(x(A))|p|f(A)|~f(y_nn_1(A)))&(p|f(D)|f(A)|~f(y_nn_1(A)))&(f(D)|f(D)|f(A)|~f(y_nn_1(A)))&(~f(x(A))|f(D)|f(A)|~f(y_nn_1(A)))&(p|~p|f(A)|~f(y_nn_1(A)))&(f(D)|~p|f(A)|~f(y_nn_1(A)))&(~f(x(A))|~p|f(A)|~f(y_nn_1(A)))&(p|p|~p|~f(y_nn_1(A)))&(f(D)|p|~p|~f(y_nn_1(A)))&(~f(x(A))|p|~p|~f(y_nn_1(A)))&(p|f(D)|~p|~f(y_nn_1(A)))&(f(D)|f(D)|~p|~f(y_nn_1(A)))&(~f(x(A))|f(D)|~p|~f(y_nn_1(A)))&(p|~p|~p|~f(y_nn_1(A)))&(f(D)|~p|~p|~f(y_nn_1(A)))&(~f(x(A))|~p|~p|~f(y_nn_1(A)))&(p|p|p|p)&(f(D)|p|p|p)&(~f(x(A))|p|p|p)&(p|f(D)|p|p)&(f(D)|f(D)|p|p)&(~f(x(A))|f(D)|p|p)&(p|~p|p|p)&(f(D)|~p|p|p)&(~f(x(A))|~p|p|p)&(p|p|f(A)|p)&(f(D)|p|f(A)|p)&(~f(x(A))|p|f(A)|p)&(p|f(D)|f(A)|p)&(f(D)|f(D)|f(A)|p)&(~f(x(A))|f(D)|f(A)|p)&(p|~p|f(A)|p)&(f(D)|~p|f(A)|p)&(~f(x(A))|~p|f(A)|p)&(p|p|~p|p)&(f(D)|p|~p|p)&(~f(x(A))|p|~p|p)&(p|f(D)|~p|p)&(f(D)|f(D)|~p|p)&(~f(x(A))|f(D)|~p|p)&(p|~p|~p|p)&(f(D)|~p|~p|p)&(~f(x(A))|~p|~p|p)&(p|p|p|f(A))&(f(D)|p|p|f(A))&(~f(x(A))|p|p|f(A))&(p|f(D)|p|f(A))&(f(D)|f(D)|p|f(A))&(~f(x(A))|f(D)|p|f(A))&(p|~p|p|f(A))&(f(D)|~p|p|f(A))&(~f(x(A))|~p|p|f(A))&(p|p|f(A)|f(A))&(f(D)|p|f(A)|f(A))&(~f(x(A))|p|f(A)|f(A))&(p|f(D)|f(A)|f(A))&(f(D)|f(D)|f(A)|f(A))&(~f(x(A))|f(D)|f(A)|f(A))&(p|~p|f(A)|f(A))&(f(D)|~p|f(A)|f(A))&(~f(x(A))|~p|f(A)|f(A))&(p|p|~p|f(A))&(f(D)|p|~p|f(A))&(~f(x(A))|p|~p|f(A))&(p|f(D)|~p|f(A))&(f(D)|f(D)|~p|f(A))&(~f(x(A))|f(D)|~p|f(A))&(p|~p|~p|f(A))&(f(D)|~p|~p|f(A))&(~f(x(A))|~p|~p|f(A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN398+1.tptp',unknown),[]).
%
% cnf(172251088,plain,(p|f(A)),inference(rewrite,[status(thm)],[kalish215]),[]).
%
% cnf(172256696,plain,(p),inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish215,172251088]),[]).
%
% cnf(172244792,plain,(f(D)|f(A)),inference(rewrite,[status(thm)],[kalish215]),[]).
%
% cnf(172261392,plain,(~p),inference(rewrite__forward_subsumption_resolution,[status(thm)],[kalish215,172244792]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[172256696,172261392]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------