TSTP Solution File: COL058-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : COL058-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art10.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% DateTime : Wed May 6 11:32:56 EDT 2009
% Result : Unsatisfiable 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(prove_the_bird_exists,plain,
! [A] : ~ $equal(response(A,A),A),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL058-1.tptp',unknown),
[] ).
cnf(145524608,plain,
~ $equal(response(A,A),A),
inference(rewrite,[status(thm)],[prove_the_bird_exists]),
[] ).
fof(lark_exists,plain,
! [A,B] : $equal(response(response(lark,A),B),response(A,response(B,B))),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL058-1.tptp',unknown),
[] ).
cnf(145519856,plain,
$equal(response(response(lark,A),B),response(A,response(B,B))),
inference(rewrite,[status(thm)],[lark_exists]),
[] ).
cnf(153321248,plain,
~ $equal(response(response(lark,response(A,A)),A),response(A,A)),
inference(paramodulation,[status(thm)],[145524608,145519856,theory(equality)]),
[] ).
cnf(153451024,plain,
~ $equal(response(response(response(lark,lark),A),A),response(A,A)),
inference(paramodulation,[status(thm)],[153321248,145519856,theory(equality)]),
[] ).
cnf(153872016,plain,
~ $equal(response(response(response(lark,response(lark,lark)),A),response(A,A)),response(response(A,A),response(A,A))),
inference(paramodulation,[status(thm)],[153451024,145519856,theory(equality)]),
[] ).
cnf(contradiction,plain,
$false,
inference(equality_resolution,[status(thm)],[153872016]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(prove_the_bird_exists,plain,(~$equal(response(A,A),A)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL058-1.tptp',unknown),[]).
%
% cnf(145524608,plain,(~$equal(response(A,A),A)),inference(rewrite,[status(thm)],[prove_the_bird_exists]),[]).
%
% fof(lark_exists,plain,($equal(response(response(lark,A),B),response(A,response(B,B)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/COL/COL058-1.tptp',unknown),[]).
%
% cnf(145519856,plain,($equal(response(response(lark,A),B),response(A,response(B,B)))),inference(rewrite,[status(thm)],[lark_exists]),[]).
%
% cnf(153321248,plain,(~$equal(response(response(lark,response(A,A)),A),response(A,A))),inference(paramodulation,[status(thm)],[145524608,145519856,theory(equality)]),[]).
%
% cnf(153451024,plain,(~$equal(response(response(response(lark,lark),A),A),response(A,A))),inference(paramodulation,[status(thm)],[153321248,145519856,theory(equality)]),[]).
%
% cnf(153872016,plain,(~$equal(response(response(response(lark,response(lark,lark)),A),response(A,A)),response(response(A,A),response(A,A)))),inference(paramodulation,[status(thm)],[153451024,145519856,theory(equality)]),[]).
%
% cnf(contradiction,plain,$false,inference(equality_resolution,[status(thm)],[153872016]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------