TSTP Solution File: SEU361+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU361+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 : 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 04:02:10 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP17674/SEU361+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17674/SEU361+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17674/SEU361+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 17770
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:![X2]:(rel_str(X1)=>element(join_on_relstr(X1,X2),the_carrier(X1))),file('/tmp/SRASS.s.p', dt_k1_yellow_0)).
% fof(5, axiom,![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>(ex_sup_of_relstr_set(X1,empty_set)&ex_inf_of_relstr_set(X1,the_carrier(X1)))),file('/tmp/SRASS.s.p', t42_yellow_0)).
% fof(7, axiom,![X1]:((antisymmetric_relstr(X1)&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>![X3]:(((X2=join_on_relstr(X1,X3)&ex_sup_of_relstr_set(X1,X3))=>(relstr_set_smaller(X1,X3,X2)&![X4]:(element(X4,the_carrier(X1))=>(relstr_set_smaller(X1,X3,X4)=>related(X1,X2,X4)))))&((relstr_set_smaller(X1,X3,X2)&![X4]:(element(X4,the_carrier(X1))=>(relstr_set_smaller(X1,X3,X4)=>related(X1,X2,X4))))=>(X2=join_on_relstr(X1,X3)&ex_sup_of_relstr_set(X1,X3)))))),file('/tmp/SRASS.s.p', t30_yellow_0)).
% fof(15, axiom,![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(16, axiom,![X1]:(rel_str(X1)=>bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)),file('/tmp/SRASS.s.p', d11_yellow_0)).
% fof(28, conjecture,![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>related(X1,bottom_of_relstr(X1),X2))),file('/tmp/SRASS.s.p', t44_yellow_0)).
% fof(29, negated_conjecture,~(![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>related(X1,bottom_of_relstr(X1),X2)))),inference(assume_negation,[status(cth)],[28])).
% fof(30, plain,![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>(ex_sup_of_relstr_set(X1,empty_set)&ex_inf_of_relstr_set(X1,the_carrier(X1)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(36, negated_conjecture,~(![X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>related(X1,bottom_of_relstr(X1),X2)))),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(46, plain,![X1]:![X2]:(~(rel_str(X1))|element(join_on_relstr(X1,X2),the_carrier(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(47, plain,![X3]:![X4]:(~(rel_str(X3))|element(join_on_relstr(X3,X4),the_carrier(X3))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(element(join_on_relstr(X1,X2),the_carrier(X1))|~rel_str(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X1]:((((empty_carrier(X1)|~(antisymmetric_relstr(X1)))|~(lower_bounded_relstr(X1)))|~(rel_str(X1)))|(ex_sup_of_relstr_set(X1,empty_set)&ex_inf_of_relstr_set(X1,the_carrier(X1)))),inference(fof_nnf,[status(thm)],[30])).
% fof(50, plain,![X2]:((((empty_carrier(X2)|~(antisymmetric_relstr(X2)))|~(lower_bounded_relstr(X2)))|~(rel_str(X2)))|(ex_sup_of_relstr_set(X2,empty_set)&ex_inf_of_relstr_set(X2,the_carrier(X2)))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X2]:((ex_sup_of_relstr_set(X2,empty_set)|(((empty_carrier(X2)|~(antisymmetric_relstr(X2)))|~(lower_bounded_relstr(X2)))|~(rel_str(X2))))&(ex_inf_of_relstr_set(X2,the_carrier(X2))|(((empty_carrier(X2)|~(antisymmetric_relstr(X2)))|~(lower_bounded_relstr(X2)))|~(rel_str(X2))))),inference(distribute,[status(thm)],[50])).
% cnf(53,plain,(empty_carrier(X1)|ex_sup_of_relstr_set(X1,empty_set)|~rel_str(X1)|~lower_bounded_relstr(X1)|~antisymmetric_relstr(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(57, plain,![X1]:((~(antisymmetric_relstr(X1))|~(rel_str(X1)))|![X2]:(~(element(X2,the_carrier(X1)))|![X3]:(((~(X2=join_on_relstr(X1,X3))|~(ex_sup_of_relstr_set(X1,X3)))|(relstr_set_smaller(X1,X3,X2)&![X4]:(~(element(X4,the_carrier(X1)))|(~(relstr_set_smaller(X1,X3,X4))|related(X1,X2,X4)))))&((~(relstr_set_smaller(X1,X3,X2))|?[X4]:(element(X4,the_carrier(X1))&(relstr_set_smaller(X1,X3,X4)&~(related(X1,X2,X4)))))|(X2=join_on_relstr(X1,X3)&ex_sup_of_relstr_set(X1,X3)))))),inference(fof_nnf,[status(thm)],[7])).
% fof(58, plain,![X5]:((~(antisymmetric_relstr(X5))|~(rel_str(X5)))|![X6]:(~(element(X6,the_carrier(X5)))|![X7]:(((~(X6=join_on_relstr(X5,X7))|~(ex_sup_of_relstr_set(X5,X7)))|(relstr_set_smaller(X5,X7,X6)&![X8]:(~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X7,X8))|related(X5,X6,X8)))))&((~(relstr_set_smaller(X5,X7,X6))|?[X9]:(element(X9,the_carrier(X5))&(relstr_set_smaller(X5,X7,X9)&~(related(X5,X6,X9)))))|(X6=join_on_relstr(X5,X7)&ex_sup_of_relstr_set(X5,X7)))))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X5]:((~(antisymmetric_relstr(X5))|~(rel_str(X5)))|![X6]:(~(element(X6,the_carrier(X5)))|![X7]:(((~(X6=join_on_relstr(X5,X7))|~(ex_sup_of_relstr_set(X5,X7)))|(relstr_set_smaller(X5,X7,X6)&![X8]:(~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X7,X8))|related(X5,X6,X8)))))&((~(relstr_set_smaller(X5,X7,X6))|(element(esk3_3(X5,X6,X7),the_carrier(X5))&(relstr_set_smaller(X5,X7,esk3_3(X5,X6,X7))&~(related(X5,X6,esk3_3(X5,X6,X7))))))|(X6=join_on_relstr(X5,X7)&ex_sup_of_relstr_set(X5,X7)))))),inference(skolemize,[status(esa)],[58])).
% fof(60, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X7,X8))|related(X5,X6,X8)))&relstr_set_smaller(X5,X7,X6))|(~(X6=join_on_relstr(X5,X7))|~(ex_sup_of_relstr_set(X5,X7))))&((~(relstr_set_smaller(X5,X7,X6))|(element(esk3_3(X5,X6,X7),the_carrier(X5))&(relstr_set_smaller(X5,X7,esk3_3(X5,X6,X7))&~(related(X5,X6,esk3_3(X5,X6,X7))))))|(X6=join_on_relstr(X5,X7)&ex_sup_of_relstr_set(X5,X7))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5)))),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,the_carrier(X5)))|(~(relstr_set_smaller(X5,X7,X8))|related(X5,X6,X8)))|(~(X6=join_on_relstr(X5,X7))|~(ex_sup_of_relstr_set(X5,X7))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5))))&(((relstr_set_smaller(X5,X7,X6)|(~(X6=join_on_relstr(X5,X7))|~(ex_sup_of_relstr_set(X5,X7))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5)))))&(((((X6=join_on_relstr(X5,X7)|(element(esk3_3(X5,X6,X7),the_carrier(X5))|~(relstr_set_smaller(X5,X7,X6))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5))))&(((ex_sup_of_relstr_set(X5,X7)|(element(esk3_3(X5,X6,X7),the_carrier(X5))|~(relstr_set_smaller(X5,X7,X6))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5)))))&(((((X6=join_on_relstr(X5,X7)|(relstr_set_smaller(X5,X7,esk3_3(X5,X6,X7))|~(relstr_set_smaller(X5,X7,X6))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5))))&(((ex_sup_of_relstr_set(X5,X7)|(relstr_set_smaller(X5,X7,esk3_3(X5,X6,X7))|~(relstr_set_smaller(X5,X7,X6))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5)))))&((((X6=join_on_relstr(X5,X7)|(~(related(X5,X6,esk3_3(X5,X6,X7)))|~(relstr_set_smaller(X5,X7,X6))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5))))&(((ex_sup_of_relstr_set(X5,X7)|(~(related(X5,X6,esk3_3(X5,X6,X7)))|~(relstr_set_smaller(X5,X7,X6))))|~(element(X6,the_carrier(X5))))|(~(antisymmetric_relstr(X5))|~(rel_str(X5)))))))),inference(distribute,[status(thm)],[60])).
% cnf(69,plain,(related(X1,X2,X4)|~rel_str(X1)|~antisymmetric_relstr(X1)|~element(X2,the_carrier(X1))|~ex_sup_of_relstr_set(X1,X3)|X2!=join_on_relstr(X1,X3)|~relstr_set_smaller(X1,X3,X4)|~element(X4,the_carrier(X1))),inference(split_conjunct,[status(thm)],[61])).
% fof(92, plain,![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)],[15])).
% fof(93, plain,![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)],[92])).
% fof(94, plain,![X3]:![X4]:((~(element(X4,the_carrier(X3)))|(relstr_set_smaller(X3,empty_set,X4)&relstr_element_smaller(X3,empty_set,X4)))|~(rel_str(X3))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, plain,![X3]:![X4]:(((relstr_set_smaller(X3,empty_set,X4)|~(element(X4,the_carrier(X3))))|~(rel_str(X3)))&((relstr_element_smaller(X3,empty_set,X4)|~(element(X4,the_carrier(X3))))|~(rel_str(X3)))),inference(distribute,[status(thm)],[94])).
% cnf(97,plain,(relstr_set_smaller(X1,empty_set,X2)|~rel_str(X1)|~element(X2,the_carrier(X1))),inference(split_conjunct,[status(thm)],[95])).
% fof(98, plain,![X1]:(~(rel_str(X1))|bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)),inference(fof_nnf,[status(thm)],[16])).
% fof(99, plain,![X2]:(~(rel_str(X2))|bottom_of_relstr(X2)=join_on_relstr(X2,empty_set)),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(bottom_of_relstr(X1)=join_on_relstr(X1,empty_set)|~rel_str(X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(125, negated_conjecture,?[X1]:((((~(empty_carrier(X1))&antisymmetric_relstr(X1))&lower_bounded_relstr(X1))&rel_str(X1))&?[X2]:(element(X2,the_carrier(X1))&~(related(X1,bottom_of_relstr(X1),X2)))),inference(fof_nnf,[status(thm)],[36])).
% fof(126, negated_conjecture,?[X3]:((((~(empty_carrier(X3))&antisymmetric_relstr(X3))&lower_bounded_relstr(X3))&rel_str(X3))&?[X4]:(element(X4,the_carrier(X3))&~(related(X3,bottom_of_relstr(X3),X4)))),inference(variable_rename,[status(thm)],[125])).
% fof(127, negated_conjecture,((((~(empty_carrier(esk9_0))&antisymmetric_relstr(esk9_0))&lower_bounded_relstr(esk9_0))&rel_str(esk9_0))&(element(esk10_0,the_carrier(esk9_0))&~(related(esk9_0,bottom_of_relstr(esk9_0),esk10_0)))),inference(skolemize,[status(esa)],[126])).
% cnf(128,negated_conjecture,(~related(esk9_0,bottom_of_relstr(esk9_0),esk10_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,negated_conjecture,(element(esk10_0,the_carrier(esk9_0))),inference(split_conjunct,[status(thm)],[127])).
% cnf(130,negated_conjecture,(rel_str(esk9_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(131,negated_conjecture,(lower_bounded_relstr(esk9_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(132,negated_conjecture,(antisymmetric_relstr(esk9_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(133,negated_conjecture,(~empty_carrier(esk9_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(135,negated_conjecture,(~related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0)|~rel_str(esk9_0)),inference(spm,[status(thm)],[128,100,theory(equality)])).
% cnf(136,negated_conjecture,(~related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0)|$false),inference(rw,[status(thm)],[135,130,theory(equality)])).
% cnf(137,negated_conjecture,(~related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0)),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(165,negated_conjecture,(relstr_set_smaller(esk9_0,empty_set,esk10_0)|~rel_str(esk9_0)),inference(spm,[status(thm)],[97,129,theory(equality)])).
% cnf(169,negated_conjecture,(relstr_set_smaller(esk9_0,empty_set,esk10_0)|$false),inference(rw,[status(thm)],[165,130,theory(equality)])).
% cnf(170,negated_conjecture,(relstr_set_smaller(esk9_0,empty_set,esk10_0)),inference(cn,[status(thm)],[169,theory(equality)])).
% cnf(181,negated_conjecture,(ex_sup_of_relstr_set(esk9_0,empty_set)|empty_carrier(esk9_0)|~antisymmetric_relstr(esk9_0)|~rel_str(esk9_0)),inference(spm,[status(thm)],[53,131,theory(equality)])).
% cnf(182,negated_conjecture,(ex_sup_of_relstr_set(esk9_0,empty_set)|empty_carrier(esk9_0)|$false|~rel_str(esk9_0)),inference(rw,[status(thm)],[181,132,theory(equality)])).
% cnf(183,negated_conjecture,(ex_sup_of_relstr_set(esk9_0,empty_set)|empty_carrier(esk9_0)|$false|$false),inference(rw,[status(thm)],[182,130,theory(equality)])).
% cnf(184,negated_conjecture,(ex_sup_of_relstr_set(esk9_0,empty_set)|empty_carrier(esk9_0)),inference(cn,[status(thm)],[183,theory(equality)])).
% cnf(185,negated_conjecture,(ex_sup_of_relstr_set(esk9_0,empty_set)),inference(sr,[status(thm)],[184,133,theory(equality)])).
% cnf(245,plain,(related(X1,join_on_relstr(X1,X2),X3)|~relstr_set_smaller(X1,X2,X3)|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~element(join_on_relstr(X1,X2),the_carrier(X1))|~rel_str(X1)),inference(er,[status(thm)],[69,theory(equality)])).
% cnf(1212,plain,(related(X1,join_on_relstr(X1,X2),X3)|~relstr_set_smaller(X1,X2,X3)|~ex_sup_of_relstr_set(X1,X2)|~antisymmetric_relstr(X1)|~element(X3,the_carrier(X1))|~rel_str(X1)),inference(csr,[status(thm)],[245,48])).
% cnf(1215,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,X1),esk10_0)|~relstr_set_smaller(esk9_0,X1,esk10_0)|~ex_sup_of_relstr_set(esk9_0,X1)|~antisymmetric_relstr(esk9_0)|~rel_str(esk9_0)),inference(spm,[status(thm)],[1212,129,theory(equality)])).
% cnf(1225,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,X1),esk10_0)|~relstr_set_smaller(esk9_0,X1,esk10_0)|~ex_sup_of_relstr_set(esk9_0,X1)|$false|~rel_str(esk9_0)),inference(rw,[status(thm)],[1215,132,theory(equality)])).
% cnf(1226,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,X1),esk10_0)|~relstr_set_smaller(esk9_0,X1,esk10_0)|~ex_sup_of_relstr_set(esk9_0,X1)|$false|$false),inference(rw,[status(thm)],[1225,130,theory(equality)])).
% cnf(1227,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,X1),esk10_0)|~relstr_set_smaller(esk9_0,X1,esk10_0)|~ex_sup_of_relstr_set(esk9_0,X1)),inference(cn,[status(thm)],[1226,theory(equality)])).
% cnf(1234,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0)|~relstr_set_smaller(esk9_0,empty_set,esk10_0)),inference(spm,[status(thm)],[1227,185,theory(equality)])).
% cnf(1235,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0)|$false),inference(rw,[status(thm)],[1234,170,theory(equality)])).
% cnf(1236,negated_conjecture,(related(esk9_0,join_on_relstr(esk9_0,empty_set),esk10_0)),inference(cn,[status(thm)],[1235,theory(equality)])).
% cnf(1237,negated_conjecture,($false),inference(sr,[status(thm)],[1236,137,theory(equality)])).
% cnf(1238,negated_conjecture,($false),1237,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 539
% # ...of these trivial : 0
% # ...subsumed : 306
% # ...remaining for further processing: 233
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 14
% # Backward-rewritten : 2
% # Generated clauses : 792
% # ...of the previous two non-trivial : 733
% # Contextual simplify-reflections : 201
% # Paramodulations : 786
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 217
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 196
% # Current number of unprocessed clauses: 203
% # ...number of literals in the above : 1380
% # Clause-clause subsumption calls (NU) : 7170
% # Rec. Clause-clause subsumption calls : 1682
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 130 leaves, 1.80+/-1.702 terms/leaf
% # Paramod-from index: 37 leaves, 1.43+/-1.242 terms/leaf
% # Paramod-into index: 98 leaves, 1.40+/-0.977 terms/leaf
% # -------------------------------------------------
% # User time : 0.102 s
% # System time : 0.001 s
% # Total time : 0.103 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP17674/SEU361+1.tptp
%
%------------------------------------------------------------------------------