TSTP Solution File: CSR115+39 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR115+39 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:38:19 EST 2010
% Result : Theorem 1.39s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 236 ( 0 equ)
% Maximal formula atoms : 156 ( 7 avg)
% Number of connectives : 259 ( 53 ~; 38 |; 165 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 156 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 22 ( 21 usr; 4 prp; 0-2 aty)
% Number of functors : 41 ( 41 usr; 41 con; 0-0 aty)
% Number of variables : 52 ( 13 sgn 18 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(60,conjecture,
? [X1,X2,X3,X4,X5,X6] :
( agt(X4,X3)
& attr(X3,X2)
& attr(X5,X6)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& val(X2,bmw_0) ),
file('/tmp/tmpJ8BP0O/sel_CSR115+39.p_1',synth_qa07_007_mira_news_1241_a19984) ).
fof(61,axiom,
( assoc(autobauer_1_1,auto__1_1)
& sub(autobauer_1_1,fabrikant_1_1)
& attr(c788,c789)
& sub(c788,firma_1_1)
& sub(c789,name_1_1)
& val(c789,bmw_0)
& sub(c791,abschlu__337_1_1)
& assoc(c792,c791)
& sub(c792,ja_nuar_1_1)
& subs(c799,ankauf__1_1)
& agt(c840,c788)
& mcont(c840,c799)
& subs(c840,bekanntgeben_1_1)
& temp(c840,c792)
& attch(c842,c799)
& attr(c842,c843)
& prop(c842,britisch__1_1)
& sub(c842,autobauer_1_1)
& sub(c843,name_1_1)
& val(c843,rover_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(c788,d)
& sort(c788,io)
& card(c788,int1)
& etype(c788,int0)
& fact(c788,real)
& gener(c788,sp)
& quant(c788,one)
& refer(c788,det)
& varia(c788,con)
& sort(c789,na)
& card(c789,int1)
& etype(c789,int0)
& fact(c789,real)
& gener(c789,sp)
& quant(c789,one)
& refer(c789,indet)
& varia(c789,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(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(c791,ad)
& sort(c791,io)
& card(c791,int1)
& etype(c791,int0)
& fact(c791,real)
& gener(c791,gener_c)
& quant(c791,one)
& refer(c791,refer_c)
& varia(c791,varia_c)
& sort(abschlu__337_1_1,ad)
& sort(abschlu__337_1_1,io)
& card(abschlu__337_1_1,int1)
& etype(abschlu__337_1_1,int0)
& fact(abschlu__337_1_1,real)
& gener(abschlu__337_1_1,ge)
& quant(abschlu__337_1_1,one)
& refer(abschlu__337_1_1,refer_c)
& varia(abschlu__337_1_1,varia_c)
& sort(c792,ta)
& card(c792,int1)
& etype(c792,int0)
& fact(c792,real)
& gener(c792,sp)
& quant(c792,one)
& refer(c792,refer_c)
& varia(c792,varia_c)
& sort(ja_nuar_1_1,ta)
& card(ja_nuar_1_1,int1)
& etype(ja_nuar_1_1,int0)
& fact(ja_nuar_1_1,real)
& gener(ja_nuar_1_1,ge)
& quant(ja_nuar_1_1,one)
& refer(ja_nuar_1_1,refer_c)
& varia(ja_nuar_1_1,varia_c)
& sort(c799,ad)
& card(c799,int1)
& etype(c799,int0)
& fact(c799,hypo)
& gener(c799,sp)
& quant(c799,one)
& refer(c799,det)
& varia(c799,con)
& sort(ankauf__1_1,ad)
& card(ankauf__1_1,int1)
& etype(ankauf__1_1,int0)
& fact(ankauf__1_1,real)
& gener(ankauf__1_1,ge)
& quant(ankauf__1_1,one)
& refer(ankauf__1_1,refer_c)
& varia(ankauf__1_1,varia_c)
& sort(c840,da)
& fact(c840,real)
& gener(c840,sp)
& sort(bekanntgeben_1_1,da)
& fact(bekanntgeben_1_1,real)
& gener(bekanntgeben_1_1,ge)
& sort(c842,d)
& sort(c842,io)
& card(c842,int1)
& etype(c842,int0)
& fact(c842,real)
& gener(c842,sp)
& quant(c842,one)
& refer(c842,det)
& varia(c842,con)
& sort(c843,na)
& card(c843,int1)
& etype(c843,int0)
& fact(c843,real)
& gener(c843,sp)
& quant(c843,one)
& refer(c843,indet)
& varia(c843,varia_c)
& sort(britisch__1_1,nq)
& sort(rover_0,fe) ),
file('/tmp/tmpJ8BP0O/sel_CSR115+39.p_1',ave07_era5_synth_qa07_007_mira_news_1241_a19984) ).
fof(62,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6] :
( agt(X4,X3)
& attr(X3,X2)
& attr(X5,X6)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& val(X2,bmw_0) ),
inference(assume_negation,[status(cth)],[60]) ).
fof(205,negated_conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ~ agt(X4,X3)
| ~ attr(X3,X2)
| ~ attr(X5,X6)
| ~ sub(X1,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ val(X2,bmw_0) ),
inference(fof_nnf,[status(thm)],[62]) ).
fof(206,negated_conjecture,
! [X7,X8,X9,X10,X11,X12] :
( ~ agt(X10,X9)
| ~ attr(X9,X8)
| ~ attr(X11,X12)
| ~ sub(X7,firma_1_1)
| ~ sub(X8,name_1_1)
| ~ val(X8,bmw_0) ),
inference(variable_rename,[status(thm)],[205]) ).
cnf(207,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,firma_1_1)
| ~ attr(X3,X4)
| ~ attr(X5,X1)
| ~ agt(X6,X5) ),
inference(split_conjunct,[status(thm)],[206]) ).
cnf(353,plain,
agt(c840,c788),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(358,plain,
val(c789,bmw_0),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(359,plain,
sub(c789,name_1_1),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(360,plain,
sub(c788,firma_1_1),
inference(split_conjunct,[status(thm)],[61]) ).
cnf(361,plain,
attr(c788,c789),
inference(split_conjunct,[status(thm)],[61]) ).
fof(455,plain,
( ~ epred1_0
<=> ! [X6,X5,X1] :
( ~ sub(X1,name_1_1)
| ~ agt(X6,X5)
| ~ attr(X5,X1)
| ~ val(X1,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(456,plain,
( epred1_0
| ~ sub(X1,name_1_1)
| ~ agt(X6,X5)
| ~ attr(X5,X1)
| ~ val(X1,bmw_0) ),
inference(split_equiv,[status(thm)],[455]) ).
fof(457,plain,
( ~ epred2_0
<=> ! [X4,X3] : ~ attr(X3,X4) ),
introduced(definition),
[split] ).
cnf(458,plain,
( epred2_0
| ~ attr(X3,X4) ),
inference(split_equiv,[status(thm)],[457]) ).
fof(459,plain,
( ~ epred3_0
<=> ! [X2] : ~ sub(X2,firma_1_1) ),
introduced(definition),
[split] ).
cnf(460,plain,
( epred3_0
| ~ sub(X2,firma_1_1) ),
inference(split_equiv,[status(thm)],[459]) ).
cnf(461,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[207,455,theory(equality)]),457,theory(equality)]),459,theory(equality)]),
[split] ).
cnf(478,plain,
epred2_0,
inference(spm,[status(thm)],[458,361,theory(equality)]) ).
cnf(481,plain,
epred3_0,
inference(spm,[status(thm)],[460,360,theory(equality)]) ).
cnf(485,negated_conjecture,
( $false
| ~ epred2_0
| ~ epred1_0 ),
inference(rw,[status(thm)],[461,481,theory(equality)]) ).
cnf(486,negated_conjecture,
( $false
| $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[485,478,theory(equality)]) ).
cnf(487,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[486,theory(equality)]) ).
cnf(488,negated_conjecture,
( ~ sub(X1,name_1_1)
| ~ agt(X6,X5)
| ~ attr(X5,X1)
| ~ val(X1,bmw_0) ),
inference(sr,[status(thm)],[456,487,theory(equality)]) ).
cnf(489,plain,
( ~ attr(X1,c789)
| ~ agt(X2,X1)
| ~ sub(c789,name_1_1) ),
inference(spm,[status(thm)],[488,358,theory(equality)]) ).
cnf(490,plain,
( ~ attr(X1,c789)
| ~ agt(X2,X1)
| $false ),
inference(rw,[status(thm)],[489,359,theory(equality)]) ).
cnf(491,plain,
( ~ attr(X1,c789)
| ~ agt(X2,X1) ),
inference(cn,[status(thm)],[490,theory(equality)]) ).
cnf(492,plain,
~ agt(X1,c788),
inference(spm,[status(thm)],[491,361,theory(equality)]) ).
cnf(495,plain,
$false,
inference(sr,[status(thm)],[353,492,theory(equality)]) ).
cnf(496,plain,
$false,
495,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR115+39.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpJ8BP0O/sel_CSR115+39.p_1 with time limit 29
% -prover status Theorem
% Problem CSR115+39.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR115+39.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR115+39.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
%
%------------------------------------------------------------------------------