TSTP Solution File: SWC367+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SWC367+1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art03.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:17:24 EDT 2009
% Result : Theorem 0.9s
% Output : Refutation 0.9s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 177 ( 0 equ)
% Maximal formula atoms : 162 ( 13 avg)
% Number of connectives : 187 ( 23 ~; 84 |; 80 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 82 ( 8 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 : 2 ( 0 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(co1,plain,
( ( sslist(u)
| neq(w,nil) )
& ( $equal(x,nil)
| neq(w,nil) )
& ( $equal(w,nil)
| neq(w,nil) )
& ( ~ rearsegp(v,u)
| neq(w,nil) )
& ( $equal(w,u)
| neq(w,nil) )
& ( $equal(x,v)
| neq(w,nil) )
& ( sslist(x)
| neq(w,nil) )
& ( sslist(w)
| neq(w,nil) )
& ( sslist(v)
| neq(w,nil) )
& ( sslist(u)
| rearsegp(x,w) )
& ( $equal(x,nil)
| rearsegp(x,w) )
& ( $equal(w,nil)
| rearsegp(x,w) )
& ( ~ rearsegp(v,u)
| rearsegp(x,w) )
& ( $equal(w,u)
| rearsegp(x,w) )
& ( $equal(x,v)
| rearsegp(x,w) )
& ( sslist(x)
| rearsegp(x,w) )
& ( sslist(w)
| rearsegp(x,w) )
& ( sslist(v)
| rearsegp(x,w) )
& ( sslist(u)
| ~ rearsegp(v,u) )
& ( $equal(x,nil)
| ~ rearsegp(v,u) )
& ( $equal(w,nil)
| ~ rearsegp(v,u) )
& ( ~ rearsegp(v,u)
| ~ rearsegp(v,u) )
& ( $equal(w,u)
| ~ rearsegp(v,u) )
& ( $equal(x,v)
| ~ rearsegp(v,u) )
& ( sslist(x)
| ~ rearsegp(v,u) )
& ( sslist(w)
| ~ rearsegp(v,u) )
& ( sslist(v)
| ~ rearsegp(v,u) )
& ( sslist(u)
| $equal(w,u) )
& ( $equal(x,nil)
| $equal(w,u) )
& ( $equal(w,nil)
| $equal(w,u) )
& ( ~ rearsegp(v,u)
| $equal(w,u) )
& ( $equal(w,u)
| $equal(w,u) )
& ( $equal(x,v)
| $equal(w,u) )
& ( sslist(x)
| $equal(w,u) )
& ( sslist(w)
| $equal(w,u) )
& ( sslist(v)
| $equal(w,u) )
& ( sslist(u)
| $equal(x,v) )
& ( $equal(x,nil)
| $equal(x,v) )
& ( $equal(w,nil)
| $equal(x,v) )
& ( ~ rearsegp(v,u)
| $equal(x,v) )
& ( $equal(w,u)
| $equal(x,v) )
& ( $equal(x,v)
| $equal(x,v) )
& ( sslist(x)
| $equal(x,v) )
& ( sslist(w)
| $equal(x,v) )
& ( sslist(v)
| $equal(x,v) )
& ( sslist(u)
| sslist(x) )
& ( $equal(x,nil)
| sslist(x) )
& ( $equal(w,nil)
| sslist(x) )
& ( ~ rearsegp(v,u)
| sslist(x) )
& ( $equal(w,u)
| sslist(x) )
& ( $equal(x,v)
| sslist(x) )
& ( sslist(x)
| sslist(x) )
& ( sslist(w)
| sslist(x) )
& ( sslist(v)
| sslist(x) )
& ( sslist(u)
| sslist(w) )
& ( $equal(x,nil)
| sslist(w) )
& ( $equal(w,nil)
| sslist(w) )
& ( ~ rearsegp(v,u)
| sslist(w) )
& ( $equal(w,u)
| sslist(w) )
& ( $equal(x,v)
| sslist(w) )
& ( sslist(x)
| sslist(w) )
& ( sslist(w)
| sslist(w) )
& ( sslist(v)
| sslist(w) )
& ( sslist(u)
| sslist(v) )
& ( $equal(x,nil)
| sslist(v) )
& ( $equal(w,nil)
| sslist(v) )
& ( ~ rearsegp(v,u)
| sslist(v) )
& ( $equal(w,u)
| sslist(v) )
& ( $equal(x,v)
| sslist(v) )
& ( sslist(x)
| sslist(v) )
& ( sslist(w)
| sslist(v) )
& ( sslist(v)
| sslist(v) )
& ( sslist(u)
| sslist(u) )
& ( $equal(x,nil)
| sslist(u) )
& ( $equal(w,nil)
| sslist(u) )
& ( ~ rearsegp(v,u)
| sslist(u) )
& ( $equal(w,u)
| sslist(u) )
& ( $equal(x,v)
| sslist(u) )
& ( sslist(x)
| sslist(u) )
& ( sslist(w)
| sslist(u) )
& ( sslist(v)
| sslist(u) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC367+1.tptp',unknown),
[] ).
cnf(170383472,plain,
sslist(x),
inference(rewrite,[status(thm)],[co1]),
[] ).
fof(ax51,plain,
! [A] :
( ~ sslist(A)
| rearsegp(A,nil) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC367+1.tptp',unknown),
[] ).
cnf(167015912,plain,
( ~ sslist(A)
| rearsegp(A,nil) ),
inference(rewrite,[status(thm)],[ax51]),
[] ).
cnf(239852144,plain,
rearsegp(x,nil),
inference(resolution,[status(thm)],[170383472,167015912]),
[] ).
cnf(170413120,plain,
( $equal(w,nil)
| rearsegp(x,w) ),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(242049792,plain,
rearsegp(x,w),
inference(paramodulation,[status(thm)],[239852144,170413120,theory(equality)]),
[] ).
cnf(170401696,plain,
~ rearsegp(v,u),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(170387264,plain,
$equal(x,v),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(241600944,plain,
~ rearsegp(x,u),
inference(paramodulation,[status(thm)],[170401696,170387264,theory(equality)]),
[] ).
cnf(170397872,plain,
$equal(w,u),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(241626096,plain,
~ rearsegp(x,w),
inference(paramodulation,[status(thm)],[241600944,170397872,theory(equality)]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[242049792,241626096]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(co1,plain,(((sslist(u)|neq(w,nil))&($equal(x,nil)|neq(w,nil))&($equal(w,nil)|neq(w,nil))&(~rearsegp(v,u)|neq(w,nil))&($equal(w,u)|neq(w,nil))&($equal(x,v)|neq(w,nil))&(sslist(x)|neq(w,nil))&(sslist(w)|neq(w,nil))&(sslist(v)|neq(w,nil))&(sslist(u)|rearsegp(x,w))&($equal(x,nil)|rearsegp(x,w))&($equal(w,nil)|rearsegp(x,w))&(~rearsegp(v,u)|rearsegp(x,w))&($equal(w,u)|rearsegp(x,w))&($equal(x,v)|rearsegp(x,w))&(sslist(x)|rearsegp(x,w))&(sslist(w)|rearsegp(x,w))&(sslist(v)|rearsegp(x,w))&(sslist(u)|~rearsegp(v,u))&($equal(x,nil)|~rearsegp(v,u))&($equal(w,nil)|~rearsegp(v,u))&(~rearsegp(v,u)|~rearsegp(v,u))&($equal(w,u)|~rearsegp(v,u))&($equal(x,v)|~rearsegp(v,u))&(sslist(x)|~rearsegp(v,u))&(sslist(w)|~rearsegp(v,u))&(sslist(v)|~rearsegp(v,u))&(sslist(u)|$equal(w,u))&($equal(x,nil)|$equal(w,u))&($equal(w,nil)|$equal(w,u))&(~rearsegp(v,u)|$equal(w,u))&($equal(w,u)|$equal(w,u))&($equal(x,v)|$equal(w,u))&(sslist(x)|$equal(w,u))&(sslist(w)|$equal(w,u))&(sslist(v)|$equal(w,u))&(sslist(u)|$equal(x,v))&($equal(x,nil)|$equal(x,v))&($equal(w,nil)|$equal(x,v))&(~rearsegp(v,u)|$equal(x,v))&($equal(w,u)|$equal(x,v))&($equal(x,v)|$equal(x,v))&(sslist(x)|$equal(x,v))&(sslist(w)|$equal(x,v))&(sslist(v)|$equal(x,v))&(sslist(u)|sslist(x))&($equal(x,nil)|sslist(x))&($equal(w,nil)|sslist(x))&(~rearsegp(v,u)|sslist(x))&($equal(w,u)|sslist(x))&($equal(x,v)|sslist(x))&(sslist(x)|sslist(x))&(sslist(w)|sslist(x))&(sslist(v)|sslist(x))&(sslist(u)|sslist(w))&($equal(x,nil)|sslist(w))&($equal(w,nil)|sslist(w))&(~rearsegp(v,u)|sslist(w))&($equal(w,u)|sslist(w))&($equal(x,v)|sslist(w))&(sslist(x)|sslist(w))&(sslist(w)|sslist(w))&(sslist(v)|sslist(w))&(sslist(u)|sslist(v))&($equal(x,nil)|sslist(v))&($equal(w,nil)|sslist(v))&(~rearsegp(v,u)|sslist(v))&($equal(w,u)|sslist(v))&($equal(x,v)|sslist(v))&(sslist(x)|sslist(v))&(sslist(w)|sslist(v))&(sslist(v)|sslist(v))&(sslist(u)|sslist(u))&($equal(x,nil)|sslist(u))&($equal(w,nil)|sslist(u))&(~rearsegp(v,u)|sslist(u))&($equal(w,u)|sslist(u))&($equal(x,v)|sslist(u))&(sslist(x)|sslist(u))&(sslist(w)|sslist(u))&(sslist(v)|sslist(u)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC367+1.tptp',unknown),[]).
%
% cnf(170383472,plain,(sslist(x)),inference(rewrite,[status(thm)],[co1]),[]).
%
% fof(ax51,plain,(~sslist(A)|rearsegp(A,nil)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC367+1.tptp',unknown),[]).
%
% cnf(167015912,plain,(~sslist(A)|rearsegp(A,nil)),inference(rewrite,[status(thm)],[ax51]),[]).
%
% cnf(239852144,plain,(rearsegp(x,nil)),inference(resolution,[status(thm)],[170383472,167015912]),[]).
%
% cnf(170413120,plain,($equal(w,nil)|rearsegp(x,w)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(242049792,plain,(rearsegp(x,w)),inference(paramodulation,[status(thm)],[239852144,170413120,theory(equality)]),[]).
%
% cnf(170401696,plain,(~rearsegp(v,u)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(170387264,plain,($equal(x,v)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(241600944,plain,(~rearsegp(x,u)),inference(paramodulation,[status(thm)],[170401696,170387264,theory(equality)]),[]).
%
% cnf(170397872,plain,($equal(w,u)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(241626096,plain,(~rearsegp(x,w)),inference(paramodulation,[status(thm)],[241600944,170397872,theory(equality)]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[242049792,241626096]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------