TSTP Solution File: SET605+3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET605+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:32:50 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 3 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(difference_empty_set,plain,
! [A,B] :
( ( ~ $equal(empty_set,difference(A,B))
| subset(A,B) )
& ( $equal(empty_set,difference(A,B))
| ~ subset(A,B) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET605+3.tptp',unknown),
[] ).
cnf(143214832,plain,
( $equal(empty_set,difference(A,B))
| ~ subset(A,B) ),
inference(rewrite,[status(thm)],[difference_empty_set]),
[] ).
fof(prove_th76,plain,
~ $equal(difference(b,union(b,c)),empty_set),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET605+3.tptp',unknown),
[] ).
cnf(143450176,plain,
~ $equal(difference(b,union(b,c)),empty_set),
inference(rewrite,[status(thm)],[prove_th76]),
[] ).
cnf(152693984,plain,
~ subset(b,union(b,c)),
inference(paramodulation,[status(thm)],[143214832,143450176,theory(equality)]),
[] ).
fof(subset_of_union,plain,
! [A,B] : subset(A,union(A,B)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET605+3.tptp',unknown),
[] ).
cnf(143208112,plain,
subset(A,union(A,B)),
inference(rewrite,[status(thm)],[subset_of_union]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[152693984,143208112]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(difference_empty_set,plain,(((~$equal(empty_set,difference(A,B))|subset(A,B))&($equal(empty_set,difference(A,B))|~subset(A,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET605+3.tptp',unknown),[]).
%
% cnf(143214832,plain,($equal(empty_set,difference(A,B))|~subset(A,B)),inference(rewrite,[status(thm)],[difference_empty_set]),[]).
%
% fof(prove_th76,plain,(~$equal(difference(b,union(b,c)),empty_set)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET605+3.tptp',unknown),[]).
%
% cnf(143450176,plain,(~$equal(difference(b,union(b,c)),empty_set)),inference(rewrite,[status(thm)],[prove_th76]),[]).
%
% cnf(152693984,plain,(~subset(b,union(b,c))),inference(paramodulation,[status(thm)],[143214832,143450176,theory(equality)]),[]).
%
% fof(subset_of_union,plain,(subset(A,union(A,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET605+3.tptp',unknown),[]).
%
% cnf(143208112,plain,(subset(A,union(A,B))),inference(rewrite,[status(thm)],[subset_of_union]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[152693984,143208112]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------