TSTP Solution File: SET173+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SET173+3 : TPTP v5.0.0. Released v2.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 02:53:48 EST 2010
% Result : Theorem 0.33s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 25 unt; 0 def)
% Number of atoms : 163 ( 30 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 168 ( 65 ~; 68 |; 30 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 138 ( 15 sgn 62 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/tmp/tmponnnAs/sel_SET173+3.p_1',commutativity_of_intersection) ).
fof(2,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/tmp/tmponnnAs/sel_SET173+3.p_1',commutativity_of_union) ).
fof(3,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/tmp/tmponnnAs/sel_SET173+3.p_1',equal_defn) ).
fof(4,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/tmp/tmponnnAs/sel_SET173+3.p_1',union_defn) ).
fof(5,conjecture,
! [X1,X2] : intersection(X1,union(X1,X2)) = X1,
file('/tmp/tmponnnAs/sel_SET173+3.p_1',prove_absorbtion_for_intersection) ).
fof(6,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/tmp/tmponnnAs/sel_SET173+3.p_1',subset_defn) ).
fof(8,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/tmp/tmponnnAs/sel_SET173+3.p_1',intersection_defn) ).
fof(10,negated_conjecture,
~ ! [X1,X2] : intersection(X1,union(X1,X2)) = X1,
inference(assume_negation,[status(cth)],[5]) ).
fof(11,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[1]) ).
cnf(12,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[11]) ).
fof(13,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[2]) ).
cnf(14,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,plain,
! [X1,X2] :
( ( X1 != X2
| ( subset(X1,X2)
& subset(X2,X1) ) )
& ( ~ subset(X1,X2)
| ~ subset(X2,X1)
| X1 = X2 ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(16,plain,
! [X3,X4] :
( ( X3 != X4
| ( subset(X3,X4)
& subset(X4,X3) ) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,plain,
! [X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[16]) ).
cnf(18,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(21,plain,
! [X1,X2,X3] :
( ( ~ member(X3,union(X1,X2))
| member(X3,X1)
| member(X3,X2) )
& ( ( ~ member(X3,X1)
& ~ member(X3,X2) )
| member(X3,union(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(22,plain,
! [X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ( ~ member(X6,X4)
& ~ member(X6,X5) )
| member(X6,union(X4,X5)) ) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,plain,
! [X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[22]) ).
cnf(24,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[23]) ).
fof(27,negated_conjecture,
? [X1,X2] : intersection(X1,union(X1,X2)) != X1,
inference(fof_nnf,[status(thm)],[10]) ).
fof(28,negated_conjecture,
? [X3,X4] : intersection(X3,union(X3,X4)) != X3,
inference(variable_rename,[status(thm)],[27]) ).
fof(29,negated_conjecture,
intersection(esk1_0,union(esk1_0,esk2_0)) != esk1_0,
inference(skolemize,[status(esa)],[28]) ).
cnf(30,negated_conjecture,
intersection(esk1_0,union(esk1_0,esk2_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X1,X2] :
( ( ~ subset(X1,X2)
| ! [X3] :
( ~ member(X3,X1)
| member(X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| subset(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(32,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ? [X7] :
( member(X7,X4)
& ~ member(X7,X5) )
| subset(X4,X5) ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ member(X6,X4)
| member(X6,X5) ) )
& ( ( member(esk3_2(X4,X5),X4)
& ~ member(esk3_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[32]) ).
fof(34,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( ( member(esk3_2(X4,X5),X4)
& ~ member(esk3_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[33]) ).
fof(35,plain,
! [X4,X5,X6] :
( ( ~ member(X6,X4)
| member(X6,X5)
| ~ subset(X4,X5) )
& ( member(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk3_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[34]) ).
cnf(36,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(37,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(38,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(48,plain,
! [X1,X2,X3] :
( ( ~ member(X3,intersection(X1,X2))
| ( member(X3,X1)
& member(X3,X2) ) )
& ( ~ member(X3,X1)
| ~ member(X3,X2)
| member(X3,intersection(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(49,plain,
! [X4,X5,X6] :
( ( ~ member(X6,intersection(X4,X5))
| ( member(X6,X4)
& member(X6,X5) ) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(variable_rename,[status(thm)],[48]) ).
fof(50,plain,
! [X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(distribute,[status(thm)],[49]) ).
cnf(51,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(52,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(66,plain,
( member(esk3_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[52,37,theory(equality)]) ).
cnf(70,plain,
( subset(X1,union(X2,X3))
| ~ member(esk3_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[36,24,theory(equality)]) ).
cnf(79,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk3_2(X1,intersection(X2,X3)),X3)
| ~ member(esk3_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[36,51,theory(equality)]) ).
cnf(101,plain,
subset(intersection(X1,X2),X2),
inference(spm,[status(thm)],[36,66,theory(equality)]) ).
cnf(103,plain,
subset(intersection(X2,X1),X2),
inference(spm,[status(thm)],[101,12,theory(equality)]) ).
cnf(131,plain,
subset(intersection(X1,X2),union(X3,X2)),
inference(spm,[status(thm)],[70,66,theory(equality)]) ).
cnf(156,plain,
( member(X1,union(X2,X3))
| ~ member(X1,intersection(X4,X3)) ),
inference(spm,[status(thm)],[38,131,theory(equality)]) ).
cnf(188,plain,
( subset(X1,intersection(X2,X1))
| ~ member(esk3_2(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[79,37,theory(equality)]) ).
cnf(252,plain,
( member(esk3_2(intersection(X1,X2),X3),union(X4,X2))
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[156,37,theory(equality)]) ).
cnf(1837,plain,
subset(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[188,37,theory(equality)]) ).
cnf(1844,plain,
subset(intersection(X1,X2),intersection(union(X3,X2),intersection(X1,X2))),
inference(spm,[status(thm)],[188,252,theory(equality)]) ).
cnf(1862,plain,
( intersection(X1,X1) = X1
| ~ subset(intersection(X1,X1),X1) ),
inference(spm,[status(thm)],[18,1837,theory(equality)]) ).
cnf(1868,plain,
( intersection(X1,X1) = X1
| $false ),
inference(rw,[status(thm)],[1862,103,theory(equality)]) ).
cnf(1869,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[1868,theory(equality)]) ).
cnf(2606,plain,
( intersection(union(X1,X2),intersection(X3,X2)) = intersection(X3,X2)
| ~ subset(intersection(union(X1,X2),intersection(X3,X2)),intersection(X3,X2)) ),
inference(spm,[status(thm)],[18,1844,theory(equality)]) ).
cnf(2613,plain,
( intersection(union(X1,X2),intersection(X3,X2)) = intersection(X3,X2)
| $false ),
inference(rw,[status(thm)],[2606,101,theory(equality)]) ).
cnf(2614,plain,
intersection(union(X1,X2),intersection(X3,X2)) = intersection(X3,X2),
inference(cn,[status(thm)],[2613,theory(equality)]) ).
cnf(2687,plain,
intersection(union(X1,X2),X2) = X2,
inference(spm,[status(thm)],[2614,1869,theory(equality)]) ).
cnf(2796,plain,
intersection(X2,union(X1,X2)) = X2,
inference(rw,[status(thm)],[2687,12,theory(equality)]) ).
cnf(2878,plain,
intersection(X1,union(X1,X2)) = X1,
inference(spm,[status(thm)],[2796,14,theory(equality)]) ).
cnf(3114,negated_conjecture,
$false,
inference(rw,[status(thm)],[30,2878,theory(equality)]) ).
cnf(3115,negated_conjecture,
$false,
inference(cn,[status(thm)],[3114,theory(equality)]) ).
cnf(3116,negated_conjecture,
$false,
3115,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SET/SET173+3.p
% --creating new selector for []
% -running prover on /tmp/tmponnnAs/sel_SET173+3.p_1 with time limit 29
% -prover status Theorem
% Problem SET173+3.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SET/SET173+3.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SET/SET173+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
%
%------------------------------------------------------------------------------