TSTP Solution File: SEU430+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU430+2 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 : Sun Dec 26 09:16:04 EST 2010
% Result : Theorem 9.77s
% Output : CNFRefutation 9.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 7 unt; 0 def)
% Number of atoms : 139 ( 86 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 159 ( 62 ~; 60 |; 30 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 29 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(69,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/tmp/tmp0aC28T/sel_SEU430+2.p_1',redefinition_k5_setfam_1) ).
fof(1364,axiom,
! [X1] :
( ~ ( ? [X2] :
( X2 != k1_xboole_0
& r2_hidden(X2,X1) )
& k3_tarski(X1) = k1_xboole_0 )
& ~ ( k3_tarski(X1) != k1_xboole_0
& ! [X2] :
~ ( X2 != k1_xboole_0
& r2_hidden(X2,X1) ) ) ),
file('/tmp/tmp0aC28T/sel_SEU430+2.p_1',t91_orders_1) ).
fof(2110,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/tmp/tmp0aC28T/sel_SEU430+2.p_1',t30_relset_2) ).
fof(2157,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[2110]) ).
fof(2529,plain,
! [X1,X2] :
( ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
| k5_setfam_1(X1,X2) = k3_tarski(X2) ),
inference(fof_nnf,[status(thm)],[69]) ).
fof(2530,plain,
! [X3,X4] :
( ~ m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X3)))
| k5_setfam_1(X3,X4) = k3_tarski(X4) ),
inference(variable_rename,[status(thm)],[2529]) ).
cnf(2531,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
inference(split_conjunct,[status(thm)],[2530]) ).
fof(6589,plain,
! [X1] :
( ( ! [X2] :
( X2 = k1_xboole_0
| ~ r2_hidden(X2,X1) )
| k3_tarski(X1) != k1_xboole_0 )
& ( k3_tarski(X1) = k1_xboole_0
| ? [X2] :
( X2 != k1_xboole_0
& r2_hidden(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[1364]) ).
fof(6590,plain,
! [X3] :
( ( ! [X4] :
( X4 = k1_xboole_0
| ~ r2_hidden(X4,X3) )
| k3_tarski(X3) != k1_xboole_0 )
& ( k3_tarski(X3) = k1_xboole_0
| ? [X5] :
( X5 != k1_xboole_0
& r2_hidden(X5,X3) ) ) ),
inference(variable_rename,[status(thm)],[6589]) ).
fof(6591,plain,
! [X3] :
( ( ! [X4] :
( X4 = k1_xboole_0
| ~ r2_hidden(X4,X3) )
| k3_tarski(X3) != k1_xboole_0 )
& ( k3_tarski(X3) = k1_xboole_0
| ( esk222_1(X3) != k1_xboole_0
& r2_hidden(esk222_1(X3),X3) ) ) ),
inference(skolemize,[status(esa)],[6590]) ).
fof(6592,plain,
! [X3,X4] :
( ( X4 = k1_xboole_0
| ~ r2_hidden(X4,X3)
| k3_tarski(X3) != k1_xboole_0 )
& ( k3_tarski(X3) = k1_xboole_0
| ( esk222_1(X3) != k1_xboole_0
& r2_hidden(esk222_1(X3),X3) ) ) ),
inference(shift_quantors,[status(thm)],[6591]) ).
fof(6593,plain,
! [X3,X4] :
( ( X4 = k1_xboole_0
| ~ r2_hidden(X4,X3)
| k3_tarski(X3) != k1_xboole_0 )
& ( esk222_1(X3) != k1_xboole_0
| k3_tarski(X3) = k1_xboole_0 )
& ( r2_hidden(esk222_1(X3),X3)
| k3_tarski(X3) = k1_xboole_0 ) ),
inference(distribute,[status(thm)],[6592]) ).
cnf(6594,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk222_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[6593]) ).
cnf(6595,plain,
( k3_tarski(X1) = k1_xboole_0
| esk222_1(X1) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[6593]) ).
cnf(6596,plain,
( X2 = k1_xboole_0
| k3_tarski(X1) != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[6593]) ).
fof(8848,negated_conjecture,
? [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
& ( k5_setfam_1(X1,X2) != k1_xboole_0
| ? [X3] :
( r2_hidden(X3,X2)
& X3 != k1_xboole_0 ) )
& ( k5_setfam_1(X1,X2) = k1_xboole_0
| ! [X3] :
( ~ r2_hidden(X3,X2)
| X3 = k1_xboole_0 ) ) ),
inference(fof_nnf,[status(thm)],[2157]) ).
fof(8849,negated_conjecture,
? [X4,X5] :
( m1_subset_1(X5,k1_zfmisc_1(k1_zfmisc_1(X4)))
& ( k5_setfam_1(X4,X5) != k1_xboole_0
| ? [X6] :
( r2_hidden(X6,X5)
& X6 != k1_xboole_0 ) )
& ( k5_setfam_1(X4,X5) = k1_xboole_0
| ! [X7] :
( ~ r2_hidden(X7,X5)
| X7 = k1_xboole_0 ) ) ),
inference(variable_rename,[status(thm)],[8848]) ).
fof(8850,negated_conjecture,
( m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0)))
& ( k5_setfam_1(esk338_0,esk339_0) != k1_xboole_0
| ( r2_hidden(esk340_0,esk339_0)
& esk340_0 != k1_xboole_0 ) )
& ( k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0
| ! [X7] :
( ~ r2_hidden(X7,esk339_0)
| X7 = k1_xboole_0 ) ) ),
inference(skolemize,[status(esa)],[8849]) ).
fof(8851,negated_conjecture,
! [X7] :
( ( ~ r2_hidden(X7,esk339_0)
| X7 = k1_xboole_0
| k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0 )
& ( k5_setfam_1(esk338_0,esk339_0) != k1_xboole_0
| ( r2_hidden(esk340_0,esk339_0)
& esk340_0 != k1_xboole_0 ) )
& m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0))) ),
inference(shift_quantors,[status(thm)],[8850]) ).
fof(8852,negated_conjecture,
! [X7] :
( ( ~ r2_hidden(X7,esk339_0)
| X7 = k1_xboole_0
| k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0 )
& ( r2_hidden(esk340_0,esk339_0)
| k5_setfam_1(esk338_0,esk339_0) != k1_xboole_0 )
& ( esk340_0 != k1_xboole_0
| k5_setfam_1(esk338_0,esk339_0) != k1_xboole_0 )
& m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0))) ),
inference(distribute,[status(thm)],[8851]) ).
cnf(8853,negated_conjecture,
m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0))),
inference(split_conjunct,[status(thm)],[8852]) ).
cnf(8854,negated_conjecture,
( k5_setfam_1(esk338_0,esk339_0) != k1_xboole_0
| esk340_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[8852]) ).
cnf(8855,negated_conjecture,
( r2_hidden(esk340_0,esk339_0)
| k5_setfam_1(esk338_0,esk339_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[8852]) ).
cnf(8856,negated_conjecture,
( k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0
| X1 = k1_xboole_0
| ~ r2_hidden(X1,esk339_0) ),
inference(split_conjunct,[status(thm)],[8852]) ).
cnf(10279,negated_conjecture,
( k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0
| k1_xboole_0 = esk222_1(esk339_0)
| k3_tarski(esk339_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[8856,6594,theory(equality)]) ).
cnf(10649,negated_conjecture,
( k3_tarski(esk339_0) != k1_xboole_0
| esk340_0 != k1_xboole_0
| ~ m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0))) ),
inference(spm,[status(thm)],[8854,2531,theory(equality)]) ).
cnf(10650,negated_conjecture,
( r2_hidden(esk340_0,esk339_0)
| k3_tarski(esk339_0) != k1_xboole_0
| ~ m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0))) ),
inference(spm,[status(thm)],[8855,2531,theory(equality)]) ).
cnf(10652,negated_conjecture,
( k3_tarski(esk339_0) != k1_xboole_0
| esk340_0 != k1_xboole_0
| $false ),
inference(rw,[status(thm)],[10649,8853,theory(equality)]) ).
cnf(10653,negated_conjecture,
( k3_tarski(esk339_0) != k1_xboole_0
| esk340_0 != k1_xboole_0 ),
inference(cn,[status(thm)],[10652,theory(equality)]) ).
cnf(10654,negated_conjecture,
( r2_hidden(esk340_0,esk339_0)
| k3_tarski(esk339_0) != k1_xboole_0
| $false ),
inference(rw,[status(thm)],[10650,8853,theory(equality)]) ).
cnf(10655,negated_conjecture,
( r2_hidden(esk340_0,esk339_0)
| k3_tarski(esk339_0) != k1_xboole_0 ),
inference(cn,[status(thm)],[10654,theory(equality)]) ).
cnf(71233,negated_conjecture,
( k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0
| k3_tarski(esk339_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[10279,6595]) ).
cnf(71235,negated_conjecture,
( r2_hidden(esk340_0,esk339_0)
| k3_tarski(esk339_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[8855,71233,theory(equality)]) ).
cnf(71249,negated_conjecture,
r2_hidden(esk340_0,esk339_0),
inference(csr,[status(thm)],[71235,10655]) ).
cnf(71254,negated_conjecture,
( k1_xboole_0 = esk340_0
| k3_tarski(esk339_0) != k1_xboole_0 ),
inference(spm,[status(thm)],[6596,71249,theory(equality)]) ).
cnf(71332,negated_conjecture,
k3_tarski(esk339_0) != k1_xboole_0,
inference(csr,[status(thm)],[71254,10653]) ).
cnf(71333,negated_conjecture,
k5_setfam_1(esk338_0,esk339_0) = k1_xboole_0,
inference(sr,[status(thm)],[71233,71332,theory(equality)]) ).
cnf(71335,negated_conjecture,
( k1_xboole_0 = k3_tarski(esk339_0)
| ~ m1_subset_1(esk339_0,k1_zfmisc_1(k1_zfmisc_1(esk338_0))) ),
inference(spm,[status(thm)],[2531,71333,theory(equality)]) ).
cnf(71345,negated_conjecture,
( k1_xboole_0 = k3_tarski(esk339_0)
| $false ),
inference(rw,[status(thm)],[71335,8853,theory(equality)]) ).
cnf(71346,negated_conjecture,
k1_xboole_0 = k3_tarski(esk339_0),
inference(cn,[status(thm)],[71345,theory(equality)]) ).
cnf(71347,negated_conjecture,
$false,
inference(sr,[status(thm)],[71346,71332,theory(equality)]) ).
cnf(71348,negated_conjecture,
$false,
71347,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU430+2.p
% --creating new selector for [SET007+3.ax, SET007+0.ax, SET007+1.ax, SET007+2.ax, SET007+4.ax, SET007+6.ax, SET007+7.ax, SET007+8.ax, SET007+9.ax, SET007+10.ax, SET007+11.ax, SET007+13.ax, SET007+14.ax, SET007+16.ax, SET007+17.ax, SET007+18.ax, SET007+20.ax, SET007+22.ax, SET007+24.ax, SET007+26.ax, SET007+31.ax, SET007+35.ax, SET007+40.ax, SET007+48.ax, SET007+54.ax, SET007+55.ax, SET007+59.ax, SET007+60.ax, SET007+61.ax, SET007+64.ax, SET007+80.ax, SET007+117.ax, SET007+126.ax, SET007+188.ax, SET007+200.ax, SET007+210.ax, SET007+212.ax, SET007+213.ax, SET007+225.ax, SET007+363.ax, SET007+393.ax, SET007+441.ax]
% -running prover on /tmp/tmp0aC28T/sel_SEU430+2.p_1 with time limit 29
% -prover status Theorem
% Problem SEU430+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU430+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU430+2.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
%
%------------------------------------------------------------------------------