%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU387+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 : art05.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 04:30:35 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP2286/SEU387+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2286/SEU387+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2286/SEU387+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 2383
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(19, axiom,![X1]:((((((~(empty_carrier(X1))&reflexive_relstr(X1))&transitive_relstr(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:((((~(empty(X2))&filtered_subset(X2,X1))&upper_relstr_subset(X2,X1))&element(X2,powerset(the_carrier(X1))))=>(proper_element(X2,powerset(the_carrier(X1)))<=>~(in(bottom_of_relstr(X1),X2))))),file('/tmp/SRASS.s.p', t8_waybel_7)).
% fof(37, axiom,![X1]:(strict_rel_str(boole_POSet(X1))&rel_str(boole_POSet(X1))),file('/tmp/SRASS.s.p', dt_k3_yellow_1)).
% fof(44, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(48, axiom,![X1]:((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1))),file('/tmp/SRASS.s.p', fc7_yellow_1)).
% fof(61, axiom,![X1]:bottom_of_relstr(boole_POSet(X1))=empty_set,file('/tmp/SRASS.s.p', t18_yellow_1)).
% fof(69, axiom,![X1]:((((((((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1)))&lower_bounded_relstr(boole_POSet(X1)))&upper_bounded_relstr(boole_POSet(X1)))&bounded_relstr(boole_POSet(X1)))&with_suprema_relstr(boole_POSet(X1)))&with_infima_relstr(boole_POSet(X1)))&complete_relstr(boole_POSet(X1))),file('/tmp/SRASS.s.p', fc8_yellow_1)).
% fof(85, conjecture,![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3))))),file('/tmp/SRASS.s.p', t2_yellow19)).
% fof(86, negated_conjecture,~(![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3)))))),inference(assume_negation,[status(cth)],[85])).
% fof(96, plain,![X1]:((((((~(empty_carrier(X1))&reflexive_relstr(X1))&transitive_relstr(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:((((~(empty(X2))&filtered_subset(X2,X1))&upper_relstr_subset(X2,X1))&element(X2,powerset(the_carrier(X1))))=>(proper_element(X2,powerset(the_carrier(X1)))<=>~(in(bottom_of_relstr(X1),X2))))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(110, plain,![X1]:((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1))),inference(fof_simplification,[status(thm)],[48,theory(equality)])).
% fof(121, plain,![X1]:((((((((((~(empty_carrier(boole_POSet(X1)))&strict_rel_str(boole_POSet(X1)))&reflexive_relstr(boole_POSet(X1)))&transitive_relstr(boole_POSet(X1)))&antisymmetric_relstr(boole_POSet(X1)))&lower_bounded_relstr(boole_POSet(X1)))&upper_bounded_relstr(boole_POSet(X1)))&bounded_relstr(boole_POSet(X1)))&with_suprema_relstr(boole_POSet(X1)))&with_infima_relstr(boole_POSet(X1)))&complete_relstr(boole_POSet(X1))),inference(fof_simplification,[status(thm)],[69,theory(equality)])).
% fof(128, negated_conjecture,~(![X1]:(~(empty(X1))=>![X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))=>![X3]:~((in(X3,X2)&empty(X3)))))),inference(fof_simplification,[status(thm)],[86,theory(equality)])).
% fof(159, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(160, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[159])).
% cnf(161,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[160])).
% fof(210, plain,![X1]:((((((empty_carrier(X1)|~(reflexive_relstr(X1)))|~(transitive_relstr(X1)))|~(antisymmetric_relstr(X1)))|~(lower_bounded_relstr(X1)))|~(rel_str(X1)))|![X2]:((((empty(X2)|~(filtered_subset(X2,X1)))|~(upper_relstr_subset(X2,X1)))|~(element(X2,powerset(the_carrier(X1)))))|((~(proper_element(X2,powerset(the_carrier(X1))))|~(in(bottom_of_relstr(X1),X2)))&(in(bottom_of_relstr(X1),X2)|proper_element(X2,powerset(the_carrier(X1))))))),inference(fof_nnf,[status(thm)],[96])).
% fof(211, plain,![X3]:((((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3)))|![X4]:((((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3)))))|((~(proper_element(X4,powerset(the_carrier(X3))))|~(in(bottom_of_relstr(X3),X4)))&(in(bottom_of_relstr(X3),X4)|proper_element(X4,powerset(the_carrier(X3))))))),inference(variable_rename,[status(thm)],[210])).
% fof(212, plain,![X3]:![X4]:(((((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3)))))|((~(proper_element(X4,powerset(the_carrier(X3))))|~(in(bottom_of_relstr(X3),X4)))&(in(bottom_of_relstr(X3),X4)|proper_element(X4,powerset(the_carrier(X3))))))|(((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3)))),inference(shift_quantors,[status(thm)],[211])).
% fof(213, plain,![X3]:![X4]:((((~(proper_element(X4,powerset(the_carrier(X3))))|~(in(bottom_of_relstr(X3),X4)))|(((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3))))))|(((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3))))&(((in(bottom_of_relstr(X3),X4)|proper_element(X4,powerset(the_carrier(X3))))|(((empty(X4)|~(filtered_subset(X4,X3)))|~(upper_relstr_subset(X4,X3)))|~(element(X4,powerset(the_carrier(X3))))))|(((((empty_carrier(X3)|~(reflexive_relstr(X3)))|~(transitive_relstr(X3)))|~(antisymmetric_relstr(X3)))|~(lower_bounded_relstr(X3)))|~(rel_str(X3))))),inference(distribute,[status(thm)],[212])).
% cnf(215,plain,(empty_carrier(X1)|empty(X2)|~rel_str(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)|~transitive_relstr(X1)|~reflexive_relstr(X1)|~element(X2,powerset(the_carrier(X1)))|~upper_relstr_subset(X2,X1)|~filtered_subset(X2,X1)|~in(bottom_of_relstr(X1),X2)|~proper_element(X2,powerset(the_carrier(X1)))),inference(split_conjunct,[status(thm)],[213])).
% fof(276, plain,![X2]:(strict_rel_str(boole_POSet(X2))&rel_str(boole_POSet(X2))),inference(variable_rename,[status(thm)],[37])).
% cnf(277,plain,(rel_str(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[276])).
% fof(319, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[44])).
% fof(320, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[319])).
% cnf(321,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[320])).
% fof(338, plain,![X2]:((((~(empty_carrier(boole_POSet(X2)))&strict_rel_str(boole_POSet(X2)))&reflexive_relstr(boole_POSet(X2)))&transitive_relstr(boole_POSet(X2)))&antisymmetric_relstr(boole_POSet(X2))),inference(variable_rename,[status(thm)],[110])).
% cnf(339,plain,(antisymmetric_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[338])).
% cnf(340,plain,(transitive_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[338])).
% cnf(341,plain,(reflexive_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[338])).
% cnf(343,plain,(~empty_carrier(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[338])).
% fof(420, plain,![X2]:bottom_of_relstr(boole_POSet(X2))=empty_set,inference(variable_rename,[status(thm)],[61])).
% cnf(421,plain,(bottom_of_relstr(boole_POSet(X1))=empty_set),inference(split_conjunct,[status(thm)],[420])).
% fof(461, plain,![X2]:((((((((((~(empty_carrier(boole_POSet(X2)))&strict_rel_str(boole_POSet(X2)))&reflexive_relstr(boole_POSet(X2)))&transitive_relstr(boole_POSet(X2)))&antisymmetric_relstr(boole_POSet(X2)))&lower_bounded_relstr(boole_POSet(X2)))&upper_bounded_relstr(boole_POSet(X2)))&bounded_relstr(boole_POSet(X2)))&with_suprema_relstr(boole_POSet(X2)))&with_infima_relstr(boole_POSet(X2)))&complete_relstr(boole_POSet(X2))),inference(variable_rename,[status(thm)],[121])).
% cnf(467,plain,(lower_bounded_relstr(boole_POSet(X1))),inference(split_conjunct,[status(thm)],[461])).
% fof(587, negated_conjecture,?[X1]:(~(empty(X1))&?[X2]:(((((~(empty(X2))&filtered_subset(X2,boole_POSet(X1)))&upper_relstr_subset(X2,boole_POSet(X1)))&proper_element(X2,powerset(the_carrier(boole_POSet(X1)))))&element(X2,powerset(the_carrier(boole_POSet(X1)))))&?[X3]:(in(X3,X2)&empty(X3)))),inference(fof_nnf,[status(thm)],[128])).
% fof(588, negated_conjecture,?[X4]:(~(empty(X4))&?[X5]:(((((~(empty(X5))&filtered_subset(X5,boole_POSet(X4)))&upper_relstr_subset(X5,boole_POSet(X4)))&proper_element(X5,powerset(the_carrier(boole_POSet(X4)))))&element(X5,powerset(the_carrier(boole_POSet(X4)))))&?[X6]:(in(X6,X5)&empty(X6)))),inference(variable_rename,[status(thm)],[587])).
% fof(589, negated_conjecture,(~(empty(esk28_0))&(((((~(empty(esk29_0))&filtered_subset(esk29_0,boole_POSet(esk28_0)))&upper_relstr_subset(esk29_0,boole_POSet(esk28_0)))&proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))))&element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))))&(in(esk30_0,esk29_0)&empty(esk30_0)))),inference(skolemize,[status(esa)],[588])).
% cnf(590,negated_conjecture,(empty(esk30_0)),inference(split_conjunct,[status(thm)],[589])).
% cnf(591,negated_conjecture,(in(esk30_0,esk29_0)),inference(split_conjunct,[status(thm)],[589])).
% cnf(592,negated_conjecture,(element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))),inference(split_conjunct,[status(thm)],[589])).
% cnf(593,negated_conjecture,(proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))),inference(split_conjunct,[status(thm)],[589])).
% cnf(594,negated_conjecture,(upper_relstr_subset(esk29_0,boole_POSet(esk28_0))),inference(split_conjunct,[status(thm)],[589])).
% cnf(595,negated_conjecture,(filtered_subset(esk29_0,boole_POSet(esk28_0))),inference(split_conjunct,[status(thm)],[589])).
% cnf(652,plain,(empty_carrier(X1)|~proper_element(X2,powerset(the_carrier(X1)))|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)|~upper_relstr_subset(X2,X1)|~filtered_subset(X2,X1)|~rel_str(X1)|~transitive_relstr(X1)|~reflexive_relstr(X1)|~element(X2,powerset(the_carrier(X1)))|~in(bottom_of_relstr(X1),X2)),inference(csr,[status(thm)],[215,161])).
% cnf(653,negated_conjecture,(empty_set=esk30_0),inference(spm,[status(thm)],[321,590,theory(equality)])).
% cnf(946,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|~lower_bounded_relstr(boole_POSet(esk28_0))|~antisymmetric_relstr(boole_POSet(esk28_0))|~upper_relstr_subset(esk29_0,boole_POSet(esk28_0))|~filtered_subset(esk29_0,boole_POSet(esk28_0))|~rel_str(boole_POSet(esk28_0))|~transitive_relstr(boole_POSet(esk28_0))|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(spm,[status(thm)],[652,593,theory(equality)])).
% cnf(948,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|~antisymmetric_relstr(boole_POSet(esk28_0))|~upper_relstr_subset(esk29_0,boole_POSet(esk28_0))|~filtered_subset(esk29_0,boole_POSet(esk28_0))|~rel_str(boole_POSet(esk28_0))|~transitive_relstr(boole_POSet(esk28_0))|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[946,467,theory(equality)])).
% cnf(949,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|~upper_relstr_subset(esk29_0,boole_POSet(esk28_0))|~filtered_subset(esk29_0,boole_POSet(esk28_0))|~rel_str(boole_POSet(esk28_0))|~transitive_relstr(boole_POSet(esk28_0))|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[948,339,theory(equality)])).
% cnf(950,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|~filtered_subset(esk29_0,boole_POSet(esk28_0))|~rel_str(boole_POSet(esk28_0))|~transitive_relstr(boole_POSet(esk28_0))|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[949,594,theory(equality)])).
% cnf(951,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|$false|~rel_str(boole_POSet(esk28_0))|~transitive_relstr(boole_POSet(esk28_0))|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[950,595,theory(equality)])).
% cnf(952,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|$false|$false|~transitive_relstr(boole_POSet(esk28_0))|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[951,277,theory(equality)])).
% cnf(953,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|$false|$false|$false|~reflexive_relstr(boole_POSet(esk28_0))|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[952,340,theory(equality)])).
% cnf(954,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|$false|$false|$false|$false|~element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0))))|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[953,341,theory(equality)])).
% cnf(955,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|$false|$false|$false|$false|$false|~in(bottom_of_relstr(boole_POSet(esk28_0)),esk29_0)),inference(rw,[status(thm)],[954,592,theory(equality)])).
% cnf(956,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|$false|$false|$false|$false|$false|$false|$false|$false|~in(empty_set,esk29_0)),inference(rw,[status(thm)],[955,421,theory(equality)])).
% cnf(957,negated_conjecture,(empty_carrier(boole_POSet(esk28_0))|~in(empty_set,esk29_0)),inference(cn,[status(thm)],[956,theory(equality)])).
% cnf(958,negated_conjecture,(~in(empty_set,esk29_0)),inference(sr,[status(thm)],[957,343,theory(equality)])).
% cnf(960,negated_conjecture,(in(empty_set,esk29_0)),inference(rw,[status(thm)],[591,653,theory(equality)])).
% cnf(969,negated_conjecture,($false),inference(sr,[status(thm)],[960,958,theory(equality)])).
% cnf(970,negated_conjecture,($false),969,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 474
% # ...of these trivial : 45
% # ...subsumed : 9
% # ...remaining for further processing: 420
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 128
% # ...of the previous two non-trivial : 86
% # Contextual simplify-reflections : 10
% # Paramodulations : 128
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 208
% # Positive orientable unit clauses: 113
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 21
% # Non-unit-clauses : 74
% # Current number of unprocessed clauses: 74
% # ...number of literals in the above : 224
% # Clause-clause subsumption calls (NU) : 1366
% # Rec. Clause-clause subsumption calls : 229
% # Unit Clause-clause subsumption calls : 107
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 240 leaves, 1.14+/-0.485 terms/leaf
% # Paramod-from index: 144 leaves, 1.01+/-0.083 terms/leaf
% # Paramod-into index: 222 leaves, 1.06+/-0.287 terms/leaf
% # -------------------------------------------------
% # User time : 0.043 s
% # System time : 0.008 s
% # Total time : 0.051 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.23 WC
% FINAL PrfWatch: 0.16 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP2286/SEU387+1.tptp
%
%------------------------------------------------------------------------------