%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : LCL169-3 : TPTP v3.4.2. Released v2.3.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 13:44:27 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(rule_1,plain,
    ! [A] :
      ( theorem(A)
      | ~ axiom(A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),
    [] ).

cnf(144266352,plain,
    ( theorem(A)
    | ~ axiom(A) ),
    inference(rewrite,[status(thm)],[rule_1]),
    [] ).

fof(axiom_1_2,plain,
    ! [A] : axiom(implies(or(A,A),A)),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),
    [] ).

cnf(144235360,plain,
    axiom(implies(or(A,A),A)),
    inference(rewrite,[status(thm)],[axiom_1_2]),
    [] ).

cnf(152077960,plain,
    theorem(implies(or(A,A),A)),
    inference(resolution,[status(thm)],[144266352,144235360]),
    [] ).

fof(implies_definition,plain,
    ! [A,B] : $equal(or(not(A),B),implies(A,B)),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),
    [] ).

cnf(144259896,plain,
    $equal(or(not(A),B),implies(A,B)),
    inference(rewrite,[status(thm)],[implies_definition]),
    [] ).

cnf(152431320,plain,
    theorem(or(not(or(A,A)),A)),
    inference(paramodulation,[status(thm)],[152077960,144259896,theory(equality)]),
    [] ).

cnf(152499400,plain,
    theorem(or(not(implies(A,not(A))),not(A))),
    inference(paramodulation,[status(thm)],[152431320,144259896,theory(equality)]),
    [] ).

fof(prove_this,plain,
    ~ theorem(implies(implies(p,not(p)),not(p))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),
    [] ).

cnf(144294024,plain,
    ~ theorem(implies(implies(p,not(p)),not(p))),
    inference(rewrite,[status(thm)],[prove_this]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[152499400,144294024,144259896,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),[]).
% 
% cnf(144266352,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
% 
% fof(axiom_1_2,plain,(axiom(implies(or(A,A),A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),[]).
% 
% cnf(144235360,plain,(axiom(implies(or(A,A),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
% 
% cnf(152077960,plain,(theorem(implies(or(A,A),A))),inference(resolution,[status(thm)],[144266352,144235360]),[]).
% 
% fof(implies_definition,plain,($equal(or(not(A),B),implies(A,B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),[]).
% 
% cnf(144259896,plain,($equal(or(not(A),B),implies(A,B))),inference(rewrite,[status(thm)],[implies_definition]),[]).
% 
% cnf(152431320,plain,(theorem(or(not(or(A,A)),A))),inference(paramodulation,[status(thm)],[152077960,144259896,theory(equality)]),[]).
% 
% cnf(152499400,plain,(theorem(or(not(implies(A,not(A))),not(A)))),inference(paramodulation,[status(thm)],[152431320,144259896,theory(equality)]),[]).
% 
% fof(prove_this,plain,(~theorem(implies(implies(p,not(p)),not(p)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL169-3.tptp',unknown),[]).
% 
% cnf(144294024,plain,(~theorem(implies(implies(p,not(p)),not(p)))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[152499400,144294024,144259896,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------