↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art02.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 18:20:45 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 :    8 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :    5 (   1 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(thm75,plain,
    ! [A,C] :
      ( ( ~ p(A,j(A),C)
        | p(a,j(A),h(j(A))) )
      & ( p(A,j(A),k(j(A)))
        | p(a,j(A),h(j(A))) )
      & ( ~ p(A,j(A),C)
        | ~ p(A,j(A),C) )
      & ( p(A,j(A),k(j(A)))
        | ~ p(A,j(A),C) ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN730+1.tptp',unknown),
    [] ).

cnf(170030784,plain,
    ~ p(A,j(A),C),
    inference(rewrite,[status(thm)],[thm75]),
    [] ).

cnf(170035408,plain,
    ( p(A,j(A),k(j(A)))
    | p(a,j(A),h(j(A))) ),
    inference(rewrite,[status(thm)],[thm75]),
    [] ).

cnf(183064208,plain,
    p(a,j(a),k(j(a))),
    inference(resolution,[status(thm)],[170035408,170030784]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[170030784,183064208]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(thm75,plain,(((~p(A,j(A),C)|p(a,j(A),h(j(A))))&(p(A,j(A),k(j(A)))|p(a,j(A),h(j(A))))&(~p(A,j(A),C)|~p(A,j(A),C))&(p(A,j(A),k(j(A)))|~p(A,j(A),C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN730+1.tptp',unknown),[]).
% 
% cnf(170030784,plain,(~p(A,j(A),C)),inference(rewrite,[status(thm)],[thm75]),[]).
% 
% cnf(170035408,plain,(p(A,j(A),k(j(A)))|p(a,j(A),h(j(A)))),inference(rewrite,[status(thm)],[thm75]),[]).
% 
% cnf(183064208,plain,(p(a,j(a),k(j(a)))),inference(resolution,[status(thm)],[170035408,170030784]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[170030784,183064208]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------