TSTP Solution File: SET576+3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET576+3 : TPTP v3.4.2. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art09.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:31:31 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 : 12 ( 5 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 39 ( 19 ~; 14 |; 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 0 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/SET576+3.tptp',unknown),
[] ).
cnf(172207984,plain,
( member(d_nn_1(A,B),B)
| ~ intersect(A,B) ),
inference(rewrite,[status(thm)],[intersect_defn]),
[] ).
fof(disjoint_defn,plain,
! [A,B] :
( ( ~ disjoint(A,B)
| ~ intersect(A,B) )
& ( disjoint(A,B)
| intersect(A,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET576+3.tptp',unknown),
[] ).
cnf(172213976,plain,
( disjoint(A,B)
| intersect(A,B) ),
inference(rewrite,[status(thm)],[disjoint_defn]),
[] ).
fof(prove_th17,plain,
! [C] :
( ( ~ disjoint(b,c)
| ~ member(C,b) )
& ( ~ member(C,c)
| ~ member(C,b) )
& ( ~ disjoint(b,c)
| ~ disjoint(b,c) )
& ( ~ member(C,c)
| ~ disjoint(b,c) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET576+3.tptp',unknown),
[] ).
cnf(172323680,plain,
~ disjoint(b,c),
inference(rewrite,[status(thm)],[prove_th17]),
[] ).
cnf(185367896,plain,
intersect(b,c),
inference(resolution,[status(thm)],[172213976,172323680]),
[] ).
cnf(185402744,plain,
member(d_nn_1(b,c),c),
inference(resolution,[status(thm)],[172207984,185367896]),
[] ).
cnf(172337344,plain,
( ~ member(C,c)
| ~ member(C,b) ),
inference(rewrite,[status(thm)],[prove_th17]),
[] ).
cnf(172202272,plain,
( member(d_nn_1(A,B),A)
| ~ intersect(A,B) ),
inference(rewrite,[status(thm)],[intersect_defn]),
[] ).
cnf(185393176,plain,
member(d_nn_1(b,c),b),
inference(resolution,[status(thm)],[172202272,185367896]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[185402744,172337344,185393176]),
[] ).
%------------------------------------------------------------------------------
%----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/SET576+3.tptp',unknown),[]).
%
% cnf(172207984,plain,(member(d_nn_1(A,B),B)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
%
% fof(disjoint_defn,plain,(((~disjoint(A,B)|~intersect(A,B))&(disjoint(A,B)|intersect(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET576+3.tptp',unknown),[]).
%
% cnf(172213976,plain,(disjoint(A,B)|intersect(A,B)),inference(rewrite,[status(thm)],[disjoint_defn]),[]).
%
% fof(prove_th17,plain,(((~disjoint(b,c)|~member(C,b))&(~member(C,c)|~member(C,b))&(~disjoint(b,c)|~disjoint(b,c))&(~member(C,c)|~disjoint(b,c)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET576+3.tptp',unknown),[]).
%
% cnf(172323680,plain,(~disjoint(b,c)),inference(rewrite,[status(thm)],[prove_th17]),[]).
%
% cnf(185367896,plain,(intersect(b,c)),inference(resolution,[status(thm)],[172213976,172323680]),[]).
%
% cnf(185402744,plain,(member(d_nn_1(b,c),c)),inference(resolution,[status(thm)],[172207984,185367896]),[]).
%
% cnf(172337344,plain,(~member(C,c)|~member(C,b)),inference(rewrite,[status(thm)],[prove_th17]),[]).
%
% cnf(172202272,plain,(member(d_nn_1(A,B),A)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
%
% cnf(185393176,plain,(member(d_nn_1(b,c),b)),inference(resolution,[status(thm)],[172202272,185367896]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[185402744,172337344,185393176]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------