TSTP Solution File: SET904+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET904+1 : TPTP v5.0.0. Released v3.2.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 03:45:40 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 29 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 4 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/tmp/tmpkOAxx1/sel_SET904+1.p_1',commutativity_k2_xboole_0) ).
fof(6,conjecture,
! [X1,X2] :
( subset(set_union2(singleton(X1),X2),X2)
=> in(X1,X2) ),
file('/tmp/tmpkOAxx1/sel_SET904+1.p_1',t45_zfmisc_1) ).
fof(9,axiom,
! [X1,X2] :
( subset(set_union2(singleton(X1),X2),X2)
=> in(X1,X2) ),
file('/tmp/tmpkOAxx1/sel_SET904+1.p_1',l21_zfmisc_1) ).
fof(11,negated_conjecture,
~ ! [X1,X2] :
( subset(set_union2(singleton(X1),X2),X2)
=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(22,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[3]) ).
cnf(23,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[22]) ).
fof(29,negated_conjecture,
? [X1,X2] :
( subset(set_union2(singleton(X1),X2),X2)
& ~ in(X1,X2) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(30,negated_conjecture,
? [X3,X4] :
( subset(set_union2(singleton(X3),X4),X4)
& ~ in(X3,X4) ),
inference(variable_rename,[status(thm)],[29]) ).
fof(31,negated_conjecture,
( subset(set_union2(singleton(esk2_0),esk3_0),esk3_0)
& ~ in(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[30]) ).
cnf(32,negated_conjecture,
~ in(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(33,negated_conjecture,
subset(set_union2(singleton(esk2_0),esk3_0),esk3_0),
inference(split_conjunct,[status(thm)],[31]) ).
fof(40,plain,
! [X1,X2] :
( ~ subset(set_union2(singleton(X1),X2),X2)
| in(X1,X2) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(41,plain,
! [X3,X4] :
( ~ subset(set_union2(singleton(X3),X4),X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( in(X1,X2)
| ~ subset(set_union2(singleton(X1),X2),X2) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(47,negated_conjecture,
subset(set_union2(esk3_0,singleton(esk2_0)),esk3_0),
inference(rw,[status(thm)],[33,23,theory(equality)]) ).
cnf(51,plain,
( in(X1,X2)
| ~ subset(set_union2(X2,singleton(X1)),X2) ),
inference(spm,[status(thm)],[42,23,theory(equality)]) ).
cnf(63,negated_conjecture,
in(esk2_0,esk3_0),
inference(spm,[status(thm)],[51,47,theory(equality)]) ).
cnf(69,negated_conjecture,
$false,
inference(sr,[status(thm)],[63,32,theory(equality)]) ).
cnf(70,negated_conjecture,
$false,
69,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET904+1.p
% --creating new selector for []
% -running prover on /tmp/tmpkOAxx1/sel_SET904+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET904+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET904+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET904+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
%
%------------------------------------------------------------------------------