TSTP Solution File: SET867+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET867+1 : TPTP v3.4.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art06.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:40:05 EDT 2009
% Result : Theorem 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 59 ( 22 ~; 28 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-5 aty)
% Number of variables : 18 ( 5 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(d1_xboole_0,plain,
! [A,B] :
( ( ~ $equal(empty_set,A)
| ~ in(B,A) )
& ( $equal(empty_set,A)
| in(b(A,B),A) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET867+1.tptp',unknown),
[] ).
cnf(165908128,plain,
( ~ $equal(empty_set,A)
| ~ in(B,A) ),
inference(rewrite,[status(thm)],[d1_xboole_0]),
[] ).
cnf(174029512,plain,
~ in(A,empty_set),
inference(equality_resolution,[status(thm)],[165908128]),
[] ).
fof(d4_tarski,plain,
! [C,B,E,A,G] :
( ( in(C,B)
| ~ in(C,E)
| ~ in(E,A)
| ~ $equal(union(A),B) )
& ( in(d_nn_3(A,B,C),A)
| ~ in(C,B)
| ~ $equal(union(A),B) )
& ( in(C,d_nn_3(A,B,C))
| ~ in(C,B)
| ~ $equal(union(A),B) )
& ( in(c(A,B,C,E),d(A,B,C,E,G))
| ~ in(c(A,B,C,E),G)
| ~ in(G,A)
| $equal(union(A),B) )
& ( in(d(A,B,C,E,G),A)
| ~ in(c(A,B,C,E),G)
| ~ in(G,A)
| $equal(union(A),B) )
& ( ~ in(c(A,B,C,E),B)
| ~ in(c(A,B,C,E),G)
| ~ in(G,A)
| $equal(union(A),B) )
& ( in(c(A,B,C,E),d(A,B,C,E,G))
| in(c(A,B,C,E),B)
| $equal(union(A),B) )
& ( in(d(A,B,C,E,G),A)
| in(c(A,B,C,E),B)
| $equal(union(A),B) )
& ( ~ in(c(A,B,C,E),B)
| in(c(A,B,C,E),B)
| $equal(union(A),B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET867+1.tptp',unknown),
[] ).
cnf(165938680,plain,
( in(d(A,B,C,E,G),A)
| in(c(A,B,C,E),B)
| $equal(union(A),B) ),
inference(rewrite,[status(thm)],[d4_tarski]),
[] ).
cnf(174104200,plain,
( in(c(empty_set,A,B,D),A)
| $equal(union(empty_set),A) ),
inference(resolution,[status(thm)],[174029512,165938680]),
[] ).
cnf(174260472,plain,
$equal(union(empty_set),empty_set),
inference(resolution,[status(thm)],[174104200,174029512]),
[] ).
fof(t2_zfmisc_1,plain,
~ $equal(union(empty_set),empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET867+1.tptp',unknown),
[] ).
cnf(166062256,plain,
~ $equal(union(empty_set),empty_set),
inference(rewrite,[status(thm)],[t2_zfmisc_1]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[174260472,166062256]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(d1_xboole_0,plain,(((~$equal(empty_set,A)|~in(B,A))&($equal(empty_set,A)|in(b(A,B),A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET867+1.tptp',unknown),[]).
%
% cnf(165908128,plain,(~$equal(empty_set,A)|~in(B,A)),inference(rewrite,[status(thm)],[d1_xboole_0]),[]).
%
% cnf(174029512,plain,(~in(A,empty_set)),inference(equality_resolution,[status(thm)],[165908128]),[]).
%
% fof(d4_tarski,plain,(((in(C,B)|~in(C,E)|~in(E,A)|~$equal(union(A),B))&(in(d_nn_3(A,B,C),A)|~in(C,B)|~$equal(union(A),B))&(in(C,d_nn_3(A,B,C))|~in(C,B)|~$equal(union(A),B))&(in(c(A,B,C,E),d(A,B,C,E,G))|~in(c(A,B,C,E),G)|~in(G,A)|$equal(union(A),B))&(in(d(A,B,C,E,G),A)|~in(c(A,B,C,E),G)|~in(G,A)|$equal(union(A),B))&(~in(c(A,B,C,E),B)|~in(c(A,B,C,E),G)|~in(G,A)|$equal(union(A),B))&(in(c(A,B,C,E),d(A,B,C,E,G))|in(c(A,B,C,E),B)|$equal(union(A),B))&(in(d(A,B,C,E,G),A)|in(c(A,B,C,E),B)|$equal(union(A),B))&(~in(c(A,B,C,E),B)|in(c(A,B,C,E),B)|$equal(union(A),B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET867+1.tptp',unknown),[]).
%
% cnf(165938680,plain,(in(d(A,B,C,E,G),A)|in(c(A,B,C,E),B)|$equal(union(A),B)),inference(rewrite,[status(thm)],[d4_tarski]),[]).
%
% cnf(174104200,plain,(in(c(empty_set,A,B,D),A)|$equal(union(empty_set),A)),inference(resolution,[status(thm)],[174029512,165938680]),[]).
%
% cnf(174260472,plain,($equal(union(empty_set),empty_set)),inference(resolution,[status(thm)],[174104200,174029512]),[]).
%
% fof(t2_zfmisc_1,plain,(~$equal(union(empty_set),empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET867+1.tptp',unknown),[]).
%
% cnf(166062256,plain,(~$equal(union(empty_set),empty_set)),inference(rewrite,[status(thm)],[t2_zfmisc_1]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[174260472,166062256]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------