%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SWC151+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:11:03 EDT 2009
% Result : Theorem 7.2s
% Output : Refutation 7.2s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 11 unt; 0 def)
% Number of atoms : 23 ( 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)
& totalorderp(v)
& ~ totalorderp(x) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC151+1.tptp',unknown),
[] ).
cnf(171230392,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/SWC151+1.tptp',unknown),
[] ).
cnf(169889784,plain,
( ~ sslist(A)
| $equal(app(nil,A),A) ),
inference(rewrite,[status(thm)],[ax28]),
[] ).
cnf(227481440,plain,
$equal(app(nil,v),v),
inference(resolution,[status(thm)],[171230392,169889784]),
[] ).
cnf(171181608,plain,
totalorderp(v),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(286488472,plain,
totalorderp(app(nil,v)),
inference(paramodulation,[status(thm)],[227481440,171181608,theory(equality)]),
[] ).
cnf(171203568,plain,
$equal(x,v),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(285905160,plain,
totalorderp(app(nil,x)),
inference(paramodulation,[status(thm)],[286488472,171203568,theory(equality)]),
[] ).
cnf(171204192,plain,
sslist(x),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(227466384,plain,
$equal(app(nil,x),x),
inference(resolution,[status(thm)],[171204192,169889784]),
[] ).
cnf(300083856,plain,
totalorderp(x),
inference(paramodulation,[status(thm)],[285905160,227466384,theory(equality)]),
[] ).
cnf(171168712,plain,
~ totalorderp(x),
inference(rewrite,[status(thm)],[co1]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[300083856,171168712]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 8 seconds
% START OF PROOF SEQUENCE
% fof(co1,plain,((sslist(u)&sslist(v)&sslist(w)&sslist(x)&$equal(x,v)&$equal(w,u)&totalorderp(v)&~totalorderp(x))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SWC/SWC151+1.tptp',unknown),[]).
%
% cnf(171230392,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/SWC151+1.tptp',unknown),[]).
%
% cnf(169889784,plain,(~sslist(A)|$equal(app(nil,A),A)),inference(rewrite,[status(thm)],[ax28]),[]).
%
% cnf(227481440,plain,($equal(app(nil,v),v)),inference(resolution,[status(thm)],[171230392,169889784]),[]).
%
% cnf(171181608,plain,(totalorderp(v)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(286488472,plain,(totalorderp(app(nil,v))),inference(paramodulation,[status(thm)],[227481440,171181608,theory(equality)]),[]).
%
% cnf(171203568,plain,($equal(x,v)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(285905160,plain,(totalorderp(app(nil,x))),inference(paramodulation,[status(thm)],[286488472,171203568,theory(equality)]),[]).
%
% cnf(171204192,plain,(sslist(x)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(227466384,plain,($equal(app(nil,x),x)),inference(resolution,[status(thm)],[171204192,169889784]),[]).
%
% cnf(300083856,plain,(totalorderp(x)),inference(paramodulation,[status(thm)],[285905160,227466384,theory(equality)]),[]).
%
% cnf(171168712,plain,(~totalorderp(x)),inference(rewrite,[status(thm)],[co1]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[300083856,171168712]),[]).
%
% END OF PROOF SEQUENCE
% faust: ../JJParser/Signature.c:39: void FreeSignatureList(SymbolNodeType**): Assertion `(*Symbols)->NumberOfUses == 0' failed.
%
%------------------------------------------------------------------------------