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

% Computer : art10.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 13:42:59 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(yqm,plain,
    ! [A,B,C] : is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(C,A)))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL117-1.tptp',unknown),
    [] ).

cnf(152629912,plain,
    is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(C,A)))),
    inference(rewrite,[status(thm)],[yqm]),
    [] ).

fof(condensed_detachment,plain,
    ! [A,B] :
      ( ~ is_a_theorem(equivalent(A,B))
      | ~ is_a_theorem(A)
      | is_a_theorem(B) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL117-1.tptp',unknown),
    [] ).

cnf(152625056,plain,
    ( ~ is_a_theorem(equivalent(A,B))
    | ~ is_a_theorem(A)
    | is_a_theorem(B) ),
    inference(rewrite,[status(thm)],[condensed_detachment]),
    [] ).

cnf(160413440,plain,
    ( ~ is_a_theorem(equivalent(A,B))
    | is_a_theorem(equivalent(equivalent(C,B),equivalent(C,A))) ),
    inference(resolution,[status(thm)],[152625056,152629912]),
    [] ).

cnf(160576712,plain,
    ( ~ is_a_theorem(equivalent(A,B))
    | ~ is_a_theorem(equivalent(C,B))
    | is_a_theorem(equivalent(C,A)) ),
    inference(resolution,[status(thm)],[160413440,152625056]),
    [] ).

cnf(160715840,plain,
    is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))),
    inference(resolution,[status(thm)],[160576712,152629912]),
    [] ).

cnf(160833840,plain,
    ( ~ is_a_theorem(equivalent(C,equivalent(A,B)))
    | is_a_theorem(equivalent(equivalent(A,B),C)) ),
    inference(resolution,[status(thm)],[160715840,160576712]),
    [] ).

fof(prove_qyf,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL117-1.tptp',unknown),
    [] ).

cnf(152634128,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    inference(rewrite,[status(thm)],[prove_qyf]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[152629912,160833840,152634128]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(yqm,plain,(is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(C,A))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL117-1.tptp',unknown),[]).
% 
% cnf(152629912,plain,(is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(C,A))))),inference(rewrite,[status(thm)],[yqm]),[]).
% 
% fof(condensed_detachment,plain,(~is_a_theorem(equivalent(A,B))|~is_a_theorem(A)|is_a_theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL117-1.tptp',unknown),[]).
% 
% cnf(152625056,plain,(~is_a_theorem(equivalent(A,B))|~is_a_theorem(A)|is_a_theorem(B)),inference(rewrite,[status(thm)],[condensed_detachment]),[]).
% 
% cnf(160413440,plain,(~is_a_theorem(equivalent(A,B))|is_a_theorem(equivalent(equivalent(C,B),equivalent(C,A)))),inference(resolution,[status(thm)],[152625056,152629912]),[]).
% 
% cnf(160576712,plain,(~is_a_theorem(equivalent(A,B))|~is_a_theorem(equivalent(C,B))|is_a_theorem(equivalent(C,A))),inference(resolution,[status(thm)],[160413440,152625056]),[]).
% 
% cnf(160715840,plain,(is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B)))),inference(resolution,[status(thm)],[160576712,152629912]),[]).
% 
% cnf(160833840,plain,(~is_a_theorem(equivalent(C,equivalent(A,B)))|is_a_theorem(equivalent(equivalent(A,B),C))),inference(resolution,[status(thm)],[160715840,160576712]),[]).
% 
% fof(prove_qyf,plain,(~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL117-1.tptp',unknown),[]).
% 
% cnf(152634128,plain,(~is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))),inference(rewrite,[status(thm)],[prove_qyf]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[152629912,160833840,152634128]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------