TSTP Solution File: SEU355+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU355+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 : art03.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:58:32 EST 2010
% Result : Theorem 47.36s
% Output : Solution 47.36s
% 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/SystemOnTPTP16068/SEU355+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16068/SEU355+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16068/SEU355+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 16236
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.92 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% PrfWatch: 9.89 CPU 10.03 WC
% PrfWatch: 11.89 CPU 12.03 WC
% # Preprocessing time : 0.365 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.87 CPU 14.04 WC
% PrfWatch: 15.86 CPU 16.04 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(rel_str(X1)=>![X2]:![X3]:(element(X3,the_carrier(X1))=>(relstr_element_smaller(X1,X2,X3)<=>![X4]:(element(X4,the_carrier(X1))=>(in(X4,X2)=>related(X1,X3,X4)))))),file('/tmp/SRASS.s.p', d8_lattice3)).
% fof(4, axiom,![X1]:(rel_str(X1)=>![X2]:![X3]:(element(X3,the_carrier(X1))=>(relstr_set_smaller(X1,X2,X3)<=>![X4]:(element(X4,the_carrier(X1))=>(in(X4,X2)=>related(X1,X4,X3)))))),file('/tmp/SRASS.s.p', d9_lattice3)).
% fof(29, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(32, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(33, axiom,![X1]:set_union2(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t1_boole)).
% fof(274, axiom,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', l23_zfmisc_1)).
% fof(310, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(562, axiom,?[X1]:((((((relation(X1)&function(X1))&one_to_one(X1))&empty(X1))&epsilon_transitive(X1))&epsilon_connected(X1))&ordinal(X1)),file('/tmp/SRASS.s.p', rc2_ordinal1)).
% fof(671, conjecture,![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>(relstr_set_smaller(X1,empty_set,X2)&relstr_element_smaller(X1,empty_set,X2)))),file('/tmp/SRASS.s.p', t6_yellow_0)).
% fof(672, negated_conjecture,~(![X1]:(rel_str(X1)=>![X2]:(element(X2,the_carrier(X1))=>(relstr_set_smaller(X1,empty_set,X2)&relstr_element_smaller(X1,empty_set,X2))))),inference(assume_negation,[status(cth)],[671])).
% fof(831, plain,![X1]:(~(rel_str(X1))|![X2]:![X3]:(~(element(X3,the_carrier(X1)))|((~(relstr_element_smaller(X1,X2,X3))|![X4]:(~(element(X4,the_carrier(X1)))|(~(in(X4,X2))|related(X1,X3,X4))))&(?[X4]:(element(X4,the_carrier(X1))&(in(X4,X2)&~(related(X1,X3,X4))))|relstr_element_smaller(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[3])).
% fof(832, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_element_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8))))&(?[X9]:(element(X9,the_carrier(X5))&(in(X9,X6)&~(related(X5,X7,X9))))|relstr_element_smaller(X5,X6,X7))))),inference(variable_rename,[status(thm)],[831])).
% fof(833, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_element_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8))))&((element(esk3_3(X5,X6,X7),the_carrier(X5))&(in(esk3_3(X5,X6,X7),X6)&~(related(X5,X7,esk3_3(X5,X6,X7)))))|relstr_element_smaller(X5,X6,X7))))),inference(skolemize,[status(esa)],[832])).
% fof(834, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8)))|~(relstr_element_smaller(X5,X6,X7)))&((element(esk3_3(X5,X6,X7),the_carrier(X5))&(in(esk3_3(X5,X6,X7),X6)&~(related(X5,X7,esk3_3(X5,X6,X7)))))|relstr_element_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5))),inference(shift_quantors,[status(thm)],[833])).
% fof(835, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X7,X8)))|~(relstr_element_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((element(esk3_3(X5,X6,X7),the_carrier(X5))|relstr_element_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((in(esk3_3(X5,X6,X7),X6)|relstr_element_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&(((~(related(X5,X7,esk3_3(X5,X6,X7)))|relstr_element_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))))),inference(distribute,[status(thm)],[834])).
% cnf(837,plain,(relstr_element_smaller(X1,X3,X2)|in(esk3_3(X1,X3,X2),X3)|~rel_str(X1)|~element(X2,the_carrier(X1))),inference(split_conjunct,[status(thm)],[835])).
% fof(840, plain,![X1]:(~(rel_str(X1))|![X2]:![X3]:(~(element(X3,the_carrier(X1)))|((~(relstr_set_smaller(X1,X2,X3))|![X4]:(~(element(X4,the_carrier(X1)))|(~(in(X4,X2))|related(X1,X4,X3))))&(?[X4]:(element(X4,the_carrier(X1))&(in(X4,X2)&~(related(X1,X4,X3))))|relstr_set_smaller(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[4])).
% fof(841, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_set_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7))))&(?[X9]:(element(X9,the_carrier(X5))&(in(X9,X6)&~(related(X5,X9,X7))))|relstr_set_smaller(X5,X6,X7))))),inference(variable_rename,[status(thm)],[840])).
% fof(842, plain,![X5]:(~(rel_str(X5))|![X6]:![X7]:(~(element(X7,the_carrier(X5)))|((~(relstr_set_smaller(X5,X6,X7))|![X8]:(~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7))))&((element(esk4_3(X5,X6,X7),the_carrier(X5))&(in(esk4_3(X5,X6,X7),X6)&~(related(X5,esk4_3(X5,X6,X7),X7))))|relstr_set_smaller(X5,X6,X7))))),inference(skolemize,[status(esa)],[841])).
% fof(843, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7)))|~(relstr_set_smaller(X5,X6,X7)))&((element(esk4_3(X5,X6,X7),the_carrier(X5))&(in(esk4_3(X5,X6,X7),X6)&~(related(X5,esk4_3(X5,X6,X7),X7))))|relstr_set_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5))),inference(shift_quantors,[status(thm)],[842])).
% fof(844, plain,![X5]:![X6]:![X7]:![X8]:(((((~(element(X8,the_carrier(X5)))|(~(in(X8,X6))|related(X5,X8,X7)))|~(relstr_set_smaller(X5,X6,X7)))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((element(esk4_3(X5,X6,X7),the_carrier(X5))|relstr_set_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&((((in(esk4_3(X5,X6,X7),X6)|relstr_set_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))&(((~(related(X5,esk4_3(X5,X6,X7),X7))|relstr_set_smaller(X5,X6,X7))|~(element(X7,the_carrier(X5))))|~(rel_str(X5)))))),inference(distribute,[status(thm)],[843])).
% cnf(846,plain,(relstr_set_smaller(X1,X3,X2)|in(esk4_3(X1,X3,X2),X3)|~rel_str(X1)|~element(X2,the_carrier(X1))),inference(split_conjunct,[status(thm)],[844])).
% fof(931, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[29])).
% fof(932, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[931])).
% cnf(933,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[932])).
% fof(944, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[32])).
% cnf(945,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[944])).
% fof(946, plain,![X2]:set_union2(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[33])).
% cnf(947,plain,(set_union2(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[946])).
% fof(2275, plain,![X1]:![X2]:(~(in(X1,X2))|set_union2(singleton(X1),X2)=X2),inference(fof_nnf,[status(thm)],[274])).
% fof(2276, plain,![X3]:![X4]:(~(in(X3,X4))|set_union2(singleton(X3),X4)=X4),inference(variable_rename,[status(thm)],[2275])).
% cnf(2277,plain,(set_union2(singleton(X1),X2)=X2|~in(X1,X2)),inference(split_conjunct,[status(thm)],[2276])).
% fof(2565, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[310])).
% cnf(2566,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[2565])).
% fof(4853, plain,?[X2]:((((((relation(X2)&function(X2))&one_to_one(X2))&empty(X2))&epsilon_transitive(X2))&epsilon_connected(X2))&ordinal(X2)),inference(variable_rename,[status(thm)],[562])).
% fof(4854, plain,((((((relation(esk402_0)&function(esk402_0))&one_to_one(esk402_0))&empty(esk402_0))&epsilon_transitive(esk402_0))&epsilon_connected(esk402_0))&ordinal(esk402_0)),inference(skolemize,[status(esa)],[4853])).
% cnf(4858,plain,(empty(esk402_0)),inference(split_conjunct,[status(thm)],[4854])).
% fof(5448, negated_conjecture,?[X1]:(rel_str(X1)&?[X2]:(element(X2,the_carrier(X1))&(~(relstr_set_smaller(X1,empty_set,X2))|~(relstr_element_smaller(X1,empty_set,X2))))),inference(fof_nnf,[status(thm)],[672])).
% fof(5449, negated_conjecture,?[X3]:(rel_str(X3)&?[X4]:(element(X4,the_carrier(X3))&(~(relstr_set_smaller(X3,empty_set,X4))|~(relstr_element_smaller(X3,empty_set,X4))))),inference(variable_rename,[status(thm)],[5448])).
% fof(5450, negated_conjecture,(rel_str(esk441_0)&(element(esk442_0,the_carrier(esk441_0))&(~(relstr_set_smaller(esk441_0,empty_set,esk442_0))|~(relstr_element_smaller(esk441_0,empty_set,esk442_0))))),inference(skolemize,[status(esa)],[5449])).
% cnf(5451,negated_conjecture,(~relstr_element_smaller(esk441_0,empty_set,esk442_0)|~relstr_set_smaller(esk441_0,empty_set,esk442_0)),inference(split_conjunct,[status(thm)],[5450])).
% cnf(5452,negated_conjecture,(element(esk442_0,the_carrier(esk441_0))),inference(split_conjunct,[status(thm)],[5450])).
% cnf(5453,negated_conjecture,(rel_str(esk441_0)),inference(split_conjunct,[status(thm)],[5450])).
% cnf(5590,plain,(set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2)),inference(rw,[status(thm)],[2277,2566,theory(equality)]),['unfolding']).
% cnf(5697,plain,(unordered_pair(X1,X1)!=empty_set),inference(rw,[status(thm)],[945,2566,theory(equality)]),['unfolding']).
% cnf(7406,plain,(empty_set=esk402_0),inference(spm,[status(thm)],[933,4858,theory(equality)])).
% cnf(13046,negated_conjecture,(in(esk3_3(esk441_0,X1,esk442_0),X1)|relstr_element_smaller(esk441_0,X1,esk442_0)|~rel_str(esk441_0)),inference(spm,[status(thm)],[837,5452,theory(equality)])).
% cnf(13059,negated_conjecture,(in(esk3_3(esk441_0,X1,esk442_0),X1)|relstr_element_smaller(esk441_0,X1,esk442_0)|$false),inference(rw,[status(thm)],[13046,5453,theory(equality)])).
% cnf(13060,negated_conjecture,(in(esk3_3(esk441_0,X1,esk442_0),X1)|relstr_element_smaller(esk441_0,X1,esk442_0)),inference(cn,[status(thm)],[13059,theory(equality)])).
% cnf(13187,negated_conjecture,(relstr_set_smaller(esk441_0,X1,esk442_0)|in(esk4_3(esk441_0,X1,esk442_0),X1)|~rel_str(esk441_0)),inference(spm,[status(thm)],[846,5452,theory(equality)])).
% cnf(13200,negated_conjecture,(relstr_set_smaller(esk441_0,X1,esk442_0)|in(esk4_3(esk441_0,X1,esk442_0),X1)|$false),inference(rw,[status(thm)],[13187,5453,theory(equality)])).
% cnf(13201,negated_conjecture,(relstr_set_smaller(esk441_0,X1,esk442_0)|in(esk4_3(esk441_0,X1,esk442_0),X1)),inference(cn,[status(thm)],[13200,theory(equality)])).
% cnf(135550,negated_conjecture,(~relstr_set_smaller(esk441_0,esk402_0,esk442_0)|~relstr_element_smaller(esk441_0,empty_set,esk442_0)),inference(rw,[status(thm)],[5451,7406,theory(equality)])).
% cnf(135551,negated_conjecture,(~relstr_set_smaller(esk441_0,esk402_0,esk442_0)|~relstr_element_smaller(esk441_0,esk402_0,esk442_0)),inference(rw,[status(thm)],[135550,7406,theory(equality)])).
% cnf(135640,plain,(unordered_pair(X1,X1)!=esk402_0),inference(rw,[status(thm)],[5697,7406,theory(equality)])).
% cnf(135664,plain,(set_union2(X1,esk402_0)=X1),inference(rw,[status(thm)],[947,7406,theory(equality)])).
% cnf(138390,plain,(unordered_pair(X1,X1)=esk402_0|~in(X1,esk402_0)),inference(spm,[status(thm)],[5590,135664,theory(equality)])).
% cnf(138403,plain,(~in(X1,esk402_0)),inference(sr,[status(thm)],[138390,135640,theory(equality)])).
% cnf(164971,negated_conjecture,(in(esk4_3(esk441_0,esk402_0,esk442_0),esk402_0)|~relstr_element_smaller(esk441_0,esk402_0,esk442_0)),inference(spm,[status(thm)],[135551,13201,theory(equality)])).
% cnf(164974,negated_conjecture,(~relstr_element_smaller(esk441_0,esk402_0,esk442_0)),inference(sr,[status(thm)],[164971,138403,theory(equality)])).
% cnf(164976,negated_conjecture,(in(esk3_3(esk441_0,esk402_0,esk442_0),esk402_0)),inference(spm,[status(thm)],[164974,13060,theory(equality)])).
% cnf(164979,negated_conjecture,($false),inference(sr,[status(thm)],[164976,138403,theory(equality)])).
% cnf(164980,negated_conjecture,($false),164979,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6920
% # ...of these trivial : 47
% # ...subsumed : 720
% # ...remaining for further processing: 6153
% # Other redundant clauses eliminated : 671
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 211
% # Generated clauses : 148253
% # ...of the previous two non-trivial : 145870
% # Contextual simplify-reflections : 466
% # Paramodulations : 147471
% # Factorizations : 14
% # Equation resolutions : 826
% # Current number of processed clauses: 3071
% # Positive orientable unit clauses: 293
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 49
% # Non-unit-clauses : 2726
% # Current number of unprocessed clauses: 134043
% # ...number of literals in the above : 930197
% # Clause-clause subsumption calls (NU) : 5768655
% # Rec. Clause-clause subsumption calls : 345523
% # Unit Clause-clause subsumption calls : 170355
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 152
% # Indexed BW rewrite successes : 44
% # Backwards rewriting index: 2233 leaves, 1.66+/-3.263 terms/leaf
% # Paramod-from index: 876 leaves, 1.08+/-1.403 terms/leaf
% # Paramod-into index: 1639 leaves, 1.36+/-2.768 terms/leaf
% # -------------------------------------------------
% # User time : 13.066 s
% # System time : 0.265 s
% # Total time : 13.331 s
% # Maximum resident set size: 0 pages
% PrfWatch: 17.29 CPU 17.46 WC
% FINAL PrfWatch: 17.29 CPU 17.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP16068/SEU355+2.tptp
%
%------------------------------------------------------------------------------