TSTP Solution File: SET146+3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET146+3 : TPTP v3.4.2. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art08.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:29:10 EDT 2009
% Result : Theorem 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 7 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 45 ( 18 ~; 20 |; 7 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 19 ( 6 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(equal_member_defn,plain,
! [C,A,B] :
( ( member(C,A)
| ~ member(C,B)
| ~ $equal(B,A) )
& ( ~ member(C,A)
| member(C,B)
| ~ $equal(B,A) )
& ( member(d(A,B,C),B)
| ~ member(d(A,B,C),B)
| $equal(B,A) )
& ( ~ member(d(A,B,C),A)
| ~ member(d(A,B,C),B)
| $equal(B,A) )
& ( member(d(A,B,C),B)
| member(d(A,B,C),A)
| $equal(B,A) )
& ( ~ member(d(A,B,C),A)
| member(d(A,B,C),A)
| $equal(B,A) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),
[] ).
cnf(158878104,plain,
( member(d(A,B,C),B)
| member(d(A,B,C),A)
| $equal(B,A) ),
inference(rewrite,[status(thm)],[equal_member_defn]),
[] ).
fof(empty_set_defn,plain,
! [A] : ~ member(A,empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),
[] ).
cnf(158786368,plain,
~ member(A,empty_set),
inference(rewrite,[status(thm)],[empty_set_defn]),
[] ).
cnf(166866424,plain,
( member(d(empty_set,A,B),A)
| $equal(A,empty_set) ),
inference(resolution,[status(thm)],[158878104,158786368]),
[] ).
fof(prove_th61,plain,
~ $equal(intersection(b,empty_set),empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),
[] ).
cnf(158926872,plain,
~ $equal(intersection(b,empty_set),empty_set),
inference(rewrite,[status(thm)],[prove_th61]),
[] ).
cnf(166900800,plain,
member(d(empty_set,intersection(b,empty_set),A),intersection(b,empty_set)),
inference(resolution,[status(thm)],[166866424,158926872]),
[] ).
fof(intersection_defn,plain,
! [C,B,A] :
( ( member(C,B)
| ~ member(C,intersection(A,B)) )
& ( member(C,A)
| ~ member(C,intersection(A,B)) )
& ( member(C,intersection(A,B))
| ~ member(C,A)
| ~ member(C,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),
[] ).
cnf(158782224,plain,
( member(C,B)
| ~ member(C,intersection(A,B)) ),
inference(rewrite,[status(thm)],[intersection_defn]),
[] ).
cnf(166778024,plain,
~ member(B,intersection(A,empty_set)),
inference(resolution,[status(thm)],[158782224,158786368]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[166900800,166778024]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(equal_member_defn,plain,(((member(C,A)|~member(C,B)|~$equal(B,A))&(~member(C,A)|member(C,B)|~$equal(B,A))&(member(d(A,B,C),B)|~member(d(A,B,C),B)|$equal(B,A))&(~member(d(A,B,C),A)|~member(d(A,B,C),B)|$equal(B,A))&(member(d(A,B,C),B)|member(d(A,B,C),A)|$equal(B,A))&(~member(d(A,B,C),A)|member(d(A,B,C),A)|$equal(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),[]).
%
% cnf(158878104,plain,(member(d(A,B,C),B)|member(d(A,B,C),A)|$equal(B,A)),inference(rewrite,[status(thm)],[equal_member_defn]),[]).
%
% fof(empty_set_defn,plain,(~member(A,empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),[]).
%
% cnf(158786368,plain,(~member(A,empty_set)),inference(rewrite,[status(thm)],[empty_set_defn]),[]).
%
% cnf(166866424,plain,(member(d(empty_set,A,B),A)|$equal(A,empty_set)),inference(resolution,[status(thm)],[158878104,158786368]),[]).
%
% fof(prove_th61,plain,(~$equal(intersection(b,empty_set),empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),[]).
%
% cnf(158926872,plain,(~$equal(intersection(b,empty_set),empty_set)),inference(rewrite,[status(thm)],[prove_th61]),[]).
%
% cnf(166900800,plain,(member(d(empty_set,intersection(b,empty_set),A),intersection(b,empty_set))),inference(resolution,[status(thm)],[166866424,158926872]),[]).
%
% fof(intersection_defn,plain,(((member(C,B)|~member(C,intersection(A,B)))&(member(C,A)|~member(C,intersection(A,B)))&(member(C,intersection(A,B))|~member(C,A)|~member(C,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET146+3.tptp',unknown),[]).
%
% cnf(158782224,plain,(member(C,B)|~member(C,intersection(A,B))),inference(rewrite,[status(thm)],[intersection_defn]),[]).
%
% cnf(166778024,plain,(~member(B,intersection(A,empty_set))),inference(resolution,[status(thm)],[158782224,158786368]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[166900800,166778024]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------