↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art05.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 13:51:01 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(cn1,plain,
    ! [A,B,C] :
      ( ( ~ cn1
        | is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) )
      & ( cn1
        | ~ is_a_theorem(implies(implies(p(A,B,C),q(A,B,C)),implies(implies(q(A,B,C),r(A,B,C)),implies(p(A,B,C),r(A,B,C))))) ) ),
    file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),
    [] ).

cnf(163671072,plain,
    ( ~ cn1
    | is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) ),
    inference(rewrite,[status(thm)],[cn1]),
    [] ).

fof(luka_cn1,plain,
    cn1,
    file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),
    [] ).

cnf(164035200,plain,
    cn1,
    inference(rewrite,[status(thm)],[luka_cn1]),
    [] ).

cnf(172499984,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(resolution,[status(thm)],[163671072,164035200]),
    [] ).

fof(implies_3,plain,
    ! [A,B,C] :
      ( ( ~ implies_3
        | is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) )
      & ( implies_3
        | ~ is_a_theorem(implies(implies(x(A,B,C),y(A,B,C)),implies(implies(y(A,B,C),z(A,B,C)),implies(x(A,B,C),z(A,B,C))))) ) ),
    file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),
    [] ).

cnf(163221096,plain,
    ( implies_3
    | ~ is_a_theorem(implies(implies(x(A,B,C),y(A,B,C)),implies(implies(y(A,B,C),z(A,B,C)),implies(x(A,B,C),z(A,B,C))))) ),
    inference(rewrite,[status(thm)],[implies_3]),
    [] ).

fof(hilbert_implies_3,plain,
    ~ implies_3,
    file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),
    [] ).

cnf(164100616,plain,
    ~ implies_3,
    inference(rewrite,[status(thm)],[hilbert_implies_3]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[172499984,163221096,164100616]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(cn1,plain,(((~cn1|is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))))&(cn1|~is_a_theorem(implies(implies(p(A,B,C),q(A,B,C)),implies(implies(q(A,B,C),r(A,B,C)),implies(p(A,B,C),r(A,B,C)))))))),file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),[]).
% 
% cnf(163671072,plain,(~cn1|is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C))))),inference(rewrite,[status(thm)],[cn1]),[]).
% 
% fof(luka_cn1,plain,(cn1),file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),[]).
% 
% cnf(164035200,plain,(cn1),inference(rewrite,[status(thm)],[luka_cn1]),[]).
% 
% cnf(172499984,plain,(is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C))))),inference(resolution,[status(thm)],[163671072,164035200]),[]).
% 
% fof(implies_3,plain,(((~implies_3|is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))))&(implies_3|~is_a_theorem(implies(implies(x(A,B,C),y(A,B,C)),implies(implies(y(A,B,C),z(A,B,C)),implies(x(A,B,C),z(A,B,C)))))))),file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),[]).
% 
% cnf(163221096,plain,(implies_3|~is_a_theorem(implies(implies(x(A,B,C),y(A,B,C)),implies(implies(y(A,B,C),z(A,B,C)),implies(x(A,B,C),z(A,B,C)))))),inference(rewrite,[status(thm)],[implies_3]),[]).
% 
% fof(hilbert_implies_3,plain,(~implies_3),file('/tmp/SystemOnTPTP5859/LCL465+1.p',unknown),[]).
% 
% cnf(164100616,plain,(~implies_3),inference(rewrite,[status(thm)],[hilbert_implies_3]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[172499984,163221096,164100616]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------