TSTP Solution File: SEU317+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU317+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 07:12:32 EST 2010
% Result : Theorem 94.00s
% Output : CNFRefutation 94.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 5 unt; 0 def)
% Number of atoms : 202 ( 0 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 270 ( 108 ~; 110 |; 39 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 93 ( 0 sgn 52 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(6,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( in(X3,the_carrier(X1))
=> ( in(X3,topstr_closure(X1,X2))
<=> ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( ( closed_subset(X4,X1)
& subset(X2,X4) )
=> in(X3,X4) ) ) ) ) ) ),
file('/tmp/tmps9gsqN/sel_SEU317+1.p_2',t45_pre_topc) ).
fof(16,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/tmp/tmps9gsqN/sel_SEU317+1.p_2',t3_subset) ).
fof(29,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
file('/tmp/tmps9gsqN/sel_SEU317+1.p_2',t48_pre_topc) ).
fof(42,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/tmp/tmps9gsqN/sel_SEU317+1.p_2',d3_tarski) ).
fof(44,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(63,plain,
! [X1] :
( ~ top_str(X1)
| ! [X2] :
( ~ element(X2,powerset(the_carrier(X1)))
| ! [X3] :
( ~ in(X3,the_carrier(X1))
| ( ( ~ in(X3,topstr_closure(X1,X2))
| ! [X4] :
( ~ element(X4,powerset(the_carrier(X1)))
| ~ closed_subset(X4,X1)
| ~ subset(X2,X4)
| in(X3,X4) ) )
& ( ? [X4] :
( element(X4,powerset(the_carrier(X1)))
& closed_subset(X4,X1)
& subset(X2,X4)
& ~ in(X3,X4) )
| in(X3,topstr_closure(X1,X2)) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(64,plain,
! [X5] :
( ~ top_str(X5)
| ! [X6] :
( ~ element(X6,powerset(the_carrier(X5)))
| ! [X7] :
( ~ in(X7,the_carrier(X5))
| ( ( ~ in(X7,topstr_closure(X5,X6))
| ! [X8] :
( ~ element(X8,powerset(the_carrier(X5)))
| ~ closed_subset(X8,X5)
| ~ subset(X6,X8)
| in(X7,X8) ) )
& ( ? [X9] :
( element(X9,powerset(the_carrier(X5)))
& closed_subset(X9,X5)
& subset(X6,X9)
& ~ in(X7,X9) )
| in(X7,topstr_closure(X5,X6)) ) ) ) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X5] :
( ~ top_str(X5)
| ! [X6] :
( ~ element(X6,powerset(the_carrier(X5)))
| ! [X7] :
( ~ in(X7,the_carrier(X5))
| ( ( ~ in(X7,topstr_closure(X5,X6))
| ! [X8] :
( ~ element(X8,powerset(the_carrier(X5)))
| ~ closed_subset(X8,X5)
| ~ subset(X6,X8)
| in(X7,X8) ) )
& ( ( element(esk2_3(X5,X6,X7),powerset(the_carrier(X5)))
& closed_subset(esk2_3(X5,X6,X7),X5)
& subset(X6,esk2_3(X5,X6,X7))
& ~ in(X7,esk2_3(X5,X6,X7)) )
| in(X7,topstr_closure(X5,X6)) ) ) ) ) ),
inference(skolemize,[status(esa)],[64]) ).
fof(66,plain,
! [X5,X6,X7,X8] :
( ( ( ~ element(X8,powerset(the_carrier(X5)))
| ~ closed_subset(X8,X5)
| ~ subset(X6,X8)
| in(X7,X8)
| ~ in(X7,topstr_closure(X5,X6)) )
& ( ( element(esk2_3(X5,X6,X7),powerset(the_carrier(X5)))
& closed_subset(esk2_3(X5,X6,X7),X5)
& subset(X6,esk2_3(X5,X6,X7))
& ~ in(X7,esk2_3(X5,X6,X7)) )
| in(X7,topstr_closure(X5,X6)) ) )
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) ),
inference(shift_quantors,[status(thm)],[65]) ).
fof(67,plain,
! [X5,X6,X7,X8] :
( ( ~ element(X8,powerset(the_carrier(X5)))
| ~ closed_subset(X8,X5)
| ~ subset(X6,X8)
| in(X7,X8)
| ~ in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( element(esk2_3(X5,X6,X7),powerset(the_carrier(X5)))
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( closed_subset(esk2_3(X5,X6,X7),X5)
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( subset(X6,esk2_3(X5,X6,X7))
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) )
& ( ~ in(X7,esk2_3(X5,X6,X7))
| in(X7,topstr_closure(X5,X6))
| ~ in(X7,the_carrier(X5))
| ~ element(X6,powerset(the_carrier(X5)))
| ~ top_str(X5) ) ),
inference(distribute,[status(thm)],[66]) ).
cnf(68,plain,
( in(X3,topstr_closure(X1,X2))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(X3,the_carrier(X1))
| ~ in(X3,esk2_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[67]) ).
cnf(69,plain,
( in(X3,topstr_closure(X1,X2))
| subset(X2,esk2_3(X1,X2,X3))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[67]) ).
fof(113,plain,
! [X1,X2] :
( ( ~ element(X1,powerset(X2))
| subset(X1,X2) )
& ( ~ subset(X1,X2)
| element(X1,powerset(X2)) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(114,plain,
! [X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(variable_rename,[status(thm)],[113]) ).
cnf(116,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(164,negated_conjecture,
? [X1] :
( top_str(X1)
& ? [X2] :
( element(X2,powerset(the_carrier(X1)))
& ~ subset(X2,topstr_closure(X1,X2)) ) ),
inference(fof_nnf,[status(thm)],[44]) ).
fof(165,negated_conjecture,
? [X3] :
( top_str(X3)
& ? [X4] :
( element(X4,powerset(the_carrier(X3)))
& ~ subset(X4,topstr_closure(X3,X4)) ) ),
inference(variable_rename,[status(thm)],[164]) ).
fof(166,negated_conjecture,
( top_str(esk5_0)
& element(esk6_0,powerset(the_carrier(esk5_0)))
& ~ subset(esk6_0,topstr_closure(esk5_0,esk6_0)) ),
inference(skolemize,[status(esa)],[165]) ).
cnf(167,negated_conjecture,
~ subset(esk6_0,topstr_closure(esk5_0,esk6_0)),
inference(split_conjunct,[status(thm)],[166]) ).
cnf(168,negated_conjecture,
element(esk6_0,powerset(the_carrier(esk5_0))),
inference(split_conjunct,[status(thm)],[166]) ).
cnf(169,negated_conjecture,
top_str(esk5_0),
inference(split_conjunct,[status(thm)],[166]) ).
fof(221,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)],[42]) ).
fof(222,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)],[221]) ).
fof(223,plain,
! [X4,X5] :
( ( ~ subset(X4,X5)
| ! [X6] :
( ~ in(X6,X4)
| in(X6,X5) ) )
& ( ( in(esk10_2(X4,X5),X4)
& ~ in(esk10_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(skolemize,[status(esa)],[222]) ).
fof(224,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( ( in(esk10_2(X4,X5),X4)
& ~ in(esk10_2(X4,X5),X5) )
| subset(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[223]) ).
fof(225,plain,
! [X4,X5,X6] :
( ( ~ in(X6,X4)
| in(X6,X5)
| ~ subset(X4,X5) )
& ( in(esk10_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk10_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[224]) ).
cnf(226,plain,
( subset(X1,X2)
| ~ in(esk10_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[225]) ).
cnf(227,plain,
( subset(X1,X2)
| in(esk10_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[225]) ).
cnf(228,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[225]) ).
cnf(385,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
inference(spm,[status(thm)],[228,116,theory(equality)]) ).
cnf(420,plain,
( in(X1,esk2_3(X2,X3,X4))
| in(X4,topstr_closure(X2,X3))
| ~ in(X1,X3)
| ~ top_str(X2)
| ~ in(X4,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[228,69,theory(equality)]) ).
cnf(2350,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[68,420,theory(equality)]) ).
cnf(18560,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(csr,[status(thm)],[2350,385]) ).
cnf(18565,plain,
( subset(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(esk10_2(X1,topstr_closure(X2,X3)),X3)
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[226,18560,theory(equality)]) ).
cnf(521787,plain,
( subset(X1,topstr_closure(X2,X1))
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[18565,227,theory(equality)]) ).
cnf(522084,negated_conjecture,
( ~ top_str(esk5_0)
| ~ element(esk6_0,powerset(the_carrier(esk5_0))) ),
inference(spm,[status(thm)],[167,521787,theory(equality)]) ).
cnf(522103,negated_conjecture,
( $false
| ~ element(esk6_0,powerset(the_carrier(esk5_0))) ),
inference(rw,[status(thm)],[522084,169,theory(equality)]) ).
cnf(522104,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[522103,168,theory(equality)]) ).
cnf(522105,negated_conjecture,
$false,
inference(cn,[status(thm)],[522104,theory(equality)]) ).
cnf(522106,negated_conjecture,
$false,
522105,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU317+1.p
% --creating new selector for []
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmps9gsqN/sel_SEU317+1.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmps9gsqN/sel_SEU317+1.p_2 with time limit 81
% -prover status Theorem
% Problem SEU317+1.p solved in phase 1.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU317+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU317+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
%
%------------------------------------------------------------------------------