%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR116+30 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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 08:00:02 EST 2010
% Result : Theorem 185.56s
% Output : CNFRefutation 185.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 11 unt; 0 def)
% Number of atoms : 404 ( 0 equ)
% Maximal formula atoms : 106 ( 6 avg)
% Number of connectives : 532 ( 193 ~; 164 |; 168 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 106 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 6 prp; 0-3 aty)
% Number of functors : 47 ( 47 usr; 43 con; 0-3 aty)
% Number of variables : 195 ( 51 sgn 55 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(14,axiom,
! [X1,X2] :
( sub(X1,X2)
=> ? [X3] :
( arg1(X3,X1)
& arg2(X3,X2)
& subr(X3,sub_0) ) ),
file('/tmp/tmpFjY6ol/sel_CSR116+30.p_4',sub__sub_0_expansion) ).
fof(48,axiom,
! [X1,X2,X3] :
( ( arg1(X1,X2)
& arg2(X1,X3)
& subr(X1,sub_0) )
=> ? [X4,X5,X6] :
( arg1(X5,X2)
& arg2(X5,X6)
& hsit(X1,X4)
& mcont(X4,X5)
& obj(X4,X2)
& sub(X6,X3)
& subr(X5,rprs_0)
& subs(X4,bezeichnen_1_1) ) ),
file('/tmp/tmpFjY6ol/sel_CSR116+30.p_4',sub__bezeichnen_1_1_als) ).
fof(80,axiom,
( attr(c11,c12)
& sub(c11,stadt__1_1)
& sub(c12,name_1_1)
& val(c12,maputo_0)
& attr(c18,c19)
& attr(c18,c20)
& sub(c19,tag_1_1)
& val(c19,c16)
& sub(c20,monat_1_1)
& val(c20,c17)
& tupl(c47,c11,c18)
& sort(c11,d)
& sort(c11,io)
& card(c11,int1)
& etype(c11,int0)
& fact(c11,real)
& gener(c11,sp)
& quant(c11,one)
& refer(c11,det)
& varia(c11,con)
& sort(c12,na)
& card(c12,int1)
& etype(c12,int0)
& fact(c12,real)
& gener(c12,sp)
& quant(c12,one)
& refer(c12,indet)
& varia(c12,varia_c)
& sort(stadt__1_1,d)
& sort(stadt__1_1,io)
& card(stadt__1_1,int1)
& etype(stadt__1_1,int0)
& fact(stadt__1_1,real)
& gener(stadt__1_1,ge)
& quant(stadt__1_1,one)
& refer(stadt__1_1,refer_c)
& varia(stadt__1_1,varia_c)
& sort(name_1_1,na)
& card(name_1_1,int1)
& etype(name_1_1,int0)
& fact(name_1_1,real)
& gener(name_1_1,ge)
& quant(name_1_1,one)
& refer(name_1_1,refer_c)
& varia(name_1_1,varia_c)
& sort(maputo_0,fe)
& sort(c18,t)
& card(c18,int1)
& etype(c18,int0)
& fact(c18,real)
& gener(c18,sp)
& quant(c18,one)
& refer(c18,det)
& varia(c18,con)
& sort(c19,me)
& sort(c19,oa)
& sort(c19,ta)
& card(c19,card_c)
& etype(c19,etype_c)
& fact(c19,real)
& gener(c19,sp)
& quant(c19,quant_c)
& refer(c19,refer_c)
& varia(c19,varia_c)
& sort(c20,me)
& sort(c20,oa)
& sort(c20,ta)
& card(c20,card_c)
& etype(c20,etype_c)
& fact(c20,real)
& gener(c20,sp)
& quant(c20,quant_c)
& refer(c20,refer_c)
& varia(c20,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(c16,nu)
& card(c16,int21)
& 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(c17,nu)
& card(c17,int7)
& sort(c47,ent)
& card(c47,card_c)
& etype(c47,etype_c)
& fact(c47,real)
& gener(c47,gener_c)
& quant(c47,quant_c)
& refer(c47,refer_c)
& varia(c47,varia_c) ),
file('/tmp/tmpFjY6ol/sel_CSR116+30.p_4',ave07_era5_synth_qa07_010_mira_news_1834) ).
fof(81,conjecture,
? [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( arg1(X4,X1)
& arg2(X4,X5)
& attr(X1,X2)
& attr(X1,X3)
& attr(X6,X7)
& obj(X8,X1)
& sub(X5,X9)
& sub(X7,name_1_1)
& subr(X4,rprs_0) ),
file('/tmp/tmpFjY6ol/sel_CSR116+30.p_4',synth_qa07_010_mira_news_1834) ).
fof(82,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( arg1(X4,X1)
& arg2(X4,X5)
& attr(X1,X2)
& attr(X1,X3)
& attr(X6,X7)
& obj(X8,X1)
& sub(X5,X9)
& sub(X7,name_1_1)
& subr(X4,rprs_0) ),
inference(assume_negation,[status(cth)],[81]) ).
fof(115,plain,
! [X1,X2] :
( ~ sub(X1,X2)
| ? [X3] :
( arg1(X3,X1)
& arg2(X3,X2)
& subr(X3,sub_0) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(116,plain,
! [X4,X5] :
( ~ sub(X4,X5)
| ? [X6] :
( arg1(X6,X4)
& arg2(X6,X5)
& subr(X6,sub_0) ) ),
inference(variable_rename,[status(thm)],[115]) ).
fof(117,plain,
! [X4,X5] :
( ~ sub(X4,X5)
| ( arg1(esk2_2(X4,X5),X4)
& arg2(esk2_2(X4,X5),X5)
& subr(esk2_2(X4,X5),sub_0) ) ),
inference(skolemize,[status(esa)],[116]) ).
fof(118,plain,
! [X4,X5] :
( ( arg1(esk2_2(X4,X5),X4)
| ~ sub(X4,X5) )
& ( arg2(esk2_2(X4,X5),X5)
| ~ sub(X4,X5) )
& ( subr(esk2_2(X4,X5),sub_0)
| ~ sub(X4,X5) ) ),
inference(distribute,[status(thm)],[117]) ).
cnf(119,plain,
( subr(esk2_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[118]) ).
cnf(120,plain,
( arg2(esk2_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[118]) ).
cnf(121,plain,
( arg1(esk2_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[118]) ).
fof(223,plain,
! [X1,X2,X3] :
( ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0)
| ? [X4,X5,X6] :
( arg1(X5,X2)
& arg2(X5,X6)
& hsit(X1,X4)
& mcont(X4,X5)
& obj(X4,X2)
& sub(X6,X3)
& subr(X5,rprs_0)
& subs(X4,bezeichnen_1_1) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(224,plain,
! [X7,X8,X9] :
( ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0)
| ? [X10,X11,X12] :
( arg1(X11,X8)
& arg2(X11,X12)
& hsit(X7,X10)
& mcont(X10,X11)
& obj(X10,X8)
& sub(X12,X9)
& subr(X11,rprs_0)
& subs(X10,bezeichnen_1_1) ) ),
inference(variable_rename,[status(thm)],[223]) ).
fof(225,plain,
! [X7,X8,X9] :
( ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0)
| ( arg1(esk13_3(X7,X8,X9),X8)
& arg2(esk13_3(X7,X8,X9),esk14_3(X7,X8,X9))
& hsit(X7,esk12_3(X7,X8,X9))
& mcont(esk12_3(X7,X8,X9),esk13_3(X7,X8,X9))
& obj(esk12_3(X7,X8,X9),X8)
& sub(esk14_3(X7,X8,X9),X9)
& subr(esk13_3(X7,X8,X9),rprs_0)
& subs(esk12_3(X7,X8,X9),bezeichnen_1_1) ) ),
inference(skolemize,[status(esa)],[224]) ).
fof(226,plain,
! [X7,X8,X9] :
( ( arg1(esk13_3(X7,X8,X9),X8)
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( arg2(esk13_3(X7,X8,X9),esk14_3(X7,X8,X9))
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( hsit(X7,esk12_3(X7,X8,X9))
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( mcont(esk12_3(X7,X8,X9),esk13_3(X7,X8,X9))
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( obj(esk12_3(X7,X8,X9),X8)
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( sub(esk14_3(X7,X8,X9),X9)
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( subr(esk13_3(X7,X8,X9),rprs_0)
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) )
& ( subs(esk12_3(X7,X8,X9),bezeichnen_1_1)
| ~ arg1(X7,X8)
| ~ arg2(X7,X9)
| ~ subr(X7,sub_0) ) ),
inference(distribute,[status(thm)],[225]) ).
cnf(228,plain,
( subr(esk13_3(X1,X3,X2),rprs_0)
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(229,plain,
( sub(esk14_3(X1,X3,X2),X2)
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(230,plain,
( obj(esk12_3(X1,X3,X2),X3)
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(233,plain,
( arg2(esk13_3(X1,X3,X2),esk14_3(X1,X3,X2))
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(234,plain,
( arg1(esk13_3(X1,X3,X2),X3)
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(split_conjunct,[status(thm)],[226]) ).
cnf(438,plain,
sub(c12,name_1_1),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(439,plain,
sub(c11,stadt__1_1),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(440,plain,
attr(c11,c12),
inference(split_conjunct,[status(thm)],[80]) ).
fof(441,negated_conjecture,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ~ arg1(X4,X1)
| ~ arg2(X4,X5)
| ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ attr(X6,X7)
| ~ obj(X8,X1)
| ~ sub(X5,X9)
| ~ sub(X7,name_1_1)
| ~ subr(X4,rprs_0) ),
inference(fof_nnf,[status(thm)],[82]) ).
fof(442,negated_conjecture,
! [X10,X11,X12,X13,X14,X15,X16,X17,X18] :
( ~ arg1(X13,X10)
| ~ arg2(X13,X14)
| ~ attr(X10,X11)
| ~ attr(X10,X12)
| ~ attr(X15,X16)
| ~ obj(X17,X10)
| ~ sub(X14,X18)
| ~ sub(X16,name_1_1)
| ~ subr(X13,rprs_0) ),
inference(variable_rename,[status(thm)],[441]) ).
cnf(443,negated_conjecture,
( ~ subr(X1,rprs_0)
| ~ sub(X2,name_1_1)
| ~ sub(X3,X4)
| ~ obj(X5,X6)
| ~ attr(X7,X2)
| ~ attr(X6,X8)
| ~ attr(X6,X9)
| ~ arg2(X1,X3)
| ~ arg1(X1,X6) ),
inference(split_conjunct,[status(thm)],[442]) ).
fof(575,plain,
( ~ epred1_0
<=> ! [X2,X7] :
( ~ sub(X2,name_1_1)
| ~ attr(X7,X2) ) ),
introduced(definition),
[split] ).
cnf(576,plain,
( epred1_0
| ~ sub(X2,name_1_1)
| ~ attr(X7,X2) ),
inference(split_equiv,[status(thm)],[575]) ).
fof(577,plain,
( ~ epred2_0
<=> ! [X5,X1,X3,X9,X4,X8,X6] :
( ~ obj(X5,X6)
| ~ sub(X3,X4)
| ~ arg1(X1,X6)
| ~ arg2(X1,X3)
| ~ subr(X1,rprs_0)
| ~ attr(X6,X8)
| ~ attr(X6,X9) ) ),
introduced(definition),
[split] ).
cnf(578,plain,
( epred2_0
| ~ obj(X5,X6)
| ~ sub(X3,X4)
| ~ arg1(X1,X6)
| ~ arg2(X1,X3)
| ~ subr(X1,rprs_0)
| ~ attr(X6,X8)
| ~ attr(X6,X9) ),
inference(split_equiv,[status(thm)],[577]) ).
cnf(579,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[443,575,theory(equality)]),577,theory(equality)]),
[split] ).
cnf(598,plain,
( epred1_0
| ~ sub(c12,name_1_1) ),
inference(spm,[status(thm)],[576,440,theory(equality)]) ).
cnf(603,plain,
( epred1_0
| $false ),
inference(rw,[status(thm)],[598,438,theory(equality)]) ).
cnf(604,plain,
epred1_0,
inference(cn,[status(thm)],[603,theory(equality)]) ).
cnf(606,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[579,604,theory(equality)]) ).
cnf(607,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[606,theory(equality)]) ).
cnf(608,negated_conjecture,
( ~ obj(X5,X6)
| ~ sub(X3,X4)
| ~ arg1(X1,X6)
| ~ arg2(X1,X3)
| ~ subr(X1,rprs_0)
| ~ attr(X6,X8)
| ~ attr(X6,X9) ),
inference(sr,[status(thm)],[578,607,theory(equality)]) ).
cnf(609,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ arg2(esk13_3(X4,X5,X6),X7)
| ~ arg1(esk13_3(X4,X5,X6),X1)
| ~ sub(X7,X8)
| ~ obj(X9,X1)
| ~ subr(X4,sub_0)
| ~ arg2(X4,X6)
| ~ arg1(X4,X5) ),
inference(spm,[status(thm)],[608,228,theory(equality)]) ).
cnf(611,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ subr(X4,sub_0)
| ~ arg2(X4,X6)
| ~ arg1(esk13_3(X4,X5,X6),X1)
| ~ arg1(X4,X5)
| ~ sub(esk14_3(X4,X5,X6),X7)
| ~ obj(X8,X1) ),
inference(spm,[status(thm)],[609,233,theory(equality)]) ).
cnf(612,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ subr(X4,sub_0)
| ~ arg2(X4,X5)
| ~ arg1(X4,X1)
| ~ sub(esk14_3(X4,X1,X5),X6)
| ~ obj(X7,X1) ),
inference(spm,[status(thm)],[611,234,theory(equality)]) ).
cnf(613,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ subr(X4,sub_0)
| ~ arg2(X4,X5)
| ~ arg1(X4,X1)
| ~ obj(X6,X1) ),
inference(spm,[status(thm)],[612,229,theory(equality)]) ).
cnf(614,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ arg2(esk2_2(X4,X5),X6)
| ~ arg1(esk2_2(X4,X5),X1)
| ~ obj(X7,X1)
| ~ sub(X4,X5) ),
inference(spm,[status(thm)],[613,119,theory(equality)]) ).
cnf(615,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ arg1(esk2_2(X4,X5),X1)
| ~ sub(X4,X5)
| ~ obj(X6,X1) ),
inference(spm,[status(thm)],[614,120,theory(equality)]) ).
cnf(616,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X1,X3)
| ~ sub(X1,X4)
| ~ obj(X5,X1) ),
inference(spm,[status(thm)],[615,121,theory(equality)]) ).
cnf(617,plain,
( ~ attr(c11,X1)
| ~ sub(c11,X2)
| ~ obj(X3,c11) ),
inference(spm,[status(thm)],[616,440,theory(equality)]) ).
fof(622,plain,
( ~ epred3_0
<=> ! [X1] : ~ attr(c11,X1) ),
introduced(definition),
[split] ).
cnf(623,plain,
( epred3_0
| ~ attr(c11,X1) ),
inference(split_equiv,[status(thm)],[622]) ).
fof(624,plain,
( ~ epred4_0
<=> ! [X2] : ~ sub(c11,X2) ),
introduced(definition),
[split] ).
cnf(625,plain,
( epred4_0
| ~ sub(c11,X2) ),
inference(split_equiv,[status(thm)],[624]) ).
fof(626,plain,
( ~ epred5_0
<=> ! [X3] : ~ obj(X3,c11) ),
introduced(definition),
[split] ).
cnf(627,plain,
( epred5_0
| ~ obj(X3,c11) ),
inference(split_equiv,[status(thm)],[626]) ).
cnf(628,plain,
( ~ epred5_0
| ~ epred4_0
| ~ epred3_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[617,622,theory(equality)]),624,theory(equality)]),626,theory(equality)]),
[split] ).
cnf(630,plain,
epred3_0,
inference(spm,[status(thm)],[623,440,theory(equality)]) ).
cnf(632,plain,
epred4_0,
inference(spm,[status(thm)],[625,439,theory(equality)]) ).
cnf(635,plain,
( epred5_0
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c11) ),
inference(spm,[status(thm)],[627,230,theory(equality)]) ).
cnf(637,plain,
( ~ epred5_0
| $false
| ~ epred3_0 ),
inference(rw,[status(thm)],[628,632,theory(equality)]) ).
cnf(638,plain,
( ~ epred5_0
| $false
| $false ),
inference(rw,[status(thm)],[637,630,theory(equality)]) ).
cnf(639,plain,
~ epred5_0,
inference(cn,[status(thm)],[638,theory(equality)]) ).
cnf(640,plain,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,c11) ),
inference(sr,[status(thm)],[635,639,theory(equality)]) ).
cnf(641,plain,
( ~ arg2(esk2_2(X1,X2),X3)
| ~ arg1(esk2_2(X1,X2),c11)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[640,119,theory(equality)]) ).
cnf(701,plain,
( ~ arg1(esk2_2(X1,X2),c11)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[641,120,theory(equality)]) ).
cnf(707,plain,
~ sub(c11,X1),
inference(spm,[status(thm)],[701,121,theory(equality)]) ).
cnf(710,plain,
$false,
inference(sr,[status(thm)],[439,707,theory(equality)]) ).
cnf(711,plain,
$false,
710,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR116+30.p
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFjY6ol/sel_CSR116+30.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpFjY6ol/sel_CSR116+30.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpFjY6ol/sel_CSR116+30.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpFjY6ol/sel_CSR116+30.p_4 with time limit 56
% -prover status Theorem
% Problem CSR116+30.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR116+30.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR116+30.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
%
%------------------------------------------------------------------------------