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

View Problem - Process Solution

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

% Computer : art02.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:14 EDT 2009

% Result   : Unsatisfiable 17.7s
% Output   : Refutation 17.7s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  14 unt;   0 def)
%            Number of atoms       :   34 (   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   :   44 (   8 sgn  13   !;   0   ?)

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

cnf(171077464,plain,
    ~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
    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/LCL207-1.tptp',unknown),
    [] ).

cnf(171057304,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/LCL207-1.tptp',unknown),
    [] ).

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

cnf(179073056,plain,
    ( theorem(or(B,or(A,C)))
    | ~ theorem(or(A,or(B,C))) ),
    inference(resolution,[status(thm)],[171057304,171025568]),
    [] ).

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

cnf(171072992,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_3,plain,
    ! [A,B] : axiom(or(not(A),or(B,A))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL207-1.tptp',unknown),
    [] ).

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

cnf(178917224,plain,
    ( theorem(or(not(A),B))
    | ~ theorem(or(not(or(C,A)),B)) ),
    inference(resolution,[status(thm)],[171072992,171013680]),
    [] ).

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

cnf(171040032,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/LCL207-1.tptp',unknown),
    [] ).

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

cnf(178929968,plain,
    theorem(or(not(or(A,B)),or(B,A))),
    inference(resolution,[status(thm)],[171040032,171021592]),
    [] ).

cnf(190976168,plain,
    theorem(or(not(A),or(A,B))),
    inference(resolution,[status(thm)],[178917224,178929968]),
    [] ).

cnf(191472920,plain,
    theorem(or(A,or(not(A),B))),
    inference(resolution,[status(thm)],[179073056,190976168]),
    [] ).

cnf(191713608,plain,
    theorem(or(not(A),or(not(not(or(B,A))),C))),
    inference(resolution,[status(thm)],[178917224,191472920]),
    [] ).

cnf(223435912,plain,
    theorem(or(not(not(or(C,B))),or(not(B),A))),
    inference(resolution,[status(thm)],[179073056,191713608]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[171077464,223435912]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 18 seconds
% START OF PROOF SEQUENCE
% fof(prove_this,plain,(~theorem(or(not(not(or(not(p),q))),or(not(q),p)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL207-1.tptp',unknown),[]).
% 
% cnf(171077464,plain,(~theorem(or(not(not(or(not(p),q))),or(not(q),p)))),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/LCL207-1.tptp',unknown),[]).
% 
% cnf(171057304,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/LCL207-1.tptp',unknown),[]).
% 
% cnf(171025568,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
% 
% cnf(179073056,plain,(theorem(or(B,or(A,C)))|~theorem(or(A,or(B,C)))),inference(resolution,[status(thm)],[171057304,171025568]),[]).
% 
% 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/LCL207-1.tptp',unknown),[]).
% 
% cnf(171072992,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_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL207-1.tptp',unknown),[]).
% 
% cnf(171013680,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
% 
% cnf(178917224,plain,(theorem(or(not(A),B))|~theorem(or(not(or(C,A)),B))),inference(resolution,[status(thm)],[171072992,171013680]),[]).
% 
% fof(rule_1,plain,(theorem(A)|~axiom(A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL207-1.tptp',unknown),[]).
% 
% cnf(171040032,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/LCL207-1.tptp',unknown),[]).
% 
% cnf(171021592,plain,(axiom(or(not(or(A,B)),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_4]),[]).
% 
% cnf(178929968,plain,(theorem(or(not(or(A,B)),or(B,A)))),inference(resolution,[status(thm)],[171040032,171021592]),[]).
% 
% cnf(190976168,plain,(theorem(or(not(A),or(A,B)))),inference(resolution,[status(thm)],[178917224,178929968]),[]).
% 
% cnf(191472920,plain,(theorem(or(A,or(not(A),B)))),inference(resolution,[status(thm)],[179073056,190976168]),[]).
% 
% cnf(191713608,plain,(theorem(or(not(A),or(not(not(or(B,A))),C)))),inference(resolution,[status(thm)],[178917224,191472920]),[]).
% 
% cnf(223435912,plain,(theorem(or(not(not(or(C,B))),or(not(B),A)))),inference(resolution,[status(thm)],[179073056,191713608]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[171077464,223435912]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------