TSTP Solution File: CSR113+20 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR113+20 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:10:07 EST 2010
% Result : Theorem 241.14s
% Output : CNFRefutation 241.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 14 unt; 0 def)
% Number of atoms : 310 ( 0 equ)
% Maximal formula atoms : 177 ( 6 avg)
% Number of connectives : 339 ( 76 ~; 59 |; 199 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 177 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 32 ( 31 usr; 4 prp; 0-2 aty)
% Number of functors : 53 ( 53 usr; 51 con; 0-3 aty)
% Number of variables : 88 ( 15 sgn 43 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(10,axiom,
! [X1,X2] : member(X1,cons(X1,X2)),
file('/tmp/tmpUjE0Wy/sel_CSR113+20.p_5',member_first) ).
fof(42,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/tmpUjE0Wy/sel_CSR113+20.p_5',attr_name__abk__374rzung_stehen_1_b_f__374r) ).
fof(65,axiom,
! [X1,X2,X3] :
( member(X1,X3)
=> member(X1,cons(X2,X3)) ),
file('/tmp/tmpUjE0Wy/sel_CSR113+20.p_5',member_second) ).
fof(123,conjecture,
? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& scar(X4,X5)
& sub(X2,name_1_1)
& val(X2,new_york_0) ),
file('/tmp/tmpUjE0Wy/sel_CSR113+20.p_5',synth_qa07_003_mira_wp_231_a19713) ).
fof(124,axiom,
( attr(c2595,c2596)
& sub(c2595,stadt__1_1)
& sub(c2596,name_1_1)
& val(c2596,new_york_0)
& pred(c2599,mauskewitz_1_1)
& sub(c3439,bord_1_1)
& mcont(c3446,c3575)
& mexp(c3446,c2599)
& obj(c3446,c3558)
& semrel(c3446,c7)
& subs(c3446,ansehen_2_3)
& poss(c3558,c3569)
& sub(c3558,freiheitsstatue_1_1)
& sspe(c3563,c3569)
& subs(c3563,verhei__337ung_1_1)
& sub(c3569,freiheit_1_1)
& arg1(c3575,c3558)
& arg2(c3575,c3563)
& subr(c3575,rprs_0)
& flp(c3577,c3439)
& obj(c7,c2599)
& origl(c7,c3577)
& ornt(c7,c2595)
& subs(c7,gehen_1_2)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& sub(freiheitsstatue_1_1,statue_1_1)
& sort(c2595,d)
& sort(c2595,io)
& card(c2595,int1)
& etype(c2595,int0)
& fact(c2595,real)
& gener(c2595,sp)
& quant(c2595,one)
& refer(c2595,det)
& varia(c2595,con)
& sort(c2596,na)
& card(c2596,int1)
& etype(c2596,int0)
& fact(c2596,real)
& gener(c2596,sp)
& quant(c2596,one)
& refer(c2596,indet)
& varia(c2596,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(new_york_0,fe)
& sort(c2599,o)
& card(c2599,cons(x_constant,cons(int1,nil)))
& etype(c2599,int1)
& fact(c2599,real)
& gener(c2599,sp)
& quant(c2599,mult)
& refer(c2599,det)
& varia(c2599,con)
& sort(mauskewitz_1_1,o)
& card(mauskewitz_1_1,int1)
& etype(mauskewitz_1_1,int0)
& fact(mauskewitz_1_1,real)
& gener(mauskewitz_1_1,ge)
& quant(mauskewitz_1_1,one)
& refer(mauskewitz_1_1,refer_c)
& varia(mauskewitz_1_1,varia_c)
& sort(c3439,d)
& card(c3439,int1)
& etype(c3439,int0)
& fact(c3439,real)
& gener(c3439,sp)
& quant(c3439,one)
& refer(c3439,refer_c)
& varia(c3439,varia_c)
& sort(bord_1_1,d)
& card(bord_1_1,int1)
& etype(bord_1_1,int0)
& fact(bord_1_1,real)
& gener(bord_1_1,ge)
& quant(bord_1_1,one)
& refer(bord_1_1,refer_c)
& varia(bord_1_1,varia_c)
& sort(c3446,st)
& fact(c3446,real)
& gener(c3446,sp)
& sort(c3575,st)
& fact(c3575,hypo)
& gener(c3575,sp)
& sort(c3558,d)
& card(c3558,int1)
& etype(c3558,int0)
& fact(c3558,real)
& gener(c3558,sp)
& quant(c3558,one)
& refer(c3558,det)
& varia(c3558,con)
& sort(c7,dn)
& fact(c7,real)
& gener(c7,sp)
& sort(ansehen_2_3,st)
& fact(ansehen_2_3,real)
& gener(ansehen_2_3,ge)
& sort(c3569,as)
& sort(c3569,io)
& card(c3569,int1)
& etype(c3569,int0)
& fact(c3569,real)
& gener(c3569,sp)
& quant(c3569,one)
& refer(c3569,det)
& varia(c3569,varia_c)
& sort(freiheitsstatue_1_1,d)
& card(freiheitsstatue_1_1,int1)
& etype(freiheitsstatue_1_1,int0)
& fact(freiheitsstatue_1_1,real)
& gener(freiheitsstatue_1_1,ge)
& quant(freiheitsstatue_1_1,one)
& refer(freiheitsstatue_1_1,refer_c)
& varia(freiheitsstatue_1_1,varia_c)
& sort(c3563,as)
& card(c3563,int1)
& etype(c3563,int0)
& fact(c3563,real)
& gener(c3563,sp)
& quant(c3563,one)
& refer(c3563,det)
& varia(c3563,varia_c)
& sort(verhei__337ung_1_1,as)
& card(verhei__337ung_1_1,int1)
& etype(verhei__337ung_1_1,int0)
& fact(verhei__337ung_1_1,real)
& gener(verhei__337ung_1_1,ge)
& quant(verhei__337ung_1_1,one)
& refer(verhei__337ung_1_1,refer_c)
& varia(verhei__337ung_1_1,varia_c)
& sort(freiheit_1_1,as)
& sort(freiheit_1_1,io)
& card(freiheit_1_1,int1)
& etype(freiheit_1_1,int0)
& fact(freiheit_1_1,real)
& gener(freiheit_1_1,ge)
& quant(freiheit_1_1,one)
& refer(freiheit_1_1,refer_c)
& varia(freiheit_1_1,varia_c)
& sort(rprs_0,st)
& fact(rprs_0,real)
& gener(rprs_0,gener_c)
& sort(c3577,l)
& card(c3577,int1)
& etype(c3577,int0)
& fact(c3577,real)
& gener(c3577,sp)
& quant(c3577,one)
& refer(c3577,refer_c)
& varia(c3577,varia_c)
& sort(gehen_1_2,dn)
& fact(gehen_1_2,real)
& gener(gehen_1_2,ge)
& sort(statue_1_1,d)
& card(statue_1_1,int1)
& etype(statue_1_1,int0)
& fact(statue_1_1,real)
& gener(statue_1_1,ge)
& quant(statue_1_1,one)
& refer(statue_1_1,refer_c)
& varia(statue_1_1,varia_c) ),
file('/tmp/tmpUjE0Wy/sel_CSR113+20.p_5',ave07_era5_synth_qa07_003_mira_wp_231_a19713) ).
fof(125,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& scar(X4,X5)
& sub(X2,name_1_1)
& val(X2,new_york_0) ),
inference(assume_negation,[status(cth)],[123]) ).
fof(169,plain,
! [X3,X4] : member(X3,cons(X3,X4)),
inference(variable_rename,[status(thm)],[10]) ).
cnf(170,plain,
member(X1,cons(X1,X2)),
inference(split_conjunct,[status(thm)],[169]) ).
fof(259,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)],[42]) ).
fof(260,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)],[259]) ).
fof(261,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(esk15_3(X5,X6,X7),X7)
& obj(esk15_3(X5,X6,X7),X7)
& scar(esk15_3(X5,X6,X7),X7)
& subs(esk15_3(X5,X6,X7),stehen_1_b) ) ),
inference(skolemize,[status(esa)],[260]) ).
fof(262,plain,
! [X5,X6,X7] :
( ( mcont(esk15_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(esk15_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(esk15_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(esk15_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)],[261]) ).
cnf(264,plain,
( scar(esk15_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)],[262]) ).
fof(363,plain,
! [X1,X2,X3] :
( ~ member(X1,X3)
| member(X1,cons(X2,X3)) ),
inference(fof_nnf,[status(thm)],[65]) ).
fof(364,plain,
! [X4,X5,X6] :
( ~ member(X4,X6)
| member(X4,cons(X5,X6)) ),
inference(variable_rename,[status(thm)],[363]) ).
cnf(365,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[364]) ).
fof(557,negated_conjecture,
! [X1,X2,X3,X4,X5] :
( ~ flp(X1,X3)
| ~ scar(X4,X5)
| ~ sub(X2,name_1_1)
| ~ val(X2,new_york_0) ),
inference(fof_nnf,[status(thm)],[125]) ).
fof(558,negated_conjecture,
! [X6,X7,X8,X9,X10] :
( ~ flp(X6,X8)
| ~ scar(X9,X10)
| ~ sub(X7,name_1_1)
| ~ val(X7,new_york_0) ),
inference(variable_rename,[status(thm)],[557]) ).
cnf(559,negated_conjecture,
( ~ val(X1,new_york_0)
| ~ sub(X1,name_1_1)
| ~ scar(X2,X3)
| ~ flp(X4,X5) ),
inference(split_conjunct,[status(thm)],[558]) ).
cnf(717,plain,
flp(c3577,c3439),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(733,plain,
val(c2596,new_york_0),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(734,plain,
sub(c2596,name_1_1),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(736,plain,
attr(c2595,c2596),
inference(split_conjunct,[status(thm)],[124]) ).
fof(795,plain,
( ~ epred1_0
<=> ! [X5,X4] : ~ flp(X4,X5) ),
introduced(definition),
[split] ).
cnf(796,plain,
( epred1_0
| ~ flp(X4,X5) ),
inference(split_equiv,[status(thm)],[795]) ).
fof(797,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ) ),
introduced(definition),
[split] ).
cnf(798,plain,
( epred2_0
| ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ),
inference(split_equiv,[status(thm)],[797]) ).
fof(799,plain,
( ~ epred3_0
<=> ! [X3,X2] : ~ scar(X2,X3) ),
introduced(definition),
[split] ).
cnf(800,plain,
( epred3_0
| ~ scar(X2,X3) ),
inference(split_equiv,[status(thm)],[799]) ).
cnf(801,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[559,795,theory(equality)]),797,theory(equality)]),799,theory(equality)]),
[split] ).
cnf(1065,plain,
epred1_0,
inference(spm,[status(thm)],[796,717,theory(equality)]) ).
cnf(1074,negated_conjecture,
( epred3_0
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X1,X2)
| ~ attr(X3,X1) ),
inference(spm,[status(thm)],[800,264,theory(equality)]) ).
cnf(1075,negated_conjecture,
( ~ epred3_0
| ~ epred2_0
| $false ),
inference(rw,[status(thm)],[801,1065,theory(equality)]) ).
cnf(1076,negated_conjecture,
( ~ epred3_0
| ~ epred2_0 ),
inference(cn,[status(thm)],[1075,theory(equality)]) ).
cnf(1077,plain,
( epred2_0
| ~ sub(c2596,name_1_1) ),
inference(spm,[status(thm)],[798,733,theory(equality)]) ).
cnf(1081,plain,
( epred2_0
| $false ),
inference(rw,[status(thm)],[1077,734,theory(equality)]) ).
cnf(1082,plain,
epred2_0,
inference(cn,[status(thm)],[1081,theory(equality)]) ).
cnf(1084,negated_conjecture,
( ~ epred3_0
| $false ),
inference(rw,[status(thm)],[1076,1082,theory(equality)]) ).
cnf(1085,negated_conjecture,
~ epred3_0,
inference(cn,[status(thm)],[1084,theory(equality)]) ).
cnf(1289,negated_conjecture,
( ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ sub(X1,X2)
| ~ attr(X3,X1) ),
inference(sr,[status(thm)],[1074,1085,theory(equality)]) ).
cnf(1291,negated_conjecture,
( ~ sub(X2,X1)
| ~ attr(X3,X2)
| ~ member(X1,cons(familiename_1_1,cons(name_1_1,nil))) ),
inference(spm,[status(thm)],[1289,365,theory(equality)]) ).
cnf(1299,negated_conjecture,
( ~ sub(X2,X1)
| ~ attr(X3,X2)
| ~ member(X1,cons(name_1_1,nil)) ),
inference(spm,[status(thm)],[1291,365,theory(equality)]) ).
cnf(1303,negated_conjecture,
( ~ sub(X1,name_1_1)
| ~ attr(X2,X1) ),
inference(spm,[status(thm)],[1299,170,theory(equality)]) ).
cnf(1305,plain,
~ sub(c2596,name_1_1),
inference(spm,[status(thm)],[1303,736,theory(equality)]) ).
cnf(1308,plain,
$false,
inference(rw,[status(thm)],[1305,734,theory(equality)]) ).
cnf(1309,plain,
$false,
inference(cn,[status(thm)],[1308,theory(equality)]) ).
cnf(1310,plain,
$false,
1309,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR113+20.p
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpUjE0Wy/sel_CSR113+20.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpUjE0Wy/sel_CSR113+20.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/tmpUjE0Wy/sel_CSR113+20.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/tmpUjE0Wy/sel_CSR113+20.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpUjE0Wy/sel_CSR113+20.p_5 with time limit 54
% -prover status Theorem
% Problem CSR113+20.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR113+20.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR113+20.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
%
%------------------------------------------------------------------------------