↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art07.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 16:38:57 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       :  329 (   0 equ)
%            Maximal formula atoms :  324 (  65 avg)
%            Number of connectives :  487 ( 163   ~; 244   |;  80   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   85 (  18 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    3 (   2 usr;   3 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(pel15,plain,
    ( ( p
      | p
      | p
      | ~ p )
    & ( ~ q
      | p
      | p
      | ~ p )
    & ( ~ p
      | p
      | p
      | ~ p )
    & ( p
      | ~ q
      | p
      | ~ p )
    & ( ~ q
      | ~ q
      | p
      | ~ p )
    & ( ~ p
      | ~ q
      | p
      | ~ p )
    & ( p
      | q
      | p
      | ~ p )
    & ( ~ q
      | q
      | p
      | ~ p )
    & ( ~ p
      | q
      | p
      | ~ p )
    & ( p
      | p
      | ~ q
      | ~ p )
    & ( ~ q
      | p
      | ~ q
      | ~ p )
    & ( ~ p
      | p
      | ~ q
      | ~ p )
    & ( p
      | ~ q
      | ~ q
      | ~ p )
    & ( ~ q
      | ~ q
      | ~ q
      | ~ p )
    & ( ~ p
      | ~ q
      | ~ q
      | ~ p )
    & ( p
      | q
      | ~ q
      | ~ p )
    & ( ~ q
      | q
      | ~ q
      | ~ p )
    & ( ~ p
      | q
      | ~ q
      | ~ p )
    & ( p
      | p
      | q
      | ~ p )
    & ( ~ q
      | p
      | q
      | ~ p )
    & ( ~ p
      | p
      | q
      | ~ p )
    & ( p
      | ~ q
      | q
      | ~ p )
    & ( ~ q
      | ~ q
      | q
      | ~ p )
    & ( ~ p
      | ~ q
      | q
      | ~ p )
    & ( p
      | q
      | q
      | ~ p )
    & ( ~ q
      | q
      | q
      | ~ p )
    & ( ~ p
      | q
      | q
      | ~ p )
    & ( p
      | p
      | p
      | p )
    & ( ~ q
      | p
      | p
      | p )
    & ( ~ p
      | p
      | p
      | p )
    & ( p
      | ~ q
      | p
      | p )
    & ( ~ q
      | ~ q
      | p
      | p )
    & ( ~ p
      | ~ q
      | p
      | p )
    & ( p
      | q
      | p
      | p )
    & ( ~ q
      | q
      | p
      | p )
    & ( ~ p
      | q
      | p
      | p )
    & ( p
      | p
      | ~ q
      | p )
    & ( ~ q
      | p
      | ~ q
      | p )
    & ( ~ p
      | p
      | ~ q
      | p )
    & ( p
      | ~ q
      | ~ q
      | p )
    & ( ~ q
      | ~ q
      | ~ q
      | p )
    & ( ~ p
      | ~ q
      | ~ q
      | p )
    & ( p
      | q
      | ~ q
      | p )
    & ( ~ q
      | q
      | ~ q
      | p )
    & ( ~ p
      | q
      | ~ q
      | p )
    & ( p
      | p
      | q
      | p )
    & ( ~ q
      | p
      | q
      | p )
    & ( ~ p
      | p
      | q
      | p )
    & ( p
      | ~ q
      | q
      | p )
    & ( ~ q
      | ~ q
      | q
      | p )
    & ( ~ p
      | ~ q
      | q
      | p )
    & ( p
      | q
      | q
      | p )
    & ( ~ q
      | q
      | q
      | p )
    & ( ~ p
      | q
      | q
      | p )
    & ( p
      | p
      | p
      | ~ q )
    & ( ~ q
      | p
      | p
      | ~ q )
    & ( ~ p
      | p
      | p
      | ~ q )
    & ( p
      | ~ q
      | p
      | ~ q )
    & ( ~ q
      | ~ q
      | p
      | ~ q )
    & ( ~ p
      | ~ q
      | p
      | ~ q )
    & ( p
      | q
      | p
      | ~ q )
    & ( ~ q
      | q
      | p
      | ~ q )
    & ( ~ p
      | q
      | p
      | ~ q )
    & ( p
      | p
      | ~ q
      | ~ q )
    & ( ~ q
      | p
      | ~ q
      | ~ q )
    & ( ~ p
      | p
      | ~ q
      | ~ q )
    & ( p
      | ~ q
      | ~ q
      | ~ q )
    & ( ~ q
      | ~ q
      | ~ q
      | ~ q )
    & ( ~ p
      | ~ q
      | ~ q
      | ~ q )
    & ( p
      | q
      | ~ q
      | ~ q )
    & ( ~ q
      | q
      | ~ q
      | ~ q )
    & ( ~ p
      | q
      | ~ q
      | ~ q )
    & ( p
      | p
      | q
      | ~ q )
    & ( ~ q
      | p
      | q
      | ~ q )
    & ( ~ p
      | p
      | q
      | ~ q )
    & ( p
      | ~ q
      | q
      | ~ q )
    & ( ~ q
      | ~ q
      | q
      | ~ q )
    & ( ~ p
      | ~ q
      | q
      | ~ q )
    & ( p
      | q
      | q
      | ~ q )
    & ( ~ q
      | q
      | q
      | ~ q )
    & ( ~ p
      | q
      | q
      | ~ q ) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN046+1.tptp',unknown),
    [] ).

cnf(143603000,plain,
    ( p
    | q ),
    inference(rewrite,[status(thm)],[pel15]),
    [] ).

cnf(143612224,plain,
    q,
    inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel15,143603000]),
    [] ).

cnf(143596200,plain,
    ~ q,
    inference(rewrite,[status(thm)],[pel15]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[143612224,143596200]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(pel15,plain,(((p|p|p|~p)&(~q|p|p|~p)&(~p|p|p|~p)&(p|~q|p|~p)&(~q|~q|p|~p)&(~p|~q|p|~p)&(p|q|p|~p)&(~q|q|p|~p)&(~p|q|p|~p)&(p|p|~q|~p)&(~q|p|~q|~p)&(~p|p|~q|~p)&(p|~q|~q|~p)&(~q|~q|~q|~p)&(~p|~q|~q|~p)&(p|q|~q|~p)&(~q|q|~q|~p)&(~p|q|~q|~p)&(p|p|q|~p)&(~q|p|q|~p)&(~p|p|q|~p)&(p|~q|q|~p)&(~q|~q|q|~p)&(~p|~q|q|~p)&(p|q|q|~p)&(~q|q|q|~p)&(~p|q|q|~p)&(p|p|p|p)&(~q|p|p|p)&(~p|p|p|p)&(p|~q|p|p)&(~q|~q|p|p)&(~p|~q|p|p)&(p|q|p|p)&(~q|q|p|p)&(~p|q|p|p)&(p|p|~q|p)&(~q|p|~q|p)&(~p|p|~q|p)&(p|~q|~q|p)&(~q|~q|~q|p)&(~p|~q|~q|p)&(p|q|~q|p)&(~q|q|~q|p)&(~p|q|~q|p)&(p|p|q|p)&(~q|p|q|p)&(~p|p|q|p)&(p|~q|q|p)&(~q|~q|q|p)&(~p|~q|q|p)&(p|q|q|p)&(~q|q|q|p)&(~p|q|q|p)&(p|p|p|~q)&(~q|p|p|~q)&(~p|p|p|~q)&(p|~q|p|~q)&(~q|~q|p|~q)&(~p|~q|p|~q)&(p|q|p|~q)&(~q|q|p|~q)&(~p|q|p|~q)&(p|p|~q|~q)&(~q|p|~q|~q)&(~p|p|~q|~q)&(p|~q|~q|~q)&(~q|~q|~q|~q)&(~p|~q|~q|~q)&(p|q|~q|~q)&(~q|q|~q|~q)&(~p|q|~q|~q)&(p|p|q|~q)&(~q|p|q|~q)&(~p|p|q|~q)&(p|~q|q|~q)&(~q|~q|q|~q)&(~p|~q|q|~q)&(p|q|q|~q)&(~q|q|q|~q)&(~p|q|q|~q))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN046+1.tptp',unknown),[]).
% 
% cnf(143603000,plain,(p|q),inference(rewrite,[status(thm)],[pel15]),[]).
% 
% cnf(143612224,plain,(q),inference(rewrite__forward_subsumption_resolution,[status(thm)],[pel15,143603000]),[]).
% 
% cnf(143596200,plain,(~q),inference(rewrite,[status(thm)],[pel15]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[143612224,143596200]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------