↑ Up

Faust---1.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SET575+3 : TPTP v3.4.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art09.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:31:28 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(intersect_defn,plain,
    ! [A,B,D] :
      ( ( member(d_nn_1(A,B),B)
        | ~ intersect(A,B) )
      & ( member(d_nn_1(A,B),A)
        | ~ intersect(A,B) )
      & ( intersect(A,B)
        | ~ member(D,A)
        | ~ member(D,B) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET575+3.tptp',unknown),
    [] ).

cnf(143039824,plain,
    ( member(d_nn_1(A,B),B)
    | ~ intersect(A,B) ),
    inference(rewrite,[status(thm)],[intersect_defn]),
    [] ).

fof(prove_th15,plain,
    ! [C] :
      ( ( intersect(b,c)
        | ~ member(C,c) )
      & ( ~ member(C,b)
        | ~ member(C,c) )
      & ( intersect(b,c)
        | intersect(b,c) )
      & ( ~ member(C,b)
        | intersect(b,c) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET575+3.tptp',unknown),
    [] ).

cnf(143130328,plain,
    intersect(b,c),
    inference(rewrite,[status(thm)],[prove_th15]),
    [] ).

cnf(156188576,plain,
    member(d_nn_1(b,c),c),
    inference(resolution,[status(thm)],[143039824,143130328]),
    [] ).

cnf(143148000,plain,
    ( ~ member(C,b)
    | ~ member(C,c) ),
    inference(rewrite,[status(thm)],[prove_th15]),
    [] ).

cnf(143034144,plain,
    ( member(d_nn_1(A,B),A)
    | ~ intersect(A,B) ),
    inference(rewrite,[status(thm)],[intersect_defn]),
    [] ).

cnf(156179040,plain,
    member(d_nn_1(b,c),b),
    inference(resolution,[status(thm)],[143034144,143130328]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[156188576,143148000,156179040]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(intersect_defn,plain,(((member(d_nn_1(A,B),B)|~intersect(A,B))&(member(d_nn_1(A,B),A)|~intersect(A,B))&(intersect(A,B)|~member(D,A)|~member(D,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET575+3.tptp',unknown),[]).
% 
% cnf(143039824,plain,(member(d_nn_1(A,B),B)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
% 
% fof(prove_th15,plain,(((intersect(b,c)|~member(C,c))&(~member(C,b)|~member(C,c))&(intersect(b,c)|intersect(b,c))&(~member(C,b)|intersect(b,c)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SET/SET575+3.tptp',unknown),[]).
% 
% cnf(143130328,plain,(intersect(b,c)),inference(rewrite,[status(thm)],[prove_th15]),[]).
% 
% cnf(156188576,plain,(member(d_nn_1(b,c),c)),inference(resolution,[status(thm)],[143039824,143130328]),[]).
% 
% cnf(143148000,plain,(~member(C,b)|~member(C,c)),inference(rewrite,[status(thm)],[prove_th15]),[]).
% 
% cnf(143034144,plain,(member(d_nn_1(A,B),A)|~intersect(A,B)),inference(rewrite,[status(thm)],[intersect_defn]),[]).
% 
% cnf(156179040,plain,(member(d_nn_1(b,c),b)),inference(resolution,[status(thm)],[143034144,143130328]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[156188576,143148000,156179040]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------