%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SYN150-1 : TPTP v3.4.2. Released v1.1.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 16:57:06 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(axiom_32,plain,
    k0(b),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),
    [] ).

cnf(172314280,plain,
    k0(b),
    inference(rewrite,[status(thm)],[axiom_32]),
    [] ).

fof(rule_137,plain,
    ! [A,B,C] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),
    [] ).

cnf(173829648,plain,
    ( n2(A)
    | ~ p1(B,C,A) ),
    inference(rewrite,[status(thm)],[rule_137]),
    [] ).

fof(prove_this,plain,
    ~ n2(b),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),
    [] ).

cnf(176522976,plain,
    ~ n2(b),
    inference(rewrite,[status(thm)],[prove_this]),
    [] ).

cnf(187196896,plain,
    ~ p1(A,B,b),
    inference(resolution,[status(thm)],[173829648,176522976]),
    [] ).

fof(rule_068,plain,
    ! [A] :
      ( p1(A,A,A)
      | ~ k0(A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),
    [] ).

cnf(173106432,plain,
    ( p1(A,A,A)
    | ~ k0(A) ),
    inference(rewrite,[status(thm)],[rule_068]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[172314280,187196896,173106432]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(axiom_32,plain,(k0(b)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),[]).
% 
% cnf(172314280,plain,(k0(b)),inference(rewrite,[status(thm)],[axiom_32]),[]).
% 
% fof(rule_137,plain,(n2(A)|~p1(B,C,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),[]).
% 
% cnf(173829648,plain,(n2(A)|~p1(B,C,A)),inference(rewrite,[status(thm)],[rule_137]),[]).
% 
% fof(prove_this,plain,(~n2(b)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),[]).
% 
% cnf(176522976,plain,(~n2(b)),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% cnf(187196896,plain,(~p1(A,B,b)),inference(resolution,[status(thm)],[173829648,176522976]),[]).
% 
% fof(rule_068,plain,(p1(A,A,A)|~k0(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN150-1.tptp',unknown),[]).
% 
% cnf(173106432,plain,(p1(A,A,A)|~k0(A)),inference(rewrite,[status(thm)],[rule_068]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[172314280,187196896,173106432]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------