TSTP Solution File: SET910+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET910+1 : TPTP v5.0.0. Released v3.2.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 : Sun Dec 26 03:46:32 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 23 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,conjecture,
! [X1,X2] :
( set_intersection2(X1,singleton(X2)) = singleton(X2)
=> in(X2,X1) ),
file('/tmp/tmpCZhIKQ/sel_SET910+1.p_1',t51_zfmisc_1) ).
fof(5,axiom,
! [X1,X2] :
( set_intersection2(X1,singleton(X2)) = singleton(X2)
=> in(X2,X1) ),
file('/tmp/tmpCZhIKQ/sel_SET910+1.p_1',l30_zfmisc_1) ).
fof(8,negated_conjecture,
~ ! [X1,X2] :
( set_intersection2(X1,singleton(X2)) = singleton(X2)
=> in(X2,X1) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(15,negated_conjecture,
? [X1,X2] :
( set_intersection2(X1,singleton(X2)) = singleton(X2)
& ~ in(X2,X1) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(16,negated_conjecture,
? [X3,X4] :
( set_intersection2(X3,singleton(X4)) = singleton(X4)
& ~ in(X4,X3) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,negated_conjecture,
( set_intersection2(esk1_0,singleton(esk2_0)) = singleton(esk2_0)
& ~ in(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[16]) ).
cnf(18,negated_conjecture,
~ in(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,negated_conjecture,
set_intersection2(esk1_0,singleton(esk2_0)) = singleton(esk2_0),
inference(split_conjunct,[status(thm)],[17]) ).
fof(23,plain,
! [X1,X2] :
( set_intersection2(X1,singleton(X2)) != singleton(X2)
| in(X2,X1) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(24,plain,
! [X3,X4] :
( set_intersection2(X3,singleton(X4)) != singleton(X4)
| in(X4,X3) ),
inference(variable_rename,[status(thm)],[23]) ).
cnf(25,plain,
( in(X1,X2)
| set_intersection2(X2,singleton(X1)) != singleton(X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(37,negated_conjecture,
in(esk2_0,esk1_0),
inference(spm,[status(thm)],[25,19,theory(equality)]) ).
cnf(40,negated_conjecture,
$false,
inference(sr,[status(thm)],[37,18,theory(equality)]) ).
cnf(41,negated_conjecture,
$false,
40,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET910+1.p
% --creating new selector for []
% -running prover on /tmp/tmpCZhIKQ/sel_SET910+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET910+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET910+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET910+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
%
%------------------------------------------------------------------------------