%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR114+6 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 07:24:32 EST 2010
% Result : Theorem 1.37s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 8 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 58 ( 7 avg)
% Number of connectives : 61 ( 4 ~; 0 |; 57 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 58 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 27 usr; 27 con; 0-0 aty)
% Number of variables : 10 ( 2 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(52,axiom,
( attr(c5,c6)
& attr(c5,c7)
& sub(c6,tag_1_1)
& val(c6,c3)
& sub(c7,monat_1_1)
& val(c7,c4)
& sort(c5,t)
& card(c5,int1)
& etype(c5,int0)
& fact(c5,real)
& gener(c5,sp)
& quant(c5,one)
& refer(c5,det)
& varia(c5,con)
& sort(c6,me)
& sort(c6,oa)
& sort(c6,ta)
& card(c6,card_c)
& etype(c6,etype_c)
& fact(c6,real)
& gener(c6,sp)
& quant(c6,quant_c)
& refer(c6,refer_c)
& varia(c6,varia_c)
& sort(c7,me)
& sort(c7,oa)
& sort(c7,ta)
& card(c7,card_c)
& etype(c7,etype_c)
& fact(c7,real)
& gener(c7,sp)
& quant(c7,quant_c)
& refer(c7,refer_c)
& varia(c7,varia_c)
& sort(tag_1_1,me)
& sort(tag_1_1,oa)
& sort(tag_1_1,ta)
& card(tag_1_1,card_c)
& etype(tag_1_1,etype_c)
& fact(tag_1_1,real)
& gener(tag_1_1,ge)
& quant(tag_1_1,quant_c)
& refer(tag_1_1,refer_c)
& varia(tag_1_1,varia_c)
& sort(c3,nu)
& card(c3,int9)
& sort(monat_1_1,me)
& sort(monat_1_1,oa)
& sort(monat_1_1,ta)
& card(monat_1_1,card_c)
& etype(monat_1_1,etype_c)
& fact(monat_1_1,real)
& gener(monat_1_1,ge)
& quant(monat_1_1,quant_c)
& refer(monat_1_1,refer_c)
& varia(monat_1_1,varia_c)
& sort(c4,nu)
& card(c4,int11) ),
file('/tmp/tmpL2XTSO/sel_CSR114+6.p_1',ave07_era5_synth_qa07_004_mira_news_526) ).
fof(53,conjecture,
? [X1,X2] : attr(X1,X2),
file('/tmp/tmpL2XTSO/sel_CSR114+6.p_1',synth_qa07_004_mira_news_526) ).
fof(54,negated_conjecture,
~ ? [X1,X2] : attr(X1,X2),
inference(assume_negation,[status(cth)],[53]) ).
cnf(254,plain,
attr(c5,c6),
inference(split_conjunct,[status(thm)],[52]) ).
fof(255,negated_conjecture,
! [X1,X2] : ~ attr(X1,X2),
inference(fof_nnf,[status(thm)],[54]) ).
fof(256,negated_conjecture,
! [X3,X4] : ~ attr(X3,X4),
inference(variable_rename,[status(thm)],[255]) ).
cnf(257,negated_conjecture,
~ attr(X1,X2),
inference(split_conjunct,[status(thm)],[256]) ).
cnf(258,plain,
$false,
inference(sr,[status(thm)],[254,257,theory(equality)]) ).
cnf(259,plain,
$false,
258,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR114+6.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpL2XTSO/sel_CSR114+6.p_1 with time limit 29
% -prover status Theorem
% Problem CSR114+6.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR114+6.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR114+6.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------