TSTP Solution File: CSR115+28 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR115+28 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:34:16 EST 2010
% Result : Theorem 186.48s
% Output : CNFRefutation 186.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 8 unt; 0 def)
% Number of atoms : 282 ( 0 equ)
% Maximal formula atoms : 106 ( 6 avg)
% Number of connectives : 329 ( 91 ~; 75 |; 158 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 106 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 4 prp; 0-3 aty)
% Number of functors : 47 ( 47 usr; 43 con; 0-3 aty)
% Number of variables : 103 ( 19 sgn 43 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(15,axiom,
! [X1,X2] :
( sub(X1,X2)
=> ? [X3] :
( arg1(X3,X1)
& arg2(X3,X2)
& subr(X3,sub_0) ) ),
file('/tmp/tmpmLMC8z/sel_CSR115+28.p_4',sub__sub_0_expansion) ).
fof(50,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/tmpmLMC8z/sel_CSR115+28.p_4',sub__bezeichnen_1_1_als) ).
fof(80,axiom,
( attr(c15,c16)
& sub(c15,stadt__1_1)
& sub(c16,name_1_1)
& val(c16,genf_0)
& attr(c22,c23)
& attr(c22,c24)
& sub(c23,tag_1_1)
& val(c23,c20)
& sub(c24,monat_1_1)
& val(c24,c21)
& tupl(c75,c15,c22)
& sort(c15,d)
& sort(c15,io)
& card(c15,int1)
& etype(c15,int0)
& fact(c15,real)
& gener(c15,sp)
& quant(c15,one)
& refer(c15,det)
& varia(c15,con)
& sort(c16,na)
& card(c16,int1)
& etype(c16,int0)
& fact(c16,real)
& gener(c16,sp)
& quant(c16,one)
& refer(c16,indet)
& varia(c16,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(genf_0,fe)
& sort(c22,t)
& card(c22,int1)
& etype(c22,int0)
& fact(c22,real)
& gener(c22,sp)
& quant(c22,one)
& refer(c22,det)
& varia(c22,con)
& sort(c23,me)
& sort(c23,oa)
& sort(c23,ta)
& card(c23,card_c)
& etype(c23,etype_c)
& fact(c23,real)
& gener(c23,sp)
& quant(c23,quant_c)
& refer(c23,refer_c)
& varia(c23,varia_c)
& sort(c24,me)
& sort(c24,oa)
& sort(c24,ta)
& card(c24,card_c)
& etype(c24,etype_c)
& fact(c24,real)
& gener(c24,sp)
& quant(c24,quant_c)
& refer(c24,refer_c)
& varia(c24,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(c20,nu)
& card(c20,int7)
& 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(c21,nu)
& card(c21,int3)
& sort(c75,ent)
& card(c75,card_c)
& etype(c75,etype_c)
& fact(c75,real)
& gener(c75,gener_c)
& quant(c75,quant_c)
& refer(c75,refer_c)
& varia(c75,varia_c) ),
file('/tmp/tmpmLMC8z/sel_CSR115+28.p_4',ave07_era5_synth_qa07_007_mira_news_1201_a19984) ).
fof(81,conjecture,
? [X1,X2,X3,X4,X5,X6] :
( attr(X3,X2)
& attr(X5,X6)
& obj(X4,X1)
& sub(X2,name_1_1) ),
file('/tmp/tmpmLMC8z/sel_CSR115+28.p_4',synth_qa07_007_mira_news_1201_a19984) ).
fof(82,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6] :
( attr(X3,X2)
& attr(X5,X6)
& obj(X4,X1)
& sub(X2,name_1_1) ),
inference(assume_negation,[status(cth)],[81]) ).
fof(118,plain,
! [X1,X2] :
( ~ sub(X1,X2)
| ? [X3] :
( arg1(X3,X1)
& arg2(X3,X2)
& subr(X3,sub_0) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(119,plain,
! [X4,X5] :
( ~ sub(X4,X5)
| ? [X6] :
( arg1(X6,X4)
& arg2(X6,X5)
& subr(X6,sub_0) ) ),
inference(variable_rename,[status(thm)],[118]) ).
fof(120,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)],[119]) ).
fof(121,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)],[120]) ).
cnf(122,plain,
( subr(esk2_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(123,plain,
( arg2(esk2_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[121]) ).
cnf(124,plain,
( arg1(esk2_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[121]) ).
fof(227,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)],[50]) ).
fof(228,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)],[227]) ).
fof(229,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)],[228]) ).
fof(230,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)],[229]) ).
cnf(234,plain,
( obj(esk12_3(X1,X3,X2),X3)
| ~ subr(X1,sub_0)
| ~ arg2(X1,X2)
| ~ arg1(X1,X3) ),
inference(split_conjunct,[status(thm)],[230]) ).
cnf(438,plain,
sub(c16,name_1_1),
inference(split_conjunct,[status(thm)],[80]) ).
cnf(440,plain,
attr(c15,c16),
inference(split_conjunct,[status(thm)],[80]) ).
fof(441,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ attr(X3,X2)
| ~ attr(X5,X6)
| ~ obj(X4,X1)
| ~ sub(X2,name_1_1) ),
inference(fof_nnf,[status(thm)],[82]) ).
fof(442,negated_conjecture,
! [X7,X8,X9,X10,X11,X12] :
( ~ attr(X9,X8)
| ~ attr(X11,X12)
| ~ obj(X10,X7)
| ~ sub(X8,name_1_1) ),
inference(variable_rename,[status(thm)],[441]) ).
cnf(443,negated_conjecture,
( ~ sub(X1,name_1_1)
| ~ obj(X2,X3)
| ~ attr(X4,X5)
| ~ attr(X6,X1) ),
inference(split_conjunct,[status(thm)],[442]) ).
fof(482,plain,
( ~ epred1_0
<=> ! [X1,X6] :
( ~ sub(X1,name_1_1)
| ~ attr(X6,X1) ) ),
introduced(definition),
[split] ).
cnf(483,plain,
( epred1_0
| ~ sub(X1,name_1_1)
| ~ attr(X6,X1) ),
inference(split_equiv,[status(thm)],[482]) ).
fof(484,plain,
( ~ epred2_0
<=> ! [X5,X4] : ~ attr(X4,X5) ),
introduced(definition),
[split] ).
cnf(485,plain,
( epred2_0
| ~ attr(X4,X5) ),
inference(split_equiv,[status(thm)],[484]) ).
fof(486,plain,
( ~ epred3_0
<=> ! [X3,X2] : ~ obj(X2,X3) ),
introduced(definition),
[split] ).
cnf(487,plain,
( epred3_0
| ~ obj(X2,X3) ),
inference(split_equiv,[status(thm)],[486]) ).
cnf(488,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[443,482,theory(equality)]),484,theory(equality)]),486,theory(equality)]),
[split] ).
cnf(600,plain,
epred2_0,
inference(spm,[status(thm)],[485,440,theory(equality)]) ).
cnf(606,negated_conjecture,
( epred3_0
| ~ subr(X1,sub_0)
| ~ arg2(X1,X3)
| ~ arg1(X1,X2) ),
inference(spm,[status(thm)],[487,234,theory(equality)]) ).
cnf(608,negated_conjecture,
( ~ epred3_0
| $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[488,600,theory(equality)]) ).
cnf(609,negated_conjecture,
( ~ epred3_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[608,theory(equality)]) ).
cnf(610,plain,
( epred1_0
| ~ sub(c16,name_1_1) ),
inference(spm,[status(thm)],[483,440,theory(equality)]) ).
cnf(615,plain,
( epred1_0
| $false ),
inference(rw,[status(thm)],[610,438,theory(equality)]) ).
cnf(616,plain,
epred1_0,
inference(cn,[status(thm)],[615,theory(equality)]) ).
cnf(618,negated_conjecture,
( ~ epred3_0
| $false ),
inference(rw,[status(thm)],[609,616,theory(equality)]) ).
cnf(619,negated_conjecture,
~ epred3_0,
inference(cn,[status(thm)],[618,theory(equality)]) ).
cnf(625,negated_conjecture,
( ~ subr(X1,sub_0)
| ~ arg2(X1,X3)
| ~ arg1(X1,X2) ),
inference(sr,[status(thm)],[606,619,theory(equality)]) ).
cnf(626,negated_conjecture,
( ~ arg2(esk2_2(X1,X2),X3)
| ~ arg1(esk2_2(X1,X2),X4)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[625,122,theory(equality)]) ).
cnf(627,negated_conjecture,
( ~ arg1(esk2_2(X1,X2),X3)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[626,123,theory(equality)]) ).
cnf(628,negated_conjecture,
~ sub(X1,X2),
inference(spm,[status(thm)],[627,124,theory(equality)]) ).
cnf(633,plain,
$false,
inference(sr,[status(thm)],[438,628,theory(equality)]) ).
cnf(634,plain,
$false,
633,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR115+28.p
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpmLMC8z/sel_CSR115+28.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpmLMC8z/sel_CSR115+28.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/tmpmLMC8z/sel_CSR115+28.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpmLMC8z/sel_CSR115+28.p_4 with time limit 55
% -prover status Theorem
% Problem CSR115+28.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR115+28.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR115+28.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
%
%------------------------------------------------------------------------------