%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU319+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 : 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:30:25 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP7739/SEU319+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7739/SEU319+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7739/SEU319+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 7835
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>(closed_subset(X2,X1)<=>open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)))),file('/tmp/SRASS.s.p', d6_pre_topc)).
% fof(9, axiom,![X1]:(top_str(X1)=>one_sorted_str(X1)),file('/tmp/SRASS.s.p', dt_l1_pre_topc)).
% fof(12, axiom,![X1]:(one_sorted_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))),file('/tmp/SRASS.s.p', t17_pre_topc)).
% fof(19, conjecture,![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(20, negated_conjecture,~(![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>(closed_subset(X2,X1)<=>open_subset(subset_complement(the_carrier(X1),X2),X1))))),inference(assume_negation,[status(cth)],[19])).
% fof(30, plain,![X1]:(~(top_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|((~(closed_subset(X2,X1))|open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1))&(~(open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1))|closed_subset(X2,X1))))),inference(fof_nnf,[status(thm)],[4])).
% fof(31, plain,![X3]:(~(top_str(X3))|![X4]:(~(element(X4,powerset(the_carrier(X3))))|((~(closed_subset(X4,X3))|open_subset(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4),X3))&(~(open_subset(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4),X3))|closed_subset(X4,X3))))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:((~(element(X4,powerset(the_carrier(X3))))|((~(closed_subset(X4,X3))|open_subset(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4),X3))&(~(open_subset(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4),X3))|closed_subset(X4,X3))))|~(top_str(X3))),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:((((~(closed_subset(X4,X3))|open_subset(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4),X3))|~(element(X4,powerset(the_carrier(X3)))))|~(top_str(X3)))&(((~(open_subset(subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4),X3))|closed_subset(X4,X3))|~(element(X4,powerset(the_carrier(X3)))))|~(top_str(X3)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(closed_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~closed_subset(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(49, plain,![X1]:(~(top_str(X1))|one_sorted_str(X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(50, plain,![X2]:(~(top_str(X2))|one_sorted_str(X2)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(one_sorted_str(X1)|~top_str(X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(57, plain,![X1]:(~(one_sorted_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(58, plain,![X3]:(~(one_sorted_str(X3))|![X4]:(~(element(X4,powerset(the_carrier(X3))))|subset_complement(the_carrier(X3),X4)=subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X3]:![X4]:((~(element(X4,powerset(the_carrier(X3))))|subset_complement(the_carrier(X3),X4)=subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),X4))|~(one_sorted_str(X3))),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(subset_complement(the_carrier(X1),X2)=subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)|~one_sorted_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(split_conjunct,[status(thm)],[59])).
% fof(69, negated_conjecture,?[X1]:(top_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&((~(closed_subset(X2,X1))|~(open_subset(subset_complement(the_carrier(X1),X2),X1)))&(closed_subset(X2,X1)|open_subset(subset_complement(the_carrier(X1),X2),X1))))),inference(fof_nnf,[status(thm)],[20])).
% fof(70, negated_conjecture,?[X3]:(top_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&((~(closed_subset(X4,X3))|~(open_subset(subset_complement(the_carrier(X3),X4),X3)))&(closed_subset(X4,X3)|open_subset(subset_complement(the_carrier(X3),X4),X3))))),inference(variable_rename,[status(thm)],[69])).
% fof(71, negated_conjecture,(top_str(esk4_0)&(element(esk5_0,powerset(the_carrier(esk4_0)))&((~(closed_subset(esk5_0,esk4_0))|~(open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)))&(closed_subset(esk5_0,esk4_0)|open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0))))),inference(skolemize,[status(esa)],[70])).
% cnf(72,negated_conjecture,(open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)|closed_subset(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,negated_conjecture,(~open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)|~closed_subset(esk5_0,esk4_0)),inference(split_conjunct,[status(thm)],[71])).
% cnf(74,negated_conjecture,(element(esk5_0,powerset(the_carrier(esk4_0)))),inference(split_conjunct,[status(thm)],[71])).
% cnf(75,negated_conjecture,(top_str(esk4_0)),inference(split_conjunct,[status(thm)],[71])).
% cnf(85,plain,(open_subset(subset_complement(the_carrier(X1),X2),X1)|~closed_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~one_sorted_str(X1)),inference(spm,[status(thm)],[35,60,theory(equality)])).
% cnf(87,plain,(closed_subset(X1,X2)|~open_subset(subset_complement(the_carrier(X2),X1),X2)|~top_str(X2)|~element(X1,powerset(the_carrier(X2)))|~one_sorted_str(X2)),inference(spm,[status(thm)],[34,60,theory(equality)])).
% cnf(90,plain,(open_subset(subset_complement(the_carrier(X1),X2),X1)|~closed_subset(X2,X1)|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))),inference(csr,[status(thm)],[85,51])).
% cnf(96,plain,(closed_subset(X1,X2)|~open_subset(subset_complement(the_carrier(X2),X1),X2)|~top_str(X2)|~element(X1,powerset(the_carrier(X2)))),inference(csr,[status(thm)],[87,51])).
% cnf(98,negated_conjecture,(closed_subset(esk5_0,esk4_0)|~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(spm,[status(thm)],[96,72,theory(equality)])).
% cnf(100,negated_conjecture,(closed_subset(esk5_0,esk4_0)|$false|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[98,75,theory(equality)])).
% cnf(101,negated_conjecture,(closed_subset(esk5_0,esk4_0)|$false|$false),inference(rw,[status(thm)],[100,74,theory(equality)])).
% cnf(102,negated_conjecture,(closed_subset(esk5_0,esk4_0)),inference(cn,[status(thm)],[101,theory(equality)])).
% cnf(103,negated_conjecture,(~open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)|$false),inference(rw,[status(thm)],[73,102,theory(equality)])).
% cnf(104,negated_conjecture,(~open_subset(subset_complement(the_carrier(esk4_0),esk5_0),esk4_0)),inference(cn,[status(thm)],[103,theory(equality)])).
% cnf(106,negated_conjecture,(~closed_subset(esk5_0,esk4_0)|~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(spm,[status(thm)],[104,90,theory(equality)])).
% cnf(107,negated_conjecture,($false|~top_str(esk4_0)|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[106,102,theory(equality)])).
% cnf(108,negated_conjecture,($false|$false|~element(esk5_0,powerset(the_carrier(esk4_0)))),inference(rw,[status(thm)],[107,75,theory(equality)])).
% cnf(109,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[108,74,theory(equality)])).
% cnf(110,negated_conjecture,($false),inference(cn,[status(thm)],[109,theory(equality)])).
% cnf(111,negated_conjecture,($false),110,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 44
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 20
% # ...of the previous two non-trivial : 15
% # Contextual simplify-reflections : 2
% # Paramodulations : 20
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 8
% # ...number of literals in the above : 38
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 38 leaves, 1.50+/-0.910 terms/leaf
% # Paramod-from index: 19 leaves, 1.05+/-0.223 terms/leaf
% # Paramod-into index: 34 leaves, 1.26+/-0.441 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.005 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.18 WC
% FINAL PrfWatch: 0.13 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP7739/SEU319+1.tptp
%
%------------------------------------------------------------------------------