TSTP Solution File: CSR113+15 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR113+15 : 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:09:18 EST 2010
% Result : Theorem 1.46s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 10 unt; 0 def)
% Number of atoms : 276 ( 0 equ)
% Maximal formula atoms : 152 ( 6 avg)
% Number of connectives : 305 ( 70 ~; 54 |; 177 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 152 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 28 ( 27 usr; 3 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 41 con; 0-2 aty)
% Number of variables : 75 ( 8 sgn 33 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(16,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/tmp/tmpgyEYVG/sel_CSR113+15.p_1',loc__stehen_1_1_loc) ).
fof(54,axiom,
! [X1,X2] :
( ( in(X1,X2)
| an(X1,X2)
| bei(X1,X2) )
=> flp(X1,X2) ),
file('/tmp/tmpgyEYVG/sel_CSR113+15.p_1',local_function___flp) ).
fof(71,conjecture,
? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& loc(X4,X1)
& scar(X4,X5)
& sub(X2,name_1_1)
& subs(X4,stehen_1_1)
& val(X2,new_york_0) ),
file('/tmp/tmpgyEYVG/sel_CSR113+15.p_1',synth_qa07_003_mira_wp_203_a19713) ).
fof(72,axiom,
( caus(c17,c43)
& sub(c17,gedanke_1_1)
& sub(c23,bootshafen_1_1)
& attch(c30,c23)
& attr(c30,c31)
& sub(c30,stadt__1_1)
& sub(c31,name_1_1)
& val(c31,new_york_0)
& sub(c32,freiheitsstatue_1_1)
& loc(c43,c79)
& rslt(c43,c32)
& subs(c43,errichten_1_1)
& agt(c75,c55)
& modl(c75,nicht_1_1)
& semrel(c75,c43)
& subs(c75,kommen_1_1)
& in(c79,c23)
& assoc(freiheitsstatue_1_1,freiheit_1_1)
& sub(freiheitsstatue_1_1,statue_1_1)
& sort(c17,as)
& sort(c17,io)
& card(c17,int1)
& etype(c17,int0)
& fact(c17,real)
& gener(c17,sp)
& quant(c17,one)
& refer(c17,det)
& varia(c17,con)
& sort(c43,da)
& fact(c43,real)
& gener(c43,sp)
& sort(gedanke_1_1,as)
& sort(gedanke_1_1,io)
& card(gedanke_1_1,int1)
& etype(gedanke_1_1,int0)
& fact(gedanke_1_1,real)
& gener(gedanke_1_1,ge)
& quant(gedanke_1_1,one)
& refer(gedanke_1_1,refer_c)
& varia(gedanke_1_1,varia_c)
& sort(c23,d)
& card(c23,int1)
& etype(c23,int0)
& fact(c23,real)
& gener(c23,sp)
& quant(c23,one)
& refer(c23,det)
& varia(c23,con)
& sort(bootshafen_1_1,d)
& card(bootshafen_1_1,int1)
& etype(bootshafen_1_1,int0)
& fact(bootshafen_1_1,real)
& gener(bootshafen_1_1,ge)
& quant(bootshafen_1_1,one)
& refer(bootshafen_1_1,refer_c)
& varia(bootshafen_1_1,varia_c)
& sort(c30,d)
& sort(c30,io)
& card(c30,int1)
& etype(c30,int0)
& fact(c30,real)
& gener(c30,sp)
& quant(c30,one)
& refer(c30,det)
& varia(c30,con)
& sort(c31,na)
& card(c31,int1)
& etype(c31,int0)
& fact(c31,real)
& gener(c31,sp)
& quant(c31,one)
& refer(c31,indet)
& varia(c31,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(c32,d)
& card(c32,int1)
& etype(c32,int0)
& fact(c32,real)
& gener(c32,sp)
& quant(c32,one)
& refer(c32,indet)
& varia(c32,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(c79,l)
& card(c79,int1)
& etype(c79,int0)
& fact(c79,real)
& gener(c79,sp)
& quant(c79,one)
& refer(c79,det)
& varia(c79,con)
& sort(errichten_1_1,da)
& fact(errichten_1_1,real)
& gener(errichten_1_1,ge)
& sort(c75,da)
& fact(c75,real)
& gener(c75,sp)
& sort(c55,d)
& card(c55,int1)
& etype(c55,int0)
& fact(c55,real)
& gener(c55,sp)
& quant(c55,one)
& refer(c55,det)
& varia(c55,varia_c)
& sort(nicht_1_1,md)
& fact(nicht_1_1,real)
& gener(nicht_1_1,gener_c)
& sort(kommen_1_1,da)
& fact(kommen_1_1,real)
& gener(kommen_1_1,ge)
& 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/tmpgyEYVG/sel_CSR113+15.p_1',ave07_era5_synth_qa07_003_mira_wp_203_a19713) ).
fof(73,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( flp(X1,X3)
& loc(X4,X1)
& scar(X4,X5)
& sub(X2,name_1_1)
& subs(X4,stehen_1_1)
& val(X2,new_york_0) ),
inference(assume_negation,[status(cth)],[71]) ).
fof(121,plain,
! [X1,X2] :
( ~ loc(X1,X2)
| ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(122,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ? [X6] :
( loc(X6,X5)
& scar(X6,X4)
& subs(X6,stehen_1_1) ) ),
inference(variable_rename,[status(thm)],[121]) ).
fof(123,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ( loc(esk3_2(X4,X5),X5)
& scar(esk3_2(X4,X5),X4)
& subs(esk3_2(X4,X5),stehen_1_1) ) ),
inference(skolemize,[status(esa)],[122]) ).
fof(124,plain,
! [X4,X5] :
( ( loc(esk3_2(X4,X5),X5)
| ~ loc(X4,X5) )
& ( scar(esk3_2(X4,X5),X4)
| ~ loc(X4,X5) )
& ( subs(esk3_2(X4,X5),stehen_1_1)
| ~ loc(X4,X5) ) ),
inference(distribute,[status(thm)],[123]) ).
cnf(125,plain,
( subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(126,plain,
( scar(esk3_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[124]) ).
cnf(127,plain,
( loc(esk3_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[124]) ).
fof(257,plain,
! [X1,X2] :
( ( ~ in(X1,X2)
& ~ an(X1,X2)
& ~ bei(X1,X2) )
| flp(X1,X2) ),
inference(fof_nnf,[status(thm)],[54]) ).
fof(258,plain,
! [X3,X4] :
( ( ~ in(X3,X4)
& ~ an(X3,X4)
& ~ bei(X3,X4) )
| flp(X3,X4) ),
inference(variable_rename,[status(thm)],[257]) ).
fof(259,plain,
! [X3,X4] :
( ( ~ in(X3,X4)
| flp(X3,X4) )
& ( ~ an(X3,X4)
| flp(X3,X4) )
& ( ~ bei(X3,X4)
| flp(X3,X4) ) ),
inference(distribute,[status(thm)],[258]) ).
cnf(262,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[259]) ).
fof(305,negated_conjecture,
! [X1,X2,X3,X4,X5] :
( ~ flp(X1,X3)
| ~ loc(X4,X1)
| ~ scar(X4,X5)
| ~ sub(X2,name_1_1)
| ~ subs(X4,stehen_1_1)
| ~ val(X2,new_york_0) ),
inference(fof_nnf,[status(thm)],[73]) ).
fof(306,negated_conjecture,
! [X6,X7,X8,X9,X10] :
( ~ flp(X6,X8)
| ~ loc(X9,X6)
| ~ scar(X9,X10)
| ~ sub(X7,name_1_1)
| ~ subs(X9,stehen_1_1)
| ~ val(X7,new_york_0) ),
inference(variable_rename,[status(thm)],[305]) ).
cnf(307,negated_conjecture,
( ~ val(X1,new_york_0)
| ~ subs(X2,stehen_1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X2,X3)
| ~ loc(X2,X4)
| ~ flp(X4,X5) ),
inference(split_conjunct,[status(thm)],[306]) ).
cnf(443,plain,
in(c79,c23),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(450,plain,
loc(c43,c79),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(452,plain,
val(c31,new_york_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(453,plain,
sub(c31,name_1_1),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(462,plain,
flp(c79,c23),
inference(spm,[status(thm)],[262,443,theory(equality)]) ).
fof(544,plain,
( ~ epred1_0
<=> ! [X5,X2,X3,X4] :
( ~ subs(X2,stehen_1_1)
| ~ loc(X2,X4)
| ~ scar(X2,X3)
| ~ flp(X4,X5) ) ),
introduced(definition),
[split] ).
cnf(545,plain,
( epred1_0
| ~ subs(X2,stehen_1_1)
| ~ loc(X2,X4)
| ~ scar(X2,X3)
| ~ flp(X4,X5) ),
inference(split_equiv,[status(thm)],[544]) ).
fof(546,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ) ),
introduced(definition),
[split] ).
cnf(547,plain,
( epred2_0
| ~ sub(X1,name_1_1)
| ~ val(X1,new_york_0) ),
inference(split_equiv,[status(thm)],[546]) ).
cnf(548,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[307,544,theory(equality)]),546,theory(equality)]),
[split] ).
cnf(615,plain,
( epred2_0
| ~ sub(c31,name_1_1) ),
inference(spm,[status(thm)],[547,452,theory(equality)]) ).
cnf(618,plain,
( epred2_0
| $false ),
inference(rw,[status(thm)],[615,453,theory(equality)]) ).
cnf(619,plain,
epred2_0,
inference(cn,[status(thm)],[618,theory(equality)]) ).
cnf(621,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[548,619,theory(equality)]) ).
cnf(622,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[621,theory(equality)]) ).
cnf(633,negated_conjecture,
( ~ subs(X2,stehen_1_1)
| ~ loc(X2,X4)
| ~ scar(X2,X3)
| ~ flp(X4,X5) ),
inference(sr,[status(thm)],[545,622,theory(equality)]) ).
cnf(634,plain,
( ~ scar(X1,X2)
| ~ loc(X1,c79)
| ~ subs(X1,stehen_1_1) ),
inference(spm,[status(thm)],[633,462,theory(equality)]) ).
cnf(635,plain,
( ~ loc(esk3_2(X1,X2),c79)
| ~ subs(esk3_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[634,126,theory(equality)]) ).
cnf(636,plain,
( ~ loc(esk3_2(X1,X2),c79)
| ~ loc(X1,X2) ),
inference(csr,[status(thm)],[635,125]) ).
cnf(637,plain,
~ loc(X1,c79),
inference(spm,[status(thm)],[636,127,theory(equality)]) ).
cnf(639,plain,
$false,
inference(sr,[status(thm)],[450,637,theory(equality)]) ).
cnf(640,plain,
$false,
639,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR113+15.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpgyEYVG/sel_CSR113+15.p_1 with time limit 29
% -prover status Theorem
% Problem CSR113+15.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR113+15.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR113+15.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
%
%------------------------------------------------------------------------------