TSTP Solution File: SYN379+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN379+1 : TPTP v3.4.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art05.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:52:15 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 3 unt; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 5 ( 2 ~; 0 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 10 ( 4 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(x2131,plain,
! [A,C,B,D,E] :
( big_p(A)
& big_q(C,B,D)
& big_p(E)
& ~ big_q(B,B,E) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN379+1.tptp',unknown),
[] ).
cnf(163989744,plain,
big_q(C,B,D),
inference(rewrite,[status(thm)],[x2131]),
[] ).
cnf(163965184,plain,
~ big_q(B,B,E),
inference(rewrite,[status(thm)],[x2131]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[163989744,163965184]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(x2131,plain,((big_p(A)&big_q(C,B,D)&big_p(E)&~big_q(B,B,E))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN379+1.tptp',unknown),[]).
%
% cnf(163989744,plain,(big_q(C,B,D)),inference(rewrite,[status(thm)],[x2131]),[]).
%
% cnf(163965184,plain,(~big_q(B,B,E)),inference(rewrite,[status(thm)],[x2131]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[163989744,163965184]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------