TSTP Solution File: CSR114+21 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR114+21 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:22:04 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 : 212 ( 0 equ)
% Maximal formula atoms : 74 ( 6 avg)
% Number of connectives : 265 ( 88 ~; 77 |; 99 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 74 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 28 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 20 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(13,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/tmp/tmpeiar10/sel_CSR114+21.p_1',loc__stehen_1_1_loc) ).
fof(49,axiom,
( attr(c12,c13)
& sub(c12,stadt__1_1)
& sub(c13,name_1_1)
& val(c13,rom_0)
& aff(c19,c5)
& subs(c19,restaurieren_1_1)
& in(c30,c12)
& loc(c5,c30)
& sub(c5,kolosseum_1_1)
& sort(c12,d)
& sort(c12,io)
& card(c12,int1)
& etype(c12,int0)
& fact(c12,real)
& gener(c12,sp)
& quant(c12,one)
& refer(c12,det)
& varia(c12,con)
& sort(c13,na)
& card(c13,int1)
& etype(c13,int0)
& fact(c13,real)
& gener(c13,sp)
& quant(c13,one)
& refer(c13,indet)
& varia(c13,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)
& sort(c19,da)
& fact(c19,real)
& gener(c19,sp)
& sort(c5,d)
& card(c5,int1)
& etype(c5,int0)
& fact(c5,real)
& gener(c5,sp)
& quant(c5,one)
& refer(c5,det)
& varia(c5,con)
& sort(restaurieren_1_1,da)
& fact(restaurieren_1_1,real)
& gener(restaurieren_1_1,ge)
& sort(c30,l)
& card(c30,int1)
& etype(c30,int0)
& fact(c30,real)
& gener(c30,sp)
& quant(c30,one)
& refer(c30,det)
& varia(c30,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) ),
file('/tmp/tmpeiar10/sel_CSR114+21.p_1',ave07_era5_synth_qa07_004_qapn_68) ).
fof(50,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/tmpeiar10/sel_CSR114+21.p_1',synth_qa07_004_qapn_68) ).
fof(51,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)],[50]) ).
fof(83,plain,
! [X1,X2] :
( ~ loc(X1,X2)
| ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(84,plain,
! [X4,X5] :
( ~ loc(X4,X5)
| ? [X6] :
( loc(X6,X5)
& scar(X6,X4)
& subs(X6,stehen_1_1) ) ),
inference(variable_rename,[status(thm)],[83]) ).
fof(85,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)],[84]) ).
fof(86,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)],[85]) ).
cnf(87,plain,
( subs(esk2_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(88,plain,
( scar(esk2_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(89,plain,
( loc(esk2_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[86]) ).
cnf(246,plain,
sub(c5,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(247,plain,
loc(c5,c30),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(248,plain,
in(c30,c12),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(251,plain,
val(c13,rom_0),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(252,plain,
sub(c13,name_1_1),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(253,plain,
sub(c12,stadt__1_1),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(254,plain,
attr(c12,c13),
inference(split_conjunct,[status(thm)],[49]) ).
fof(255,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)],[51]) ).
fof(256,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)],[255]) ).
cnf(257,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)],[256]) ).
cnf(315,plain,
( ~ sub(X1,stadt__1_1)
| ~ sub(X2,kolosseum_1_1)
| ~ sub(c13,name_1_1)
| ~ attr(X1,c13)
| ~ in(X3,X1)
| ~ scar(X4,X2)
| ~ loc(X4,X3)
| ~ subs(X4,stehen_1_1) ),
inference(spm,[status(thm)],[257,251,theory(equality)]) ).
cnf(318,plain,
( ~ sub(X1,stadt__1_1)
| ~ sub(X2,kolosseum_1_1)
| $false
| ~ attr(X1,c13)
| ~ in(X3,X1)
| ~ scar(X4,X2)
| ~ loc(X4,X3)
| ~ subs(X4,stehen_1_1) ),
inference(rw,[status(thm)],[315,252,theory(equality)]) ).
cnf(319,plain,
( ~ sub(X1,stadt__1_1)
| ~ sub(X2,kolosseum_1_1)
| ~ attr(X1,c13)
| ~ in(X3,X1)
| ~ scar(X4,X2)
| ~ loc(X4,X3)
| ~ subs(X4,stehen_1_1) ),
inference(cn,[status(thm)],[318,theory(equality)]) ).
cnf(320,plain,
( ~ sub(c12,stadt__1_1)
| ~ sub(X1,kolosseum_1_1)
| ~ attr(c12,c13)
| ~ scar(X2,X1)
| ~ loc(X2,c30)
| ~ subs(X2,stehen_1_1) ),
inference(spm,[status(thm)],[319,248,theory(equality)]) ).
cnf(323,plain,
( $false
| ~ sub(X1,kolosseum_1_1)
| ~ attr(c12,c13)
| ~ scar(X2,X1)
| ~ loc(X2,c30)
| ~ subs(X2,stehen_1_1) ),
inference(rw,[status(thm)],[320,253,theory(equality)]) ).
cnf(324,plain,
( $false
| ~ sub(X1,kolosseum_1_1)
| $false
| ~ scar(X2,X1)
| ~ loc(X2,c30)
| ~ subs(X2,stehen_1_1) ),
inference(rw,[status(thm)],[323,254,theory(equality)]) ).
cnf(325,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ scar(X2,X1)
| ~ loc(X2,c30)
| ~ subs(X2,stehen_1_1) ),
inference(cn,[status(thm)],[324,theory(equality)]) ).
cnf(326,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(esk2_2(X1,X2),c30)
| ~ subs(esk2_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[325,88,theory(equality)]) ).
cnf(331,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(esk2_2(X1,X2),c30)
| ~ loc(X1,X2) ),
inference(csr,[status(thm)],[326,87]) ).
cnf(332,plain,
( ~ sub(X1,kolosseum_1_1)
| ~ loc(X1,c30) ),
inference(spm,[status(thm)],[331,89,theory(equality)]) ).
cnf(333,plain,
~ loc(c5,c30),
inference(spm,[status(thm)],[332,246,theory(equality)]) ).
cnf(335,plain,
$false,
inference(rw,[status(thm)],[333,247,theory(equality)]) ).
cnf(336,plain,
$false,
inference(cn,[status(thm)],[335,theory(equality)]) ).
cnf(337,plain,
$false,
336,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR114+21.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpeiar10/sel_CSR114+21.p_1 with time limit 29
% -prover status Theorem
% Problem CSR114+21.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR114+21.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR114+21.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
%
%------------------------------------------------------------------------------