TSTP Solution File: CSR114+8 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR114+8 : 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:24:50 EST 2010
% Result : Theorem 241.19s
% Output : CNFRefutation 241.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 248 ( 0 equ)
% Maximal formula atoms : 106 ( 5 avg)
% Number of connectives : 285 ( 82 ~; 69 |; 130 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 106 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 3 prp; 0-3 aty)
% Number of functors : 46 ( 46 usr; 44 con; 0-3 aty)
% Number of variables : 84 ( 11 sgn 40 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2] : member(X1,cons(X1,X2)),
file('/tmp/tmp_NDwUA/sel_CSR114+8.p_5',member_first) ).
fof(37,axiom,
! [X1,X2,X3] :
( ( attr(X3,X1)
& member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
& sub(X1,X2) )
=> ? [X4] :
( mcont(X4,X3)
& obj(X4,X3)
& scar(X4,X3)
& subs(X4,stehen_1_b) ) ),
file('/tmp/tmp_NDwUA/sel_CSR114+8.p_5',attr_name__abk__374rzung_stehen_1_b_f__374r) ).
fof(56,axiom,
! [X1,X2,X3] :
( member(X1,X3)
=> member(X1,cons(X2,X3)) ),
file('/tmp/tmp_NDwUA/sel_CSR114+8.p_5',member_second) ).
fof(112,conjecture,
? [X1,X2,X3,X4] :
( attr(X1,X2)
& scar(X4,X3)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& val(X2,rom_0) ),
file('/tmp/tmp_NDwUA/sel_CSR114+8.p_5',synth_qa07_004_mira_news_550) ).
fof(113,axiom,
( attr(c11,c12)
& sub(c11,stadt__1_1)
& sub(c12,name_1_1)
& val(c12,rom_0)
& attr(c18,c19)
& attr(c18,c20)
& sub(c19,tag_1_1)
& val(c19,c16)
& sub(c20,monat_1_1)
& val(c20,c17)
& tupl(c59,c11,c18)
& sort(c11,d)
& sort(c11,io)
& card(c11,int1)
& etype(c11,int0)
& fact(c11,real)
& gener(c11,sp)
& quant(c11,one)
& refer(c11,det)
& varia(c11,con)
& sort(c12,na)
& card(c12,int1)
& etype(c12,int0)
& fact(c12,real)
& gener(c12,sp)
& quant(c12,one)
& refer(c12,indet)
& varia(c12,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(rom_0,fe)
& sort(c18,t)
& card(c18,int1)
& etype(c18,int0)
& fact(c18,real)
& gener(c18,sp)
& quant(c18,one)
& refer(c18,det)
& varia(c18,con)
& sort(c19,me)
& sort(c19,oa)
& sort(c19,ta)
& card(c19,card_c)
& etype(c19,etype_c)
& fact(c19,real)
& gener(c19,sp)
& quant(c19,quant_c)
& refer(c19,refer_c)
& varia(c19,varia_c)
& sort(c20,me)
& sort(c20,oa)
& sort(c20,ta)
& card(c20,card_c)
& etype(c20,etype_c)
& fact(c20,real)
& gener(c20,sp)
& quant(c20,quant_c)
& refer(c20,refer_c)
& varia(c20,varia_c)
& sort(tag_1_1,me)
& sort(tag_1_1,oa)
& sort(tag_1_1,ta)
& card(tag_1_1,card_c)
& etype(tag_1_1,etype_c)
& fact(tag_1_1,real)
& gener(tag_1_1,ge)
& quant(tag_1_1,quant_c)
& refer(tag_1_1,refer_c)
& varia(tag_1_1,varia_c)
& sort(c16,nu)
& card(c16,int6)
& sort(monat_1_1,me)
& sort(monat_1_1,oa)
& sort(monat_1_1,ta)
& card(monat_1_1,card_c)
& etype(monat_1_1,etype_c)
& fact(monat_1_1,real)
& gener(monat_1_1,ge)
& quant(monat_1_1,quant_c)
& refer(monat_1_1,refer_c)
& varia(monat_1_1,varia_c)
& sort(c17,nu)
& card(c17,int3)
& sort(c59,ent)
& card(c59,card_c)
& etype(c59,etype_c)
& fact(c59,real)
& gener(c59,gener_c)
& quant(c59,quant_c)
& refer(c59,refer_c)
& varia(c59,varia_c) ),
file('/tmp/tmp_NDwUA/sel_CSR114+8.p_5',ave07_era5_synth_qa07_004_mira_news_550) ).
fof(114,negated_conjecture,
~ ? [X1,X2,X3,X4] :
( attr(X1,X2)
& scar(X4,X3)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[112]) ).
fof(145,plain,
! [X3,X4] : member(X3,cons(X3,X4)),
inference(variable_rename,[status(thm)],[7]) ).
cnf(146,plain,
member(X1,cons(X1,X2)),
inference(split_conjunct,[status(thm)],[145]) ).
fof(224,plain,
! [X1,X2,X3] :
( ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X1,X2)
| ? [X4] :
( mcont(X4,X3)
& obj(X4,X3)
& scar(X4,X3)
& subs(X4,stehen_1_b) ) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(225,plain,
! [X5,X6,X7] :
( ~ attr(X7,X5)
| ~ member(X6,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X5,X6)
| ? [X8] :
( mcont(X8,X7)
& obj(X8,X7)
& scar(X8,X7)
& subs(X8,stehen_1_b) ) ),
inference(variable_rename,[status(thm)],[224]) ).
fof(226,plain,
! [X5,X6,X7] :
( ~ attr(X7,X5)
| ~ member(X6,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X5,X6)
| ( mcont(esk11_3(X5,X6,X7),X7)
& obj(esk11_3(X5,X6,X7),X7)
& scar(esk11_3(X5,X6,X7),X7)
& subs(esk11_3(X5,X6,X7),stehen_1_b) ) ),
inference(skolemize,[status(esa)],[225]) ).
fof(227,plain,
! [X5,X6,X7] :
( ( mcont(esk11_3(X5,X6,X7),X7)
| ~ attr(X7,X5)
| ~ member(X6,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X5,X6) )
& ( obj(esk11_3(X5,X6,X7),X7)
| ~ attr(X7,X5)
| ~ member(X6,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X5,X6) )
& ( scar(esk11_3(X5,X6,X7),X7)
| ~ attr(X7,X5)
| ~ member(X6,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X5,X6) )
& ( subs(esk11_3(X5,X6,X7),stehen_1_b)
| ~ attr(X7,X5)
| ~ member(X6,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X5,X6) ) ),
inference(distribute,[status(thm)],[226]) ).
cnf(229,plain,
( scar(esk11_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ attr(X3,X1) ),
inference(split_conjunct,[status(thm)],[227]) ).
fof(307,plain,
! [X1,X2,X3] :
( ~ member(X1,X3)
| member(X1,cons(X2,X3)) ),
inference(fof_nnf,[status(thm)],[56]) ).
fof(308,plain,
! [X4,X5,X6] :
( ~ member(X4,X6)
| member(X4,cons(X5,X6)) ),
inference(variable_rename,[status(thm)],[307]) ).
cnf(309,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[308]) ).
fof(486,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ attr(X1,X2)
| ~ scar(X4,X3)
| ~ sub(X2,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ val(X2,rom_0) ),
inference(fof_nnf,[status(thm)],[114]) ).
fof(487,negated_conjecture,
! [X5,X6,X7,X8] :
( ~ attr(X5,X6)
| ~ scar(X8,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X5,stadt__1_1)
| ~ val(X6,rom_0) ),
inference(variable_rename,[status(thm)],[486]) ).
cnf(488,negated_conjecture,
( ~ val(X1,rom_0)
| ~ sub(X2,stadt__1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X3,X4)
| ~ attr(X2,X1) ),
inference(split_conjunct,[status(thm)],[487]) ).
cnf(591,plain,
val(c12,rom_0),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(592,plain,
sub(c12,name_1_1),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(593,plain,
sub(c11,stadt__1_1),
inference(split_conjunct,[status(thm)],[113]) ).
cnf(594,plain,
attr(c11,c12),
inference(split_conjunct,[status(thm)],[113]) ).
fof(641,plain,
( ~ epred1_0
<=> ! [X2,X1] :
( ~ sub(X1,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ attr(X2,X1)
| ~ val(X1,rom_0) ) ),
introduced(definition),
[split] ).
cnf(642,plain,
( epred1_0
| ~ sub(X1,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ attr(X2,X1)
| ~ val(X1,rom_0) ),
inference(split_equiv,[status(thm)],[641]) ).
fof(643,plain,
( ~ epred2_0
<=> ! [X4,X3] : ~ scar(X3,X4) ),
introduced(definition),
[split] ).
cnf(644,plain,
( epred2_0
| ~ scar(X3,X4) ),
inference(split_equiv,[status(thm)],[643]) ).
cnf(645,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[488,641,theory(equality)]),643,theory(equality)]),
[split] ).
cnf(850,negated_conjecture,
( epred2_0
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[644,229,theory(equality)]) ).
cnf(851,plain,
( epred1_0
| ~ attr(X1,c12)
| ~ sub(c12,name_1_1)
| ~ sub(X1,stadt__1_1) ),
inference(spm,[status(thm)],[642,591,theory(equality)]) ).
cnf(854,plain,
( epred1_0
| ~ attr(X1,c12)
| $false
| ~ sub(X1,stadt__1_1) ),
inference(rw,[status(thm)],[851,592,theory(equality)]) ).
cnf(855,plain,
( epred1_0
| ~ attr(X1,c12)
| ~ sub(X1,stadt__1_1) ),
inference(cn,[status(thm)],[854,theory(equality)]) ).
cnf(857,plain,
( epred1_0
| ~ sub(c11,stadt__1_1) ),
inference(spm,[status(thm)],[855,594,theory(equality)]) ).
cnf(858,plain,
( epred1_0
| $false ),
inference(rw,[status(thm)],[857,593,theory(equality)]) ).
cnf(859,plain,
epred1_0,
inference(cn,[status(thm)],[858,theory(equality)]) ).
cnf(862,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[645,859,theory(equality)]) ).
cnf(863,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[862,theory(equality)]) ).
cnf(1031,negated_conjecture,
( ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X1,X2) ),
inference(sr,[status(thm)],[850,863,theory(equality)]) ).
cnf(1033,negated_conjecture,
( ~ attr(X1,X2)
| ~ sub(X2,X3)
| ~ member(X3,cons(familiename_1_1,cons(name_1_1,nil))) ),
inference(spm,[status(thm)],[1031,309,theory(equality)]) ).
cnf(1040,negated_conjecture,
( ~ attr(X1,X2)
| ~ sub(X2,X3)
| ~ member(X3,cons(name_1_1,nil)) ),
inference(spm,[status(thm)],[1033,309,theory(equality)]) ).
cnf(1046,negated_conjecture,
( ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[1040,146,theory(equality)]) ).
cnf(1048,plain,
~ sub(c12,name_1_1),
inference(spm,[status(thm)],[1046,594,theory(equality)]) ).
cnf(1053,plain,
$false,
inference(rw,[status(thm)],[1048,592,theory(equality)]) ).
cnf(1054,plain,
$false,
inference(cn,[status(thm)],[1053,theory(equality)]) ).
cnf(1055,plain,
$false,
1054,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR114+8.p
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp_NDwUA/sel_CSR114+8.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp_NDwUA/sel_CSR114+8.p_2 with time limit 80
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp_NDwUA/sel_CSR114+8.p_3 with time limit 74
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp_NDwUA/sel_CSR114+8.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmp_NDwUA/sel_CSR114+8.p_5 with time limit 54
% -prover status Theorem
% Problem CSR114+8.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR114+8.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR114+8.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
%
%------------------------------------------------------------------------------