TSTP Solution File: SWC349+1 by Faust---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Faust---1.0
% Problem  : SWC349+1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : faust %s

% Computer : art06.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:16:11 EDT 2009

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(ax42,plain,
    ! [A] :
      ( ~ sslist(A)
      | frontsegp(A,A) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),
    [] ).

cnf(160674320,plain,
    ( ~ sslist(A)
    | frontsegp(A,A) ),
    inference(rewrite,[status(thm)],[ax42]),
    [] ).

fof(ax17,plain,
    sslist(nil),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),
    [] ).

cnf(160151904,plain,
    sslist(nil),
    inference(rewrite,[status(thm)],[ax17]),
    [] ).

cnf(196773552,plain,
    frontsegp(nil,nil),
    inference(resolution,[status(thm)],[160674320,160151904]),
    [] ).

fof(ax45,plain,
    ! [A] :
      ( ~ sslist(A)
      | frontsegp(A,nil) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),
    [] ).

cnf(160758784,plain,
    ( ~ sslist(A)
    | frontsegp(A,nil) ),
    inference(rewrite,[status(thm)],[ax45]),
    [] ).

fof(ax40,plain,
    ! [A,B,C] :
      ( ~ sslist(A)
      | ~ sslist(B)
      | ~ sslist(C)
      | ~ frontsegp(A,B)
      | ~ frontsegp(B,C)
      | frontsegp(A,C) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),
    [] ).

cnf(160648136,plain,
    ( ~ sslist(A)
    | ~ sslist(B)
    | ~ sslist(C)
    | ~ frontsegp(A,B)
    | ~ frontsegp(B,C)
    | frontsegp(A,C) ),
    inference(rewrite,[status(thm)],[ax40]),
    [] ).

cnf(197942536,plain,
    ( ~ sslist(A)
    | ~ sslist(B)
    | ~ frontsegp(nil,B)
    | frontsegp(A,B) ),
    inference(forward_subsumption_resolution__resolution,[status(thm)],[160758784,160648136,160151904]),
    [] ).

fof(co1,plain,
    ( sslist(u)
    & sslist(v)
    & sslist(w)
    & sslist(x)
    & $equal(w,nil)
    & $equal(x,v)
    & $equal(w,u)
    & neq(v,nil)
    & ~ frontsegp(v,u) ),
    file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),
    [] ).

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

cnf(201131032,plain,
    ( ~ sslist(A)
    | ~ frontsegp(nil,A)
    | frontsegp(v,A) ),
    inference(resolution,[status(thm)],[197942536,161735992]),
    [] ).

cnf(201149880,plain,
    frontsegp(v,nil),
    inference(forward_subsumption_resolution__resolution,[status(thm)],[196773552,201131032,160151904]),
    [] ).

cnf(161707456,plain,
    $equal(w,nil),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(214985272,plain,
    frontsegp(v,w),
    inference(paramodulation,[status(thm)],[201149880,161707456,theory(equality)]),
    [] ).

cnf(161659632,plain,
    ~ frontsegp(v,u),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(161686824,plain,
    $equal(w,u),
    inference(rewrite,[status(thm)],[co1]),
    [] ).

cnf(214777712,plain,
    ~ frontsegp(v,w),
    inference(paramodulation,[status(thm)],[161659632,161686824,theory(equality)]),
    [] ).

cnf(contradiction,plain,
    $false,
    inference(resolution,[status(thm)],[214985272,214777712]),
    [] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 2 seconds
% START OF PROOF SEQUENCE
% fof(ax42,plain,(~sslist(A)|frontsegp(A,A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),[]).
% 
% cnf(160674320,plain,(~sslist(A)|frontsegp(A,A)),inference(rewrite,[status(thm)],[ax42]),[]).
% 
% fof(ax17,plain,(sslist(nil)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),[]).
% 
% cnf(160151904,plain,(sslist(nil)),inference(rewrite,[status(thm)],[ax17]),[]).
% 
% cnf(196773552,plain,(frontsegp(nil,nil)),inference(resolution,[status(thm)],[160674320,160151904]),[]).
% 
% fof(ax45,plain,(~sslist(A)|frontsegp(A,nil)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),[]).
% 
% cnf(160758784,plain,(~sslist(A)|frontsegp(A,nil)),inference(rewrite,[status(thm)],[ax45]),[]).
% 
% fof(ax40,plain,(~sslist(A)|~sslist(B)|~sslist(C)|~frontsegp(A,B)|~frontsegp(B,C)|frontsegp(A,C)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),[]).
% 
% cnf(160648136,plain,(~sslist(A)|~sslist(B)|~sslist(C)|~frontsegp(A,B)|~frontsegp(B,C)|frontsegp(A,C)),inference(rewrite,[status(thm)],[ax40]),[]).
% 
% cnf(197942536,plain,(~sslist(A)|~sslist(B)|~frontsegp(nil,B)|frontsegp(A,B)),inference(forward_subsumption_resolution__resolution,[status(thm)],[160758784,160648136,160151904]),[]).
% 
% fof(co1,plain,((sslist(u)&sslist(v)&sslist(w)&sslist(x)&$equal(w,nil)&$equal(x,v)&$equal(w,u)&neq(v,nil)&~frontsegp(v,u))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC349+1.tptp',unknown),[]).
% 
% cnf(161735992,plain,(sslist(v)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(201131032,plain,(~sslist(A)|~frontsegp(nil,A)|frontsegp(v,A)),inference(resolution,[status(thm)],[197942536,161735992]),[]).
% 
% cnf(201149880,plain,(frontsegp(v,nil)),inference(forward_subsumption_resolution__resolution,[status(thm)],[196773552,201131032,160151904]),[]).
% 
% cnf(161707456,plain,($equal(w,nil)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(214985272,plain,(frontsegp(v,w)),inference(paramodulation,[status(thm)],[201149880,161707456,theory(equality)]),[]).
% 
% cnf(161659632,plain,(~frontsegp(v,u)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(161686824,plain,($equal(w,u)),inference(rewrite,[status(thm)],[co1]),[]).
% 
% cnf(214777712,plain,(~frontsegp(v,w)),inference(paramodulation,[status(thm)],[161659632,161686824,theory(equality)]),[]).
% 
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[214985272,214777712]),[]).
% 
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
% 
%------------------------------------------------------------------------------