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

% Computer : art02.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:42:43 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(f_is_associative,plain,
    ! [A,B,C] : $equal(f(f(A,B),C),f(A,f(B,C))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN083-1.tptp',unknown),
    [] ).

cnf(163209200,plain,
    $equal(f(f(A,B),C),f(A,f(B,C))),
    inference(rewrite,[status(thm)],[f_is_associative]),
    [] ).

fof(prove_this,plain,
    ~ $equal(f(f(f(a,b),c),d),f(a,f(b,f(c,d)))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN083-1.tptp',unknown),
    [] ).

cnf(163214312,plain,
    ~ $equal(f(f(f(a,b),c),d),f(a,f(b,f(c,d)))),
    inference(rewrite,[status(thm)],[prove_this]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[163209200,163214312,163209200,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(f_is_associative,plain,($equal(f(f(A,B),C),f(A,f(B,C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN083-1.tptp',unknown),[]).
% 
% cnf(163209200,plain,($equal(f(f(A,B),C),f(A,f(B,C)))),inference(rewrite,[status(thm)],[f_is_associative]),[]).
% 
% fof(prove_this,plain,(~$equal(f(f(f(a,b),c),d),f(a,f(b,f(c,d))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN083-1.tptp',unknown),[]).
% 
% cnf(163214312,plain,(~$equal(f(f(f(a,b),c),d),f(a,f(b,f(c,d))))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[163209200,163214312,163209200,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------