TSTP Solution File: CSR051+2 by Faust---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Faust---1.0
% Problem : CSR051+2 : TPTP v3.4.2. Released v3.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 11:42:35 EDT 2009
% Result : Theorem 1.4s
% Output : Refutation 1.4s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 2 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 1 sgn 1 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Faust---1.0 format not known, defaulting to TPTP
fof(query101,plain,
! [A] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(A) ),
file('/tmp/SystemOnTPTP20986/CSR051+2.p',unknown),
[] ).
cnf(213711616,plain,
~ marriagelicensedocument(A),
inference(rewrite,[status(thm)],[query101]),
[] ).
cnf(213783992,plain,
mtvisible(c_tptp_member3356_mt),
inference(rewrite,[status(thm)],[query101]),
[] ).
fof(ax1_51,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/tmp/SystemOnTPTP20986/CSR051+2.p',unknown),
[] ).
cnf(164333408,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(rewrite,[status(thm)],[ax1_51]),
[] ).
cnf(231363224,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(resolution,[status(thm)],[213783992,164333408]),
[] ).
cnf(contradiction,plain,
$false,
inference(resolution,[status(thm)],[213711616,231363224]),
[] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Proof found in: 1 seconds
% START OF PROOF SEQUENCE
% fof(query101,plain,((mtvisible(c_tptp_member3356_mt)&~marriagelicensedocument(A))),file('/tmp/SystemOnTPTP20986/CSR051+2.p',unknown),[]).
%
% cnf(213711616,plain,(~marriagelicensedocument(A)),inference(rewrite,[status(thm)],[query101]),[]).
%
% cnf(213783992,plain,(mtvisible(c_tptp_member3356_mt)),inference(rewrite,[status(thm)],[query101]),[]).
%
% fof(ax1_51,plain,(~mtvisible(c_tptp_member3356_mt)|marriagelicensedocument(c_tptpmarriagelicensedocument)),file('/tmp/SystemOnTPTP20986/CSR051+2.p',unknown),[]).
%
% cnf(164333408,plain,(~mtvisible(c_tptp_member3356_mt)|marriagelicensedocument(c_tptpmarriagelicensedocument)),inference(rewrite,[status(thm)],[ax1_51]),[]).
%
% cnf(231363224,plain,(marriagelicensedocument(c_tptpmarriagelicensedocument)),inference(resolution,[status(thm)],[213783992,164333408]),[]).
%
% cnf(contradiction,plain,$false,inference(resolution,[status(thm)],[213711616,231363224]),[]).
%
% END OF PROOF SEQUENCE
%
%------------------------------------------------------------------------------