TSTP Solution File: LCL197-1 by Faust---1.0

View Problem - Process Solution

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

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_this,plain,
    ~ theorem(or(not(or(q,or(p,q))),or(p,q))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL197-1.tptp',unknown),
    [] ).

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

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

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

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

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

cnf(194838360,plain,
    ( theorem(or(not(or(B,or(C,D))),A))
    | ~ theorem(or(not(or(C,or(B,D))),A)) ),
    inference(resolution,[status(thm)],[173755792,173704280]),
    [] ).

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

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

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

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

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

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

cnf(181523424,plain,
    theorem(or(not(or(A,A)),A)),
    inference(resolution,[status(thm)],[173722832,173692312]),
    [] ).

cnf(181667360,plain,
    ( theorem(A)
    | ~ axiom(or(not(or(not(or(B,B)),B)),A)) ),
    inference(resolution,[status(thm)],[173740104,181523424]),
    [] ).

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

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

cnf(186926192,plain,
    theorem(or(not(or(B,or(A,A))),or(B,A))),
    inference(resolution,[status(thm)],[181667360,173712472]),
    [] ).

cnf(206661952,plain,
    theorem(or(not(or(A,or(B,A))),or(B,A))),
    inference(resolution,[status(thm)],[194838360,186926192]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[173760264,206661952]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 11 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(or(q,or(p,q))),or(p,q)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL197-1.tptp',unknown),[]).
% 
% cnf(173760264,plain,(~theorem(or(not(or(q,or(p,q))),or(p,q)))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% fof(rule_3,plain,(theorem(or(not(A),B))|~axiom(or(not(A),C))|~theorem(or(not(C),B))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL197-1.tptp',unknown),[]).
% 
% cnf(173755792,plain,(theorem(or(not(A),B))|~axiom(or(not(A),C))|~theorem(or(not(C),B))),inference(rewrite,[status(thm)],[rule_3]),[]).
% 
% 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/LCL197-1.tptp',unknown),[]).
% 
% cnf(173704280,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
% 
% cnf(194838360,plain,(theorem(or(not(or(B,or(C,D))),A))|~theorem(or(not(or(C,or(B,D))),A))),inference(resolution,[status(thm)],[173755792,173704280]),[]).
% 
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL197-1.tptp',unknown),[]).
% 
% cnf(173740104,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),inference(rewrite,[status(thm)],[rule_2]),[]).
% 
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL197-1.tptp',unknown),[]).
% 
% cnf(173722832,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
% 
% fof(axiom_1_2,plain,(axiom(or(not(or(A,A)),A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL197-1.tptp',unknown),[]).
% 
% cnf(173692312,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
% 
% cnf(181523424,plain,(theorem(or(not(or(A,A)),A))),inference(resolution,[status(thm)],[173722832,173692312]),[]).
% 
% cnf(181667360,plain,(theorem(A)|~axiom(or(not(or(not(or(B,B)),B)),A))),inference(resolution,[status(thm)],[173740104,181523424]),[]).
% 
% 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/LCL197-1.tptp',unknown),[]).
% 
% cnf(173712472,plain,(axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))),inference(rewrite,[status(thm)],[axiom_1_6]),[]).
% 
% cnf(186926192,plain,(theorem(or(not(or(B,or(A,A))),or(B,A)))),inference(resolution,[status(thm)],[181667360,173712472]),[]).
% 
% cnf(206661952,plain,(theorem(or(not(or(A,or(B,A))),or(B,A)))),inference(resolution,[status(thm)],[194838360,186926192]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[173760264,206661952]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------