TSTP Solution File: CSR115+36 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR115+36 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:37:46 EST 2010
% Result : Theorem 1.35s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 257 ( 0 equ)
% Maximal formula atoms : 139 ( 6 avg)
% Number of connectives : 298 ( 78 ~; 63 |; 154 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 139 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 24 ( 23 usr; 4 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 42 con; 0-0 aty)
% Number of variables : 61 ( 10 sgn 21 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(56,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(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/tmp/tmpNUFLMX/sel_CSR115+36.p_1',synth_qa07_007_mira_news_1223) ).
fof(57,axiom,
( assoc(autofirma_1_1,auto__1_1)
& sub(autofirma_1_1,firma_1_1)
& attr(c428,c429)
& sub(c428,firma_1_1)
& sub(c429,name_1_1)
& val(c429,bmw_0)
& prop(c434,britisch__1_1)
& sub(c434,autofirma_1_1)
& benf(c441,c452)
& pred(c441,beid_2_1)
& name(c452,die_vorhersehbare_zukunft_0)
& exp(c458,c441)
& obj(c458,c6)
& subs(c458,ausschlie__337en_1_1)
& agt(c6,c428)
& obj(c6,c434)
& subs(c6,kapitalbeteiligung_1_1)
& assoc(kapitalbeteiligung_1_1,kapital_2_1)
& subs(kapitalbeteiligung_1_1,beteiligung_1_1)
& sort(autofirma_1_1,d)
& sort(autofirma_1_1,io)
& card(autofirma_1_1,int1)
& etype(autofirma_1_1,int0)
& fact(autofirma_1_1,real)
& gener(autofirma_1_1,ge)
& quant(autofirma_1_1,one)
& refer(autofirma_1_1,refer_c)
& varia(autofirma_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(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(c428,d)
& sort(c428,io)
& card(c428,int1)
& etype(c428,int0)
& fact(c428,real)
& gener(c428,sp)
& quant(c428,one)
& refer(c428,det)
& varia(c428,con)
& sort(c429,na)
& card(c429,int1)
& etype(c429,int0)
& fact(c429,real)
& gener(c429,sp)
& quant(c429,one)
& refer(c429,indet)
& varia(c429,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(bmw_0,fe)
& sort(c434,d)
& sort(c434,io)
& card(c434,int1)
& etype(c434,int0)
& fact(c434,real)
& gener(c434,sp)
& quant(c434,one)
& refer(c434,det)
& varia(c434,con)
& sort(britisch__1_1,nq)
& sort(c441,o)
& card(c441,int2)
& etype(c441,int1)
& etype(c441,int2)
& etype(c441,int3)
& fact(c441,real)
& gener(c441,sp)
& quant(c441,both)
& refer(c441,indet)
& varia(c441,varia_c)
& sort(c452,o)
& card(c452,int1)
& etype(c452,int0)
& fact(c452,real)
& gener(c452,sp)
& quant(c452,one)
& refer(c452,refer_c)
& varia(c452,varia_c)
& sort(beid_2_1,o)
& card(beid_2_1,int2)
& etype(beid_2_1,int1)
& fact(beid_2_1,real)
& gener(beid_2_1,gener_c)
& quant(beid_2_1,both)
& refer(beid_2_1,refer_c)
& varia(beid_2_1,varia_c)
& sort(die_vorhersehbare_zukunft_0,fe)
& sort(c458,dn)
& fact(c458,real)
& gener(c458,sp)
& sort(c6,ad)
& card(c6,int1)
& etype(c6,int0)
& fact(c6,real)
& gener(c6,sp)
& quant(c6,one)
& refer(c6,indet)
& varia(c6,varia_c)
& sort(ausschlie__337en_1_1,dn)
& fact(ausschlie__337en_1_1,real)
& gener(ausschlie__337en_1_1,ge)
& sort(kapitalbeteiligung_1_1,ad)
& card(kapitalbeteiligung_1_1,int1)
& etype(kapitalbeteiligung_1_1,int0)
& fact(kapitalbeteiligung_1_1,real)
& gener(kapitalbeteiligung_1_1,ge)
& quant(kapitalbeteiligung_1_1,one)
& refer(kapitalbeteiligung_1_1,refer_c)
& varia(kapitalbeteiligung_1_1,varia_c)
& sort(kapital_2_1,nq)
& sort(beteiligung_1_1,ad)
& card(beteiligung_1_1,int1)
& etype(beteiligung_1_1,int0)
& fact(beteiligung_1_1,real)
& gener(beteiligung_1_1,ge)
& quant(beteiligung_1_1,one)
& refer(beteiligung_1_1,refer_c)
& varia(beteiligung_1_1,varia_c) ),
file('/tmp/tmpNUFLMX/sel_CSR115+36.p_1',ave07_era5_synth_qa07_007_mira_news_1223) ).
fof(58,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(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[56]) ).
fof(188,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(X1,firma_1_1)
| ~ sub(X3,name_1_1)
| ~ val(X2,bmw_0)
| ~ val(X3,bmw_0) ),
inference(fof_nnf,[status(thm)],[58]) ).
fof(189,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(X8,firma_1_1)
| ~ sub(X10,name_1_1)
| ~ val(X9,bmw_0)
| ~ val(X10,bmw_0) ),
inference(variable_rename,[status(thm)],[188]) ).
cnf(190,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X3,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ attr(X4,X5)
| ~ attr(X6,X1)
| ~ attr(X3,X2)
| ~ agt(X7,X6) ),
inference(split_conjunct,[status(thm)],[189]) ).
cnf(315,plain,
agt(c6,c428),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(324,plain,
val(c429,bmw_0),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(325,plain,
sub(c429,name_1_1),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(326,plain,
sub(c428,firma_1_1),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(327,plain,
attr(c428,c429),
inference(split_conjunct,[status(thm)],[57]) ).
fof(416,plain,
( ~ epred1_0
<=> ! [X3,X2] :
( ~ sub(X2,name_1_1)
| ~ sub(X3,firma_1_1)
| ~ attr(X3,X2)
| ~ val(X2,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(417,plain,
( epred1_0
| ~ sub(X2,name_1_1)
| ~ sub(X3,firma_1_1)
| ~ attr(X3,X2)
| ~ val(X2,bmw_0) ),
inference(split_equiv,[status(thm)],[416]) ).
fof(418,plain,
( ~ epred2_0
<=> ! [X6,X7,X1] :
( ~ sub(X1,name_1_1)
| ~ agt(X7,X6)
| ~ attr(X6,X1)
| ~ val(X1,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(419,plain,
( epred2_0
| ~ sub(X1,name_1_1)
| ~ agt(X7,X6)
| ~ attr(X6,X1)
| ~ val(X1,bmw_0) ),
inference(split_equiv,[status(thm)],[418]) ).
fof(420,plain,
( ~ epred3_0
<=> ! [X5,X4] : ~ attr(X4,X5) ),
introduced(definition),
[split] ).
cnf(421,plain,
( epred3_0
| ~ attr(X4,X5) ),
inference(split_equiv,[status(thm)],[420]) ).
cnf(422,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[190,416,theory(equality)]),418,theory(equality)]),420,theory(equality)]),
[split] ).
cnf(423,plain,
epred3_0,
inference(spm,[status(thm)],[421,327,theory(equality)]) ).
cnf(428,negated_conjecture,
( $false
| ~ epred2_0
| ~ epred1_0 ),
inference(rw,[status(thm)],[422,423,theory(equality)]) ).
cnf(429,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[428,theory(equality)]) ).
cnf(432,plain,
( epred1_0
| ~ attr(X1,c429)
| ~ sub(c429,name_1_1)
| ~ sub(X1,firma_1_1) ),
inference(spm,[status(thm)],[417,324,theory(equality)]) ).
cnf(434,plain,
( epred1_0
| ~ attr(X1,c429)
| $false
| ~ sub(X1,firma_1_1) ),
inference(rw,[status(thm)],[432,325,theory(equality)]) ).
cnf(435,plain,
( epred1_0
| ~ attr(X1,c429)
| ~ sub(X1,firma_1_1) ),
inference(cn,[status(thm)],[434,theory(equality)]) ).
cnf(436,plain,
( epred1_0
| ~ sub(c428,firma_1_1) ),
inference(spm,[status(thm)],[435,327,theory(equality)]) ).
cnf(437,plain,
( epred1_0
| $false ),
inference(rw,[status(thm)],[436,326,theory(equality)]) ).
cnf(438,plain,
epred1_0,
inference(cn,[status(thm)],[437,theory(equality)]) ).
cnf(441,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[429,438,theory(equality)]) ).
cnf(442,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[441,theory(equality)]) ).
cnf(445,negated_conjecture,
( ~ sub(X1,name_1_1)
| ~ agt(X7,X6)
| ~ attr(X6,X1)
| ~ val(X1,bmw_0) ),
inference(sr,[status(thm)],[419,442,theory(equality)]) ).
cnf(446,plain,
( ~ attr(X1,c429)
| ~ agt(X2,X1)
| ~ sub(c429,name_1_1) ),
inference(spm,[status(thm)],[445,324,theory(equality)]) ).
cnf(448,plain,
( ~ attr(X1,c429)
| ~ agt(X2,X1)
| $false ),
inference(rw,[status(thm)],[446,325,theory(equality)]) ).
cnf(449,plain,
( ~ attr(X1,c429)
| ~ agt(X2,X1) ),
inference(cn,[status(thm)],[448,theory(equality)]) ).
cnf(450,plain,
~ attr(c428,c429),
inference(spm,[status(thm)],[449,315,theory(equality)]) ).
cnf(453,plain,
$false,
inference(rw,[status(thm)],[450,327,theory(equality)]) ).
cnf(454,plain,
$false,
inference(cn,[status(thm)],[453,theory(equality)]) ).
cnf(455,plain,
$false,
454,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR115+36.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpNUFLMX/sel_CSR115+36.p_1 with time limit 29
% -prover status Theorem
% Problem CSR115+36.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR115+36.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR115+36.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
%
%------------------------------------------------------------------------------