TSTP Solution File: SYN053+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN053+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 16:39:26 EDT 2009
% Result : Theorem 0.2s
% Output : Refutation 0.2s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 339 ( 0 equ)
% Maximal formula atoms : 324 ( 37 avg)
% Number of connectives : 551 ( 221 ~; 250 |; 80 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 87 ( 12 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 : 12 ( 10 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(pel23,plain,
! [A,D] :
( ( ~ p
| ~ p
| ~ p
| p )
& ( ~ big_f(x(A))
| ~ p
| ~ p
| p )
& ( p
| ~ p
| ~ p
| p )
& ( ~ p
| ~ big_f(x(A))
| ~ p
| p )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| ~ p
| p )
& ( p
| ~ big_f(x(A))
| ~ p
| p )
& ( ~ p
| big_f(D)
| ~ p
| p )
& ( ~ big_f(x(A))
| big_f(D)
| ~ p
| p )
& ( p
| big_f(D)
| ~ p
| p )
& ( ~ p
| ~ p
| ~ big_f(x1_nn_1(A))
| p )
& ( ~ big_f(x(A))
| ~ p
| ~ big_f(x1_nn_1(A))
| p )
& ( p
| ~ p
| ~ big_f(x1_nn_1(A))
| p )
& ( ~ p
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| p )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| p )
& ( p
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| p )
& ( ~ p
| big_f(D)
| ~ big_f(x1_nn_1(A))
| p )
& ( ~ big_f(x(A))
| big_f(D)
| ~ big_f(x1_nn_1(A))
| p )
& ( p
| big_f(D)
| ~ big_f(x1_nn_1(A))
| p )
& ( ~ p
| ~ p
| big_f(A)
| p )
& ( ~ big_f(x(A))
| ~ p
| big_f(A)
| p )
& ( p
| ~ p
| big_f(A)
| p )
& ( ~ p
| ~ big_f(x(A))
| big_f(A)
| p )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| big_f(A)
| p )
& ( p
| ~ big_f(x(A))
| big_f(A)
| p )
& ( ~ p
| big_f(D)
| big_f(A)
| p )
& ( ~ big_f(x(A))
| big_f(D)
| big_f(A)
| p )
& ( p
| big_f(D)
| big_f(A)
| p )
& ( ~ p
| ~ p
| ~ p
| ~ p )
& ( ~ big_f(x(A))
| ~ p
| ~ p
| ~ p )
& ( p
| ~ p
| ~ p
| ~ p )
& ( ~ p
| ~ big_f(x(A))
| ~ p
| ~ p )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| ~ p
| ~ p )
& ( p
| ~ big_f(x(A))
| ~ p
| ~ p )
& ( ~ p
| big_f(D)
| ~ p
| ~ p )
& ( ~ big_f(x(A))
| big_f(D)
| ~ p
| ~ p )
& ( p
| big_f(D)
| ~ p
| ~ p )
& ( ~ p
| ~ p
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( ~ big_f(x(A))
| ~ p
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( p
| ~ p
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( ~ p
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( p
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( ~ p
| big_f(D)
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( ~ big_f(x(A))
| big_f(D)
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( p
| big_f(D)
| ~ big_f(x1_nn_1(A))
| ~ p )
& ( ~ p
| ~ p
| big_f(A)
| ~ p )
& ( ~ big_f(x(A))
| ~ p
| big_f(A)
| ~ p )
& ( p
| ~ p
| big_f(A)
| ~ p )
& ( ~ p
| ~ big_f(x(A))
| big_f(A)
| ~ p )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| big_f(A)
| ~ p )
& ( p
| ~ big_f(x(A))
| big_f(A)
| ~ p )
& ( ~ p
| big_f(D)
| big_f(A)
| ~ p )
& ( ~ big_f(x(A))
| big_f(D)
| big_f(A)
| ~ p )
& ( p
| big_f(D)
| big_f(A)
| ~ p )
& ( ~ p
| ~ p
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| ~ p
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( p
| ~ p
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| ~ big_f(x(A))
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( p
| ~ big_f(x(A))
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| big_f(D)
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| big_f(D)
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( p
| big_f(D)
| ~ p
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| ~ p
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| ~ p
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( p
| ~ p
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( p
| ~ big_f(x(A))
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| big_f(D)
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| big_f(D)
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( p
| big_f(D)
| ~ big_f(x1_nn_1(A))
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| ~ p
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| ~ p
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( p
| ~ p
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| ~ big_f(x(A))
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| ~ big_f(x(A))
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( p
| ~ big_f(x(A))
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( ~ p
| big_f(D)
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( ~ big_f(x(A))
| big_f(D)
| big_f(A)
| ~ big_f(x1_nn_1(A)) )
& ( p
| big_f(D)
| big_f(A)
| ~ big_f(x1_nn_1(A)) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN053+1.tptp',unknown),
[] ).
cnf(170448992,plain,
( p
| big_f(D)
| big_f(A) ),
inference(rewrite,[status(thm)],[pel23]),
[] ).
cnf(170426176,plain,
( ~ p
| big_f(A) ),
inference(rewrite,[status(thm)],[pel23]),
[] ).
cnf(170444712,plain,
~ p,
inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel23,170426176]),
[] ).
cnf(222788520,plain,
( big_f(D)
| big_f(A) ),
inference(resolution,[status(thm)],[170448992,170444712]),
[] ).
cnf(170385936,plain,
( p
| big_f(D)
| ~ big_f(x1_nn_1(A)) ),
inference(rewrite,[status(thm)],[pel23]),
[] ).
cnf(170395192,plain,
( big_f(D)
| ~ big_f(x1_nn_1(A)) ),
inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel23,170385936]),
[] ).
cnf(170407864,plain,
~ big_f(x1_nn_1(A)),
inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel23,170395192]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[222788520,170407864]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(pel23,plain,(((~p|~p|~p|p)&(~big_f(x(A))|~p|~p|p)&(p|~p|~p|p)&(~p|~big_f(x(A))|~p|p)&(~big_f(x(A))|~big_f(x(A))|~p|p)&(p|~big_f(x(A))|~p|p)&(~p|big_f(D)|~p|p)&(~big_f(x(A))|big_f(D)|~p|p)&(p|big_f(D)|~p|p)&(~p|~p|~big_f(x1_nn_1(A))|p)&(~big_f(x(A))|~p|~big_f(x1_nn_1(A))|p)&(p|~p|~big_f(x1_nn_1(A))|p)&(~p|~big_f(x(A))|~big_f(x1_nn_1(A))|p)&(~big_f(x(A))|~big_f(x(A))|~big_f(x1_nn_1(A))|p)&(p|~big_f(x(A))|~big_f(x1_nn_1(A))|p)&(~p|big_f(D)|~big_f(x1_nn_1(A))|p)&(~big_f(x(A))|big_f(D)|~big_f(x1_nn_1(A))|p)&(p|big_f(D)|~big_f(x1_nn_1(A))|p)&(~p|~p|big_f(A)|p)&(~big_f(x(A))|~p|big_f(A)|p)&(p|~p|big_f(A)|p)&(~p|~big_f(x(A))|big_f(A)|p)&(~big_f(x(A))|~big_f(x(A))|big_f(A)|p)&(p|~big_f(x(A))|big_f(A)|p)&(~p|big_f(D)|big_f(A)|p)&(~big_f(x(A))|big_f(D)|big_f(A)|p)&(p|big_f(D)|big_f(A)|p)&(~p|~p|~p|~p)&(~big_f(x(A))|~p|~p|~p)&(p|~p|~p|~p)&(~p|~big_f(x(A))|~p|~p)&(~big_f(x(A))|~big_f(x(A))|~p|~p)&(p|~big_f(x(A))|~p|~p)&(~p|big_f(D)|~p|~p)&(~big_f(x(A))|big_f(D)|~p|~p)&(p|big_f(D)|~p|~p)&(~p|~p|~big_f(x1_nn_1(A))|~p)&(~big_f(x(A))|~p|~big_f(x1_nn_1(A))|~p)&(p|~p|~big_f(x1_nn_1(A))|~p)&(~p|~big_f(x(A))|~big_f(x1_nn_1(A))|~p)&(~big_f(x(A))|~big_f(x(A))|~big_f(x1_nn_1(A))|~p)&(p|~big_f(x(A))|~big_f(x1_nn_1(A))|~p)&(~p|big_f(D)|~big_f(x1_nn_1(A))|~p)&(~big_f(x(A))|big_f(D)|~big_f(x1_nn_1(A))|~p)&(p|big_f(D)|~big_f(x1_nn_1(A))|~p)&(~p|~p|big_f(A)|~p)&(~big_f(x(A))|~p|big_f(A)|~p)&(p|~p|big_f(A)|~p)&(~p|~big_f(x(A))|big_f(A)|~p)&(~big_f(x(A))|~big_f(x(A))|big_f(A)|~p)&(p|~big_f(x(A))|big_f(A)|~p)&(~p|big_f(D)|big_f(A)|~p)&(~big_f(x(A))|big_f(D)|big_f(A)|~p)&(p|big_f(D)|big_f(A)|~p)&(~p|~p|~p|~big_f(x1_nn_1(A)))&(~big_f(x(A))|~p|~p|~big_f(x1_nn_1(A)))&(p|~p|~p|~big_f(x1_nn_1(A)))&(~p|~big_f(x(A))|~p|~big_f(x1_nn_1(A)))&(~big_f(x(A))|~big_f(x(A))|~p|~big_f(x1_nn_1(A)))&(p|~big_f(x(A))|~p|~big_f(x1_nn_1(A)))&(~p|big_f(D)|~p|~big_f(x1_nn_1(A)))&(~big_f(x(A))|big_f(D)|~p|~big_f(x1_nn_1(A)))&(p|big_f(D)|~p|~big_f(x1_nn_1(A)))&(~p|~p|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(~big_f(x(A))|~p|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(p|~p|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(~p|~big_f(x(A))|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(~big_f(x(A))|~big_f(x(A))|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(p|~big_f(x(A))|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(~p|big_f(D)|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(~big_f(x(A))|big_f(D)|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(p|big_f(D)|~big_f(x1_nn_1(A))|~big_f(x1_nn_1(A)))&(~p|~p|big_f(A)|~big_f(x1_nn_1(A)))&(~big_f(x(A))|~p|big_f(A)|~big_f(x1_nn_1(A)))&(p|~p|big_f(A)|~big_f(x1_nn_1(A)))&(~p|~big_f(x(A))|big_f(A)|~big_f(x1_nn_1(A)))&(~big_f(x(A))|~big_f(x(A))|big_f(A)|~big_f(x1_nn_1(A)))&(p|~big_f(x(A))|big_f(A)|~big_f(x1_nn_1(A)))&(~p|big_f(D)|big_f(A)|~big_f(x1_nn_1(A)))&(~big_f(x(A))|big_f(D)|big_f(A)|~big_f(x1_nn_1(A)))&(p|big_f(D)|big_f(A)|~big_f(x1_nn_1(A))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN053+1.tptp',unknown),[]).
%
% cnf(170448992,plain,(p|big_f(D)|big_f(A)),inference(rewrite,[status(thm)],[pel23]),[]).
%
% cnf(170426176,plain,(~p|big_f(A)),inference(rewrite,[status(thm)],[pel23]),[]).
%
% cnf(170444712,plain,(~p),inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel23,170426176]),[]).
%
% cnf(222788520,plain,(big_f(D)|big_f(A)),inference(resolution,[status(thm)],[170448992,170444712]),[]).
%
% cnf(170385936,plain,(p|big_f(D)|~big_f(x1_nn_1(A))),inference(rewrite,[status(thm)],[pel23]),[]).
%
% cnf(170395192,plain,(big_f(D)|~big_f(x1_nn_1(A))),inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel23,170385936]),[]).
%
% cnf(170407864,plain,(~big_f(x1_nn_1(A))),inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel23,170395192]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[222788520,170407864]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------