TSTP Solution File: SET626+3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET626+3 : TPTP v3.4.2. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art10.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:33:32 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 36 ( 17 ~; 14 |; 5 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(intersect_defn,plain,
! [A,B,D] :
( ( member(d_nn_1(A,B),B)
| ~ intersect(A,B) )
& ( member(d_nn_1(A,B),A)
| ~ intersect(A,B) )
& ( intersect(A,B)
| ~ member(D,A)
| ~ member(D,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET626+3.tptp',unknown),
[] ).
cnf(165564288,plain,
( member(d_nn_1(A,B),A)
| ~ intersect(A,B) ),
inference(rewrite,[status(thm)],[intersect_defn]),
[] ).
fof(prove_th102,plain,
( intersect(b,intersection(c,d))
& ~ intersect(b,c) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET626+3.tptp',unknown),
[] ).
cnf(165686696,plain,
intersect(b,intersection(c,d)),
inference(rewrite,[status(thm)],[prove_th102]),
[] ).
cnf(176164464,plain,
member(d_nn_1(b,intersection(c,d)),b),
inference(resolution,[status(thm)],[165564288,165686696]),
[] ).
cnf(165558744,plain,
( intersect(A,B)
| ~ member(D,A)
| ~ member(D,B) ),
inference(rewrite,[status(thm)],[intersect_defn]),
[] ).
cnf(165679392,plain,
~ intersect(b,c),
inference(rewrite,[status(thm)],[prove_th102]),
[] ).
cnf(176136712,plain,
( ~ member(B,b)
| ~ member(B,c) ),
inference(resolution,[status(thm)],[165558744,165679392]),
[] ).
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/SET626+3.tptp',unknown),
[] ).
cnf(165547160,plain,
( member(C,A)
| ~ member(C,intersection(A,B)) ),
inference(rewrite,[status(thm)],[intersection_defn]),
[] ).
cnf(165574096,plain,
( member(d_nn_1(A,B),B)
| ~ intersect(A,B) ),
inference(rewrite,[status(thm)],[intersect_defn]),
[] ).
cnf(176174096,plain,
member(d_nn_1(b,intersection(c,d)),intersection(c,d)),
inference(resolution,[status(thm)],[165574096,165686696]),
[] ).
cnf(176300064,plain,
member(d_nn_1(b,intersection(c,d)),c),
inference(resolution,[status(thm)],[165547160,176174096]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[176164464,176136712,176300064]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(intersect_defn,plain,(((member(d_nn_1(A,B),B)|~intersect(A,B))&(member(d_nn_1(A,B),A)|~intersect(A,B))&(intersect(A,B)|~member(D,A)|~member(D,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET626+3.tptp',unknown),[]).
%
% cnf(165564288,plain,(member(d_nn_1(A,B),A)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
%
% fof(prove_th102,plain,((intersect(b,intersection(c,d))&~intersect(b,c))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET626+3.tptp',unknown),[]).
%
% cnf(165686696,plain,(intersect(b,intersection(c,d))),inference(rewrite,[status(thm)],[prove_th102]),[]).
%
% cnf(176164464,plain,(member(d_nn_1(b,intersection(c,d)),b)),inference(resolution,[status(thm)],[165564288,165686696]),[]).
%
% cnf(165558744,plain,(intersect(A,B)|~member(D,A)|~member(D,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
%
% cnf(165679392,plain,(~intersect(b,c)),inference(rewrite,[status(thm)],[prove_th102]),[]).
%
% cnf(176136712,plain,(~member(B,b)|~member(B,c)),inference(resolution,[status(thm)],[165558744,165679392]),[]).
%
% 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/SET626+3.tptp',unknown),[]).
%
% cnf(165547160,plain,(member(C,A)|~member(C,intersection(A,B))),inference(rewrite,[status(thm)],[intersection_defn]),[]).
%
% cnf(165574096,plain,(member(d_nn_1(A,B),B)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
%
% cnf(176174096,plain,(member(d_nn_1(b,intersection(c,d)),intersection(c,d))),inference(resolution,[status(thm)],[165574096,165686696]),[]).
%
% cnf(176300064,plain,(member(d_nn_1(b,intersection(c,d)),c)),inference(resolution,[status(thm)],[165547160,176174096]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[176164464,176136712,176300064]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------