TSTP Solution File: SET063+4 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET063+4 : TPTP v3.4.2. Released v2.2.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 15:26:34 EDT 2009
% Result : Theorem 0.2s
% Output : Refutation 0.2s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 19 ~; 16 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 23 ( 8 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(subset,plain,
! [A,B,C] :
( ( ~ subset(A,B)
| ~ member(C,A)
| member(C,B) )
& ( ~ member(x(A,B,C),B)
| subset(A,B) )
& ( member(x(A,B,C),A)
| subset(A,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),
[] ).
cnf(148572160,plain,
( member(x(A,B,C),A)
| subset(A,B) ),
inference(rewrite,[status(thm)],[subset]),
[] ).
fof(intersection,plain,
! [A,C,B] :
( ( member(A,C)
| ~ member(A,intersection(B,C)) )
& ( member(A,B)
| ~ member(A,intersection(B,C)) )
& ( member(A,intersection(B,C))
| ~ member(A,B)
| ~ member(A,C) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),
[] ).
cnf(148647792,plain,
( member(A,C)
| ~ member(A,intersection(B,C)) ),
inference(rewrite,[status(thm)],[intersection]),
[] ).
fof(empty_set,plain,
! [A] : ~ member(A,empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),
[] ).
cnf(148671992,plain,
~ member(A,empty_set),
inference(rewrite,[status(thm)],[empty_set]),
[] ).
cnf(156710032,plain,
~ member(A,intersection(B,empty_set)),
inference(resolution,[status(thm)],[148647792,148671992]),
[] ).
cnf(157381320,plain,
subset(intersection(C,empty_set),A),
inference(resolution,[status(thm)],[148572160,156710032]),
[] ).
cnf(156674008,plain,
subset(empty_set,A),
inference(resolution,[status(thm)],[148572160,148671992]),
[] ).
fof(equal_set,plain,
! [B,A] :
( ( subset(B,A)
| ~ equal_set(A,B) )
& ( subset(A,B)
| ~ equal_set(A,B) )
& ( equal_set(A,B)
| ~ subset(A,B)
| ~ subset(B,A) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),
[] ).
cnf(148600008,plain,
( equal_set(A,B)
| ~ subset(A,B)
| ~ subset(B,A) ),
inference(rewrite,[status(thm)],[equal_set]),
[] ).
fof(thI17,plain,
~ equal_set(intersection(a,empty_set),empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),
[] ).
cnf(148819352,plain,
~ equal_set(intersection(a,empty_set),empty_set),
inference(rewrite,[status(thm)],[thI17]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[157381320,156674008,148600008,148819352]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(subset,plain,(((~subset(A,B)|~member(C,A)|member(C,B))&(~member(x(A,B,C),B)|subset(A,B))&(member(x(A,B,C),A)|subset(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),[]).
%
% cnf(148572160,plain,(member(x(A,B,C),A)|subset(A,B)),inference(rewrite,[status(thm)],[subset]),[]).
%
% fof(intersection,plain,(((member(A,C)|~member(A,intersection(B,C)))&(member(A,B)|~member(A,intersection(B,C)))&(member(A,intersection(B,C))|~member(A,B)|~member(A,C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),[]).
%
% cnf(148647792,plain,(member(A,C)|~member(A,intersection(B,C))),inference(rewrite,[status(thm)],[intersection]),[]).
%
% fof(empty_set,plain,(~member(A,empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),[]).
%
% cnf(148671992,plain,(~member(A,empty_set)),inference(rewrite,[status(thm)],[empty_set]),[]).
%
% cnf(156710032,plain,(~member(A,intersection(B,empty_set))),inference(resolution,[status(thm)],[148647792,148671992]),[]).
%
% cnf(157381320,plain,(subset(intersection(C,empty_set),A)),inference(resolution,[status(thm)],[148572160,156710032]),[]).
%
% cnf(156674008,plain,(subset(empty_set,A)),inference(resolution,[status(thm)],[148572160,148671992]),[]).
%
% fof(equal_set,plain,(((subset(B,A)|~equal_set(A,B))&(subset(A,B)|~equal_set(A,B))&(equal_set(A,B)|~subset(A,B)|~subset(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),[]).
%
% cnf(148600008,plain,(equal_set(A,B)|~subset(A,B)|~subset(B,A)),inference(rewrite,[status(thm)],[equal_set]),[]).
%
% fof(thI17,plain,(~equal_set(intersection(a,empty_set),empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+4.tptp',unknown),[]).
%
% cnf(148819352,plain,(~equal_set(intersection(a,empty_set),empty_set)),inference(rewrite,[status(thm)],[thI17]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[157381320,156674008,148600008,148819352]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------