%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET585+3 : TPTP v5.0.0. Released v2.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 02:58:29 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 16 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 7 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 3 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] : subset(intersection(X1,X2),X1),
file('/tmp/tmpXn3moM/sel_SET585+3.p_1',intersection_is_subset) ).
fof(6,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/tmp/tmpXn3moM/sel_SET585+3.p_1',transitivity_of_subset) ).
fof(10,axiom,
! [X1,X2] : subset(X1,union(X1,X2)),
file('/tmp/tmpXn3moM/sel_SET585+3.p_1',subset_of_union) ).
fof(11,conjecture,
! [X1,X2,X3] : subset(intersection(X1,X2),union(X1,X3)),
file('/tmp/tmpXn3moM/sel_SET585+3.p_1',prove_intersection_subset_of_union) ).
fof(12,negated_conjecture,
~ ! [X1,X2,X3] : subset(intersection(X1,X2),union(X1,X3)),
inference(assume_negation,[status(cth)],[11]) ).
fof(23,plain,
! [X3,X4] : subset(intersection(X3,X4),X3),
inference(variable_rename,[status(thm)],[3]) ).
cnf(24,plain,
subset(intersection(X1,X2),X1),
inference(split_conjunct,[status(thm)],[23]) ).
fof(33,plain,
! [X1,X2,X3] :
( ~ subset(X1,X2)
| ~ subset(X2,X3)
| subset(X1,X3) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(34,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[33]) ).
cnf(35,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(53,plain,
! [X3,X4] : subset(X3,union(X3,X4)),
inference(variable_rename,[status(thm)],[10]) ).
cnf(54,plain,
subset(X1,union(X1,X2)),
inference(split_conjunct,[status(thm)],[53]) ).
fof(55,negated_conjecture,
? [X1,X2,X3] : ~ subset(intersection(X1,X2),union(X1,X3)),
inference(fof_nnf,[status(thm)],[12]) ).
fof(56,negated_conjecture,
? [X4,X5,X6] : ~ subset(intersection(X4,X5),union(X4,X6)),
inference(variable_rename,[status(thm)],[55]) ).
fof(57,negated_conjecture,
~ subset(intersection(esk3_0,esk4_0),union(esk3_0,esk5_0)),
inference(skolemize,[status(esa)],[56]) ).
cnf(58,negated_conjecture,
~ subset(intersection(esk3_0,esk4_0),union(esk3_0,esk5_0)),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(64,plain,
( subset(X1,union(X2,X3))
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[35,54,theory(equality)]) ).
cnf(121,negated_conjecture,
~ subset(intersection(esk3_0,esk4_0),esk3_0),
inference(spm,[status(thm)],[58,64,theory(equality)]) ).
cnf(124,negated_conjecture,
$false,
inference(rw,[status(thm)],[121,24,theory(equality)]) ).
cnf(125,negated_conjecture,
$false,
inference(cn,[status(thm)],[124,theory(equality)]) ).
cnf(126,negated_conjecture,
$false,
125,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET585+3.p
% --creating new selector for []
% -running prover on /tmp/tmpXn3moM/sel_SET585+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET585+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET585+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET585+3.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
%
%------------------------------------------------------------------------------