TSTP Solution File: SYN033-1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN033-1 : TPTP v3.4.2. Released v1.0.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:38:10 EDT 2009
% Result : Unsatisfiable 0.0s
% Output : Refutation 0.0s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-2 aty)
% Number of variables : 29 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(clause3,plain,
! [A,B,C,D,E,F] :
( ~ p(A,B,C)
| ~ p(D,E,B)
| ~ p(A,D,F)
| p(F,E,C) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),
[] ).
cnf(164165384,plain,
( ~ p(A,B,C)
| ~ p(D,E,B)
| ~ p(A,D,F)
| p(F,E,C) ),
inference(rewrite,[status(thm)],[clause3]),
[] ).
fof(clause2,plain,
! [A,B] : p(A,h(A,B),B),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),
[] ).
cnf(164155584,plain,
p(A,h(A,B),B),
inference(rewrite,[status(thm)],[clause2]),
[] ).
cnf(172050272,plain,
( ~ p(A,B,C)
| ~ p(A,D,E)
| p(E,h(D,B),C) ),
inference(resolution,[status(thm)],[164165384,164155584]),
[] ).
fof(clause1,plain,
! [A,B] : p(g(A,B),A,B),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),
[] ).
cnf(164151656,plain,
p(g(A,B),A,B),
inference(rewrite,[status(thm)],[clause1]),
[] ).
cnf(172161848,plain,
p(B,h(A,A),B),
inference(resolution,[status(thm)],[172050272,164151656]),
[] ).
fof(prove_something,plain,
! [A] : ~ p(k(A),A,k(A)),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),
[] ).
cnf(164169144,plain,
~ p(k(A),A,k(A)),
inference(rewrite,[status(thm)],[prove_something]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[172161848,164169144]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(clause3,plain,(~p(A,B,C)|~p(D,E,B)|~p(A,D,F)|p(F,E,C)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),[]).
%
% cnf(164165384,plain,(~p(A,B,C)|~p(D,E,B)|~p(A,D,F)|p(F,E,C)),inference(rewrite,[status(thm)],[clause3]),[]).
%
% fof(clause2,plain,(p(A,h(A,B),B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),[]).
%
% cnf(164155584,plain,(p(A,h(A,B),B)),inference(rewrite,[status(thm)],[clause2]),[]).
%
% cnf(172050272,plain,(~p(A,B,C)|~p(A,D,E)|p(E,h(D,B),C)),inference(resolution,[status(thm)],[164165384,164155584]),[]).
%
% fof(clause1,plain,(p(g(A,B),A,B)),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),[]).
%
% cnf(164151656,plain,(p(g(A,B),A,B)),inference(rewrite,[status(thm)],[clause1]),[]).
%
% cnf(172161848,plain,(p(B,h(A,A),B)),inference(resolution,[status(thm)],[172050272,164151656]),[]).
%
% fof(prove_something,plain,(~p(k(A),A,k(A))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN033-1.tptp',unknown),[]).
%
% cnf(164169144,plain,(~p(k(A),A,k(A))),inference(rewrite,[status(thm)],[prove_something]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[172161848,164169144]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------