TSTP Solution File: SWC035+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SWC035+1 : TPTP v3.4.2. Released v2.4.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:05:20 EDT 2009
% Result : Theorem 3.0s
% Output : Refutation 3.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 8 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 12 ( 4 ~; 0 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(co1,plain,
( sslist(u)
& sslist(v)
& sslist(w)
& sslist(x)
& $equal(v,nil)
& $equal(x,v)
& $equal(w,u)
& $equal(w,x)
& ~ $equal(u,nil) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC035+1.tptp',unknown),
[] ).
cnf(180337848,plain,
$equal(w,x),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(180325200,plain,
~ $equal(u,nil),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(180369368,plain,
$equal(v,nil),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(246047552,plain,
~ $equal(u,v),
inference(paramodulation,[status(thm)],[180325200,180369368,theory(equality)]),
[] ).
cnf(180355456,plain,
$equal(w,u),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(246086408,plain,
~ $equal(w,v),
inference(paramodulation,[status(thm)],[246047552,180355456,theory(equality)]),
[] ).
cnf(180362592,plain,
$equal(x,v),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(contradiction,plain,
$false,
inference(forward_subsumption_resolution__paramodulation,[status(thm)],[180337848,246086408,180362592,theory(equality)]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 3 seconds
% START OF PROOF SEQUENCE
% fof(co1,plain,((sslist(u)&sslist(v)&sslist(w)&sslist(x)&$equal(v,nil)&$equal(x,v)&$equal(w,u)&$equal(w,x)&~$equal(u,nil))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC035+1.tptp',unknown),[]).
%
% cnf(180337848,plain,($equal(w,x)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(180325200,plain,(~$equal(u,nil)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(180369368,plain,($equal(v,nil)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(246047552,plain,(~$equal(u,v)),inference(paramodulation,[status(thm)],[180325200,180369368,theory(equality)]),[]).
%
% cnf(180355456,plain,($equal(w,u)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(246086408,plain,(~$equal(w,v)),inference(paramodulation,[status(thm)],[246047552,180355456,theory(equality)]),[]).
%
% cnf(180362592,plain,($equal(x,v)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(contradiction,plain,$false,inference(forward_subsumption_resolution__paramodulation,[status(thm)],[180337848,246086408,180362592,theory(equality)]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------