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

% Computer : art08.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:46:50 EDT 2009

% Result   : Unsatisfiable 3.0s
% Output   : Refutation 3.0s
% 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    :    6 (   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   :   24 (   0 sgn   9   !;   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/LCL226-1.tptp',unknown),
    [] ).

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

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/LCL226-1.tptp',unknown),
    [] ).

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

cnf(153003496,plain,
    theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    inference(resolution,[status(thm)],[144983152,144976848]),
    [] ).

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

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

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

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

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

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

cnf(153102720,plain,
    ( theorem(or(B,or(A,C)))
    | ~ theorem(or(A,or(B,C))) ),
    inference(resolution,[status(thm)],[145000456,144968624]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[153003496,145020680,153102720]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 3 seconds
% START OF PROOF SEQUENCE
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL226-1.tptp',unknown),[]).
% 
% cnf(144983152,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
% 
% 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/LCL226-1.tptp',unknown),[]).
% 
% cnf(144976848,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(rewrite,[status(thm)],[axiom_1_6]),[]).
% 
% cnf(153003496,plain,(theorem(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(resolution,[status(thm)],[144983152,144976848]),[]).
% 
% fof(prove_this,plain,(~theorem(or(not(or(q,r)),or(not(or(not(r),s)),or(q,s))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL226-1.tptp',unknown),[]).
% 
% cnf(145020680,plain,(~theorem(or(not(or(q,r)),or(not(or(not(r),s)),or(q,s))))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL226-1.tptp',unknown),[]).
% 
% cnf(145000456,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
% 
% fof(axiom_1_5,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL226-1.tptp',unknown),[]).
% 
% cnf(144968624,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
% 
% cnf(153102720,plain,(theorem(or(B,or(A,C)))|~theorem(or(A,or(B,C)))),inference(resolution,[status(thm)],[145000456,144968624]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[153003496,145020680,153102720]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------