↑ Up

Faust---1.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SEU122+2 : TPTP v3.4.2. Released v3.3.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:47:14 EDT 2009

% Result   : Theorem 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   19 (  10   ~;   7   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-3 aty)
%            Number of variables   :   12 (   4 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(d3_tarski,plain,
    ! [A,B,C] :
      ( ( ~ subset(A,B)
        | ~ in(C,A)
        | in(C,B) )
      & ( ~ in(c(A,B,C),B)
        | subset(A,B) )
      & ( in(c(A,B,C),A)
        | subset(A,B) ) ),
    file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),
    [] ).

cnf(142951256,plain,
    ( in(c(A,B,C),A)
    | subset(A,B) ),
    inference(rewrite,[status(thm)],[d3_tarski]),
    [] ).

fof(t7_boole,plain,
    ! [A,B] :
      ( ~ in(A,B)
      | ~ empty(B) ),
    file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),
    [] ).

cnf(143160528,plain,
    ( ~ in(A,B)
    | ~ empty(B) ),
    inference(rewrite,[status(thm)],[t7_boole]),
    [] ).

fof(fc1_xboole_0,plain,
    empty(empty_set),
    file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),
    [] ).

cnf(143043784,plain,
    empty(empty_set),
    inference(rewrite,[status(thm)],[fc1_xboole_0]),
    [] ).

cnf(151022752,plain,
    ~ in(A,empty_set),
    inference(resolution,[status(thm)],[143160528,143043784]),
    [] ).

cnf(151110248,plain,
    subset(empty_set,A),
    inference(resolution,[status(thm)],[142951256,151022752]),
    [] ).

fof(t2_xboole_1,plain,
    ~ subset(empty_set,a),
    file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),
    [] ).

cnf(143101584,plain,
    ~ subset(empty_set,a),
    inference(rewrite,[status(thm)],[t2_xboole_1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[151110248,143101584]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(d3_tarski,plain,(((~subset(A,B)|~in(C,A)|in(C,B))&(~in(c(A,B,C),B)|subset(A,B))&(in(c(A,B,C),A)|subset(A,B)))),file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),[]).
% 
% cnf(142951256,plain,(in(c(A,B,C),A)|subset(A,B)),inference(rewrite,[status(thm)],[d3_tarski]),[]).
% 
% fof(t7_boole,plain,(~in(A,B)|~empty(B)),file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),[]).
% 
% cnf(143160528,plain,(~in(A,B)|~empty(B)),inference(rewrite,[status(thm)],[t7_boole]),[]).
% 
% fof(fc1_xboole_0,plain,(empty(empty_set)),file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),[]).
% 
% cnf(143043784,plain,(empty(empty_set)),inference(rewrite,[status(thm)],[fc1_xboole_0]),[]).
% 
% cnf(151022752,plain,(~in(A,empty_set)),inference(resolution,[status(thm)],[143160528,143043784]),[]).
% 
% cnf(151110248,plain,(subset(empty_set,A)),inference(resolution,[status(thm)],[142951256,151022752]),[]).
% 
% fof(t2_xboole_1,plain,(~subset(empty_set,a)),file('/tmp/SystemOnTPTP9506/SEU122+2.p',unknown),[]).
% 
% cnf(143101584,plain,(~subset(empty_set,a)),inference(rewrite,[status(thm)],[t2_xboole_1]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[151110248,143101584]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------