TSTP Solution File: CSR115+49 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR115+49 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:40:17 EST 2010
% Result : Theorem 1.43s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 16 unt; 0 def)
% Number of atoms : 337 ( 0 equ)
% Maximal formula atoms : 180 ( 6 avg)
% Number of connectives : 382 ( 97 ~; 79 |; 201 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 180 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 22 ( 21 usr; 5 prp; 0-5 aty)
% Number of functors : 47 ( 47 usr; 46 con; 0-3 aty)
% Number of variables : 80 ( 12 sgn 36 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,axiom,
! [X1,X2,X3] :
( ( chea(X3,X2)
& subs(X1,X2) )
=> ? [X4] :
( chea(X4,X1)
& subs(X4,X3) ) ),
file('/tmp/tmpC2OnDS/sel_CSR115+49.p_1',chea_subs_abs__event) ).
fof(52,axiom,
chea(n374bernehmen_1_1,annahme_1_1),
file('/tmp/tmpC2OnDS/sel_CSR115+49.p_1',fact_8354) ).
fof(57,axiom,
( assoc(autobauer_1_1,auto__1_1)
& sub(autobauer_1_1,fabrikant_1_1)
& tupl_p5(c171,c18,c25,c73,c86)
& attr(c18,c19)
& sub(c18,kommission_1_1)
& sub(c19,name_1_1)
& val(c19,eu_0)
& obj(c25,c55)
& subs(c25,annahme_1_1)
& attr(c55,c56)
& prop(c55,britisch__1_1)
& sub(c55,autobauer_1_1)
& sub(c56,name_1_1)
& val(c56,rover_0)
& attr(c73,c74)
& sub(c73,firma_1_1)
& sub(c74,name_1_1)
& val(c74,bmw_0)
& attr(c86,c87)
& sub(c86,stadt__1_1)
& sub(c87,name_1_1)
& val(c87,m__374nchen_0)
& sort(autobauer_1_1,d)
& sort(autobauer_1_1,io)
& card(autobauer_1_1,int1)
& etype(autobauer_1_1,int0)
& fact(autobauer_1_1,real)
& gener(autobauer_1_1,ge)
& quant(autobauer_1_1,one)
& refer(autobauer_1_1,refer_c)
& varia(autobauer_1_1,varia_c)
& sort(auto__1_1,d)
& card(auto__1_1,int1)
& etype(auto__1_1,int0)
& fact(auto__1_1,real)
& gener(auto__1_1,ge)
& quant(auto__1_1,one)
& refer(auto__1_1,refer_c)
& varia(auto__1_1,varia_c)
& sort(fabrikant_1_1,d)
& sort(fabrikant_1_1,io)
& card(fabrikant_1_1,int1)
& etype(fabrikant_1_1,int0)
& fact(fabrikant_1_1,real)
& gener(fabrikant_1_1,ge)
& quant(fabrikant_1_1,one)
& refer(fabrikant_1_1,refer_c)
& varia(fabrikant_1_1,varia_c)
& sort(c171,ent)
& card(c171,card_c)
& etype(c171,etype_c)
& fact(c171,real)
& gener(c171,gener_c)
& quant(c171,quant_c)
& refer(c171,refer_c)
& varia(c171,varia_c)
& sort(c18,d)
& sort(c18,io)
& card(c18,int1)
& etype(c18,int1)
& fact(c18,real)
& gener(c18,sp)
& quant(c18,one)
& refer(c18,det)
& varia(c18,varia_c)
& sort(c25,ad)
& card(c25,int1)
& etype(c25,int0)
& fact(c25,real)
& gener(c25,sp)
& quant(c25,one)
& refer(c25,det)
& varia(c25,con)
& sort(c73,d)
& sort(c73,io)
& card(c73,int1)
& etype(c73,int0)
& fact(c73,real)
& gener(c73,sp)
& quant(c73,one)
& refer(c73,det)
& varia(c73,con)
& sort(c86,d)
& sort(c86,io)
& card(c86,int1)
& etype(c86,int0)
& fact(c86,real)
& gener(c86,sp)
& quant(c86,one)
& refer(c86,det)
& varia(c86,con)
& sort(c19,na)
& card(c19,int1)
& etype(c19,int0)
& fact(c19,real)
& gener(c19,sp)
& quant(c19,one)
& refer(c19,det)
& varia(c19,varia_c)
& sort(kommission_1_1,d)
& sort(kommission_1_1,io)
& card(kommission_1_1,card_c)
& etype(kommission_1_1,int1)
& fact(kommission_1_1,real)
& gener(kommission_1_1,ge)
& quant(kommission_1_1,quant_c)
& refer(kommission_1_1,refer_c)
& varia(kommission_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(eu_0,fe)
& sort(c55,d)
& sort(c55,io)
& card(c55,int1)
& etype(c55,int0)
& fact(c55,real)
& gener(c55,sp)
& quant(c55,one)
& refer(c55,det)
& varia(c55,con)
& sort(annahme_1_1,ad)
& card(annahme_1_1,int1)
& etype(annahme_1_1,int0)
& fact(annahme_1_1,real)
& gener(annahme_1_1,ge)
& quant(annahme_1_1,one)
& refer(annahme_1_1,refer_c)
& varia(annahme_1_1,varia_c)
& sort(c56,na)
& card(c56,int1)
& etype(c56,int0)
& fact(c56,real)
& gener(c56,sp)
& quant(c56,one)
& refer(c56,indet)
& varia(c56,varia_c)
& sort(britisch__1_1,nq)
& sort(rover_0,fe)
& sort(c74,na)
& card(c74,int1)
& etype(c74,int0)
& fact(c74,real)
& gener(c74,sp)
& quant(c74,one)
& refer(c74,indet)
& varia(c74,varia_c)
& sort(firma_1_1,d)
& sort(firma_1_1,io)
& card(firma_1_1,int1)
& etype(firma_1_1,int0)
& fact(firma_1_1,real)
& gener(firma_1_1,ge)
& quant(firma_1_1,one)
& refer(firma_1_1,refer_c)
& varia(firma_1_1,varia_c)
& sort(bmw_0,fe)
& sort(c87,na)
& card(c87,int1)
& etype(c87,int0)
& fact(c87,real)
& gener(c87,sp)
& quant(c87,one)
& refer(c87,indet)
& varia(c87,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(m__374nchen_0,fe) ),
file('/tmp/tmpC2OnDS/sel_CSR115+49.p_1',ave07_era5_synth_qa07_007_mira_news_1294) ).
fof(58,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X1,firma_1_1)
& sub(X3,name_1_1)
& subs(X5,n374bernehmen_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/tmp/tmpC2OnDS/sel_CSR115+49.p_1',synth_qa07_007_mira_news_1294) ).
fof(59,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X1,firma_1_1)
& sub(X3,name_1_1)
& subs(X5,n374bernehmen_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[58]) ).
fof(103,plain,
! [X1,X2,X3] :
( ~ chea(X3,X2)
| ~ subs(X1,X2)
| ? [X4] :
( chea(X4,X1)
& subs(X4,X3) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(104,plain,
! [X5,X6,X7] :
( ~ chea(X7,X6)
| ~ subs(X5,X6)
| ? [X8] :
( chea(X8,X5)
& subs(X8,X7) ) ),
inference(variable_rename,[status(thm)],[103]) ).
fof(105,plain,
! [X5,X6,X7] :
( ~ chea(X7,X6)
| ~ subs(X5,X6)
| ( chea(esk5_3(X5,X6,X7),X5)
& subs(esk5_3(X5,X6,X7),X7) ) ),
inference(skolemize,[status(esa)],[104]) ).
fof(106,plain,
! [X5,X6,X7] :
( ( chea(esk5_3(X5,X6,X7),X5)
| ~ chea(X7,X6)
| ~ subs(X5,X6) )
& ( subs(esk5_3(X5,X6,X7),X7)
| ~ chea(X7,X6)
| ~ subs(X5,X6) ) ),
inference(distribute,[status(thm)],[105]) ).
cnf(107,plain,
( subs(esk5_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
inference(split_conjunct,[status(thm)],[106]) ).
cnf(186,plain,
chea(n374bernehmen_1_1,annahme_1_1),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(357,plain,
val(c74,bmw_0),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(358,plain,
sub(c74,name_1_1),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(359,plain,
sub(c73,firma_1_1),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(360,plain,
attr(c73,c74),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(366,plain,
subs(c25,annahme_1_1),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(371,plain,
attr(c18,c19),
inference(split_conjunct,[status(thm)],[57]) ).
fof(375,negated_conjecture,
! [X1,X2,X3,X4,X5,X6,X7] :
( ~ attr(X1,X2)
| ~ attr(X4,X3)
| ~ attr(X6,X7)
| ~ sub(X2,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ sub(X3,name_1_1)
| ~ subs(X5,n374bernehmen_1_1)
| ~ val(X2,bmw_0)
| ~ val(X3,bmw_0) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(376,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ attr(X8,X9)
| ~ attr(X11,X10)
| ~ attr(X13,X14)
| ~ sub(X9,name_1_1)
| ~ sub(X8,firma_1_1)
| ~ sub(X10,name_1_1)
| ~ subs(X12,n374bernehmen_1_1)
| ~ val(X9,bmw_0)
| ~ val(X10,bmw_0) ),
inference(variable_rename,[status(thm)],[375]) ).
cnf(377,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ subs(X3,n374bernehmen_1_1)
| ~ sub(X1,name_1_1)
| ~ sub(X4,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ attr(X5,X6)
| ~ attr(X7,X1)
| ~ attr(X4,X2) ),
inference(split_conjunct,[status(thm)],[376]) ).
fof(529,plain,
( ~ epred1_0
<=> ! [X4,X2] :
( ~ sub(X2,name_1_1)
| ~ sub(X4,firma_1_1)
| ~ attr(X4,X2)
| ~ val(X2,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(530,plain,
( epred1_0
| ~ sub(X2,name_1_1)
| ~ sub(X4,firma_1_1)
| ~ attr(X4,X2)
| ~ val(X2,bmw_0) ),
inference(split_equiv,[status(thm)],[529]) ).
fof(531,plain,
( ~ epred2_0
<=> ! [X7,X1] :
( ~ sub(X1,name_1_1)
| ~ attr(X7,X1)
| ~ val(X1,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(532,plain,
( epred2_0
| ~ sub(X1,name_1_1)
| ~ attr(X7,X1)
| ~ val(X1,bmw_0) ),
inference(split_equiv,[status(thm)],[531]) ).
fof(533,plain,
( ~ epred3_0
<=> ! [X6,X5] : ~ attr(X5,X6) ),
introduced(definition),
[split] ).
cnf(534,plain,
( epred3_0
| ~ attr(X5,X6) ),
inference(split_equiv,[status(thm)],[533]) ).
fof(535,plain,
( ~ epred4_0
<=> ! [X3] : ~ subs(X3,n374bernehmen_1_1) ),
introduced(definition),
[split] ).
cnf(536,plain,
( epred4_0
| ~ subs(X3,n374bernehmen_1_1) ),
inference(split_equiv,[status(thm)],[535]) ).
cnf(537,negated_conjecture,
( ~ epred4_0
| ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[377,529,theory(equality)]),531,theory(equality)]),533,theory(equality)]),535,theory(equality)]),
[split] ).
cnf(538,plain,
epred3_0,
inference(spm,[status(thm)],[534,371,theory(equality)]) ).
cnf(546,negated_conjecture,
( epred4_0
| ~ subs(X1,X2)
| ~ chea(n374bernehmen_1_1,X2) ),
inference(spm,[status(thm)],[536,107,theory(equality)]) ).
cnf(547,negated_conjecture,
( ~ epred4_0
| $false
| ~ epred2_0
| ~ epred1_0 ),
inference(rw,[status(thm)],[537,538,theory(equality)]) ).
cnf(548,negated_conjecture,
( ~ epred4_0
| ~ epred2_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[547,theory(equality)]) ).
cnf(552,plain,
( epred4_0
| ~ chea(n374bernehmen_1_1,annahme_1_1) ),
inference(spm,[status(thm)],[546,366,theory(equality)]) ).
cnf(555,plain,
( epred4_0
| $false ),
inference(rw,[status(thm)],[552,186,theory(equality)]) ).
cnf(556,plain,
epred4_0,
inference(cn,[status(thm)],[555,theory(equality)]) ).
cnf(559,negated_conjecture,
( $false
| ~ epred2_0
| ~ epred1_0 ),
inference(rw,[status(thm)],[548,556,theory(equality)]) ).
cnf(560,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[559,theory(equality)]) ).
cnf(562,plain,
( epred2_0
| ~ attr(X1,c74)
| ~ sub(c74,name_1_1) ),
inference(spm,[status(thm)],[532,357,theory(equality)]) ).
cnf(565,plain,
( epred2_0
| ~ attr(X1,c74)
| $false ),
inference(rw,[status(thm)],[562,358,theory(equality)]) ).
cnf(566,plain,
( epred2_0
| ~ attr(X1,c74) ),
inference(cn,[status(thm)],[565,theory(equality)]) ).
cnf(567,plain,
epred2_0,
inference(spm,[status(thm)],[566,360,theory(equality)]) ).
cnf(570,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[560,567,theory(equality)]) ).
cnf(571,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[570,theory(equality)]) ).
cnf(572,negated_conjecture,
( ~ sub(X2,name_1_1)
| ~ sub(X4,firma_1_1)
| ~ attr(X4,X2)
| ~ val(X2,bmw_0) ),
inference(sr,[status(thm)],[530,571,theory(equality)]) ).
cnf(573,plain,
( ~ attr(X1,c74)
| ~ sub(c74,name_1_1)
| ~ sub(X1,firma_1_1) ),
inference(spm,[status(thm)],[572,357,theory(equality)]) ).
cnf(576,plain,
( ~ attr(X1,c74)
| $false
| ~ sub(X1,firma_1_1) ),
inference(rw,[status(thm)],[573,358,theory(equality)]) ).
cnf(577,plain,
( ~ attr(X1,c74)
| ~ sub(X1,firma_1_1) ),
inference(cn,[status(thm)],[576,theory(equality)]) ).
cnf(578,plain,
~ sub(c73,firma_1_1),
inference(spm,[status(thm)],[577,360,theory(equality)]) ).
cnf(579,plain,
$false,
inference(rw,[status(thm)],[578,359,theory(equality)]) ).
cnf(580,plain,
$false,
inference(cn,[status(thm)],[579,theory(equality)]) ).
cnf(581,plain,
$false,
580,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR115+49.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpC2OnDS/sel_CSR115+49.p_1 with time limit 29
% -prover status Theorem
% Problem CSR115+49.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR115+49.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR115+49.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
%
%------------------------------------------------------------------------------