TSTP Solution File: CSR115+21 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR115+21 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 07:37:28 EST 2010
% Result : Theorem 1.30s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 238 ( 0 equ)
% Maximal formula atoms : 135 ( 7 avg)
% Number of connectives : 273 ( 69 ~; 53 |; 148 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 135 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 27 ( 26 usr; 4 prp; 0-2 aty)
% Number of functors : 43 ( 43 usr; 43 con; 0-0 aty)
% Number of variables : 62 ( 16 sgn 21 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(62,axiom,
( attr(c5,c802)
& sub(c5,papier_1_1)
& aff(c537,c5)
& init(c537,c822)
& mannr(c537,enorm_1_1)
& rslt(c537,c821)
& subs(c537,gewinnen_1_2)
& attch(c717,c5)
& attr(c717,c718)
& sub(c717,k__344ufer_1_1)
& sub(c718,name_1_1)
& val(c718,bmw_0)
& sub(c802,wert_1_1)
& sub(c814,firma_1_1)
& agt(c816,c717)
& modl(c816,just_1_1)
& obj(c816,c814)
& reas(c816,c537)
& subs(c816,zulegen_1_1)
& arg1(c821,c802)
& subr(c821,val_0)
& arg1(c822,c802)
& subr(c822,val_0)
& sort(c5,s)
& card(c5,int1)
& etype(c5,int0)
& fact(c5,real)
& gener(c5,sp)
& quant(c5,one)
& refer(c5,det)
& varia(c5,con)
& sort(c802,io)
& sort(c802,oa)
& card(c802,int1)
& etype(c802,int0)
& fact(c802,real)
& gener(c802,gener_c)
& quant(c802,one)
& refer(c802,refer_c)
& varia(c802,varia_c)
& sort(papier_1_1,s)
& card(papier_1_1,int1)
& etype(papier_1_1,int0)
& fact(papier_1_1,real)
& gener(papier_1_1,ge)
& quant(papier_1_1,one)
& refer(papier_1_1,refer_c)
& varia(papier_1_1,varia_c)
& sort(c537,dn)
& fact(c537,real)
& gener(c537,sp)
& sort(c822,st)
& fact(c822,real)
& gener(c822,sp)
& sort(enorm_1_1,nq)
& sort(c821,st)
& fact(c821,real)
& gener(c821,sp)
& sort(gewinnen_1_2,dn)
& fact(gewinnen_1_2,real)
& gener(gewinnen_1_2,ge)
& sort(c717,d)
& sort(c717,io)
& card(c717,int1)
& etype(c717,int0)
& fact(c717,real)
& gener(c717,sp)
& quant(c717,one)
& refer(c717,det)
& varia(c717,con)
& sort(c718,na)
& card(c718,int1)
& etype(c718,int0)
& fact(c718,real)
& gener(c718,sp)
& quant(c718,one)
& refer(c718,indet)
& varia(c718,varia_c)
& sort(k__344ufer_1_1,d)
& sort(k__344ufer_1_1,io)
& card(k__344ufer_1_1,int1)
& etype(k__344ufer_1_1,int0)
& fact(k__344ufer_1_1,real)
& gener(k__344ufer_1_1,ge)
& quant(k__344ufer_1_1,one)
& refer(k__344ufer_1_1,refer_c)
& varia(k__344ufer_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(wert_1_1,io)
& sort(wert_1_1,oa)
& card(wert_1_1,int1)
& etype(wert_1_1,int0)
& fact(wert_1_1,real)
& gener(wert_1_1,ge)
& quant(wert_1_1,one)
& refer(wert_1_1,refer_c)
& varia(wert_1_1,varia_c)
& sort(c814,d)
& sort(c814,io)
& card(c814,int1)
& etype(c814,int0)
& fact(c814,real)
& gener(c814,sp)
& quant(c814,one)
& refer(c814,det)
& varia(c814,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(c816,da)
& fact(c816,real)
& gener(c816,sp)
& sort(just_1_1,md)
& fact(just_1_1,real)
& gener(just_1_1,gener_c)
& sort(zulegen_1_1,da)
& fact(zulegen_1_1,real)
& gener(zulegen_1_1,ge)
& sort(val_0,st)
& fact(val_0,real)
& gener(val_0,gener_c) ),
file('/tmp/tmposdZxX/sel_CSR115+21.p_1',ave07_era5_synth_qa07_007_mira_news_1144) ).
fof(63,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)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/tmp/tmposdZxX/sel_CSR115+21.p_1',synth_qa07_007_mira_news_1144) ).
fof(64,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)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[63]) ).
cnf(329,plain,
agt(c816,c717),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(332,plain,
val(c718,bmw_0),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(333,plain,
sub(c718,name_1_1),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(335,plain,
attr(c717,c718),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(343,plain,
attr(c5,c802),
inference(split_conjunct,[status(thm)],[62]) ).
fof(344,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)
| ~ val(X2,bmw_0)
| ~ val(X3,bmw_0) ),
inference(fof_nnf,[status(thm)],[64]) ).
fof(345,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)
| ~ val(X9,bmw_0)
| ~ val(X10,bmw_0) ),
inference(variable_rename,[status(thm)],[344]) ).
cnf(346,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ attr(X3,X4)
| ~ attr(X5,X1)
| ~ attr(X6,X2)
| ~ agt(X7,X5) ),
inference(split_conjunct,[status(thm)],[345]) ).
fof(429,plain,
( ~ epred1_0
<=> ! [X6,X2] :
( ~ sub(X2,name_1_1)
| ~ attr(X6,X2)
| ~ val(X2,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(430,plain,
( epred1_0
| ~ sub(X2,name_1_1)
| ~ attr(X6,X2)
| ~ val(X2,bmw_0) ),
inference(split_equiv,[status(thm)],[429]) ).
fof(431,plain,
( ~ epred2_0
<=> ! [X5,X7,X1] :
( ~ sub(X1,name_1_1)
| ~ agt(X7,X5)
| ~ attr(X5,X1)
| ~ val(X1,bmw_0) ) ),
introduced(definition),
[split] ).
cnf(432,plain,
( epred2_0
| ~ sub(X1,name_1_1)
| ~ agt(X7,X5)
| ~ attr(X5,X1)
| ~ val(X1,bmw_0) ),
inference(split_equiv,[status(thm)],[431]) ).
fof(433,plain,
( ~ epred3_0
<=> ! [X4,X3] : ~ attr(X3,X4) ),
introduced(definition),
[split] ).
cnf(434,plain,
( epred3_0
| ~ attr(X3,X4) ),
inference(split_equiv,[status(thm)],[433]) ).
cnf(435,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[346,429,theory(equality)]),431,theory(equality)]),433,theory(equality)]),
[split] ).
cnf(448,plain,
epred3_0,
inference(spm,[status(thm)],[434,343,theory(equality)]) ).
cnf(451,negated_conjecture,
( $false
| ~ epred2_0
| ~ epred1_0 ),
inference(rw,[status(thm)],[435,448,theory(equality)]) ).
cnf(452,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(cn,[status(thm)],[451,theory(equality)]) ).
cnf(453,plain,
( epred1_0
| ~ attr(X1,c718)
| ~ sub(c718,name_1_1) ),
inference(spm,[status(thm)],[430,332,theory(equality)]) ).
cnf(454,plain,
( epred1_0
| ~ attr(X1,c718)
| $false ),
inference(rw,[status(thm)],[453,333,theory(equality)]) ).
cnf(455,plain,
( epred1_0
| ~ attr(X1,c718) ),
inference(cn,[status(thm)],[454,theory(equality)]) ).
cnf(456,plain,
epred1_0,
inference(spm,[status(thm)],[455,335,theory(equality)]) ).
cnf(459,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[452,456,theory(equality)]) ).
cnf(460,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[459,theory(equality)]) ).
cnf(461,negated_conjecture,
( ~ sub(X1,name_1_1)
| ~ agt(X7,X5)
| ~ attr(X5,X1)
| ~ val(X1,bmw_0) ),
inference(sr,[status(thm)],[432,460,theory(equality)]) ).
cnf(462,plain,
( ~ attr(X1,c718)
| ~ agt(X2,X1)
| ~ sub(c718,name_1_1) ),
inference(spm,[status(thm)],[461,332,theory(equality)]) ).
cnf(463,plain,
( ~ attr(X1,c718)
| ~ agt(X2,X1)
| $false ),
inference(rw,[status(thm)],[462,333,theory(equality)]) ).
cnf(464,plain,
( ~ attr(X1,c718)
| ~ agt(X2,X1) ),
inference(cn,[status(thm)],[463,theory(equality)]) ).
cnf(465,plain,
~ agt(X1,c717),
inference(spm,[status(thm)],[464,335,theory(equality)]) ).
cnf(468,plain,
$false,
inference(sr,[status(thm)],[329,465,theory(equality)]) ).
cnf(469,plain,
$false,
468,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR115+21.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmposdZxX/sel_CSR115+21.p_1 with time limit 29
% -prover status Theorem
% Problem CSR115+21.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR115+21.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR115+21.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
%
%------------------------------------------------------------------------------