%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU127+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 04:44:00 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 14 unt; 0 def)
% Number of atoms : 139 ( 19 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 170 ( 62 ~; 68 |; 36 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 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 : 78 ( 4 sgn 50 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/tmp/tmppvYeiU/sel_SEU127+1.p_1',commutativity_k3_xboole_0) ).
fof(8,conjecture,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/tmp/tmppvYeiU/sel_SEU127+1.p_1',t17_xboole_1) ).
fof(12,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/tmp/tmppvYeiU/sel_SEU127+1.p_1',d3_xboole_0) ).
fof(14,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmppvYeiU/sel_SEU127+1.p_1',d3_tarski) ).
fof(17,negated_conjecture,
~ ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
inference(assume_negation,[status(cth)],[8]) ).
fof(20,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[1]) ).
cnf(21,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[20]) ).
fof(34,negated_conjecture,
? [X1,X2] : ~ subset(set_intersection2(X1,X2),X1),
inference(fof_nnf,[status(thm)],[17]) ).
fof(35,negated_conjecture,
? [X3,X4] : ~ subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[34]) ).
fof(36,negated_conjecture,
~ subset(set_intersection2(esk2_0,esk3_0),esk2_0),
inference(skolemize,[status(esa)],[35]) ).
cnf(37,negated_conjecture,
~ subset(set_intersection2(esk2_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[36]) ).
fof(47,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)],[12]) ).
fof(48,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)],[47]) ).
fof(49,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)],[48]) ).
fof(50,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)],[49]) ).
fof(51,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)],[50]) ).
cnf(56,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(61,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)],[14]) ).
fof(62,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)],[61]) ).
fof(63,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)],[62]) ).
fof(64,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)],[63]) ).
fof(65,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)],[64]) ).
cnf(66,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(67,plain,
( subset(X1,X2)
| in(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[65]) ).
cnf(106,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[56,theory(equality)]) ).
cnf(317,plain,
( in(esk6_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[106,67,theory(equality)]) ).
cnf(361,plain,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[66,317,theory(equality)]) ).
cnf(381,plain,
subset(set_intersection2(X2,X1),X2),
inference(spm,[status(thm)],[361,21,theory(equality)]) ).
cnf(411,negated_conjecture,
$false,
inference(rw,[status(thm)],[37,381,theory(equality)]) ).
cnf(412,negated_conjecture,
$false,
inference(cn,[status(thm)],[411,theory(equality)]) ).
cnf(413,negated_conjecture,
$false,
412,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU127+1.p
% --creating new selector for []
% -running prover on /tmp/tmppvYeiU/sel_SEU127+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU127+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU127+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU127+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
%
%------------------------------------------------------------------------------