TSTP Solution File: CSR115+52 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR115+52 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:41:28 EST 2010
% Result : Theorem 1.38s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 267 ( 0 equ)
% Maximal formula atoms : 147 ( 7 avg)
% Number of connectives : 310 ( 80 ~; 65 |; 162 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 147 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 4 prp; 0-2 aty)
% Number of functors : 40 ( 40 usr; 40 con; 0-0 aty)
% Number of variables : 61 ( 9 sgn 21 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(54,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X5,X4)
& attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X3,name_1_1)
& subs(X5,n374bernehmen_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/tmp/tmpwe4DHG/sel_CSR115+52.p_1',synth_qa07_007_mira_news_1305) ).
fof(55,axiom,
( assoc(autokonzern_1_1,auto__1_1)
& sub(autokonzern_1_1,firmengruppe_1_1)
& assoc(autounternehmen_1_1,auto__1_1)
& sub(autounternehmen_1_1,unternehmen_1_1)
& attr(c0,c1)
& sub(c0,stadt__1_1)
& sub(c1,name_1_1)
& val(c1,m__374nchen_0)
& agt(c163,c165)
& obj(c163,c218)
& subs(c163,n374bernehmen_1_1)
& attr(c165,c166)
& prop(c165,m__374nchner_1_1)
& sub(c165,autokonzern_1_1)
& sub(c166,name_1_1)
& val(c166,bmw_0)
& attr(c218,c219)
& prop(c218,altbew__344hrt_1_1)
& prop(c218,britisch__1_1)
& sub(c218,autounternehmen_1_1)
& sub(c219,name_1_1)
& val(c219,rover_0)
& assoc(m__374nchner_1_1,c0)
& sort(autokonzern_1_1,d)
& sort(autokonzern_1_1,io)
& card(autokonzern_1_1,int1)
& etype(autokonzern_1_1,int0)
& fact(autokonzern_1_1,real)
& gener(autokonzern_1_1,ge)
& quant(autokonzern_1_1,one)
& refer(autokonzern_1_1,refer_c)
& varia(autokonzern_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(firmengruppe_1_1,d)
& sort(firmengruppe_1_1,io)
& card(firmengruppe_1_1,int1)
& etype(firmengruppe_1_1,int0)
& fact(firmengruppe_1_1,real)
& gener(firmengruppe_1_1,ge)
& quant(firmengruppe_1_1,one)
& refer(firmengruppe_1_1,refer_c)
& varia(firmengruppe_1_1,varia_c)
& sort(autounternehmen_1_1,d)
& sort(autounternehmen_1_1,io)
& card(autounternehmen_1_1,int1)
& etype(autounternehmen_1_1,int0)
& fact(autounternehmen_1_1,real)
& gener(autounternehmen_1_1,ge)
& quant(autounternehmen_1_1,one)
& refer(autounternehmen_1_1,refer_c)
& varia(autounternehmen_1_1,varia_c)
& sort(unternehmen_1_1,d)
& sort(unternehmen_1_1,io)
& card(unternehmen_1_1,int1)
& etype(unternehmen_1_1,int0)
& fact(unternehmen_1_1,real)
& gener(unternehmen_1_1,ge)
& quant(unternehmen_1_1,one)
& refer(unternehmen_1_1,refer_c)
& varia(unternehmen_1_1,varia_c)
& sort(c0,d)
& sort(c0,io)
& card(c0,int1)
& etype(c0,int0)
& fact(c0,real)
& gener(c0,sp)
& quant(c0,one)
& refer(c0,det)
& varia(c0,varia_c)
& sort(c1,na)
& card(c1,int1)
& etype(c1,int0)
& fact(c1,real)
& gener(c1,sp)
& quant(c1,one)
& refer(c1,det)
& varia(c1,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(m__374nchen_0,fe)
& sort(c163,da)
& fact(c163,real)
& gener(c163,sp)
& sort(c165,d)
& sort(c165,io)
& card(c165,int1)
& etype(c165,int0)
& fact(c165,real)
& gener(c165,sp)
& quant(c165,one)
& refer(c165,det)
& varia(c165,con)
& sort(c218,d)
& sort(c218,io)
& card(c218,int1)
& etype(c218,int0)
& fact(c218,real)
& gener(c218,sp)
& quant(c218,one)
& refer(c218,det)
& varia(c218,con)
& sort(n374bernehmen_1_1,da)
& fact(n374bernehmen_1_1,real)
& gener(n374bernehmen_1_1,ge)
& sort(c166,na)
& card(c166,int1)
& etype(c166,int0)
& fact(c166,real)
& gener(c166,sp)
& quant(c166,one)
& refer(c166,indet)
& varia(c166,varia_c)
& sort(m__374nchner_1_1,gq)
& sort(bmw_0,fe)
& sort(c219,na)
& card(c219,int1)
& etype(c219,int0)
& fact(c219,real)
& gener(c219,sp)
& quant(c219,one)
& refer(c219,indet)
& varia(c219,varia_c)
& sort(altbew__344hrt_1_1,ql)
& sort(britisch__1_1,nq)
& sort(rover_0,fe) ),
file('/tmp/tmpwe4DHG/sel_CSR115+52.p_1',ave07_era5_synth_qa07_007_mira_news_1305) ).
fof(56,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X5,X4)
& attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_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)],[54]) ).
fof(187,negated_conjecture,
! [X1,X2,X3,X4,X5,X6,X7] :
( ~ agt(X5,X4)
| ~ attr(X1,X2)
| ~ attr(X4,X3)
| ~ attr(X6,X7)
| ~ sub(X2,name_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)],[56]) ).
fof(188,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ agt(X12,X11)
| ~ attr(X8,X9)
| ~ attr(X11,X10)
| ~ attr(X13,X14)
| ~ sub(X9,name_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)],[187]) ).
cnf(189,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ subs(X3,n374bernehmen_1_1)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ attr(X4,X5)
| ~ attr(X6,X1)
| ~ attr(X7,X2)
| ~ agt(X3,X6) ),
inference(split_conjunct,[status(thm)],[188]) ).
cnf(321,plain,
val(c166,bmw_0),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(322,plain,
sub(c166,name_1_1),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(325,plain,
attr(c165,c166),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(326,plain,
subs(c163,n374bernehmen_1_1),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(328,plain,
agt(c163,c165),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(332,plain,
attr(c0,c1),
inference(split_conjunct,[status(thm)],[55]) ).
fof(428,plain,
( ~ epred1_0
<=> ! [X1,X6,X3] :
( ~ subs(X3,n374bernehmen_1_1)
| ~ sub(X1,name_1_1)
| ~ attr(X6,X1)
| ~ val(X1,bmw_0)
| ~ agt(X3,X6) ) ),
introduced(definition),
[split] ).
cnf(429,plain,
( epred1_0
| ~ subs(X3,n374bernehmen_1_1)
| ~ sub(X1,name_1_1)
| ~ attr(X6,X1)
| ~ val(X1,bmw_0)
| ~ agt(X3,X6) ),
inference(split_equiv,[status(thm)],[428]) ).
fof(430,plain,
( ~ epred2_0
<=> ! [X7,X2] :
( ~ sub(X2,name_1_1)
| ~ attr(X7,X2)
| ~ val(X2,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(431,plain,
( epred2_0
| ~ sub(X2,name_1_1)
| ~ attr(X7,X2)
| ~ val(X2,bmw_0) ),
inference(split_equiv,[status(thm)],[430]) ).
fof(432,plain,
( ~ epred3_0
<=> ! [X5,X4] : ~ attr(X4,X5) ),
introduced(definition),
[split] ).
cnf(433,plain,
( epred3_0
| ~ attr(X4,X5) ),
inference(split_equiv,[status(thm)],[432]) ).
cnf(434,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[189,428,theory(equality)]),430,theory(equality)]),432,theory(equality)]),
[split] ).
cnf(437,plain,
epred3_0,
inference(spm,[status(thm)],[433,332,theory(equality)]) ).
cnf(443,negated_conjecture,
( $false
| ~ epred2_0
| ~ epred1_0 ),
inference(rw,[status(thm)],[434,437,theory(equality)]) ).
cnf(444,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[443,theory(equality)]) ).
cnf(445,plain,
( epred2_0
| ~ attr(X1,c166)
| ~ sub(c166,name_1_1) ),
inference(spm,[status(thm)],[431,321,theory(equality)]) ).
cnf(448,plain,
( epred2_0
| ~ attr(X1,c166)
| $false ),
inference(rw,[status(thm)],[445,322,theory(equality)]) ).
cnf(449,plain,
( epred2_0
| ~ attr(X1,c166) ),
inference(cn,[status(thm)],[448,theory(equality)]) ).
cnf(450,plain,
epred2_0,
inference(spm,[status(thm)],[449,325,theory(equality)]) ).
cnf(453,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[444,450,theory(equality)]) ).
cnf(454,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[453,theory(equality)]) ).
cnf(455,negated_conjecture,
( ~ subs(X3,n374bernehmen_1_1)
| ~ sub(X1,name_1_1)
| ~ attr(X6,X1)
| ~ val(X1,bmw_0)
| ~ agt(X3,X6) ),
inference(sr,[status(thm)],[429,454,theory(equality)]) ).
cnf(456,plain,
( ~ agt(X1,X2)
| ~ attr(X2,c166)
| ~ sub(c166,name_1_1)
| ~ subs(X1,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[455,321,theory(equality)]) ).
cnf(459,plain,
( ~ agt(X1,X2)
| ~ attr(X2,c166)
| $false
| ~ subs(X1,n374bernehmen_1_1) ),
inference(rw,[status(thm)],[456,322,theory(equality)]) ).
cnf(460,plain,
( ~ agt(X1,X2)
| ~ attr(X2,c166)
| ~ subs(X1,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[459,theory(equality)]) ).
cnf(461,plain,
( ~ attr(c165,c166)
| ~ subs(c163,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[460,328,theory(equality)]) ).
cnf(463,plain,
( $false
| ~ subs(c163,n374bernehmen_1_1) ),
inference(rw,[status(thm)],[461,325,theory(equality)]) ).
cnf(464,plain,
( $false
| $false ),
inference(rw,[status(thm)],[463,326,theory(equality)]) ).
cnf(465,plain,
$false,
inference(cn,[status(thm)],[464,theory(equality)]) ).
cnf(466,plain,
$false,
465,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR115+52.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpwe4DHG/sel_CSR115+52.p_1 with time limit 29
% -prover status Theorem
% Problem CSR115+52.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR115+52.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR115+52.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
%
%------------------------------------------------------------------------------