TSTP Solution File: CSR114+13 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR114+13 : 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:19:49 EST 2010
% Result : Theorem 241.11s
% Output : CNFRefutation 241.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 312 ( 0 equ)
% Maximal formula atoms : 135 ( 6 avg)
% Number of connectives : 355 ( 91 ~; 78 |; 182 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 135 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 3 prp; 0-5 aty)
% Number of functors : 51 ( 51 usr; 46 con; 0-3 aty)
% Number of variables : 99 ( 12 sgn 40 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1,X2,X3] :
( ( prop(X1,X2)
& state_adjective_state_binding(X2,X3) )
=> ? [X4,X5,X6] :
( in(X6,X4)
& attr(X4,X5)
& loc(X1,X6)
& sub(X4,land_1_1)
& sub(X5,name_1_1)
& val(X5,X3) ) ),
file('/tmp/tmp3skX8t/sel_CSR114+13.p_5',state_adjective__in_state) ).
fof(23,axiom,
state_adjective_state_binding(italienisch__1_1,italien_0),
file('/tmp/tmp3skX8t/sel_CSR114+13.p_5',fact_8886) ).
fof(74,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/tmp/tmp3skX8t/sel_CSR114+13.p_5',loc__stehen_1_1_loc) ).
fof(96,axiom,
( attr(c112,c113)
& sub(c112,gebietsinstitution_1_1)
& sub(c113,name_1_1)
& val(c113,ponza_0)
& prop(c117,beliebt_1_1)
& sub(c117,ferienziel_1_1)
& pred(c123,tourist_1_1)
& prop(c123,italienisch__1_1)
& attr(c136,c137)
& sub(c136,stadt__1_1)
& sub(c137,name_1_1)
& val(c137,rom_0)
& tupl_p5(c694,c112,c117,c123,c136)
& assoc(ferienziel_1_1,ferien__1_1)
& sub(ferienziel_1_1,ziel_1_1)
& sort(c112,d)
& sort(c112,io)
& card(c112,int1)
& etype(c112,int0)
& fact(c112,real)
& gener(c112,sp)
& quant(c112,one)
& refer(c112,det)
& varia(c112,con)
& sort(c113,na)
& card(c113,int1)
& etype(c113,int0)
& fact(c113,real)
& gener(c113,sp)
& quant(c113,one)
& refer(c113,indet)
& varia(c113,varia_c)
& sort(gebietsinstitution_1_1,d)
& sort(gebietsinstitution_1_1,io)
& card(gebietsinstitution_1_1,int1)
& etype(gebietsinstitution_1_1,int0)
& fact(gebietsinstitution_1_1,real)
& gener(gebietsinstitution_1_1,ge)
& quant(gebietsinstitution_1_1,one)
& refer(gebietsinstitution_1_1,refer_c)
& varia(gebietsinstitution_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(ponza_0,fe)
& sort(c117,io)
& card(c117,int1)
& etype(c117,int0)
& fact(c117,real)
& gener(c117,sp)
& quant(c117,one)
& refer(c117,indet)
& varia(c117,varia_c)
& sort(beliebt_1_1,nq)
& sort(ferienziel_1_1,io)
& card(ferienziel_1_1,int1)
& etype(ferienziel_1_1,int0)
& fact(ferienziel_1_1,real)
& gener(ferienziel_1_1,ge)
& quant(ferienziel_1_1,one)
& refer(ferienziel_1_1,refer_c)
& varia(ferienziel_1_1,varia_c)
& sort(c123,d)
& card(c123,cons(x_constant,cons(int1,nil)))
& etype(c123,int1)
& fact(c123,real)
& gener(c123,gener_c)
& quant(c123,mult)
& refer(c123,refer_c)
& varia(c123,varia_c)
& sort(tourist_1_1,d)
& card(tourist_1_1,int1)
& etype(tourist_1_1,int0)
& fact(tourist_1_1,real)
& gener(tourist_1_1,ge)
& quant(tourist_1_1,one)
& refer(tourist_1_1,refer_c)
& varia(tourist_1_1,varia_c)
& sort(italienisch__1_1,nq)
& sort(c136,d)
& sort(c136,io)
& card(c136,int1)
& etype(c136,int0)
& fact(c136,real)
& gener(c136,sp)
& quant(c136,one)
& refer(c136,det)
& varia(c136,con)
& sort(c137,na)
& card(c137,int1)
& etype(c137,int0)
& fact(c137,real)
& gener(c137,sp)
& quant(c137,one)
& refer(c137,indet)
& varia(c137,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(rom_0,fe)
& sort(c694,ent)
& card(c694,card_c)
& etype(c694,etype_c)
& fact(c694,real)
& gener(c694,gener_c)
& quant(c694,quant_c)
& refer(c694,refer_c)
& varia(c694,varia_c)
& sort(ferien__1_1,as)
& card(ferien__1_1,int1)
& etype(ferien__1_1,int0)
& fact(ferien__1_1,real)
& gener(ferien__1_1,ge)
& quant(ferien__1_1,one)
& refer(ferien__1_1,refer_c)
& varia(ferien__1_1,varia_c)
& sort(ziel_1_1,io)
& card(ziel_1_1,int1)
& etype(ziel_1_1,int0)
& fact(ziel_1_1,real)
& gener(ziel_1_1,ge)
& quant(ziel_1_1,one)
& refer(ziel_1_1,refer_c)
& varia(ziel_1_1,varia_c) ),
file('/tmp/tmp3skX8t/sel_CSR114+13.p_5',ave07_era5_synth_qa07_004_mira_wp_311) ).
fof(97,conjecture,
? [X1,X2,X3,X4,X5] :
( attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
file('/tmp/tmp3skX8t/sel_CSR114+13.p_5',synth_qa07_004_mira_wp_311) ).
fof(98,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[97]) ).
fof(112,plain,
! [X1,X2,X3] :
( ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3)
| ? [X4,X5,X6] :
( in(X6,X4)
& attr(X4,X5)
& loc(X1,X6)
& sub(X4,land_1_1)
& sub(X5,name_1_1)
& val(X5,X3) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(113,plain,
! [X7,X8,X9] :
( ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9)
| ? [X10,X11,X12] :
( in(X12,X10)
& attr(X10,X11)
& loc(X7,X12)
& sub(X10,land_1_1)
& sub(X11,name_1_1)
& val(X11,X9) ) ),
inference(variable_rename,[status(thm)],[112]) ).
fof(114,plain,
! [X7,X8,X9] :
( ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9)
| ( in(esk3_3(X7,X8,X9),esk1_3(X7,X8,X9))
& attr(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9))
& loc(X7,esk3_3(X7,X8,X9))
& sub(esk1_3(X7,X8,X9),land_1_1)
& sub(esk2_3(X7,X8,X9),name_1_1)
& val(esk2_3(X7,X8,X9),X9) ) ),
inference(skolemize,[status(esa)],[113]) ).
fof(115,plain,
! [X7,X8,X9] :
( ( in(esk3_3(X7,X8,X9),esk1_3(X7,X8,X9))
| ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9) )
& ( attr(esk1_3(X7,X8,X9),esk2_3(X7,X8,X9))
| ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9) )
& ( loc(X7,esk3_3(X7,X8,X9))
| ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9) )
& ( sub(esk1_3(X7,X8,X9),land_1_1)
| ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9) )
& ( sub(esk2_3(X7,X8,X9),name_1_1)
| ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9) )
& ( val(esk2_3(X7,X8,X9),X9)
| ~ prop(X7,X8)
| ~ state_adjective_state_binding(X8,X9) ) ),
inference(distribute,[status(thm)],[114]) ).
cnf(119,plain,
( loc(X3,esk3_3(X3,X1,X2))
| ~ state_adjective_state_binding(X1,X2)
| ~ prop(X3,X1) ),
inference(split_conjunct,[status(thm)],[115]) ).
cnf(164,plain,
state_adjective_state_binding(italienisch__1_1,italien_0),
inference(split_conjunct,[status(thm)],[23]) ).
fof(304,plain,
! [X1,X2] :
( ~ loc(X1,X2)
| ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
inference(fof_nnf,[status(thm)],[74]) ).
fof(305,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ? [X6] :
( loc(X6,X5)
& scar(X6,X4)
& subs(X6,stehen_1_1) ) ),
inference(variable_rename,[status(thm)],[304]) ).
fof(306,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ( loc(esk12_2(X4,X5),X5)
& scar(esk12_2(X4,X5),X4)
& subs(esk12_2(X4,X5),stehen_1_1) ) ),
inference(skolemize,[status(esa)],[305]) ).
fof(307,plain,
! [X4,X5] :
( ( loc(esk12_2(X4,X5),X5)
| ~ loc(X4,X5) )
& ( scar(esk12_2(X4,X5),X4)
| ~ loc(X4,X5) )
& ( subs(esk12_2(X4,X5),stehen_1_1)
| ~ loc(X4,X5) ) ),
inference(distribute,[status(thm)],[306]) ).
cnf(308,plain,
( subs(esk12_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[307]) ).
cnf(309,plain,
( scar(esk12_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[307]) ).
cnf(310,plain,
( loc(esk12_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[307]) ).
cnf(491,plain,
val(c137,rom_0),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(492,plain,
sub(c137,name_1_1),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(493,plain,
sub(c136,stadt__1_1),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(494,plain,
attr(c136,c137),
inference(split_conjunct,[status(thm)],[96]) ).
cnf(495,plain,
prop(c123,italienisch__1_1),
inference(split_conjunct,[status(thm)],[96]) ).
fof(503,negated_conjecture,
! [X1,X2,X3,X4,X5] :
( ~ attr(X1,X2)
| ~ loc(X5,X3)
| ~ scar(X5,X4)
| ~ sub(X2,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ subs(X5,stehen_1_1)
| ~ val(X2,rom_0) ),
inference(fof_nnf,[status(thm)],[98]) ).
fof(504,negated_conjecture,
! [X6,X7,X8,X9,X10] :
( ~ attr(X6,X7)
| ~ loc(X10,X8)
| ~ scar(X10,X9)
| ~ sub(X7,name_1_1)
| ~ sub(X6,stadt__1_1)
| ~ subs(X10,stehen_1_1)
| ~ val(X7,rom_0) ),
inference(variable_rename,[status(thm)],[503]) ).
cnf(505,negated_conjecture,
( ~ val(X1,rom_0)
| ~ subs(X2,stehen_1_1)
| ~ sub(X3,stadt__1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X2,X4)
| ~ loc(X2,X5)
| ~ attr(X3,X1) ),
inference(split_conjunct,[status(thm)],[504]) ).
fof(684,plain,
( ~ epred1_0
<=> ! [X3,X1] :
( ~ sub(X1,name_1_1)
| ~ sub(X3,stadt__1_1)
| ~ attr(X3,X1)
| ~ val(X1,rom_0) ) ),
introduced(definition),
[split] ).
cnf(685,plain,
( epred1_0
| ~ sub(X1,name_1_1)
| ~ sub(X3,stadt__1_1)
| ~ attr(X3,X1)
| ~ val(X1,rom_0) ),
inference(split_equiv,[status(thm)],[684]) ).
fof(686,plain,
( ~ epred2_0
<=> ! [X5,X4,X2] :
( ~ subs(X2,stehen_1_1)
| ~ scar(X2,X4)
| ~ loc(X2,X5) ) ),
introduced(definition),
[split] ).
cnf(687,plain,
( epred2_0
| ~ subs(X2,stehen_1_1)
| ~ scar(X2,X4)
| ~ loc(X2,X5) ),
inference(split_equiv,[status(thm)],[686]) ).
cnf(688,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[505,684,theory(equality)]),686,theory(equality)]),
[split] ).
cnf(723,negated_conjecture,
( epred2_0
| ~ scar(esk12_2(X1,X2),X3)
| ~ subs(esk12_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[687,310,theory(equality)]) ).
cnf(726,plain,
( epred1_0
| ~ attr(X1,c137)
| ~ sub(c137,name_1_1)
| ~ sub(X1,stadt__1_1) ),
inference(spm,[status(thm)],[685,491,theory(equality)]) ).
cnf(729,plain,
( epred1_0
| ~ attr(X1,c137)
| $false
| ~ sub(X1,stadt__1_1) ),
inference(rw,[status(thm)],[726,492,theory(equality)]) ).
cnf(730,plain,
( epred1_0
| ~ attr(X1,c137)
| ~ sub(X1,stadt__1_1) ),
inference(cn,[status(thm)],[729,theory(equality)]) ).
cnf(731,plain,
( epred1_0
| ~ sub(c136,stadt__1_1) ),
inference(spm,[status(thm)],[730,494,theory(equality)]) ).
cnf(732,plain,
( epred1_0
| $false ),
inference(rw,[status(thm)],[731,493,theory(equality)]) ).
cnf(733,plain,
epred1_0,
inference(cn,[status(thm)],[732,theory(equality)]) ).
cnf(736,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[688,733,theory(equality)]) ).
cnf(737,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[736,theory(equality)]) ).
cnf(738,negated_conjecture,
( ~ scar(esk12_2(X1,X2),X3)
| ~ subs(esk12_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(sr,[status(thm)],[723,737,theory(equality)]) ).
cnf(739,negated_conjecture,
( ~ loc(X1,X2)
| ~ scar(esk12_2(X1,X2),X3) ),
inference(csr,[status(thm)],[738,308]) ).
cnf(740,negated_conjecture,
~ loc(X1,X2),
inference(spm,[status(thm)],[739,309,theory(equality)]) ).
cnf(742,negated_conjecture,
( ~ state_adjective_state_binding(X2,X3)
| ~ prop(X1,X2) ),
inference(spm,[status(thm)],[740,119,theory(equality)]) ).
cnf(744,negated_conjecture,
~ prop(X1,italienisch__1_1),
inference(spm,[status(thm)],[742,164,theory(equality)]) ).
cnf(745,plain,
$false,
inference(sr,[status(thm)],[495,744,theory(equality)]) ).
cnf(746,plain,
$false,
745,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR114+13.p
% --creating new selector for [CSR004+0.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp3skX8t/sel_CSR114+13.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp3skX8t/sel_CSR114+13.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/tmp3skX8t/sel_CSR114+13.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/tmp3skX8t/sel_CSR114+13.p_4 with time limit 55
% -prover status ResourceOut
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmp3skX8t/sel_CSR114+13.p_5 with time limit 54
% -prover status Theorem
% Problem CSR114+13.p solved in phase 4.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR114+13.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR114+13.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
%
%------------------------------------------------------------------------------