%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR113+31 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:15:01 EST 2010
% Result : Theorem 242.05s
% Output : CNFRefutation 242.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 14 unt; 0 def)
% Number of atoms : 315 ( 0 equ)
% Maximal formula atoms : 189 ( 7 avg)
% Number of connectives : 342 ( 70 ~; 57 |; 211 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 189 ( 9 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 3 prp; 0-3 aty)
% Number of functors : 53 ( 53 usr; 51 con; 0-3 aty)
% Number of variables : 81 ( 15 sgn 40 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(9,axiom,
! [X1,X2] : member(X1,cons(X1,X2)),
file('/tmp/tmpzttvYa/sel_CSR113+31.p_5',member_first) ).
fof(17,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/tmpzttvYa/sel_CSR113+31.p_5',attr_name__abk__374rzung_stehen_1_b_f__374r) ).
fof(33,axiom,
! [X1,X2,X3] :
( member(X1,X3)
=> member(X1,cons(X2,X3)) ),
file('/tmp/tmpzttvYa/sel_CSR113+31.p_5',member_second) ).
fof(125,axiom,
( agt(c4,c1)
& assoc(c4,aufmerksam_1_1)
& mcont(c4,c74)
& obj(c4,c74)
& ornt(c4,c70)
& subs(c4,hinweisen_1_1)
& attr(c70,c71)
& sub(c70,mensch_1_1)
& sub(c71,familiename_1_1)
& val(c71,jacob_0)
& mcont(c74,c97)
& pred(c74,strophe_1_1)
& sub(c79,freiheitsstatue_1_1)
& attch(c84,c79)
& attr(c84,c85)
& sub(c84,stadt__1_1)
& sub(c85,name_1_1)
& val(c85,new_york_0)
& attch(c86,c87)
& sub(c87,verfasserin_1_1)
& itms(c97,c79,c87)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& sub(freiheitsstatue_1_1,statue_1_1)
& sort(c4,da)
& fact(c4,real)
& gener(c4,sp)
& sort(c1,o)
& card(c1,int1)
& etype(c1,int0)
& fact(c1,real)
& gener(c1,sp)
& quant(c1,one)
& refer(c1,det)
& varia(c1,varia_c)
& sort(aufmerksam_1_1,nq)
& sort(c74,d)
& sort(c74,io)
& card(c74,cons(x_constant,cons(int1,nil)))
& etype(c74,int1)
& fact(c74,hypo)
& gener(c74,sp)
& quant(c74,mult)
& refer(c74,det)
& varia(c74,con)
& sort(c70,d)
& card(c70,int1)
& etype(c70,int0)
& fact(c70,real)
& gener(c70,sp)
& quant(c70,one)
& refer(c70,det)
& varia(c70,con)
& sort(hinweisen_1_1,da)
& fact(hinweisen_1_1,real)
& gener(hinweisen_1_1,ge)
& sort(c71,na)
& card(c71,int1)
& etype(c71,int0)
& fact(c71,real)
& gener(c71,sp)
& quant(c71,one)
& refer(c71,indet)
& varia(c71,varia_c)
& sort(mensch_1_1,d)
& card(mensch_1_1,int1)
& etype(mensch_1_1,int0)
& fact(mensch_1_1,real)
& gener(mensch_1_1,ge)
& quant(mensch_1_1,one)
& refer(mensch_1_1,refer_c)
& varia(mensch_1_1,varia_c)
& sort(familiename_1_1,na)
& card(familiename_1_1,int1)
& etype(familiename_1_1,int0)
& fact(familiename_1_1,real)
& gener(familiename_1_1,ge)
& quant(familiename_1_1,one)
& refer(familiename_1_1,refer_c)
& varia(familiename_1_1,varia_c)
& sort(jacob_0,fe)
& sort(c97,d)
& card(c97,int2)
& etype(c97,int1)
& fact(c97,hypo)
& gener(c97,sp)
& quant(c97,nfquant)
& refer(c97,det)
& varia(c97,con)
& sort(strophe_1_1,d)
& sort(strophe_1_1,io)
& card(strophe_1_1,int1)
& etype(strophe_1_1,int0)
& fact(strophe_1_1,real)
& gener(strophe_1_1,ge)
& quant(strophe_1_1,one)
& refer(strophe_1_1,refer_c)
& varia(strophe_1_1,varia_c)
& sort(c79,d)
& card(c79,int1)
& etype(c79,int0)
& fact(c79,real)
& gener(c79,sp)
& quant(c79,one)
& refer(c79,det)
& varia(c79,con)
& 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(c84,d)
& sort(c84,io)
& card(c84,int1)
& etype(c84,int0)
& fact(c84,real)
& gener(c84,sp)
& quant(c84,one)
& refer(c84,det)
& varia(c84,con)
& sort(c85,na)
& card(c85,int1)
& etype(c85,int0)
& fact(c85,real)
& gener(c85,sp)
& quant(c85,one)
& refer(c85,indet)
& varia(c85,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(c86,o)
& card(c86,int1)
& etype(c86,int0)
& fact(c86,real)
& gener(c86,sp)
& quant(c86,one)
& refer(c86,det)
& varia(c86,varia_c)
& sort(c87,d)
& card(c87,int1)
& etype(c87,int0)
& fact(c87,real)
& gener(c87,sp)
& quant(c87,one)
& refer(c87,det)
& varia(c87,varia_c)
& sort(verfasserin_1_1,d)
& card(verfasserin_1_1,int1)
& etype(verfasserin_1_1,int0)
& fact(verfasserin_1_1,real)
& gener(verfasserin_1_1,ge)
& quant(verfasserin_1_1,one)
& refer(verfasserin_1_1,refer_c)
& varia(verfasserin_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(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/tmpzttvYa/sel_CSR113+31.p_5',ave07_era5_synth_qa07_003_qw2_50_a19713) ).
fof(126,conjecture,
? [X1,X2,X3,X4] :
( attr(X2,X1)
& scar(X3,X4)
& sub(X1,name_1_1)
& val(X1,new_york_0) ),
file('/tmp/tmpzttvYa/sel_CSR113+31.p_5',synth_qa07_003_qw2_50_a19713) ).
fof(127,negated_conjecture,
~ ? [X1,X2,X3,X4] :
( attr(X2,X1)
& scar(X3,X4)
& sub(X1,name_1_1)
& val(X1,new_york_0) ),
inference(assume_negation,[status(cth)],[126]) ).
fof(170,plain,
! [X3,X4] : member(X3,cons(X3,X4)),
inference(variable_rename,[status(thm)],[9]) ).
cnf(171,plain,
member(X1,cons(X1,X2)),
inference(split_conjunct,[status(thm)],[170]) ).
fof(194,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)],[17]) ).
fof(195,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)],[194]) ).
fof(196,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)],[195]) ).
fof(197,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)],[196]) ).
cnf(199,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)],[197]) ).
fof(246,plain,
! [X1,X2,X3] :
( ~ member(X1,X3)
| member(X1,cons(X2,X3)) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(247,plain,
! [X4,X5,X6] :
( ~ member(X4,X6)
| member(X4,cons(X5,X6)) ),
inference(variable_rename,[status(thm)],[246]) ).
cnf(248,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[247]) ).
cnf(720,plain,
val(c85,new_york_0),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(721,plain,
sub(c85,name_1_1),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(723,plain,
attr(c84,c85),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(729,plain,
sub(c71,familiename_1_1),
inference(split_conjunct,[status(thm)],[125]) ).
cnf(731,plain,
attr(c70,c71),
inference(split_conjunct,[status(thm)],[125]) ).
fof(738,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ attr(X2,X1)
| ~ scar(X3,X4)
| ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ),
inference(fof_nnf,[status(thm)],[127]) ).
fof(739,negated_conjecture,
! [X5,X6,X7,X8] :
( ~ attr(X6,X5)
| ~ scar(X7,X8)
| ~ sub(X5,name_1_1)
| ~ val(X5,new_york_0) ),
inference(variable_rename,[status(thm)],[738]) ).
cnf(740,negated_conjecture,
( ~ val(X1,new_york_0)
| ~ sub(X1,name_1_1)
| ~ scar(X2,X3)
| ~ attr(X4,X1) ),
inference(split_conjunct,[status(thm)],[739]) ).
fof(812,plain,
( ~ epred1_0
<=> ! [X4,X1] :
( ~ attr(X4,X1)
| ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ) ),
introduced(definition),
[split] ).
cnf(813,plain,
( epred1_0
| ~ attr(X4,X1)
| ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ),
inference(split_equiv,[status(thm)],[812]) ).
fof(814,plain,
( ~ epred2_0
<=> ! [X3,X2] : ~ scar(X2,X3) ),
introduced(definition),
[split] ).
cnf(815,plain,
( epred2_0
| ~ scar(X2,X3) ),
inference(split_equiv,[status(thm)],[814]) ).
cnf(816,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[740,812,theory(equality)]),814,theory(equality)]),
[split] ).
cnf(1085,negated_conjecture,
( epred2_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)],[815,199,theory(equality)]) ).
cnf(1086,plain,
( epred1_0
| ~ sub(c85,name_1_1)
| ~ attr(X1,c85) ),
inference(spm,[status(thm)],[813,720,theory(equality)]) ).
cnf(1090,plain,
( epred1_0
| $false
| ~ attr(X1,c85) ),
inference(rw,[status(thm)],[1086,721,theory(equality)]) ).
cnf(1091,plain,
( epred1_0
| ~ attr(X1,c85) ),
inference(cn,[status(thm)],[1090,theory(equality)]) ).
cnf(1092,plain,
epred1_0,
inference(spm,[status(thm)],[1091,723,theory(equality)]) ).
cnf(1095,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[816,1092,theory(equality)]) ).
cnf(1096,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[1095,theory(equality)]) ).
cnf(1169,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)],[1085,1096,theory(equality)]) ).
cnf(1171,negated_conjecture,
( ~ sub(X2,X1)
| ~ attr(X3,X2)
| ~ member(X1,cons(familiename_1_1,cons(name_1_1,nil))) ),
inference(spm,[status(thm)],[1169,248,theory(equality)]) ).
cnf(1176,negated_conjecture,
( ~ sub(X1,familiename_1_1)
| ~ attr(X2,X1) ),
inference(spm,[status(thm)],[1171,171,theory(equality)]) ).
cnf(1178,plain,
~ sub(c71,familiename_1_1),
inference(spm,[status(thm)],[1176,731,theory(equality)]) ).
cnf(1182,plain,
$false,
inference(rw,[status(thm)],[1178,729,theory(equality)]) ).
cnf(1183,plain,
$false,
inference(cn,[status(thm)],[1182,theory(equality)]) ).
cnf(1184,plain,
$false,
1183,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR113+31.p
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpzttvYa/sel_CSR113+31.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpzttvYa/sel_CSR113+31.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/tmpzttvYa/sel_CSR113+31.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpzttvYa/sel_CSR113+31.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpzttvYa/sel_CSR113+31.p_5 with time limit 54
% -prover status Theorem
% Problem CSR113+31.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR113+31.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR113+31.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
%
%------------------------------------------------------------------------------