%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET639+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:34:13 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 : 11 ( 8 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_th121,plain,
( subset(b,c)
& $equal(intersection(c,b),empty_set)
& ~ $equal(empty_set,b) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET639+3.tptp',unknown),
[] ).
cnf(168469088,plain,
subset(b,c),
inference(rewrite,[status(thm)],[prove_th121]),
[] ).
fof(subset_intersection,plain,
! [A,B] :
( ~ subset(A,B)
| $equal(intersection(A,B),A) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET639+3.tptp',unknown),
[] ).
cnf(168238968,plain,
( ~ subset(A,B)
| $equal(intersection(A,B),A) ),
inference(rewrite,[status(thm)],[subset_intersection]),
[] ).
cnf(168450280,plain,
~ $equal(empty_set,b),
inference(rewrite,[status(thm)],[prove_th121]),
[] ).
cnf(168457696,plain,
$equal(intersection(c,b),empty_set),
inference(rewrite,[status(thm)],[prove_th121]),
[] ).
cnf(181938112,plain,
~ $equal(intersection(c,b),b),
inference(paramodulation,[status(thm)],[168450280,168457696,theory(equality)]),
[] ).
fof(commutativity_of_intersection,plain,
! [B,A] : $equal(intersection(B,A),intersection(A,B)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET639+3.tptp',unknown),
[] ).
cnf(168343368,plain,
$equal(intersection(B,A),intersection(A,B)),
inference(rewrite,[status(thm)],[commutativity_of_intersection]),
[] ).
cnf(182166112,plain,
~ $equal(intersection(b,c),b),
inference(paramodulation,[status(thm)],[181938112,168343368,theory(equality)]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[168469088,168238968,182166112]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_th121,plain,((subset(b,c)&$equal(intersection(c,b),empty_set)&~$equal(empty_set,b))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET639+3.tptp',unknown),[]).
%
% cnf(168469088,plain,(subset(b,c)),inference(rewrite,[status(thm)],[prove_th121]),[]).
%
% fof(subset_intersection,plain,(~subset(A,B)|$equal(intersection(A,B),A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET639+3.tptp',unknown),[]).
%
% cnf(168238968,plain,(~subset(A,B)|$equal(intersection(A,B),A)),inference(rewrite,[status(thm)],[subset_intersection]),[]).
%
% cnf(168450280,plain,(~$equal(empty_set,b)),inference(rewrite,[status(thm)],[prove_th121]),[]).
%
% cnf(168457696,plain,($equal(intersection(c,b),empty_set)),inference(rewrite,[status(thm)],[prove_th121]),[]).
%
% cnf(181938112,plain,(~$equal(intersection(c,b),b)),inference(paramodulation,[status(thm)],[168450280,168457696,theory(equality)]),[]).
%
% fof(commutativity_of_intersection,plain,($equal(intersection(B,A),intersection(A,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET639+3.tptp',unknown),[]).
%
% cnf(168343368,plain,($equal(intersection(B,A),intersection(A,B))),inference(rewrite,[status(thm)],[commutativity_of_intersection]),[]).
%
% cnf(182166112,plain,(~$equal(intersection(b,c),b)),inference(paramodulation,[status(thm)],[181938112,168343368,theory(equality)]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[168469088,168238968,182166112]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------