↑ Up

Faust---1.0.THM-Ref.s

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

% Computer : art05.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:10:22 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(co1,plain,
    ( sslist(u)
    & sslist(v)
    & sslist(w)
    & sslist(x)
    & $equal(x,v)
    & $equal(w,u)
    & neq(v,nil)
    & ~ neq(x,nil) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC141+1.tptp',unknown),
    [] ).

cnf(176025728,plain,
    sslist(v),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

fof(ax28,plain,
    ! [A] :
      ( ~ sslist(A)
      | $equal(app(nil,A),A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC141+1.tptp',unknown),
    [] ).

cnf(174671504,plain,
    ( ~ sslist(A)
    | $equal(app(nil,A),A) ),
    inference(rewrite,[status(thm)],[ax28]),
    [] ).

cnf(213019064,plain,
    $equal(app(nil,v),v),
    inference(resolution,[status(thm)],[176025728,174671504]),
    [] ).

cnf(175968112,plain,
    neq(v,nil),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(228239688,plain,
    neq(app(nil,v),nil),
    inference(paramodulation,[status(thm)],[213019064,175968112,theory(equality)]),
    [] ).

cnf(175994800,plain,
    $equal(x,v),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(228252240,plain,
    $equal(x,app(nil,v)),
    inference(paramodulation,[status(thm)],[213019064,175994800,theory(equality)]),
    [] ).

cnf(175954320,plain,
    ~ neq(x,nil),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(forward_subsumption_resolution__paramodulation,[status(thm)],[228239688,228252240,175954320,theory(equality)]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(co1,plain,((sslist(u)&sslist(v)&sslist(w)&sslist(x)&$equal(x,v)&$equal(w,u)&neq(v,nil)&~neq(x,nil))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC141+1.tptp',unknown),[]).
% 
% cnf(176025728,plain,(sslist(v)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% fof(ax28,plain,(~sslist(A)|$equal(app(nil,A),A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC141+1.tptp',unknown),[]).
% 
% cnf(174671504,plain,(~sslist(A)|$equal(app(nil,A),A)),inference(rewrite,[status(thm)],[ax28]),[]).
% 
% cnf(213019064,plain,($equal(app(nil,v),v)),inference(resolution,[status(thm)],[176025728,174671504]),[]).
% 
% cnf(175968112,plain,(neq(v,nil)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(228239688,plain,(neq(app(nil,v),nil)),inference(paramodulation,[status(thm)],[213019064,175968112,theory(equality)]),[]).
% 
% cnf(175994800,plain,($equal(x,v)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(228252240,plain,($equal(x,app(nil,v))),inference(paramodulation,[status(thm)],[213019064,175994800,theory(equality)]),[]).
% 
% cnf(175954320,plain,(~neq(x,nil)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[228239688,228252240,175954320,theory(equality)]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------