TSTP Solution File: SYN318+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN318+1 : TPTP v3.4.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art07.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:48:55 EDT 2009
% Result : Theorem 0.2s
% Output : Refutation 0.2s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 2 unt; 0 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 192 ( 39 avg)
% Number of connectives : 278 ( 84 ~; 131 |; 63 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 69 ( 16 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 8 ( 5 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(church_46_2_4,plain,
! [B,A] :
( ( p
| p
| ~ big_f(B) )
& ( big_f(x(A,B))
| p
| ~ big_f(B) )
& ( ~ big_g(A)
| p
| ~ big_f(B) )
& ( big_g(B)
| p
| ~ big_f(B) )
& ( p
| big_f(x(A,B))
| ~ big_f(B) )
& ( big_f(x(A,B))
| big_f(x(A,B))
| ~ big_f(B) )
& ( ~ big_g(A)
| big_f(x(A,B))
| ~ big_f(B) )
& ( big_g(B)
| big_f(x(A,B))
| ~ big_f(B) )
& ( p
| ~ big_g(A)
| ~ big_f(B) )
& ( big_f(x(A,B))
| ~ big_g(A)
| ~ big_f(B) )
& ( ~ big_g(A)
| ~ big_g(A)
| ~ big_f(B) )
& ( big_g(B)
| ~ big_g(A)
| ~ big_f(B) )
& ( p
| ~ big_f(A)
| ~ big_f(B) )
& ( big_f(x(A,B))
| ~ big_f(A)
| ~ big_f(B) )
& ( ~ big_g(A)
| ~ big_f(A)
| ~ big_f(B) )
& ( big_g(B)
| ~ big_f(A)
| ~ big_f(B) )
& ( p
| p
| p )
& ( big_f(x(A,B))
| p
| p )
& ( ~ big_g(A)
| p
| p )
& ( big_g(B)
| p
| p )
& ( p
| big_f(x(A,B))
| p )
& ( big_f(x(A,B))
| big_f(x(A,B))
| p )
& ( ~ big_g(A)
| big_f(x(A,B))
| p )
& ( big_g(B)
| big_f(x(A,B))
| p )
& ( p
| ~ big_g(A)
| p )
& ( big_f(x(A,B))
| ~ big_g(A)
| p )
& ( ~ big_g(A)
| ~ big_g(A)
| p )
& ( big_g(B)
| ~ big_g(A)
| p )
& ( p
| ~ big_f(A)
| p )
& ( big_f(x(A,B))
| ~ big_f(A)
| p )
& ( ~ big_g(A)
| ~ big_f(A)
| p )
& ( big_g(B)
| ~ big_f(A)
| p )
& ( p
| p
| big_f(x(A,B)) )
& ( big_f(x(A,B))
| p
| big_f(x(A,B)) )
& ( ~ big_g(A)
| p
| big_f(x(A,B)) )
& ( big_g(B)
| p
| big_f(x(A,B)) )
& ( p
| big_f(x(A,B))
| big_f(x(A,B)) )
& ( big_f(x(A,B))
| big_f(x(A,B))
| big_f(x(A,B)) )
& ( ~ big_g(A)
| big_f(x(A,B))
| big_f(x(A,B)) )
& ( big_g(B)
| big_f(x(A,B))
| big_f(x(A,B)) )
& ( p
| ~ big_g(A)
| big_f(x(A,B)) )
& ( big_f(x(A,B))
| ~ big_g(A)
| big_f(x(A,B)) )
& ( ~ big_g(A)
| ~ big_g(A)
| big_f(x(A,B)) )
& ( big_g(B)
| ~ big_g(A)
| big_f(x(A,B)) )
& ( p
| ~ big_f(A)
| big_f(x(A,B)) )
& ( big_f(x(A,B))
| ~ big_f(A)
| big_f(x(A,B)) )
& ( ~ big_g(A)
| ~ big_f(A)
| big_f(x(A,B)) )
& ( big_g(B)
| ~ big_f(A)
| big_f(x(A,B)) )
& ( p
| p
| ~ big_g(A) )
& ( big_f(x(A,B))
| p
| ~ big_g(A) )
& ( ~ big_g(A)
| p
| ~ big_g(A) )
& ( big_g(B)
| p
| ~ big_g(A) )
& ( p
| big_f(x(A,B))
| ~ big_g(A) )
& ( big_f(x(A,B))
| big_f(x(A,B))
| ~ big_g(A) )
& ( ~ big_g(A)
| big_f(x(A,B))
| ~ big_g(A) )
& ( big_g(B)
| big_f(x(A,B))
| ~ big_g(A) )
& ( p
| ~ big_g(A)
| ~ big_g(A) )
& ( big_f(x(A,B))
| ~ big_g(A)
| ~ big_g(A) )
& ( ~ big_g(A)
| ~ big_g(A)
| ~ big_g(A) )
& ( big_g(B)
| ~ big_g(A)
| ~ big_g(A) )
& ( p
| ~ big_f(A)
| ~ big_g(A) )
& ( big_f(x(A,B))
| ~ big_f(A)
| ~ big_g(A) )
& ( ~ big_g(A)
| ~ big_f(A)
| ~ big_g(A) )
& ( big_g(B)
| ~ big_f(A)
| ~ big_g(A) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN318+1.tptp',unknown),
[] ).
cnf(152648656,plain,
( big_g(B)
| ~ big_f(A)
| ~ big_f(B) ),
inference(rewrite,[status(thm)],[church_46_2_4]),
[] ).
cnf(152653312,plain,
( ~ big_f(A)
| ~ big_f(B) ),
inference(rewrite__forward_subsumption_resolution,[status(thm)],[church_46_2_4,152648656]),
[] ).
cnf(152622896,plain,
big_f(x(A,B)),
inference(rewrite,[status(thm)],[church_46_2_4]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[152653312,152622896]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(church_46_2_4,plain,(((p|p|~big_f(B))&(big_f(x(A,B))|p|~big_f(B))&(~big_g(A)|p|~big_f(B))&(big_g(B)|p|~big_f(B))&(p|big_f(x(A,B))|~big_f(B))&(big_f(x(A,B))|big_f(x(A,B))|~big_f(B))&(~big_g(A)|big_f(x(A,B))|~big_f(B))&(big_g(B)|big_f(x(A,B))|~big_f(B))&(p|~big_g(A)|~big_f(B))&(big_f(x(A,B))|~big_g(A)|~big_f(B))&(~big_g(A)|~big_g(A)|~big_f(B))&(big_g(B)|~big_g(A)|~big_f(B))&(p|~big_f(A)|~big_f(B))&(big_f(x(A,B))|~big_f(A)|~big_f(B))&(~big_g(A)|~big_f(A)|~big_f(B))&(big_g(B)|~big_f(A)|~big_f(B))&(p|p|p)&(big_f(x(A,B))|p|p)&(~big_g(A)|p|p)&(big_g(B)|p|p)&(p|big_f(x(A,B))|p)&(big_f(x(A,B))|big_f(x(A,B))|p)&(~big_g(A)|big_f(x(A,B))|p)&(big_g(B)|big_f(x(A,B))|p)&(p|~big_g(A)|p)&(big_f(x(A,B))|~big_g(A)|p)&(~big_g(A)|~big_g(A)|p)&(big_g(B)|~big_g(A)|p)&(p|~big_f(A)|p)&(big_f(x(A,B))|~big_f(A)|p)&(~big_g(A)|~big_f(A)|p)&(big_g(B)|~big_f(A)|p)&(p|p|big_f(x(A,B)))&(big_f(x(A,B))|p|big_f(x(A,B)))&(~big_g(A)|p|big_f(x(A,B)))&(big_g(B)|p|big_f(x(A,B)))&(p|big_f(x(A,B))|big_f(x(A,B)))&(big_f(x(A,B))|big_f(x(A,B))|big_f(x(A,B)))&(~big_g(A)|big_f(x(A,B))|big_f(x(A,B)))&(big_g(B)|big_f(x(A,B))|big_f(x(A,B)))&(p|~big_g(A)|big_f(x(A,B)))&(big_f(x(A,B))|~big_g(A)|big_f(x(A,B)))&(~big_g(A)|~big_g(A)|big_f(x(A,B)))&(big_g(B)|~big_g(A)|big_f(x(A,B)))&(p|~big_f(A)|big_f(x(A,B)))&(big_f(x(A,B))|~big_f(A)|big_f(x(A,B)))&(~big_g(A)|~big_f(A)|big_f(x(A,B)))&(big_g(B)|~big_f(A)|big_f(x(A,B)))&(p|p|~big_g(A))&(big_f(x(A,B))|p|~big_g(A))&(~big_g(A)|p|~big_g(A))&(big_g(B)|p|~big_g(A))&(p|big_f(x(A,B))|~big_g(A))&(big_f(x(A,B))|big_f(x(A,B))|~big_g(A))&(~big_g(A)|big_f(x(A,B))|~big_g(A))&(big_g(B)|big_f(x(A,B))|~big_g(A))&(p|~big_g(A)|~big_g(A))&(big_f(x(A,B))|~big_g(A)|~big_g(A))&(~big_g(A)|~big_g(A)|~big_g(A))&(big_g(B)|~big_g(A)|~big_g(A))&(p|~big_f(A)|~big_g(A))&(big_f(x(A,B))|~big_f(A)|~big_g(A))&(~big_g(A)|~big_f(A)|~big_g(A))&(big_g(B)|~big_f(A)|~big_g(A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN318+1.tptp',unknown),[]).
%
% cnf(152648656,plain,(big_g(B)|~big_f(A)|~big_f(B)),inference(rewrite,[status(thm)],[church_46_2_4]),[]).
%
% cnf(152653312,plain,(~big_f(A)|~big_f(B)),inference(rewrite__forward_subsumption_resolution,[status(thm)],[church_46_2_4,152648656]),[]).
%
% cnf(152622896,plain,(big_f(x(A,B))),inference(rewrite,[status(thm)],[church_46_2_4]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[152653312,152622896]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------