TSTP Solution File: SEU151+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SEU151+1 : TPTP v3.4.2. Released v3.3.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:49:20 EDT 2009
% Result : Theorem 0.4s
% Output : Refutation 0.4s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 31 ( 4 avg)
% Number of connectives : 63 ( 23 ~; 30 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 15 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(d2_tarski,plain,
! [B,D,C,A] :
( ( ~ $equal(B,D)
| in(D,C)
| ~ $equal(unordered_pair(A,B),C) )
& ( ~ $equal(A,D)
| in(D,C)
| ~ $equal(unordered_pair(A,B),C) )
& ( ~ in(D,C)
| $equal(A,D)
| $equal(B,D)
| ~ $equal(unordered_pair(A,B),C) )
& ( $equal(d(A,B,C,D),A)
| $equal(d(A,B,C,D),B)
| ~ $equal(d(A,B,C,D),A)
| $equal(unordered_pair(A,B),C) )
& ( ~ in(d(A,B,C,D),C)
| ~ $equal(d(A,B,C,D),A)
| $equal(unordered_pair(A,B),C) )
& ( $equal(d(A,B,C,D),A)
| $equal(d(A,B,C,D),B)
| ~ $equal(d(A,B,C,D),B)
| $equal(unordered_pair(A,B),C) )
& ( ~ in(d(A,B,C,D),C)
| ~ $equal(d(A,B,C,D),B)
| $equal(unordered_pair(A,B),C) )
& ( $equal(d(A,B,C,D),A)
| $equal(d(A,B,C,D),B)
| in(d(A,B,C,D),C)
| $equal(unordered_pair(A,B),C) )
& ( ~ in(d(A,B,C,D),C)
| in(d(A,B,C,D),C)
| $equal(unordered_pair(A,B),C) ) ),
file('/tmp/SystemOnTPTP2977/SEU151+1.p',unknown),
[] ).
cnf(141128000,plain,
( ~ $equal(A,D)
| in(D,C)
| ~ $equal(unordered_pair(A,B),C) ),
inference(rewrite,[status(thm)],[d2_tarski]),
[] ).
cnf(154682912,plain,
in(A,unordered_pair(A,B)),
inference(equality_resolution,[status(thm)],[141128000]),
[] ).
fof(t10_zfmisc_1,plain,
( $equal(unordered_pair(c,d),unordered_pair(a,b))
& ~ $equal(c,a)
& ~ $equal(d,a) ),
file('/tmp/SystemOnTPTP2977/SEU151+1.p',unknown),
[] ).
cnf(141217392,plain,
~ $equal(c,a),
inference(rewrite,[status(thm)],[t10_zfmisc_1]),
[] ).
cnf(141210096,plain,
~ $equal(d,a),
inference(rewrite,[status(thm)],[t10_zfmisc_1]),
[] ).
cnf(141115912,plain,
( ~ in(D,C)
| $equal(A,D)
| $equal(B,D)
| ~ $equal(unordered_pair(A,B),C) ),
inference(rewrite,[status(thm)],[d2_tarski]),
[] ).
cnf(141224488,plain,
$equal(unordered_pair(c,d),unordered_pair(a,b)),
inference(rewrite,[status(thm)],[t10_zfmisc_1]),
[] ).
cnf(154644064,plain,
( ~ in(A,unordered_pair(a,b))
| $equal(c,A)
| $equal(d,A) ),
inference(resolution,[status(thm)],[141115912,141224488]),
[] ).
cnf(162162832,plain,
( ~ in(a,unordered_pair(a,b))
| $equal(c,a) ),
inference(resolution,[status(thm)],[141210096,154644064]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__resolution,[status(thm)],[154682912,141217392,162162832]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(d2_tarski,plain,(((~$equal(B,D)|in(D,C)|~$equal(unordered_pair(A,B),C))&(~$equal(A,D)|in(D,C)|~$equal(unordered_pair(A,B),C))&(~in(D,C)|$equal(A,D)|$equal(B,D)|~$equal(unordered_pair(A,B),C))&($equal(d(A,B,C,D),A)|$equal(d(A,B,C,D),B)|~$equal(d(A,B,C,D),A)|$equal(unordered_pair(A,B),C))&(~in(d(A,B,C,D),C)|~$equal(d(A,B,C,D),A)|$equal(unordered_pair(A,B),C))&($equal(d(A,B,C,D),A)|$equal(d(A,B,C,D),B)|~$equal(d(A,B,C,D),B)|$equal(unordered_pair(A,B),C))&(~in(d(A,B,C,D),C)|~$equal(d(A,B,C,D),B)|$equal(unordered_pair(A,B),C))&($equal(d(A,B,C,D),A)|$equal(d(A,B,C,D),B)|in(d(A,B,C,D),C)|$equal(unordered_pair(A,B),C))&(~in(d(A,B,C,D),C)|in(d(A,B,C,D),C)|$equal(unordered_pair(A,B),C)))),file('/tmp/SystemOnTPTP2977/SEU151+1.p',unknown),[]).
%
% cnf(141128000,plain,(~$equal(A,D)|in(D,C)|~$equal(unordered_pair(A,B),C)),inference(rewrite,[status(thm)],[d2_tarski]),[]).
%
% cnf(154682912,plain,(in(A,unordered_pair(A,B))),inference(equality_resolution,[status(thm)],[141128000]),[]).
%
% fof(t10_zfmisc_1,plain,(($equal(unordered_pair(c,d),unordered_pair(a,b))&~$equal(c,a)&~$equal(d,a))),file('/tmp/SystemOnTPTP2977/SEU151+1.p',unknown),[]).
%
% cnf(141217392,plain,(~$equal(c,a)),inference(rewrite,[status(thm)],[t10_zfmisc_1]),[]).
%
% cnf(141210096,plain,(~$equal(d,a)),inference(rewrite,[status(thm)],[t10_zfmisc_1]),[]).
%
% cnf(141115912,plain,(~in(D,C)|$equal(A,D)|$equal(B,D)|~$equal(unordered_pair(A,B),C)),inference(rewrite,[status(thm)],[d2_tarski]),[]).
%
% cnf(141224488,plain,($equal(unordered_pair(c,d),unordered_pair(a,b))),inference(rewrite,[status(thm)],[t10_zfmisc_1]),[]).
%
% cnf(154644064,plain,(~in(A,unordered_pair(a,b))|$equal(c,A)|$equal(d,A)),inference(resolution,[status(thm)],[141115912,141224488]),[]).
%
% cnf(162162832,plain,(~in(a,unordered_pair(a,b))|$equal(c,a)),inference(resolution,[status(thm)],[141210096,154644064]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[154682912,141217392,162162832]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------