TSTP Solution File: CSR114+27 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR114+27 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:23:09 EST 2010
% Result : Theorem 1.40s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 242 ( 0 equ)
% Maximal formula atoms : 105 ( 6 avg)
% Number of connectives : 296 ( 89 ~; 76 |; 130 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 105 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 32 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 20 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/tmp/tmplXCnQ9/sel_CSR114+27.p_1',loc__stehen_1_1_loc) ).
fof(51,axiom,
( obj(c16,c21)
& subs(c16,aufnehmen_1_1)
& loc(c21,c35)
& sub(c21,konzert__1_1)
& loc(c25,c34)
& sub(c25,kolosseum_1_1)
& attr(c31,c32)
& sub(c31,stadt__1_1)
& sub(c32,name_1_1)
& val(c32,rom_0)
& in(c34,c31)
& in(c35,c25)
& sort(c16,dn)
& fact(c16,real)
& gener(c16,sp)
& sort(c21,ad)
& sort(c21,d)
& sort(c21,io)
& card(c21,int1)
& etype(c21,int0)
& fact(c21,real)
& gener(c21,sp)
& quant(c21,one)
& refer(c21,det)
& varia(c21,con)
& sort(aufnehmen_1_1,dn)
& fact(aufnehmen_1_1,real)
& gener(aufnehmen_1_1,ge)
& sort(c35,l)
& card(c35,int1)
& etype(c35,int0)
& fact(c35,real)
& gener(c35,sp)
& quant(c35,one)
& refer(c35,det)
& varia(c35,con)
& sort(konzert__1_1,ad)
& sort(konzert__1_1,d)
& sort(konzert__1_1,io)
& card(konzert__1_1,int1)
& etype(konzert__1_1,int0)
& fact(konzert__1_1,real)
& gener(konzert__1_1,ge)
& quant(konzert__1_1,one)
& refer(konzert__1_1,refer_c)
& varia(konzert__1_1,varia_c)
& sort(c25,d)
& card(c25,int1)
& etype(c25,int0)
& fact(c25,real)
& gener(c25,sp)
& quant(c25,one)
& refer(c25,det)
& varia(c25,con)
& sort(c34,l)
& card(c34,int1)
& etype(c34,int0)
& fact(c34,real)
& gener(c34,sp)
& quant(c34,one)
& refer(c34,det)
& varia(c34,con)
& sort(kolosseum_1_1,d)
& card(kolosseum_1_1,int1)
& etype(kolosseum_1_1,int0)
& fact(kolosseum_1_1,real)
& gener(kolosseum_1_1,sp)
& quant(kolosseum_1_1,one)
& refer(kolosseum_1_1,det)
& varia(kolosseum_1_1,con)
& sort(c31,d)
& sort(c31,io)
& card(c31,int1)
& etype(c31,int0)
& fact(c31,real)
& gener(c31,sp)
& quant(c31,one)
& refer(c31,det)
& varia(c31,con)
& sort(c32,na)
& card(c32,int1)
& etype(c32,int0)
& fact(c32,real)
& gener(c32,sp)
& quant(c32,one)
& refer(c32,indet)
& varia(c32,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) ),
file('/tmp/tmplXCnQ9/sel_CSR114+27.p_1',ave07_era5_synth_qa07_004_qapw_90) ).
fof(52,conjecture,
? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
file('/tmp/tmplXCnQ9/sel_CSR114+27.p_1',synth_qa07_004_qapw_90) ).
fof(53,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[52]) ).
fof(81,plain,
! [X1,X2] :
( ~ loc(X1,X2)
| ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(82,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ? [X6] :
( loc(X6,X5)
& scar(X6,X4)
& subs(X6,stehen_1_1) ) ),
inference(variable_rename,[status(thm)],[81]) ).
fof(83,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ( loc(esk2_2(X4,X5),X5)
& scar(esk2_2(X4,X5),X4)
& subs(esk2_2(X4,X5),stehen_1_1) ) ),
inference(skolemize,[status(esa)],[82]) ).
fof(84,plain,
! [X4,X5] :
( ( loc(esk2_2(X4,X5),X5)
| ~ loc(X4,X5) )
& ( scar(esk2_2(X4,X5),X4)
| ~ loc(X4,X5) )
& ( subs(esk2_2(X4,X5),stehen_1_1)
| ~ loc(X4,X5) ) ),
inference(distribute,[status(thm)],[83]) ).
cnf(85,plain,
( subs(esk2_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[84]) ).
cnf(86,plain,
( scar(esk2_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[84]) ).
cnf(87,plain,
( loc(esk2_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[84]) ).
cnf(279,plain,
in(c34,c31),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(280,plain,
val(c32,rom_0),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(281,plain,
sub(c32,name_1_1),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(282,plain,
sub(c31,stadt__1_1),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(283,plain,
attr(c31,c32),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(284,plain,
sub(c25,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(285,plain,
loc(c25,c34),
inference(split_conjunct,[status(thm)],[51]) ).
fof(290,negated_conjecture,
! [X1,X2,X3,X4,X5] :
( ~ in(X3,X1)
| ~ attr(X1,X2)
| ~ loc(X5,X3)
| ~ scar(X5,X4)
| ~ sub(X2,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ subs(X5,stehen_1_1)
| ~ val(X2,rom_0) ),
inference(fof_nnf,[status(thm)],[53]) ).
fof(291,negated_conjecture,
! [X6,X7,X8,X9,X10] :
( ~ in(X8,X6)
| ~ attr(X6,X7)
| ~ loc(X10,X8)
| ~ scar(X10,X9)
| ~ sub(X7,name_1_1)
| ~ sub(X6,stadt__1_1)
| ~ sub(X9,kolosseum_1_1)
| ~ subs(X10,stehen_1_1)
| ~ val(X7,rom_0) ),
inference(variable_rename,[status(thm)],[290]) ).
cnf(292,negated_conjecture,
( ~ val(X1,rom_0)
| ~ subs(X2,stehen_1_1)
| ~ sub(X3,kolosseum_1_1)
| ~ sub(X4,stadt__1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X2,X3)
| ~ loc(X2,X5)
| ~ attr(X4,X1)
| ~ in(X5,X4) ),
inference(split_conjunct,[status(thm)],[291]) ).
cnf(359,plain,
( ~ sub(X1,stadt__1_1)
| ~ sub(X2,kolosseum_1_1)
| ~ sub(c32,name_1_1)
| ~ attr(X1,c32)
| ~ in(X3,X1)
| ~ scar(X4,X2)
| ~ loc(X4,X3)
| ~ subs(X4,stehen_1_1) ),
inference(spm,[status(thm)],[292,280,theory(equality)]) ).
cnf(362,plain,
( ~ sub(X1,stadt__1_1)
| ~ sub(X2,kolosseum_1_1)
| $false
| ~ attr(X1,c32)
| ~ in(X3,X1)
| ~ scar(X4,X2)
| ~ loc(X4,X3)
| ~ subs(X4,stehen_1_1) ),
inference(rw,[status(thm)],[359,281,theory(equality)]) ).
cnf(363,plain,
( ~ sub(X1,stadt__1_1)
| ~ sub(X2,kolosseum_1_1)
| ~ attr(X1,c32)
| ~ in(X3,X1)
| ~ scar(X4,X2)
| ~ loc(X4,X3)
| ~ subs(X4,stehen_1_1) ),
inference(cn,[status(thm)],[362,theory(equality)]) ).
cnf(365,plain,
( ~ sub(c31,stadt__1_1)
| ~ sub(X1,kolosseum_1_1)
| ~ in(X2,c31)
| ~ scar(X3,X1)
| ~ loc(X3,X2)
| ~ subs(X3,stehen_1_1) ),
inference(spm,[status(thm)],[363,283,theory(equality)]) ).
cnf(366,plain,
( $false
| ~ sub(X1,kolosseum_1_1)
| ~ in(X2,c31)
| ~ scar(X3,X1)
| ~ loc(X3,X2)
| ~ subs(X3,stehen_1_1) ),
inference(rw,[status(thm)],[365,282,theory(equality)]) ).
cnf(367,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ in(X2,c31)
| ~ scar(X3,X1)
| ~ loc(X3,X2)
| ~ subs(X3,stehen_1_1) ),
inference(cn,[status(thm)],[366,theory(equality)]) ).
cnf(368,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ scar(X2,X1)
| ~ loc(X2,c34)
| ~ subs(X2,stehen_1_1) ),
inference(spm,[status(thm)],[367,279,theory(equality)]) ).
cnf(369,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(esk2_2(X1,X2),c34)
| ~ subs(esk2_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[368,86,theory(equality)]) ).
cnf(370,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(esk2_2(X1,X2),c34)
| ~ loc(X1,X2) ),
inference(csr,[status(thm)],[369,85]) ).
cnf(371,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(X1,c34) ),
inference(spm,[status(thm)],[370,87,theory(equality)]) ).
cnf(376,plain,
~ loc(c25,c34),
inference(spm,[status(thm)],[371,284,theory(equality)]) ).
cnf(378,plain,
$false,
inference(rw,[status(thm)],[376,285,theory(equality)]) ).
cnf(379,plain,
$false,
inference(cn,[status(thm)],[378,theory(equality)]) ).
cnf(380,plain,
$false,
379,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR114+27.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmplXCnQ9/sel_CSR114+27.p_1 with time limit 29
% -prover status Theorem
% Problem CSR114+27.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR114+27.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR114+27.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
%
%------------------------------------------------------------------------------