↑ Up

Faust---1.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SYN369+1 : TPTP v3.4.2. Released v2.0.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 17:51:48 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(x2120,plain,
    ! [D,A,B,C] :
      ( ( ~ big_p(D,y(A,B,C,D))
        | big_p(A,B) )
      & ( big_p(B,C)
        | big_p(A,B) )
      & ( ~ big_p(D,y(A,B,C,D))
        | ~ big_p(D,y(A,B,C,D)) )
      & ( big_p(B,C)
        | ~ big_p(D,y(A,B,C,D)) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN369+1.tptp',unknown),
    [] ).

cnf(165017120,plain,
    ~ big_p(D,y(A,B,C,D)),
    inference(rewrite,[status(thm)],[x2120]),
    [] ).

cnf(165021592,plain,
    ( big_p(B,C)
    | big_p(A,B) ),
    inference(rewrite,[status(thm)],[x2120]),
    [] ).

cnf(178020616,plain,
    big_p(A,B),
    inference(resolution,[status(thm)],[165021592,165017120]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[165017120,178020616]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(x2120,plain,(((~big_p(D,y(A,B,C,D))|big_p(A,B))&(big_p(B,C)|big_p(A,B))&(~big_p(D,y(A,B,C,D))|~big_p(D,y(A,B,C,D)))&(big_p(B,C)|~big_p(D,y(A,B,C,D))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN369+1.tptp',unknown),[]).
% 
% cnf(165017120,plain,(~big_p(D,y(A,B,C,D))),inference(rewrite,[status(thm)],[x2120]),[]).
% 
% cnf(165021592,plain,(big_p(B,C)|big_p(A,B)),inference(rewrite,[status(thm)],[x2120]),[]).
% 
% cnf(178020616,plain,(big_p(A,B)),inference(resolution,[status(thm)],[165021592,165017120]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[165017120,178020616]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------