↑ Up

Faust---1.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : LCL189-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art07.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:28 EDT 2009

% Result   : Unsatisfiable 0.2s
% Output   : Refutation 0.2s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  12 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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   :   30 (   4 sgn   9   !;   0   ?)

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

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

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

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

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

cnf(157705488,plain,
    theorem(or(not(A),or(B,A))),
    inference(resolution,[status(thm)],[149792384,149766032]),
    [] ).

cnf(157795432,plain,
    ( theorem(A)
    | ~ axiom(or(not(or(not(B),or(C,B))),A)) ),
    inference(resolution,[status(thm)],[149809656,157705488]),
    [] ).

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

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

cnf(162988536,plain,
    theorem(or(B,or(not(A),A))),
    inference(resolution,[status(thm)],[157795432,149773832]),
    [] ).

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

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

cnf(157616680,plain,
    ( theorem(A)
    | ~ theorem(or(A,A)) ),
    inference(resolution,[status(thm)],[149809656,149761864]),
    [] ).

cnf(163053312,plain,
    theorem(or(not(A),A)),
    inference(resolution,[status(thm)],[162988536,157616680]),
    [] ).

cnf(157854232,plain,
    ( theorem(or(B,or(A,C)))
    | ~ theorem(or(A,or(B,C))) ),
    inference(resolution,[status(thm)],[149809656,149773832]),
    [] ).

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

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

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__resolution,[status(thm)],[163053312,157854232,149829816]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(rule_2,plain,(theorem(A)|~axiom(or(not(B),A))|~theorem(B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL189-1.tptp',unknown),[]).
% 
% cnf(149809656,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/LCL189-1.tptp',unknown),[]).
% 
% cnf(149792384,plain,(theorem(A)|~axiom(A)),inference(rewrite,[status(thm)],[rule_1]),[]).
% 
% fof(axiom_1_3,plain,(axiom(or(not(A),or(B,A)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL189-1.tptp',unknown),[]).
% 
% cnf(149766032,plain,(axiom(or(not(A),or(B,A)))),inference(rewrite,[status(thm)],[axiom_1_3]),[]).
% 
% cnf(157705488,plain,(theorem(or(not(A),or(B,A)))),inference(resolution,[status(thm)],[149792384,149766032]),[]).
% 
% cnf(157795432,plain,(theorem(A)|~axiom(or(not(or(not(B),or(C,B))),A))),inference(resolution,[status(thm)],[149809656,157705488]),[]).
% 
% 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/LCL189-1.tptp',unknown),[]).
% 
% cnf(149773832,plain,(axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))),inference(rewrite,[status(thm)],[axiom_1_5]),[]).
% 
% cnf(162988536,plain,(theorem(or(B,or(not(A),A)))),inference(resolution,[status(thm)],[157795432,149773832]),[]).
% 
% fof(axiom_1_2,plain,(axiom(or(not(or(A,A)),A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL189-1.tptp',unknown),[]).
% 
% cnf(149761864,plain,(axiom(or(not(or(A,A)),A))),inference(rewrite,[status(thm)],[axiom_1_2]),[]).
% 
% cnf(157616680,plain,(theorem(A)|~theorem(or(A,A))),inference(resolution,[status(thm)],[149809656,149761864]),[]).
% 
% cnf(163053312,plain,(theorem(or(not(A),A))),inference(resolution,[status(thm)],[162988536,157616680]),[]).
% 
% cnf(157854232,plain,(theorem(or(B,or(A,C)))|~theorem(or(A,or(B,C)))),inference(resolution,[status(thm)],[149809656,149773832]),[]).
% 
% fof(prove_this,plain,(~theorem(or(not(p),or(not(or(not(p),q)),q)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/LCL/LCL189-1.tptp',unknown),[]).
% 
% cnf(149829816,plain,(~theorem(or(not(p),or(not(or(not(p),q)),q)))),inference(rewrite,[status(thm)],[prove_this]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__resolution,[status(thm)],[163053312,157854232,149829816]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------