↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art09.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 16:42:29 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(pel58,plain,
    ~ $equal(f(g(y)),f(f(x))),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN080+1.tptp',unknown),
    [] ).

cnf(164872528,plain,
    ~ $equal(f(g(y)),f(f(x))),
    inference(rewrite,[status(thm)],[pel58]),
    [] ).

fof(pel58_1,plain,
    ! [B,A] : $equal(g(B),f(A)),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN080+1.tptp',unknown),
    [] ).

cnf(164827544,plain,
    $equal(g(B),f(A)),
    inference(rewrite,[status(thm)],[pel58_1]),
    [] ).

cnf(172658160,plain,
    ~ $equal(f(g(y)),g(A)),
    inference(paramodulation,[status(thm)],[164872528,164827544,theory(equality)]),
    [] ).

cnf(172702048,plain,
    ~ $equal(g(B),g(A)),
    inference(paramodulation,[status(thm)],[172658160,164827544,theory(equality)]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(equality_resolution,[status(thm)],[172702048]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(pel58,plain,(~$equal(f(g(y)),f(f(x)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN080+1.tptp',unknown),[]).
% 
% cnf(164872528,plain,(~$equal(f(g(y)),f(f(x)))),inference(rewrite,[status(thm)],[pel58]),[]).
% 
% fof(pel58_1,plain,($equal(g(B),f(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN080+1.tptp',unknown),[]).
% 
% cnf(164827544,plain,($equal(g(B),f(A))),inference(rewrite,[status(thm)],[pel58_1]),[]).
% 
% cnf(172658160,plain,(~$equal(f(g(y)),g(A))),inference(paramodulation,[status(thm)],[164872528,164827544,theory(equality)]),[]).
% 
% cnf(172702048,plain,(~$equal(g(B),g(A))),inference(paramodulation,[status(thm)],[172658160,164827544,theory(equality)]),[]).
% 
% cnf(contradiction,plain,$false,inference(equality_resolution,[status(thm)],[172702048]),[]).
% 
% END OF PROOF SEQUENCE
% 
%------------------------------------------------------------------------------