TSTP Solution File: SEU408+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU408+2 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 26 08:35:27 EST 2010
% Result : Theorem 74.26s
% Output : CNFRefutation 74.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 236 ( 36 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 289 ( 101 ~; 85 |; 87 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 88 ( 2 sgn 55 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(189,axiom,
! [X1,X2,X3] :
( ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3)) )
=> m1_subset_1(X1,X3) ),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',t4_subset) ).
fof(402,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',commutativity_k2_xboole_0) ).
fof(533,axiom,
! [X1,X2] : r1_tarski(X1,k2_xboole_0(X1,X2)),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',t7_xboole_1) ).
fof(548,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',t3_subset) ).
fof(654,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( v1_orders_2(X3)
& l1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
& u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2))) ) ) ) ) ),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',d2_latsum_1) ).
fof(657,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& l1_orders_2(X2) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',dt_k1_latsum_1) ).
fof(667,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
file('/tmp/tmp51gS_K/sel_SEU408+2.p_2',t11_latsum_1) ).
fof(669,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(assume_negation,[status(cth)],[667]) ).
fof(744,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(fof_simplification,[status(thm)],[669,theory(equality)]) ).
fof(1603,plain,
! [X1,X2,X3] :
( ~ r2_hidden(X1,X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(X3))
| m1_subset_1(X1,X3) ),
inference(fof_nnf,[status(thm)],[189]) ).
fof(1604,plain,
! [X4,X5,X6] :
( ~ r2_hidden(X4,X5)
| ~ m1_subset_1(X5,k1_zfmisc_1(X6))
| m1_subset_1(X4,X6) ),
inference(variable_rename,[status(thm)],[1603]) ).
cnf(1605,plain,
( m1_subset_1(X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ r2_hidden(X1,X3) ),
inference(split_conjunct,[status(thm)],[1604]) ).
fof(2494,plain,
! [X3,X4] : k2_xboole_0(X3,X4) = k2_xboole_0(X4,X3),
inference(variable_rename,[status(thm)],[402]) ).
cnf(2495,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[2494]) ).
fof(3040,plain,
! [X3,X4] : r1_tarski(X3,k2_xboole_0(X3,X4)),
inference(variable_rename,[status(thm)],[533]) ).
cnf(3041,plain,
r1_tarski(X1,k2_xboole_0(X1,X2)),
inference(split_conjunct,[status(thm)],[3040]) ).
fof(3107,plain,
! [X1,X2] :
( ( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| r1_tarski(X1,X2) )
& ( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ) ),
inference(fof_nnf,[status(thm)],[548]) ).
fof(3108,plain,
! [X3,X4] :
( ( ~ m1_subset_1(X3,k1_zfmisc_1(X4))
| r1_tarski(X3,X4) )
& ( ~ r1_tarski(X3,X4)
| m1_subset_1(X3,k1_zfmisc_1(X4)) ) ),
inference(variable_rename,[status(thm)],[3107]) ).
cnf(3109,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[3108]) ).
fof(3580,plain,
! [X1] :
( ~ l1_orders_2(X1)
| ! [X2] :
( ~ l1_orders_2(X2)
| ! [X3] :
( ~ v1_orders_2(X3)
| ~ l1_orders_2(X3)
| ( ( X3 != k1_latsum_1(X1,X2)
| ( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
& u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2))) ) )
& ( u1_struct_0(X3) != k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| u1_orders_2(X3) != k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))
| X3 = k1_latsum_1(X1,X2) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[654]) ).
fof(3581,plain,
! [X4] :
( ~ l1_orders_2(X4)
| ! [X5] :
( ~ l1_orders_2(X5)
| ! [X6] :
( ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ( ( X6 != k1_latsum_1(X4,X5)
| ( u1_struct_0(X6) = k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
& u1_orders_2(X6) = k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5))) ) )
& ( u1_struct_0(X6) != k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| u1_orders_2(X6) != k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 = k1_latsum_1(X4,X5) ) ) ) ) ),
inference(variable_rename,[status(thm)],[3580]) ).
fof(3582,plain,
! [X4,X5,X6] :
( ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ( ( X6 != k1_latsum_1(X4,X5)
| ( u1_struct_0(X6) = k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
& u1_orders_2(X6) = k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5))) ) )
& ( u1_struct_0(X6) != k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| u1_orders_2(X6) != k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 = k1_latsum_1(X4,X5) ) )
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) ),
inference(shift_quantors,[status(thm)],[3581]) ).
fof(3583,plain,
! [X4,X5,X6] :
( ( u1_struct_0(X6) = k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| X6 != k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) )
& ( u1_orders_2(X6) = k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 != k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) )
& ( u1_struct_0(X6) != k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| u1_orders_2(X6) != k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 = k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[3582]) ).
cnf(3586,plain,
( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ v1_orders_2(X3)
| X3 != k1_latsum_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[3583]) ).
fof(3599,plain,
! [X1,X2] :
( ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[657]) ).
fof(3600,plain,
! [X3,X4] :
( ~ l1_orders_2(X3)
| ~ l1_orders_2(X4)
| ( v1_orders_2(k1_latsum_1(X3,X4))
& l1_orders_2(k1_latsum_1(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[3599]) ).
fof(3601,plain,
! [X3,X4] :
( ( v1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) )
& ( l1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[3600]) ).
cnf(3602,plain,
( l1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[3601]) ).
cnf(3603,plain,
( v1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[3601]) ).
fof(3667,negated_conjecture,
? [X1] :
( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1)
& ? [X2] :
( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2)
& ? [X3] :
( r2_hidden(X3,u1_struct_0(X2))
& ~ m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(fof_nnf,[status(thm)],[744]) ).
fof(3668,negated_conjecture,
? [X4] :
( ~ v3_struct_0(X4)
& v2_orders_2(X4)
& v3_orders_2(X4)
& v4_orders_2(X4)
& v1_lattice3(X4)
& l1_orders_2(X4)
& ? [X5] :
( ~ v3_struct_0(X5)
& v2_orders_2(X5)
& v3_orders_2(X5)
& v4_orders_2(X5)
& v1_lattice3(X5)
& l1_orders_2(X5)
& ? [X6] :
( r2_hidden(X6,u1_struct_0(X5))
& ~ m1_subset_1(X6,u1_struct_0(k1_latsum_1(X4,X5))) ) ) ),
inference(variable_rename,[status(thm)],[3667]) ).
fof(3669,negated_conjecture,
( ~ v3_struct_0(esk193_0)
& v2_orders_2(esk193_0)
& v3_orders_2(esk193_0)
& v4_orders_2(esk193_0)
& v1_lattice3(esk193_0)
& l1_orders_2(esk193_0)
& ~ v3_struct_0(esk194_0)
& v2_orders_2(esk194_0)
& v3_orders_2(esk194_0)
& v4_orders_2(esk194_0)
& v1_lattice3(esk194_0)
& l1_orders_2(esk194_0)
& r2_hidden(esk195_0,u1_struct_0(esk194_0))
& ~ m1_subset_1(esk195_0,u1_struct_0(k1_latsum_1(esk193_0,esk194_0))) ),
inference(skolemize,[status(esa)],[3668]) ).
cnf(3670,negated_conjecture,
~ m1_subset_1(esk195_0,u1_struct_0(k1_latsum_1(esk193_0,esk194_0))),
inference(split_conjunct,[status(thm)],[3669]) ).
cnf(3671,negated_conjecture,
r2_hidden(esk195_0,u1_struct_0(esk194_0)),
inference(split_conjunct,[status(thm)],[3669]) ).
cnf(3672,negated_conjecture,
l1_orders_2(esk194_0),
inference(split_conjunct,[status(thm)],[3669]) ).
cnf(3678,negated_conjecture,
l1_orders_2(esk193_0),
inference(split_conjunct,[status(thm)],[3669]) ).
cnf(4272,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X3)
| ~ r1_tarski(X3,X2) ),
inference(spm,[status(thm)],[1605,3109,theory(equality)]) ).
cnf(8405,plain,
( k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) = u1_struct_0(k1_latsum_1(X1,X2))
| ~ v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(er,[status(thm)],[3586,theory(equality)]) ).
cnf(46370,negated_conjecture,
( m1_subset_1(esk195_0,X1)
| ~ r1_tarski(u1_struct_0(esk194_0),X1) ),
inference(spm,[status(thm)],[4272,3671,theory(equality)]) ).
cnf(46511,negated_conjecture,
m1_subset_1(esk195_0,k2_xboole_0(u1_struct_0(esk194_0),X1)),
inference(spm,[status(thm)],[46370,3041,theory(equality)]) ).
cnf(386559,plain,
( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[8405,3602]) ).
cnf(386560,plain,
( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[386559,3603]) ).
cnf(386561,negated_conjecture,
( ~ m1_subset_1(esk195_0,k2_xboole_0(u1_struct_0(esk193_0),u1_struct_0(esk194_0)))
| ~ l1_orders_2(esk194_0)
| ~ l1_orders_2(esk193_0) ),
inference(spm,[status(thm)],[3670,386560,theory(equality)]) ).
cnf(386656,negated_conjecture,
( $false
| ~ l1_orders_2(esk194_0)
| ~ l1_orders_2(esk193_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[386561,2495,theory(equality)]),46511,theory(equality)]) ).
cnf(386657,negated_conjecture,
( $false
| $false
| ~ l1_orders_2(esk193_0) ),
inference(rw,[status(thm)],[386656,3672,theory(equality)]) ).
cnf(386658,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[386657,3678,theory(equality)]) ).
cnf(386659,negated_conjecture,
$false,
inference(cn,[status(thm)],[386658,theory(equality)]) ).
cnf(386660,negated_conjecture,
$false,
386659,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU408+2.p
% --creating new selector for [SET007+4.ax, SET007+3.ax, SET007+0.ax, SET007+1.ax, SET007+2.ax, SET007+6.ax, SET007+7.ax, SET007+9.ax, SET007+10.ax, SET007+11.ax, SET007+13.ax, SET007+14.ax, SET007+16.ax, SET007+17.ax, SET007+19.ax, SET007+20.ax, SET007+24.ax, SET007+25.ax, SET007+26.ax, SET007+31.ax, SET007+35.ax, SET007+54.ax, SET007+55.ax, SET007+59.ax, SET007+60.ax, SET007+64.ax, SET007+80.ax, SET007+200.ax, SET007+205.ax, SET007+218.ax, SET007+242.ax, SET007+295.ax, SET007+335.ax, SET007+480.ax, SET007+481.ax, SET007+483.ax, SET007+484.ax, SET007+485.ax, SET007+492.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmp51gS_K/sel_SEU408+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmp51gS_K/sel_SEU408+2.p_2 with time limit 80
% -prover status Theorem
% Problem SEU408+2.p solved in phase 1.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU408+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU408+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
%
%------------------------------------------------------------------------------