↑ Up

Faust---1.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : COL083-1 : TPTP v3.4.2. Released v2.6.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.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May  6 11:34:08 EDT 2009

% Result   : Unsatisfiable 0.1s
% Output   : Refutation 0.1s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   5 unt;   0 def)
%            Number of atoms       :    5 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   10 (   2 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_birds_are_compatible_1,plain,
    ! [A,B] : ~ $equal(response(a,A),B),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL083-1.tptp',unknown),
    [] ).

cnf(154044696,plain,
    ~ $equal(response(a,A),B),
    inference(rewrite,[status(thm)],[prove_birds_are_compatible_1]),
    [] ).

fof(composer_exists,plain,
    ! [A,B,C] : $equal(response(A,response(B,C)),response(compose(A,B),C)),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL083-1.tptp',unknown),
    [] ).

cnf(154040024,plain,
    $equal(response(A,response(B,C)),response(compose(A,B),C)),
    inference(rewrite,[status(thm)],[composer_exists]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[154044696,154040024]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_birds_are_compatible_1,plain,(~$equal(response(a,A),B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL083-1.tptp',unknown),[]).
% 
% cnf(154044696,plain,(~$equal(response(a,A),B)),inference(rewrite,[status(thm)],[prove_birds_are_compatible_1]),[]).
% 
% fof(composer_exists,plain,($equal(response(A,response(B,C)),response(compose(A,B),C))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL083-1.tptp',unknown),[]).
% 
% cnf(154040024,plain,($equal(response(A,response(B,C)),response(compose(A,B),C))),inference(rewrite,[status(thm)],[composer_exists]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[154044696,154040024]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------