TSTP Solution File: SET196+3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET196+3 : TPTP v3.4.2. Released v2.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:30:01 EDT 2009
% Result : Theorem 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 6 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 28 ( 13 ~; 11 |; 4 &)
% ( 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 : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 19 ( 7 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
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/SET196+3.tptp',unknown),
[] ).
cnf(160502000,plain,
( member(C,A)
| ~ member(C,intersection(A,B)) ),
inference(rewrite,[status(thm)],[intersection_defn]),
[] ).
fof(subset_defn,plain,
! [A,B,C] :
( ( ~ subset(A,B)
| ~ member(C,A)
| member(C,B) )
& ( ~ member(d(A,B,C),B)
| subset(A,B) )
& ( member(d(A,B,C),A)
| subset(A,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET196+3.tptp',unknown),
[] ).
cnf(160517696,plain,
( ~ member(d(A,B,C),B)
| subset(A,B) ),
inference(rewrite,[status(thm)],[subset_defn]),
[] ).
fof(prove_intersection_is_subset,plain,
~ subset(intersection(b,c),b),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET196+3.tptp',unknown),
[] ).
cnf(160614120,plain,
~ subset(intersection(b,c),b),
inference(rewrite,[status(thm)],[prove_intersection_is_subset]),
[] ).
cnf(168426168,plain,
~ member(d(intersection(b,c),b,A),b),
inference(resolution,[status(thm)],[160517696,160614120]),
[] ).
cnf(168451032,plain,
~ member(d(intersection(b,c),b,B),intersection(b,A)),
inference(resolution,[status(thm)],[160502000,168426168]),
[] ).
cnf(160511136,plain,
( member(d(A,B,C),A)
| subset(A,B) ),
inference(rewrite,[status(thm)],[subset_defn]),
[] ).
cnf(168412568,plain,
member(d(intersection(b,c),b,A),intersection(b,c)),
inference(resolution,[status(thm)],[160511136,160614120]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[168451032,168412568]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% 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/SET196+3.tptp',unknown),[]).
%
% cnf(160502000,plain,(member(C,A)|~member(C,intersection(A,B))),inference(rewrite,[status(thm)],[intersection_defn]),[]).
%
% fof(subset_defn,plain,(((~subset(A,B)|~member(C,A)|member(C,B))&(~member(d(A,B,C),B)|subset(A,B))&(member(d(A,B,C),A)|subset(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET196+3.tptp',unknown),[]).
%
% cnf(160517696,plain,(~member(d(A,B,C),B)|subset(A,B)),inference(rewrite,[status(thm)],[subset_defn]),[]).
%
% fof(prove_intersection_is_subset,plain,(~subset(intersection(b,c),b)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET196+3.tptp',unknown),[]).
%
% cnf(160614120,plain,(~subset(intersection(b,c),b)),inference(rewrite,[status(thm)],[prove_intersection_is_subset]),[]).
%
% cnf(168426168,plain,(~member(d(intersection(b,c),b,A),b)),inference(resolution,[status(thm)],[160517696,160614120]),[]).
%
% cnf(168451032,plain,(~member(d(intersection(b,c),b,B),intersection(b,A))),inference(resolution,[status(thm)],[160502000,168426168]),[]).
%
% cnf(160511136,plain,(member(d(A,B,C),A)|subset(A,B)),inference(rewrite,[status(thm)],[subset_defn]),[]).
%
% cnf(168412568,plain,(member(d(intersection(b,c),b,A),intersection(b,c))),inference(resolution,[status(thm)],[160511136,160614120]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[168451032,168412568]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------