TSTP Solution File: SET947+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET947+1 : TPTP v3.4.2. Released v3.2.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 15:42:23 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 50 ( 20 ~; 23 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-3 aty)
% Number of variables : 24 ( 5 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(l50_zfmisc_1,plain,
! [A,B] :
( ~ in(A,B)
| subset(A,union(B)) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),
[] ).
cnf(142665768,plain,
( ~ in(A,B)
| subset(A,union(B)) ),
inference(rewrite,[status(thm)],[l50_zfmisc_1]),
[] ).
fof(d3_tarski,plain,
! [A,B,C] :
( ( ~ subset(A,B)
| ~ in(C,A)
| in(C,B) )
& ( ~ in(c(A,B,C),B)
| subset(A,B) )
& ( in(c(A,B,C),A)
| subset(A,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),
[] ).
cnf(142643808,plain,
( in(c(A,B,C),A)
| subset(A,B) ),
inference(rewrite,[status(thm)],[d3_tarski]),
[] ).
fof(t100_zfmisc_1,plain,
~ subset(a,powerset(union(a))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),
[] ).
cnf(142712936,plain,
~ subset(a,powerset(union(a))),
inference(rewrite,[status(thm)],[t100_zfmisc_1]),
[] ).
cnf(150538664,plain,
in(c(a,powerset(union(a)),A),a),
inference(resolution,[status(thm)],[142643808,142712936]),
[] ).
cnf(150610192,plain,
subset(c(a,powerset(union(a)),A),union(a)),
inference(resolution,[status(thm)],[142665768,150538664]),
[] ).
fof(d1_zfmisc_1,plain,
! [C,B,A] :
( ( in(C,B)
| ~ subset(C,A)
| ~ $equal(powerset(A),B) )
& ( ~ in(C,B)
| subset(C,A)
| ~ $equal(powerset(A),B) )
& ( subset(c(A,B,C),A)
| ~ subset(c(A,B,C),A)
| $equal(powerset(A),B) )
& ( ~ in(c(A,B,C),B)
| ~ subset(c(A,B,C),A)
| $equal(powerset(A),B) )
& ( subset(c(A,B,C),A)
| in(c(A,B,C),B)
| $equal(powerset(A),B) )
& ( ~ in(c(A,B,C),B)
| in(c(A,B,C),B)
| $equal(powerset(A),B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),
[] ).
cnf(142638240,plain,
( in(C,B)
| ~ subset(C,A)
| ~ $equal(powerset(A),B) ),
inference(rewrite,[status(thm)],[d1_zfmisc_1]),
[] ).
cnf(151535088,plain,
( in(B,powerset(A))
| ~ subset(B,A) ),
inference(equality_resolution,[status(thm)],[142638240]),
[] ).
cnf(142649672,plain,
( ~ in(c(A,B,C),B)
| subset(A,B) ),
inference(rewrite,[status(thm)],[d3_tarski]),
[] ).
cnf(150552576,plain,
~ in(c(a,powerset(union(a)),A),powerset(union(a))),
inference(resolution,[status(thm)],[142649672,142712936]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[150610192,151535088,150552576]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(l50_zfmisc_1,plain,(~in(A,B)|subset(A,union(B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),[]).
%
% cnf(142665768,plain,(~in(A,B)|subset(A,union(B))),inference(rewrite,[status(thm)],[l50_zfmisc_1]),[]).
%
% fof(d3_tarski,plain,(((~subset(A,B)|~in(C,A)|in(C,B))&(~in(c(A,B,C),B)|subset(A,B))&(in(c(A,B,C),A)|subset(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),[]).
%
% cnf(142643808,plain,(in(c(A,B,C),A)|subset(A,B)),inference(rewrite,[status(thm)],[d3_tarski]),[]).
%
% fof(t100_zfmisc_1,plain,(~subset(a,powerset(union(a)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),[]).
%
% cnf(142712936,plain,(~subset(a,powerset(union(a)))),inference(rewrite,[status(thm)],[t100_zfmisc_1]),[]).
%
% cnf(150538664,plain,(in(c(a,powerset(union(a)),A),a)),inference(resolution,[status(thm)],[142643808,142712936]),[]).
%
% cnf(150610192,plain,(subset(c(a,powerset(union(a)),A),union(a))),inference(resolution,[status(thm)],[142665768,150538664]),[]).
%
% fof(d1_zfmisc_1,plain,(((in(C,B)|~subset(C,A)|~$equal(powerset(A),B))&(~in(C,B)|subset(C,A)|~$equal(powerset(A),B))&(subset(c(A,B,C),A)|~subset(c(A,B,C),A)|$equal(powerset(A),B))&(~in(c(A,B,C),B)|~subset(c(A,B,C),A)|$equal(powerset(A),B))&(subset(c(A,B,C),A)|in(c(A,B,C),B)|$equal(powerset(A),B))&(~in(c(A,B,C),B)|in(c(A,B,C),B)|$equal(powerset(A),B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET947+1.tptp',unknown),[]).
%
% cnf(142638240,plain,(in(C,B)|~subset(C,A)|~$equal(powerset(A),B)),inference(rewrite,[status(thm)],[d1_zfmisc_1]),[]).
%
% cnf(151535088,plain,(in(B,powerset(A))|~subset(B,A)),inference(equality_resolution,[status(thm)],[142638240]),[]).
%
% cnf(142649672,plain,(~in(c(A,B,C),B)|subset(A,B)),inference(rewrite,[status(thm)],[d3_tarski]),[]).
%
% cnf(150552576,plain,(~in(c(a,powerset(union(a)),A),powerset(union(a)))),inference(resolution,[status(thm)],[142649672,142712936]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[150610192,151535088,150552576]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------