TSTP Solution File: CSR114+16 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : CSR114+16 : 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:21:03 EST 2010
% Result : Theorem 1.44s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 174 ( 0 equ)
% Maximal formula atoms : 108 ( 6 avg)
% Number of connectives : 191 ( 44 ~; 30 |; 115 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 108 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 3 prp; 0-2 aty)
% Number of functors : 40 ( 40 usr; 40 con; 0-0 aty)
% Number of variables : 33 ( 4 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(57,conjecture,
? [X1,X2,X3,X4] :
( attr(X1,X2)
& scar(X4,X3)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& val(X2,rom_0) ),
file('/tmp/tmpZ0PbcI/sel_CSR114+16.p_1',synth_qa07_004_mw3_158) ).
fof(58,axiom,
( obj(c657,c660)
& scar(c657,c43)
& subs(c657,haben_1_1)
& pred(c660,bewohner__1_1)
& assoc(c672,c814)
& scar(c672,c43)
& semrel(c672,c657)
& sspe(c672,c819)
& subs(c672,geh__366ren_1_1)
& sub(c814,provinz_1_1)
& attr(c819,c820)
& sub(c819,stadt__1_1)
& sub(c820,name_1_1)
& val(c820,rom_0)
& sort(c657,st)
& fact(c657,real)
& gener(c657,sp)
& sort(c660,d)
& card(c660,int35895)
& etype(c660,int1)
& fact(c660,real)
& gener(c660,sp)
& quant(c660,nfquant)
& refer(c660,indet)
& varia(c660,varia_c)
& sort(c43,abs)
& sort(c43,co)
& sort(c43,io)
& sort(c43,mo)
& sort(c43,ta)
& sort(c43,re)
& card(c43,card_c)
& etype(c43,etype_c)
& fact(c43,real)
& gener(c43,sp)
& quant(c43,quant_c)
& refer(c43,det)
& varia(c43,varia_c)
& sort(haben_1_1,st)
& fact(haben_1_1,real)
& gener(haben_1_1,ge)
& sort(bewohner__1_1,d)
& card(bewohner__1_1,int1)
& etype(bewohner__1_1,int0)
& fact(bewohner__1_1,real)
& gener(bewohner__1_1,ge)
& quant(bewohner__1_1,one)
& refer(bewohner__1_1,refer_c)
& varia(bewohner__1_1,varia_c)
& sort(c672,st)
& fact(c672,real)
& gener(c672,sp)
& sort(c814,d)
& sort(c814,io)
& card(c814,int1)
& etype(c814,int0)
& fact(c814,real)
& gener(c814,sp)
& quant(c814,one)
& refer(c814,det)
& varia(c814,con)
& sort(c819,d)
& sort(c819,io)
& card(c819,int1)
& etype(c819,int0)
& fact(c819,real)
& gener(c819,sp)
& quant(c819,one)
& refer(c819,det)
& varia(c819,con)
& sort(geh__366ren_1_1,st)
& fact(geh__366ren_1_1,real)
& gener(geh__366ren_1_1,ge)
& sort(provinz_1_1,d)
& sort(provinz_1_1,io)
& card(provinz_1_1,int1)
& etype(provinz_1_1,int0)
& fact(provinz_1_1,real)
& gener(provinz_1_1,ge)
& quant(provinz_1_1,one)
& refer(provinz_1_1,refer_c)
& varia(provinz_1_1,varia_c)
& sort(c820,na)
& card(c820,int1)
& etype(c820,int0)
& fact(c820,real)
& gener(c820,sp)
& quant(c820,one)
& refer(c820,indet)
& varia(c820,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/tmpZ0PbcI/sel_CSR114+16.p_1',ave07_era5_synth_qa07_004_mw3_158) ).
fof(59,negated_conjecture,
~ ? [X1,X2,X3,X4] :
( attr(X1,X2)
& scar(X4,X3)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[57]) ).
fof(206,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ attr(X1,X2)
| ~ scar(X4,X3)
| ~ sub(X2,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ val(X2,rom_0) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(207,negated_conjecture,
! [X5,X6,X7,X8] :
( ~ attr(X5,X6)
| ~ scar(X8,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X5,stadt__1_1)
| ~ val(X6,rom_0) ),
inference(variable_rename,[status(thm)],[206]) ).
cnf(208,negated_conjecture,
( ~ val(X1,rom_0)
| ~ sub(X2,stadt__1_1)
| ~ sub(X1,name_1_1)
| ~ scar(X3,X4)
| ~ attr(X2,X1) ),
inference(split_conjunct,[status(thm)],[207]) ).
cnf(303,plain,
val(c820,rom_0),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(304,plain,
sub(c820,name_1_1),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(305,plain,
sub(c819,stadt__1_1),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(306,plain,
attr(c819,c820),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(315,plain,
scar(c657,c43),
inference(split_conjunct,[status(thm)],[58]) ).
fof(352,plain,
( ~ epred1_0
<=> ! [X4,X3] : ~ scar(X3,X4) ),
introduced(definition),
[split] ).
cnf(353,plain,
( epred1_0
| ~ scar(X3,X4) ),
inference(split_equiv,[status(thm)],[352]) ).
fof(354,plain,
( ~ epred2_0
<=> ! [X2,X1] :
( ~ attr(X2,X1)
| ~ sub(X1,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X1,rom_0) ) ),
introduced(definition),
[split] ).
cnf(355,plain,
( epred2_0
| ~ attr(X2,X1)
| ~ sub(X1,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X1,rom_0) ),
inference(split_equiv,[status(thm)],[354]) ).
cnf(356,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[208,352,theory(equality)]),354,theory(equality)]),
[split] ).
cnf(426,plain,
epred1_0,
inference(spm,[status(thm)],[353,315,theory(equality)]) ).
cnf(429,negated_conjecture,
( ~ epred2_0
| $false ),
inference(rw,[status(thm)],[356,426,theory(equality)]) ).
cnf(430,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[429,theory(equality)]) ).
cnf(431,negated_conjecture,
( ~ attr(X2,X1)
| ~ sub(X1,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X1,rom_0) ),
inference(sr,[status(thm)],[355,430,theory(equality)]) ).
cnf(432,plain,
( ~ sub(c820,name_1_1)
| ~ sub(X1,stadt__1_1)
| ~ attr(X1,c820) ),
inference(spm,[status(thm)],[431,303,theory(equality)]) ).
cnf(435,plain,
( $false
| ~ sub(X1,stadt__1_1)
| ~ attr(X1,c820) ),
inference(rw,[status(thm)],[432,304,theory(equality)]) ).
cnf(436,plain,
( ~ sub(X1,stadt__1_1)
| ~ attr(X1,c820) ),
inference(cn,[status(thm)],[435,theory(equality)]) ).
cnf(437,plain,
~ sub(c819,stadt__1_1),
inference(spm,[status(thm)],[436,306,theory(equality)]) ).
cnf(438,plain,
$false,
inference(rw,[status(thm)],[437,305,theory(equality)]) ).
cnf(439,plain,
$false,
inference(cn,[status(thm)],[438,theory(equality)]) ).
cnf(440,plain,
$false,
439,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/CSR/CSR114+16.p
% --creating new selector for [CSR004+0.ax]
% -running prover on /tmp/tmpZ0PbcI/sel_CSR114+16.p_1 with time limit 29
% -prover status Theorem
% Problem CSR114+16.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR114+16.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR114+16.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
%
%------------------------------------------------------------------------------