TSTP Solution File: SET063+3 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SET063+3 : TPTP v3.4.2. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art03.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:26:31 EDT 2009
% Result : Theorem 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 6 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 17 ( 8 ~; 6 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 1 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(empty_set_subset,plain,
! [A] : subset(empty_set,A),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+3.tptp',unknown),
[] ).
cnf(161777936,plain,
subset(empty_set,A),
inference(rewrite,[status(thm)],[empty_set_subset]),
[] ).
fof(equal_defn,plain,
! [B,A] :
( ( subset(B,A)
| ~ $equal(B,A) )
& ( subset(A,B)
| ~ $equal(B,A) )
& ( $equal(B,A)
| ~ subset(A,B)
| ~ subset(B,A) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+3.tptp',unknown),
[] ).
cnf(161826032,plain,
( $equal(B,A)
| ~ subset(A,B)
| ~ subset(B,A) ),
inference(rewrite,[status(thm)],[equal_defn]),
[] ).
fof(prove_subset_of_empty_set_is_empty_set,plain,
( subset(b,empty_set)
& ~ $equal(empty_set,b) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+3.tptp',unknown),
[] ).
cnf(161908336,plain,
subset(b,empty_set),
inference(rewrite,[status(thm)],[prove_subset_of_empty_set_is_empty_set]),
[] ).
cnf(172356616,plain,
$equal(empty_set,b),
inference(forward_subsumption_resolution__resolution,[status(thm)],[161777936,161826032,161908336]),
[] ).
cnf(161900928,plain,
~ $equal(empty_set,b),
inference(rewrite,[status(thm)],[prove_subset_of_empty_set_is_empty_set]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[172356616,161900928]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(empty_set_subset,plain,(subset(empty_set,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+3.tptp',unknown),[]).
%
% cnf(161777936,plain,(subset(empty_set,A)),inference(rewrite,[status(thm)],[empty_set_subset]),[]).
%
% fof(equal_defn,plain,(((subset(B,A)|~$equal(B,A))&(subset(A,B)|~$equal(B,A))&($equal(B,A)|~subset(A,B)|~subset(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+3.tptp',unknown),[]).
%
% cnf(161826032,plain,($equal(B,A)|~subset(A,B)|~subset(B,A)),inference(rewrite,[status(thm)],[equal_defn]),[]).
%
% fof(prove_subset_of_empty_set_is_empty_set,plain,((subset(b,empty_set)&~$equal(empty_set,b))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET063+3.tptp',unknown),[]).
%
% cnf(161908336,plain,(subset(b,empty_set)),inference(rewrite,[status(thm)],[prove_subset_of_empty_set_is_empty_set]),[]).
%
% cnf(172356616,plain,($equal(empty_set,b)),inference(forward_subsumption_resolution__resolution,[status(thm)],[161777936,161826032,161908336]),[]).
%
% cnf(161900928,plain,(~$equal(empty_set,b)),inference(rewrite,[status(thm)],[prove_subset_of_empty_set_is_empty_set]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[172356616,161900928]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------