%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET932+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:48:31 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 5 unt; 0 def)
% Number of atoms : 138 ( 15 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 162 ( 60 ~; 66 |; 29 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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-2 aty)
% Number of variables : 79 ( 0 sgn 49 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/tmp/tmpnQ1e0U/sel_SET932+1.p_1',t1_xboole_1) ).
fof(2,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> subset(powerset(X1),powerset(X2)) ),
file('/tmp/tmpnQ1e0U/sel_SET932+1.p_1',t79_zfmisc_1) ).
fof(4,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/tmp/tmpnQ1e0U/sel_SET932+1.p_1',d1_zfmisc_1) ).
fof(7,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmpnQ1e0U/sel_SET932+1.p_1',d3_tarski) ).
fof(9,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> subset(powerset(X1),powerset(X2)) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(12,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X2,X3)
| subset(X1,X3) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(13,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[12]) ).
cnf(14,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,negated_conjecture,
? [X1,X2] :
( subset(X1,X2)
& ~ subset(powerset(X1),powerset(X2)) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(16,negated_conjecture,
? [X3,X4] :
( subset(X3,X4)
& ~ subset(powerset(X3),powerset(X4)) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,negated_conjecture,
( subset(esk1_0,esk2_0)
& ~ subset(powerset(esk1_0),powerset(esk2_0)) ),
inference(skolemize,[status(esa)],[16]) ).
cnf(18,negated_conjecture,
~ subset(powerset(esk1_0),powerset(esk2_0)),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(19,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[17]) ).
fof(23,plain,
! [X1,X2] :
( ( X2 != powerset(X1)
| ! [X3] :
( ( ~ in(X3,X2)
| subset(X3,X1) )
& ( ~ subset(X3,X1)
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( ~ in(X3,X2)
| ~ subset(X3,X1) )
& ( in(X3,X2)
| subset(X3,X1) ) )
| X2 = powerset(X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(24,plain,
! [X4,X5] :
( ( X5 != powerset(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| subset(X6,X4) )
& ( ~ subset(X6,X4)
| in(X6,X5) ) ) )
& ( ? [X7] :
( ( ~ in(X7,X5)
| ~ subset(X7,X4) )
& ( in(X7,X5)
| subset(X7,X4) ) )
| X5 = powerset(X4) ) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,plain,
! [X4,X5] :
( ( X5 != powerset(X4)
| ! [X6] :
( ( ~ in(X6,X5)
| subset(X6,X4) )
& ( ~ subset(X6,X4)
| in(X6,X5) ) ) )
& ( ( ( ~ in(esk4_2(X4,X5),X5)
| ~ subset(esk4_2(X4,X5),X4) )
& ( in(esk4_2(X4,X5),X5)
| subset(esk4_2(X4,X5),X4) ) )
| X5 = powerset(X4) ) ),
inference(skolemize,[status(esa)],[24]) ).
fof(26,plain,
! [X4,X5,X6] :
( ( ( ( ~ in(X6,X5)
| subset(X6,X4) )
& ( ~ subset(X6,X4)
| in(X6,X5) ) )
| X5 != powerset(X4) )
& ( ( ( ~ in(esk4_2(X4,X5),X5)
| ~ subset(esk4_2(X4,X5),X4) )
& ( in(esk4_2(X4,X5),X5)
| subset(esk4_2(X4,X5),X4) ) )
| X5 = powerset(X4) ) ),
inference(shift_quantors,[status(thm)],[25]) ).
fof(27,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X5)
| subset(X6,X4)
| X5 != powerset(X4) )
& ( ~ subset(X6,X4)
| in(X6,X5)
| X5 != powerset(X4) )
& ( ~ in(esk4_2(X4,X5),X5)
| ~ subset(esk4_2(X4,X5),X4)
| X5 = powerset(X4) )
& ( in(esk4_2(X4,X5),X5)
| subset(esk4_2(X4,X5),X4)
| X5 = powerset(X4) ) ),
inference(distribute,[status(thm)],[26]) ).
cnf(30,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[27]) ).
cnf(31,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
fof(38,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)],[7]) ).
fof(39,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)],[38]) ).
fof(40,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)],[39]) ).
fof(41,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)],[40]) ).
fof(42,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)],[41]) ).
cnf(43,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(44,plain,
( subset(X1,X2)
| in(esk6_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(52,negated_conjecture,
( subset(X1,esk2_0)
| ~ subset(X1,esk1_0) ),
inference(spm,[status(thm)],[14,19,theory(equality)]) ).
cnf(58,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[31,theory(equality)]) ).
cnf(59,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[30,theory(equality)]) ).
cnf(65,plain,
( subset(esk6_2(powerset(X1),X2),X1)
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[58,44,theory(equality)]) ).
cnf(81,negated_conjecture,
( subset(esk6_2(powerset(esk1_0),X1),esk2_0)
| subset(powerset(esk1_0),X1) ),
inference(spm,[status(thm)],[52,65,theory(equality)]) ).
cnf(85,negated_conjecture,
( in(esk6_2(powerset(esk1_0),X1),powerset(esk2_0))
| subset(powerset(esk1_0),X1) ),
inference(spm,[status(thm)],[59,81,theory(equality)]) ).
cnf(87,negated_conjecture,
subset(powerset(esk1_0),powerset(esk2_0)),
inference(spm,[status(thm)],[43,85,theory(equality)]) ).
cnf(89,negated_conjecture,
$false,
inference(sr,[status(thm)],[87,18,theory(equality)]) ).
cnf(90,negated_conjecture,
$false,
89,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET932+1.p
% --creating new selector for []
% -running prover on /tmp/tmpnQ1e0U/sel_SET932+1.p_1 with time limit 29
% -prover status Theorem
% Problem SET932+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET932+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET932+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
%
%------------------------------------------------------------------------------