TSTP Solution File: SYN031-1 by Faust---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SYN031-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art09.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:06 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(theorem,plain,
    ! [A,B] :
      ( ~ g(A,B)
      | ~ g(B,a) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN031-1.tptp',unknown),
    [] ).

cnf(151226008,plain,
    ( ~ g(A,B)
    | ~ g(B,a) ),
    inference(rewrite,[status(thm)],[theorem]),
    [] ).

fof(clause1,plain,
    ! [A] :
      ( g(A,a)
      | g(f(A),A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN031-1.tptp',unknown),
    [] ).

cnf(151203496,plain,
    ( g(A,a)
    | g(f(A),A) ),
    inference(rewrite,[status(thm)],[clause1]),
    [] ).

cnf(159061360,plain,
    g(f(a),a),
    inference(resolution,[status(thm)],[151226008,151203496]),
    [] ).

fof(clause2,plain,
    ! [A] :
      ( g(A,a)
      | g(A,f(A)) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN031-1.tptp',unknown),
    [] ).

cnf(151207592,plain,
    ( g(A,a)
    | g(A,f(A)) ),
    inference(rewrite,[status(thm)],[clause2]),
    [] ).

cnf(159091104,plain,
    g(a,f(a)),
    inference(resolution,[status(thm)],[151226008,151207592]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[159061360,159091104,151226008]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(theorem,plain,(~g(A,B)|~g(B,a)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN031-1.tptp',unknown),[]).
% 
% cnf(151226008,plain,(~g(A,B)|~g(B,a)),inference(rewrite,[status(thm)],[theorem]),[]).
% 
% fof(clause1,plain,(g(A,a)|g(f(A),A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN031-1.tptp',unknown),[]).
% 
% cnf(151203496,plain,(g(A,a)|g(f(A),A)),inference(rewrite,[status(thm)],[clause1]),[]).
% 
% cnf(159061360,plain,(g(f(a),a)),inference(resolution,[status(thm)],[151226008,151203496]),[]).
% 
% fof(clause2,plain,(g(A,a)|g(A,f(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN031-1.tptp',unknown),[]).
% 
% cnf(151207592,plain,(g(A,a)|g(A,f(A))),inference(rewrite,[status(thm)],[clause2]),[]).
% 
% cnf(159091104,plain,(g(a,f(a))),inference(resolution,[status(thm)],[151226008,151207592]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[159061360,159091104,151226008]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------