TSTP Solution File: SYN395+1 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : SYN395+1 : TPTP v3.4.2. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : faust %s
% Computer : art01.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 17:52:56 EDT 2009
% Result : Theorem 0.1s
% Output : Refutation 0.1s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 4 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 30 ( 12 ~; 10 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 6 ( 3 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(kalish202,plain,
! [A,C] :
( ( f(y(A))
| ~ f(A) )
& ( ~ g(C)
| ~ f(A) )
& ( g(A)
| ~ f(A) )
& ( f(y(A))
| f(y(A)) )
& ( ~ g(C)
| f(y(A)) )
& ( g(A)
| f(y(A)) )
& ( f(y(A))
| ~ g(C) )
& ( ~ g(C)
| ~ g(C) )
& ( g(A)
| ~ g(C) ) ),
file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN395+1.tptp',unknown),
[] ).
cnf(167346200,plain,
f(y(A)),
inference(rewrite,[status(thm)],[kalish202]),
[] ).
cnf(167350760,plain,
( g(A)
| ~ f(A) ),
inference(rewrite,[status(thm)],[kalish202]),
[] ).
cnf(167336816,plain,
~ g(C),
inference(rewrite,[status(thm)],[kalish202]),
[] ).
cnf(185591448,plain,
~ f(A),
inference(resolution,[status(thm)],[167350760,167336816]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[167346200,185591448]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 0 seconds
% START OF PROOF SEQUENCE
% fof(kalish202,plain,(((f(y(A))|~f(A))&(~g(C)|~f(A))&(g(A)|~f(A))&(f(y(A))|f(y(A)))&(~g(C)|f(y(A)))&(g(A)|f(y(A)))&(f(y(A))|~g(C))&(~g(C)|~g(C))&(g(A)|~g(C)))),file('/home/graph/tptp/TSTP/PreparedTPTP/tptp---none/SYN/SYN395+1.tptp',unknown),[]).
%
% cnf(167346200,plain,(f(y(A))),inference(rewrite,[status(thm)],[kalish202]),[]).
%
% cnf(167350760,plain,(g(A)|~f(A)),inference(rewrite,[status(thm)],[kalish202]),[]).
%
% cnf(167336816,plain,(~g(C)),inference(rewrite,[status(thm)],[kalish202]),[]).
%
% cnf(185591448,plain,(~f(A)),inference(resolution,[status(thm)],[167350760,167336816]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[167346200,185591448]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------