TSTP Solution File: SEU130+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU130+1 : TPTP v5.0.0. Released v3.3.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 04:49:15 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 150 ( 27 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 189 ( 69 ~; 75 |; 39 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 68 ( 0 sgn 46 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/tmp/tmprk8Jdp/sel_SEU130+1.p_1',t28_xboole_1) ).
fof(14,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/tmp/tmprk8Jdp/sel_SEU130+1.p_1',d3_xboole_0) ).
fof(16,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmprk8Jdp/sel_SEU130+1.p_1',d3_tarski) ).
fof(19,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[6]) ).
fof(35,negated_conjecture,
? [X1,X2] :
( subset(X1,X2)
& set_intersection2(X1,X2) != X1 ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(36,negated_conjecture,
? [X3,X4] :
( subset(X3,X4)
& set_intersection2(X3,X4) != X3 ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,negated_conjecture,
( subset(esk1_0,esk2_0)
& set_intersection2(esk1_0,esk2_0) != esk1_0 ),
inference(skolemize,[status(esa)],[36]) ).
cnf(38,negated_conjecture,
set_intersection2(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[37]) ).
cnf(39,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[37]) ).
fof(58,plain,
! [X1,X2,X3] :
( ( X3 != set_intersection2(X1,X2)
| ! [X4] :
( ( ~ in(X4,X3)
| ( in(X4,X1)
& in(X4,X2) ) )
& ( ~ in(X4,X1)
| ~ in(X4,X2)
| in(X4,X3) ) ) )
& ( ? [X4] :
( ( ~ in(X4,X3)
| ~ in(X4,X1)
| ~ in(X4,X2) )
& ( in(X4,X3)
| ( in(X4,X1)
& in(X4,X2) ) ) )
| X3 = set_intersection2(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(59,plain,
! [X5,X6,X7] :
( ( X7 != set_intersection2(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| ( in(X8,X5)
& in(X8,X6) ) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7) ) ) )
& ( ? [X9] :
( ( ~ in(X9,X7)
| ~ in(X9,X5)
| ~ in(X9,X6) )
& ( in(X9,X7)
| ( in(X9,X5)
& in(X9,X6) ) ) )
| X7 = set_intersection2(X5,X6) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X5,X6,X7] :
( ( X7 != set_intersection2(X5,X6)
| ! [X8] :
( ( ~ in(X8,X7)
| ( in(X8,X5)
& in(X8,X6) ) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7) ) ) )
& ( ( ( ~ in(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6) )
& ( in(esk5_3(X5,X6,X7),X7)
| ( in(esk5_3(X5,X6,X7),X5)
& in(esk5_3(X5,X6,X7),X6) ) ) )
| X7 = set_intersection2(X5,X6) ) ),
inference(skolemize,[status(esa)],[59]) ).
fof(61,plain,
! [X5,X6,X7,X8] :
( ( ( ( ~ in(X8,X7)
| ( in(X8,X5)
& in(X8,X6) ) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7) ) )
| X7 != set_intersection2(X5,X6) )
& ( ( ( ~ in(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6) )
& ( in(esk5_3(X5,X6,X7),X7)
| ( in(esk5_3(X5,X6,X7),X5)
& in(esk5_3(X5,X6,X7),X6) ) ) )
| X7 = set_intersection2(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[60]) ).
fof(62,plain,
! [X5,X6,X7,X8] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X6)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) ) ),
inference(distribute,[status(thm)],[61]) ).
cnf(64,plain,
( X1 = set_intersection2(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(65,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk5_3(X2,X3,X1),X3)
| ~ in(esk5_3(X2,X3,X1),X2)
| ~ in(esk5_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[62]) ).
fof(72,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ in(X3,X1)
| in(X3,X2) ) )
& ( ? [X3] :
( in(X3,X1)
& ~ in(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(73,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ? [X7] :
( in(X7,X4)
& ~ in(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[72]) ).
fof(74,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk6_2(X4,X5),X4)
& ~ in(esk6_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[73]) ).
fof(75,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk6_2(X4,X5),X4)
& ~ in(esk6_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[74]) ).
fof(76,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk6_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk6_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[75]) ).
cnf(79,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[76]) ).
cnf(107,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[79,39,theory(equality)]) ).
cnf(134,plain,
( set_intersection2(X4,X5) = X4
| in(esk5_3(X4,X5,X4),X4) ),
inference(ef,[status(thm)],[64,theory(equality)]) ).
cnf(227,negated_conjecture,
( set_intersection2(X1,esk2_0) = X2
| ~ in(esk5_3(X1,esk2_0,X2),X1)
| ~ in(esk5_3(X1,esk2_0,X2),X2)
| ~ in(esk5_3(X1,esk2_0,X2),esk1_0) ),
inference(spm,[status(thm)],[65,107,theory(equality)]) ).
cnf(1121,negated_conjecture,
( set_intersection2(esk1_0,esk2_0) = esk1_0
| ~ in(esk5_3(esk1_0,esk2_0,esk1_0),esk1_0) ),
inference(spm,[status(thm)],[227,134,theory(equality)]) ).
cnf(1128,negated_conjecture,
~ in(esk5_3(esk1_0,esk2_0,esk1_0),esk1_0),
inference(sr,[status(thm)],[1121,38,theory(equality)]) ).
cnf(1135,negated_conjecture,
set_intersection2(esk1_0,esk2_0) = esk1_0,
inference(spm,[status(thm)],[1128,134,theory(equality)]) ).
cnf(1139,negated_conjecture,
$false,
inference(sr,[status(thm)],[1135,38,theory(equality)]) ).
cnf(1140,negated_conjecture,
$false,
1139,
[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/SEU130+1.p
% --creating new selector for []
% -running prover on /tmp/tmprk8Jdp/sel_SEU130+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU130+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU130+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU130+1.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
%
%------------------------------------------------------------------------------