%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : LCL190-1 : TPTP v3.4.2. Released v1.1.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 13:45:31 EDT 2009

% Result   : Unsatisfiable 12.1s
% Output   : Refutation 12.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   13 (   8 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (   9   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn   8   !;   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/LCL190-1.tptp',unknown),
    [] ).

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

fof(axiom_1_4,plain,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),
    [] ).

cnf(141876152,plain,
    axiom(or(not(or(A,B)),or(B,A))),
    inference(rewrite,[status(thm)],[axiom_1_4]),
    [] ).

cnf(149866296,plain,
    theorem(or(not(or(A,B)),or(B,A))),
    inference(resolution,[status(thm)],[141894672,141876152]),
    [] ).

fof(rule_2,plain,
    ! [A,B] :
      ( theorem(A)
      | ~ axiom(or(not(B),A))
      | ~ theorem(B) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),
    [] ).

cnf(141911976,plain,
    ( theorem(A)
    | ~ axiom(or(not(B),A))
    | ~ theorem(B) ),
    inference(rewrite,[status(thm)],[rule_2]),
    [] ).

fof(axiom_1_6,plain,
    ! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),
    [] ).

cnf(141888368,plain,
    axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    inference(rewrite,[status(thm)],[axiom_1_6]),
    [] ).

cnf(150060936,plain,
    ( theorem(or(not(or(C,A)),or(C,B)))
    | ~ theorem(or(not(A),B)) ),
    inference(resolution,[status(thm)],[141911976,141888368]),
    [] ).

fof(prove_this,plain,
    ~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),
    [] ).

cnf(141932184,plain,
    ~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
    inference(rewrite,[status(thm)],[prove_this]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[149866296,150060936,141932184]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 11 seconds
% START OF PROOF SEQUENCE
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),[]).
% 
% cnf(141894672,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
% 
% fof(axiom_1_4,plain,(axiom(or(not(or(A,B)),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),[]).
% 
% cnf(141876152,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
% 
% cnf(149866296,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[141894672,141876152]),[]).
% 
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),[]).
% 
% cnf(141911976,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
% 
% fof(axiom_1_6,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),[]).
% 
% cnf(141888368,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(rewrite,[status(thm)],[axiom_1_6]),[]).
% 
% cnf(150060936,plain,(theorem(or(not(or(C,A)),or(C,B)))|~theorem(or(not(A),B))),inference(resolution,[status(thm)],[141911976,141888368]),[]).
% 
% fof(prove_this,plain,(~theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL190-1.tptp',unknown),[]).
% 
% cnf(141932184,plain,(~theorem(or(not(or(p,or(q,r))),or(p,or(r,q))))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[149866296,150060936,141932184]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------