TSTP Solution File: SEU337+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU337+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %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 : Thu Dec 30 03:43:34 EST 2010
% Result : Theorem 49.12s
% Output : Solution 49.12s
% 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/SystemOnTPTP19782/SEU337+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19782/SEU337+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19782/SEU337+2.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 19882
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% PrfWatch: 1.49 CPU 2.03 WC
% PrfWatch: 3.48 CPU 4.04 WC
% PrfWatch: 5.47 CPU 6.05 WC
% PrfWatch: 7.44 CPU 8.06 WC
% PrfWatch: 9.43 CPU 10.06 WC
% PrfWatch: 11.42 CPU 12.07 WC
% PrfWatch: 13.41 CPU 14.08 WC
% PrfWatch: 15.40 CPU 16.08 WC
% PrfWatch: 17.39 CPU 18.09 WC
% PrfWatch: 19.38 CPU 20.10 WC
% PrfWatch: 21.37 CPU 22.11 WC
% PrfWatch: 23.36 CPU 24.11 WC
% # Preprocessing time : 0.310 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 25.33 CPU 26.12 WC
% PrfWatch: 27.32 CPU 28.13 WC
% PrfWatch: 28.93 CPU 30.13 WC
% PrfWatch: 30.54 CPU 32.14 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(element(X2,powerset(powerset(X1)))=>element(complements_of_subsets(X1,X2),powerset(powerset(X1)))),file('/tmp/SRASS.s.p', dt_k7_setfam_1)).
% fof(4, axiom,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>(closed_subsets(X2,X1)<=>open_subsets(complements_of_subsets(the_carrier(X1),X2),X1)))),file('/tmp/SRASS.s.p', t16_tops_2)).
% fof(5, 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(556, conjecture,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>(open_subsets(X2,X1)<=>closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1)))),file('/tmp/SRASS.s.p', t17_tops_2)).
% fof(557, negated_conjecture,~(![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(powerset(the_carrier(X1))))=>(open_subsets(X2,X1)<=>closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1))))),inference(assume_negation,[status(cth)],[556])).
% fof(644, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|element(complements_of_subsets(X1,X2),powerset(powerset(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(645, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|element(complements_of_subsets(X3,X4),powerset(powerset(X3)))),inference(variable_rename,[status(thm)],[644])).
% cnf(646,plain,(element(complements_of_subsets(X1,X2),powerset(powerset(X1)))|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[645])).
% fof(653, plain,![X1]:(~(top_str(X1))|![X2]:(~(element(X2,powerset(powerset(the_carrier(X1)))))|((~(closed_subsets(X2,X1))|open_subsets(complements_of_subsets(the_carrier(X1),X2),X1))&(~(open_subsets(complements_of_subsets(the_carrier(X1),X2),X1))|closed_subsets(X2,X1))))),inference(fof_nnf,[status(thm)],[4])).
% fof(654, plain,![X3]:(~(top_str(X3))|![X4]:(~(element(X4,powerset(powerset(the_carrier(X3)))))|((~(closed_subsets(X4,X3))|open_subsets(complements_of_subsets(the_carrier(X3),X4),X3))&(~(open_subsets(complements_of_subsets(the_carrier(X3),X4),X3))|closed_subsets(X4,X3))))),inference(variable_rename,[status(thm)],[653])).
% fof(655, plain,![X3]:![X4]:((~(element(X4,powerset(powerset(the_carrier(X3)))))|((~(closed_subsets(X4,X3))|open_subsets(complements_of_subsets(the_carrier(X3),X4),X3))&(~(open_subsets(complements_of_subsets(the_carrier(X3),X4),X3))|closed_subsets(X4,X3))))|~(top_str(X3))),inference(shift_quantors,[status(thm)],[654])).
% fof(656, plain,![X3]:![X4]:((((~(closed_subsets(X4,X3))|open_subsets(complements_of_subsets(the_carrier(X3),X4),X3))|~(element(X4,powerset(powerset(the_carrier(X3))))))|~(top_str(X3)))&(((~(open_subsets(complements_of_subsets(the_carrier(X3),X4),X3))|closed_subsets(X4,X3))|~(element(X4,powerset(powerset(the_carrier(X3))))))|~(top_str(X3)))),inference(distribute,[status(thm)],[655])).
% cnf(657,plain,(closed_subsets(X2,X1)|~top_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))|~open_subsets(complements_of_subsets(the_carrier(X1),X2),X1)),inference(split_conjunct,[status(thm)],[656])).
% cnf(658,plain,(open_subsets(complements_of_subsets(the_carrier(X1),X2),X1)|~top_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))|~closed_subsets(X2,X1)),inference(split_conjunct,[status(thm)],[656])).
% fof(659, plain,![X1]:![X2]:(~(element(X2,powerset(powerset(X1))))|complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2),inference(fof_nnf,[status(thm)],[5])).
% fof(660, plain,![X3]:![X4]:(~(element(X4,powerset(powerset(X3))))|complements_of_subsets(X3,complements_of_subsets(X3,X4))=X4),inference(variable_rename,[status(thm)],[659])).
% cnf(661,plain,(complements_of_subsets(X1,complements_of_subsets(X1,X2))=X2|~element(X2,powerset(powerset(X1)))),inference(split_conjunct,[status(thm)],[660])).
% fof(4614, negated_conjecture,?[X1]:(top_str(X1)&?[X2]:(element(X2,powerset(powerset(the_carrier(X1))))&((~(open_subsets(X2,X1))|~(closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1)))&(open_subsets(X2,X1)|closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1))))),inference(fof_nnf,[status(thm)],[557])).
% fof(4615, negated_conjecture,?[X3]:(top_str(X3)&?[X4]:(element(X4,powerset(powerset(the_carrier(X3))))&((~(open_subsets(X4,X3))|~(closed_subsets(complements_of_subsets(the_carrier(X3),X4),X3)))&(open_subsets(X4,X3)|closed_subsets(complements_of_subsets(the_carrier(X3),X4),X3))))),inference(variable_rename,[status(thm)],[4614])).
% fof(4616, negated_conjecture,(top_str(esk410_0)&(element(esk411_0,powerset(powerset(the_carrier(esk410_0))))&((~(open_subsets(esk411_0,esk410_0))|~(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)))&(open_subsets(esk411_0,esk410_0)|closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0))))),inference(skolemize,[status(esa)],[4615])).
% cnf(4617,negated_conjecture,(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|open_subsets(esk411_0,esk410_0)),inference(split_conjunct,[status(thm)],[4616])).
% cnf(4618,negated_conjecture,(~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|~open_subsets(esk411_0,esk410_0)),inference(split_conjunct,[status(thm)],[4616])).
% cnf(4619,negated_conjecture,(element(esk411_0,powerset(powerset(the_carrier(esk410_0))))),inference(split_conjunct,[status(thm)],[4616])).
% cnf(4620,negated_conjecture,(top_str(esk410_0)),inference(split_conjunct,[status(thm)],[4616])).
% cnf(7810,negated_conjecture,(complements_of_subsets(the_carrier(esk410_0),complements_of_subsets(the_carrier(esk410_0),esk411_0))=esk411_0),inference(spm,[status(thm)],[661,4619,theory(equality)])).
% cnf(9072,plain,(open_subsets(complements_of_subsets(the_carrier(X1),complements_of_subsets(the_carrier(X1),X2)),X1)|~closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1)|~top_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))),inference(spm,[status(thm)],[658,646,theory(equality)])).
% cnf(9093,plain,(closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1)|~open_subsets(complements_of_subsets(the_carrier(X1),complements_of_subsets(the_carrier(X1),X2)),X1)|~top_str(X1)|~element(X2,powerset(powerset(the_carrier(X1))))),inference(spm,[status(thm)],[657,646,theory(equality)])).
% cnf(407549,negated_conjecture,(open_subsets(esk411_0,esk410_0)|~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|~top_str(esk410_0)|~element(esk411_0,powerset(powerset(the_carrier(esk410_0))))),inference(spm,[status(thm)],[9072,7810,theory(equality)])).
% cnf(407595,negated_conjecture,(open_subsets(esk411_0,esk410_0)|~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|$false|~element(esk411_0,powerset(powerset(the_carrier(esk410_0))))),inference(rw,[status(thm)],[407549,4620,theory(equality)])).
% cnf(407596,negated_conjecture,(open_subsets(esk411_0,esk410_0)|~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|$false|$false),inference(rw,[status(thm)],[407595,4619,theory(equality)])).
% cnf(407597,negated_conjecture,(open_subsets(esk411_0,esk410_0)|~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)),inference(cn,[status(thm)],[407596,theory(equality)])).
% cnf(407600,negated_conjecture,(open_subsets(esk411_0,esk410_0)),inference(csr,[status(thm)],[407597,4617])).
% cnf(407651,negated_conjecture,($false|~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)),inference(rw,[status(thm)],[4618,407600,theory(equality)])).
% cnf(407652,negated_conjecture,(~closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)),inference(cn,[status(thm)],[407651,theory(equality)])).
% cnf(409795,negated_conjecture,(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|~open_subsets(esk411_0,esk410_0)|~top_str(esk410_0)|~element(esk411_0,powerset(powerset(the_carrier(esk410_0))))),inference(spm,[status(thm)],[9093,7810,theory(equality)])).
% cnf(409845,negated_conjecture,(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|$false|~top_str(esk410_0)|~element(esk411_0,powerset(powerset(the_carrier(esk410_0))))),inference(rw,[status(thm)],[409795,407600,theory(equality)])).
% cnf(409846,negated_conjecture,(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|$false|$false|~element(esk411_0,powerset(powerset(the_carrier(esk410_0))))),inference(rw,[status(thm)],[409845,4620,theory(equality)])).
% cnf(409847,negated_conjecture,(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)|$false|$false|$false),inference(rw,[status(thm)],[409846,4619,theory(equality)])).
% cnf(409848,negated_conjecture,(closed_subsets(complements_of_subsets(the_carrier(esk410_0),esk411_0),esk410_0)),inference(cn,[status(thm)],[409847,theory(equality)])).
% cnf(409849,negated_conjecture,($false),inference(sr,[status(thm)],[409848,407652,theory(equality)])).
% cnf(409850,negated_conjecture,($false),409849,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 18567
% # ...of these trivial : 238
% # ...subsumed : 9092
% # ...remaining for further processing: 9237
% # Other redundant clauses eliminated : 848
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 169
% # Backward-rewritten : 201
% # Generated clauses : 346337
% # ...of the previous two non-trivial : 332676
% # Contextual simplify-reflections : 2541
% # Paramodulations : 345333
% # Factorizations : 14
% # Equation resolutions : 1042
% # Current number of processed clauses: 6276
% # Positive orientable unit clauses: 666
% # Positive unorientable unit clauses: 10
% # Negative unit clauses : 182
% # Non-unit-clauses : 5418
% # Current number of unprocessed clauses: 302469
% # ...number of literals in the above : 1621093
% # Clause-clause subsumption calls (NU) : 5956398
% # Rec. Clause-clause subsumption calls : 1777860
% # Unit Clause-clause subsumption calls : 139889
% # Rewrite failures with RHS unbound : 1
% # Indexed BW rewrite attempts : 425
% # Indexed BW rewrite successes : 103
% # Backwards rewriting index: 3790 leaves, 1.46+/-2.570 terms/leaf
% # Paramod-from index: 1618 leaves, 1.12+/-1.112 terms/leaf
% # Paramod-into index: 2822 leaves, 1.32+/-2.187 terms/leaf
% # -------------------------------------------------
% # User time : 23.854 s
% # System time : 0.524 s
% # Total time : 24.378 s
% # Maximum resident set size: 0 pages
% PrfWatch: 31.27 CPU 32.86 WC
% FINAL PrfWatch: 31.27 CPU 32.86 WC
% SZS output end Solution for /tmp/SystemOnTPTP19782/SEU337+2.tptp
%
%------------------------------------------------------------------------------