%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : GRP162-1 : TPTP v3.4.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art06.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May  6 12:30:06 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(ax_transa_2,plain,
    $equal(least_upper_bound(b,c),c),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),
    [] ).

cnf(142575680,plain,
    $equal(least_upper_bound(b,c),c),
    inference(rewrite,[status(thm)],[ax_transa_2]),
    [] ).

fof(prove_ax_transa,plain,
    ~ $equal(least_upper_bound(a,c),c),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),
    [] ).

cnf(142445984,plain,
    ~ $equal(least_upper_bound(a,c),c),
    inference(rewrite,[status(thm)],[prove_ax_transa]),
    [] ).

cnf(150400712,plain,
    ~ $equal(least_upper_bound(a,least_upper_bound(b,c)),c),
    inference(paramodulation,[status(thm)],[142445984,142575680,theory(equality)]),
    [] ).

fof(associativity_of_lub,plain,
    ! [A,B,C] : $equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),
    [] ).

cnf(142486088,plain,
    $equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
    inference(rewrite,[status(thm)],[associativity_of_lub]),
    [] ).

cnf(150613576,plain,
    ~ $equal(least_upper_bound(least_upper_bound(a,b),c),c),
    inference(paramodulation,[status(thm)],[150400712,142486088,theory(equality)]),
    [] ).

fof(ax_transa_1,plain,
    $equal(least_upper_bound(a,b),b),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),
    [] ).

cnf(142571736,plain,
    $equal(least_upper_bound(a,b),b),
    inference(rewrite,[status(thm)],[ax_transa_1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[142575680,150613576,142571736,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(ax_transa_2,plain,($equal(least_upper_bound(b,c),c)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),[]).
% 
% cnf(142575680,plain,($equal(least_upper_bound(b,c),c)),inference(rewrite,[status(thm)],[ax_transa_2]),[]).
% 
% fof(prove_ax_transa,plain,(~$equal(least_upper_bound(a,c),c)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),[]).
% 
% cnf(142445984,plain,(~$equal(least_upper_bound(a,c),c)),inference(rewrite,[status(thm)],[prove_ax_transa]),[]).
% 
% cnf(150400712,plain,(~$equal(least_upper_bound(a,least_upper_bound(b,c)),c)),inference(paramodulation,[status(thm)],[142445984,142575680,theory(equality)]),[]).
% 
% fof(associativity_of_lub,plain,($equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),[]).
% 
% cnf(142486088,plain,($equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C)))),inference(rewrite,[status(thm)],[associativity_of_lub]),[]).
% 
% cnf(150613576,plain,(~$equal(least_upper_bound(least_upper_bound(a,b),c),c)),inference(paramodulation,[status(thm)],[150400712,142486088,theory(equality)]),[]).
% 
% fof(ax_transa_1,plain,($equal(least_upper_bound(a,b),b)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/GRP/GRP162-1.tptp',unknown),[]).
% 
% cnf(142571736,plain,($equal(least_upper_bound(a,b),b)),inference(rewrite,[status(thm)],[ax_transa_1]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[142575680,150613576,142571736,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------