%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU112+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:41:08 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 45 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 13 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 42 ( 2 sgn 27 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/tmp/tmpWGJl8E/sel_SEU112+1.p_1',t8_xboole_1) ).
fof(17,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/tmp/tmpWGJl8E/sel_SEU112+1.p_1',commutativity_k2_xboole_0) ).
fof(19,axiom,
! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
file('/tmp/tmpWGJl8E/sel_SEU112+1.p_1',t23_finsub_1) ).
fof(21,conjecture,
! [X1,X2] : subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
file('/tmp/tmpWGJl8E/sel_SEU112+1.p_1',t25_finsub_1) ).
fof(23,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/tmp/tmpWGJl8E/sel_SEU112+1.p_1',t7_xboole_1) ).
fof(41,negated_conjecture,
~ ! [X1,X2] : subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
inference(assume_negation,[status(cth)],[21]) ).
fof(75,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X3,X2)
| subset(set_union2(X1,X3),X2) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(76,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[75]) ).
cnf(77,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[76]) ).
fof(122,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[17]) ).
cnf(123,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[122]) ).
fof(126,plain,
! [X1,X2] :
( ~ subset(X1,X2)
| subset(finite_subsets(X1),finite_subsets(X2)) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(127,plain,
! [X3,X4] :
( ~ subset(X3,X4)
| subset(finite_subsets(X3),finite_subsets(X4)) ),
inference(variable_rename,[status(thm)],[126]) ).
cnf(128,plain,
( subset(finite_subsets(X1),finite_subsets(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[127]) ).
fof(133,negated_conjecture,
? [X1,X2] : ~ subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
inference(fof_nnf,[status(thm)],[41]) ).
fof(134,negated_conjecture,
? [X3,X4] : ~ subset(set_union2(finite_subsets(X3),finite_subsets(X4)),finite_subsets(set_union2(X3,X4))),
inference(variable_rename,[status(thm)],[133]) ).
fof(135,negated_conjecture,
~ subset(set_union2(finite_subsets(esk7_0),finite_subsets(esk8_0)),finite_subsets(set_union2(esk7_0,esk8_0))),
inference(skolemize,[status(esa)],[134]) ).
cnf(136,negated_conjecture,
~ subset(set_union2(finite_subsets(esk7_0),finite_subsets(esk8_0)),finite_subsets(set_union2(esk7_0,esk8_0))),
inference(split_conjunct,[status(thm)],[135]) ).
fof(140,plain,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[23]) ).
cnf(141,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[140]) ).
cnf(212,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[141,123,theory(equality)]) ).
cnf(256,negated_conjecture,
( ~ subset(finite_subsets(esk8_0),finite_subsets(set_union2(esk7_0,esk8_0)))
| ~ subset(finite_subsets(esk7_0),finite_subsets(set_union2(esk7_0,esk8_0))) ),
inference(spm,[status(thm)],[136,77,theory(equality)]) ).
cnf(318,negated_conjecture,
( ~ subset(finite_subsets(esk7_0),finite_subsets(set_union2(esk7_0,esk8_0)))
| ~ subset(esk8_0,set_union2(esk7_0,esk8_0)) ),
inference(spm,[status(thm)],[256,128,theory(equality)]) ).
cnf(320,negated_conjecture,
( ~ subset(esk8_0,set_union2(esk7_0,esk8_0))
| ~ subset(esk7_0,set_union2(esk7_0,esk8_0)) ),
inference(spm,[status(thm)],[318,128,theory(equality)]) ).
cnf(322,negated_conjecture,
( ~ subset(esk8_0,set_union2(esk7_0,esk8_0))
| $false ),
inference(rw,[status(thm)],[320,141,theory(equality)]) ).
cnf(323,negated_conjecture,
~ subset(esk8_0,set_union2(esk7_0,esk8_0)),
inference(cn,[status(thm)],[322,theory(equality)]) ).
cnf(346,negated_conjecture,
$false,
inference(rw,[status(thm)],[323,212,theory(equality)]) ).
cnf(347,negated_conjecture,
$false,
inference(cn,[status(thm)],[346,theory(equality)]) ).
cnf(348,negated_conjecture,
$false,
347,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU112+1.p
% --creating new selector for []
% -running prover on /tmp/tmpWGJl8E/sel_SEU112+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU112+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU112+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU112+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
%
%------------------------------------------------------------------------------