%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU174+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Thu Dec 30 01:25:54 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP23003/SEU174+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23003/SEU174+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23003/SEU174+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 23099
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(3, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),file('/tmp/SRASS.s.p', involutiveness_k7_setfam_1)).
% fof(4, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(7, axiom,![X1]:?[X2]:(element(X2,powerset(X1))&empty(X2)),file('/tmp/SRASS.s.p', rc2_subset_1)).
% fof(8, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>![X3]:(element(X3,powerset(powerset(X1)))=>(X3=complements_of_subsets(X1,X2)<=>![X4]:(element(X4,powerset(X1))=>(in(X4,X3)<=>in(subset_complement(X1,X4),X2)))))),file('/tmp/SRASS.s.p', d8_setfam_1)).
% fof(9, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(10, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(20, axiom,![X1]:![X2]:![X3]:~(((in(X1,X2)&element(X2,powerset(X3)))&empty(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(21, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(27, conjecture,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set))),file('/tmp/SRASS.s.p', t46_setfam_1)).
% fof(28, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>~((~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set)))),inference(assume_negation,[status(cth)],[27])).
% fof(36, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[2])).
% fof(37, plain,![X3]:element(esk1_1(X3),X3),inference(skolemize,[status(esa)],[36])).
% cnf(38,plain,(element(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),inference(fof_nnf,[status(thm)],[3])).
% fof(40, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|complements_of_subsets(X3,complements_of_subsets(X3,X4))=X4),inference(variable_rename,[status(thm)],[39])).
% cnf(41,plain,(complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[4])).
% fof(43, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[42])).
% cnf(44,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(54, plain,![X3]:?[X4]:(element(X4,powerset(X3))&empty(X4)),inference(variable_rename,[status(thm)],[7])).
% fof(55, plain,![X3]:(element(esk3_1(X3),powerset(X3))&empty(esk3_1(X3))),inference(skolemize,[status(esa)],[54])).
% cnf(56,plain,(empty(esk3_1(X1))),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(element(esk3_1(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(58, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|![X3]:(~(element(X3,powerset(powerset(X1))))|((~(X3=complements_of_subsets(X1,X2))|![X4]:(~(element(X4,powerset(X1)))|((~(in(X4,X3))|in(subset_complement(X1,X4),X2))&(~(in(subset_complement(X1,X4),X2))|in(X4,X3)))))&(?[X4]:(element(X4,powerset(X1))&((~(in(X4,X3))|~(in(subset_complement(X1,X4),X2)))&(in(X4,X3)|in(subset_complement(X1,X4),X2))))|X3=complements_of_subsets(X1,X2))))),inference(fof_nnf,[status(thm)],[8])).
% fof(59, plain,![X5]:![X6]:(~(element(X6,powerset(powerset(X5))))|![X7]:(~(element(X7,powerset(powerset(X5))))|((~(X7=complements_of_subsets(X5,X6))|![X8]:(~(element(X8,powerset(X5)))|((~(in(X8,X7))|in(subset_complement(X5,X8),X6))&(~(in(subset_complement(X5,X8),X6))|in(X8,X7)))))&(?[X9]:(element(X9,powerset(X5))&((~(in(X9,X7))|~(in(subset_complement(X5,X9),X6)))&(in(X9,X7)|in(subset_complement(X5,X9),X6))))|X7=complements_of_subsets(X5,X6))))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X5]:![X6]:(~(element(X6,powerset(powerset(X5))))|![X7]:(~(element(X7,powerset(powerset(X5))))|((~(X7=complements_of_subsets(X5,X6))|![X8]:(~(element(X8,powerset(X5)))|((~(in(X8,X7))|in(subset_complement(X5,X8),X6))&(~(in(subset_complement(X5,X8),X6))|in(X8,X7)))))&((element(esk4_3(X5,X6,X7),powerset(X5))&((~(in(esk4_3(X5,X6,X7),X7))|~(in(subset_complement(X5,esk4_3(X5,X6,X7)),X6)))&(in(esk4_3(X5,X6,X7),X7)|in(subset_complement(X5,esk4_3(X5,X6,X7)),X6))))|X7=complements_of_subsets(X5,X6))))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,powerset(X5)))|((~(in(X8,X7))|in(subset_complement(X5,X8),X6))&(~(in(subset_complement(X5,X8),X6))|in(X8,X7))))|~(X7=complements_of_subsets(X5,X6)))&((element(esk4_3(X5,X6,X7),powerset(X5))&((~(in(esk4_3(X5,X6,X7),X7))|~(in(subset_complement(X5,esk4_3(X5,X6,X7)),X6)))&(in(esk4_3(X5,X6,X7),X7)|in(subset_complement(X5,esk4_3(X5,X6,X7)),X6))))|X7=complements_of_subsets(X5,X6)))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5))))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(X8,X7))|in(subset_complement(X5,X8),X6))|~(element(X8,powerset(X5))))|~(X7=complements_of_subsets(X5,X6)))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))&(((((~(in(subset_complement(X5,X8),X6))|in(X8,X7))|~(element(X8,powerset(X5))))|~(X7=complements_of_subsets(X5,X6)))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5))))))&((((element(esk4_3(X5,X6,X7),powerset(X5))|X7=complements_of_subsets(X5,X6))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))&(((((~(in(esk4_3(X5,X6,X7),X7))|~(in(subset_complement(X5,esk4_3(X5,X6,X7)),X6)))|X7=complements_of_subsets(X5,X6))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))&((((in(esk4_3(X5,X6,X7),X7)|in(subset_complement(X5,esk4_3(X5,X6,X7)),X6))|X7=complements_of_subsets(X5,X6))|~(element(X7,powerset(powerset(X5)))))|~(element(X6,powerset(powerset(X5)))))))),inference(distribute,[status(thm)],[61])).
% cnf(67,plain,(in(subset_complement(X2,X4),X1)|~element(X1,powerset(powerset(X2)))|~element(X3,powerset(powerset(X2)))|X3!=complements_of_subsets(X2,X1)|~element(X4,powerset(X2))|~in(X4,X3)),inference(split_conjunct,[status(thm)],[62])).
% cnf(68,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[9])).
% fof(69, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[10])).
% fof(70, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[70])).
% fof(98, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|~(empty(X3))),inference(fof_nnf,[status(thm)],[20])).
% fof(99, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|~(empty(X6))),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(~empty(X1)|~element(X2,powerset(X1))|~in(X3,X2)),inference(split_conjunct,[status(thm)],[99])).
% fof(101, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(102, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[101])).
% cnf(103,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[102])).
% fof(118, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(powerset(X1)))&(~(X2=empty_set)&complements_of_subsets(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[28])).
% fof(119, negated_conjecture,?[X3]:?[X4]:(element(X4,powerset(powerset(X3)))&(~(X4=empty_set)&complements_of_subsets(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[118])).
% fof(120, negated_conjecture,(element(esk9_0,powerset(powerset(esk8_0)))&(~(esk9_0=empty_set)&complements_of_subsets(esk8_0,esk9_0)=empty_set)),inference(skolemize,[status(esa)],[119])).
% cnf(121,negated_conjecture,(complements_of_subsets(esk8_0,esk9_0)=empty_set),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,negated_conjecture,(esk9_0!=empty_set),inference(split_conjunct,[status(thm)],[120])).
% cnf(123,negated_conjecture,(element(esk9_0,powerset(powerset(esk8_0)))),inference(split_conjunct,[status(thm)],[120])).
% cnf(124,plain,(in(subset_complement(X2,X4),X1)|complements_of_subsets(X2,X1)!=X3|~in(X4,X3)|~element(X3,powerset(powerset(X2)))|~element(X1,powerset(powerset(X2)))),inference(csr,[status(thm)],[67,71])).
% cnf(126,plain,(empty_set=esk3_1(X1)),inference(spm,[status(thm)],[44,56,theory(equality)])).
% cnf(132,negated_conjecture,(complements_of_subsets(esk8_0,empty_set)=esk9_0|~element(esk9_0,powerset(powerset(esk8_0)))),inference(spm,[status(thm)],[41,121,theory(equality)])).
% cnf(133,negated_conjecture,(complements_of_subsets(esk8_0,empty_set)=esk9_0|$false),inference(rw,[status(thm)],[132,123,theory(equality)])).
% cnf(134,negated_conjecture,(complements_of_subsets(esk8_0,empty_set)=esk9_0),inference(cn,[status(thm)],[133,theory(equality)])).
% cnf(173,negated_conjecture,(in(subset_complement(esk8_0,X1),X2)|complements_of_subsets(esk8_0,X2)!=esk9_0|~in(X1,esk9_0)|~element(X2,powerset(powerset(esk8_0)))),inference(spm,[status(thm)],[124,123,theory(equality)])).
% cnf(191,plain,(element(empty_set,powerset(X1))),inference(rw,[status(thm)],[57,126,theory(equality)])).
% cnf(220,plain,(~in(X1,empty_set)|~empty(X2)),inference(spm,[status(thm)],[100,191,theory(equality)])).
% fof(222, plain,(~(epred1_0)<=>![X1]:~(in(X1,empty_set))),introduced(definition),['split']).
% cnf(223,plain,(epred1_0|~in(X1,empty_set)),inference(split_equiv,[status(thm)],[222])).
% fof(224, plain,(~(epred2_0)<=>![X2]:~(empty(X2))),introduced(definition),['split']).
% cnf(225,plain,(epred2_0|~empty(X2)),inference(split_equiv,[status(thm)],[224])).
% cnf(226,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[220,222,theory(equality)]),224,theory(equality)]),['split']).
% cnf(227,plain,(epred2_0),inference(spm,[status(thm)],[225,68,theory(equality)])).
% cnf(228,plain,($false|~epred1_0),inference(rw,[status(thm)],[226,227,theory(equality)])).
% cnf(229,plain,(~epred1_0),inference(cn,[status(thm)],[228,theory(equality)])).
% cnf(583,negated_conjecture,(epred1_0|complements_of_subsets(esk8_0,empty_set)!=esk9_0|~in(X1,esk9_0)|~element(empty_set,powerset(powerset(esk8_0)))),inference(spm,[status(thm)],[223,173,theory(equality)])).
% cnf(612,negated_conjecture,(epred1_0|$false|~in(X1,esk9_0)|~element(empty_set,powerset(powerset(esk8_0)))),inference(rw,[status(thm)],[583,134,theory(equality)])).
% cnf(613,negated_conjecture,(epred1_0|$false|~in(X1,esk9_0)|$false),inference(rw,[status(thm)],[612,191,theory(equality)])).
% cnf(614,negated_conjecture,(epred1_0|~in(X1,esk9_0)),inference(cn,[status(thm)],[613,theory(equality)])).
% cnf(615,negated_conjecture,(~in(X1,esk9_0)),inference(sr,[status(thm)],[614,229,theory(equality)])).
% cnf(624,negated_conjecture,(empty(esk9_0)|~element(X1,esk9_0)),inference(spm,[status(thm)],[615,103,theory(equality)])).
% cnf(649,negated_conjecture,(empty(esk9_0)),inference(spm,[status(thm)],[624,38,theory(equality)])).
% cnf(651,negated_conjecture,(empty_set=esk9_0),inference(spm,[status(thm)],[44,649,theory(equality)])).
% cnf(654,negated_conjecture,($false),inference(sr,[status(thm)],[651,122,theory(equality)])).
% cnf(655,negated_conjecture,($false),654,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 214
% # ...of these trivial : 0
% # ...subsumed : 45
% # ...remaining for further processing: 169
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 24
% # Backward-rewritten : 12
% # Generated clauses : 376
% # ...of the previous two non-trivial : 346
% # Contextual simplify-reflections : 28
% # Paramodulations : 372
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 73
% # Current number of unprocessed clauses: 142
% # ...number of literals in the above : 642
% # Clause-clause subsumption calls (NU) : 785
% # Rec. Clause-clause subsumption calls : 606
% # Unit Clause-clause subsumption calls : 83
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 101 leaves, 1.53+/-1.439 terms/leaf
% # Paramod-from index: 33 leaves, 1.12+/-0.326 terms/leaf
% # Paramod-into index: 82 leaves, 1.32+/-0.679 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP23003/SEU174+1.tptp
%
%------------------------------------------------------------------------------