TSTP Solution File: SEU320+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU320+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 03:30:48 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP21948/SEU320+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21948/SEU320+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21948/SEU320+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 22044
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>element(subset_complement(X1,X2),powerset(X1))),file('/tmp/SRASS.s.p', dt_k3_subset_1)).
% fof(4, axiom,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>(closed_subset(X2,X1)<=>open_subset(subset_complement(the_carrier(X1),X2),X1)))),file('/tmp/SRASS.s.p', t29_tops_1)).
% fof(5, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,subset_complement(X1,X2))=X2),file('/tmp/SRASS.s.p', involutiveness_k3_subset_1)).
% fof(14, conjecture,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>(open_subset(X2,X1)<=>closed_subset(subset_complement(the_carrier(X1),X2),X1)))),file('/tmp/SRASS.s.p', t30_tops_1)).
% fof(15, negated_conjecture,~(![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>(open_subset(X2,X1)<=>closed_subset(subset_complement(the_carrier(X1),X2),X1))))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|element(subset_complement(X1,X2),powerset(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|element(subset_complement(X3,X4),powerset(X3))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(element(subset_complement(X1,X2),powerset(X1))|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[17])).
% fof(25, plain,![X1]:(~(top_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|((~(closed_subset(X2,X1))|open_subset(subset_complement(the_carrier(X1),X2),X1))&(~(open_subset(subset_complement(the_carrier(X1),X2),X1))|closed_subset(X2,X1))))),inference(fof_nnf,[status(thm)],[4])).
% fof(26, plain,![X3]:(~(top_str(X3))|![X4]:(~(element(X4,powerset(the_carrier(X3))))|((~(closed_subset(X4,X3))|open_subset(subset_complement(the_carrier(X3),X4),X3))&(~(open_subset(subset_complement(the_carrier(X3),X4),X3))|closed_subset(X4,X3))))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X3]:![X4]:((~(element(X4,powerset(the_carrier(X3))))|((~(closed_subset(X4,X3))|open_subset(subset_complement(the_carrier(X3),X4),X3))&(~(open_subset(subset_complement(the_carrier(X3),X4),X3))|closed_subset(X4,X3))))|~(top_str(X3))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:((((~(closed_subset(X4,X3))|open_subset(subset_complement(the_carrier(X3),X4),X3))|~(element(X4,powerset(the_carrier(X3)))))|~(top_str(X3)))&(((~(open_subset(subset_complement(the_carrier(X3),X4),X3))|closed_subset(X4,X3))|~(element(X4,powerset(the_carrier(X3)))))|~(top_str(X3)))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(closed_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~open_subset(subset_complement(the_carrier(X1),X2),X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(open_subset(subset_complement(the_carrier(X1),X2),X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~closed_subset(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(31, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,subset_complement(X1,X2))=X2),inference(fof_nnf,[status(thm)],[5])).
% fof(32, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,subset_complement(X3,X4))=X4),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(subset_complement(X1,subset_complement(X1,X2))=X2|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[32])).
% fof(50, negated_conjecture,?[X1]:(top_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&((~(open_subset(X2,X1))|~(closed_subset(subset_complement(the_carrier(X1),X2),X1)))&(open_subset(X2,X1)|closed_subset(subset_complement(the_carrier(X1),X2),X1))))),inference(fof_nnf,[status(thm)],[15])).
% fof(51, negated_conjecture,?[X3]:(top_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&((~(open_subset(X4,X3))|~(closed_subset(subset_complement(the_carrier(X3),X4),X3)))&(open_subset(X4,X3)|closed_subset(subset_complement(the_carrier(X3),X4),X3))))),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,(top_str(esk4_0)&(element(esk5_0,powerset(the_carrier(esk4_0)))&((~(open_subset(esk5_0,esk4_0))|~(closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)))&(open_subset(esk5_0,esk4_0)|closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0))))),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)|open_subset(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(~closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)|~open_subset(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(55,negated_conjecture,(element(esk5_0,powerset(the_carrier(esk4_0)))),inference(split_conjunct,[status(thm)],[52])).
% cnf(56,negated_conjecture,(top_str(esk4_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(61,plain,(open_subset(X2,X1)|~closed_subset(subset_complement(the_carrier(X1),X2),X1)|~top_str(X1)|~element(subset_complement(the_carrier(X1),X2),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))),inference(spm,[status(thm)],[30,33,theory(equality)])).
% cnf(62,plain,(closed_subset(subset_complement(the_carrier(X1),X2),X1)|~open_subset(X2,X1)|~top_str(X1)|~element(subset_complement(the_carrier(X1),X2),powerset(the_carrier(X1)))|~element(X2,powerset(the_carrier(X1)))),inference(spm,[status(thm)],[29,33,theory(equality)])).
% cnf(64,plain,(open_subset(X2,X1)|~closed_subset(subset_complement(the_carrier(X1),X2),X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(csr,[status(thm)],[61,18])).
% cnf(66,negated_conjecture,(open_subset(esk5_0,esk4_0)|~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(spm,[status(thm)],[64,53,theory(equality)])).
% cnf(67,negated_conjecture,(open_subset(esk5_0,esk4_0)|$false|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[66,56,theory(equality)])).
% cnf(68,negated_conjecture,(open_subset(esk5_0,esk4_0)|$false|$false),inference(rw,[status(thm)],[67,55,theory(equality)])).
% cnf(69,negated_conjecture,(open_subset(esk5_0,esk4_0)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(70,negated_conjecture,($false|~closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)),inference(rw,[status(thm)],[54,69,theory(equality)])).
% cnf(71,negated_conjecture,(~closed_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)),inference(cn,[status(thm)],[70,theory(equality)])).
% cnf(73,plain,(closed_subset(subset_complement(the_carrier(X1),X2),X1)|~open_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(csr,[status(thm)],[62,18])).
% cnf(74,negated_conjecture,(~open_subset(esk5_0,esk4_0)|~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(spm,[status(thm)],[71,73,theory(equality)])).
% cnf(77,negated_conjecture,($false|~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[74,69,theory(equality)])).
% cnf(78,negated_conjecture,($false|$false|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[77,56,theory(equality)])).
% cnf(79,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[78,55,theory(equality)])).
% cnf(80,negated_conjecture,($false),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(81,negated_conjecture,($false),80,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 12
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 2
% # Paramodulations : 12
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 5
% # Clause-clause subsumption calls (NU) : 5
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 32 leaves, 1.41+/-0.551 terms/leaf
% # Paramod-from index: 13 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-into index: 26 leaves, 1.19+/-0.394 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP21948/SEU320+1.tptp
%
%------------------------------------------------------------------------------