TSTP Solution File: SEU030+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU030+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.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 00:40:44 EST 2010

% Result   : Theorem 14.33s
% Output   : Solution 14.33s
% 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/SystemOnTPTP18081/SEU030+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP18081/SEU030+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18081/SEU030+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 18178
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.91 CPU 4.03 WC
% PrfWatch: 5.91 CPU 6.03 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.90 CPU 8.04 WC
% PrfWatch: 9.88 CPU 10.04 WC
% PrfWatch: 11.88 CPU 12.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((relation(X1)&function(X1))=>(relation(function_inverse(X1))&function(function_inverse(X1)))),file('/tmp/SRASS.s.p', dt_k2_funct_1)).
% fof(6, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>![X3]:((relation(X3)&function(X3))=>![X4]:((relation(X4)&function(X4))=>(((relation_rng(X2)=X1&relation_composition(X2,X3)=identity_relation(relation_dom(X4)))&relation_composition(X3,X4)=identity_relation(X1))=>X4=X2)))),file('/tmp/SRASS.s.p', l72_funct_1)).
% fof(9, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_rng(X1)=relation_dom(function_inverse(X1))&relation_dom(X1)=relation_rng(function_inverse(X1))))),file('/tmp/SRASS.s.p', t55_funct_1)).
% fof(10, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_composition(X1,function_inverse(X1))=identity_relation(relation_dom(X1))&relation_composition(function_inverse(X1),X1)=identity_relation(relation_rng(X1))))),file('/tmp/SRASS.s.p', t61_funct_1)).
% fof(43, conjecture,![X1]:((relation(X1)&function(X1))=>![X2]:((relation(X2)&function(X2))=>(((one_to_one(X1)&relation_rng(X1)=relation_dom(X2))&relation_composition(X1,X2)=identity_relation(relation_dom(X1)))=>X2=function_inverse(X1)))),file('/tmp/SRASS.s.p', t63_funct_1)).
% fof(44, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>![X2]:((relation(X2)&function(X2))=>(((one_to_one(X1)&relation_rng(X1)=relation_dom(X2))&relation_composition(X1,X2)=identity_relation(relation_dom(X1)))=>X2=function_inverse(X1))))),inference(assume_negation,[status(cth)],[43])).
% fof(52, plain,![X1]:((~(relation(X1))|~(function(X1)))|(relation(function_inverse(X1))&function(function_inverse(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(53, plain,![X2]:((~(relation(X2))|~(function(X2)))|(relation(function_inverse(X2))&function(function_inverse(X2)))),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,![X2]:((relation(function_inverse(X2))|(~(relation(X2))|~(function(X2))))&(function(function_inverse(X2))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[53])).
% cnf(55,plain,(function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(relation(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(70, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|![X3]:((~(relation(X3))|~(function(X3)))|![X4]:((~(relation(X4))|~(function(X4)))|(((~(relation_rng(X2)=X1)|~(relation_composition(X2,X3)=identity_relation(relation_dom(X4))))|~(relation_composition(X3,X4)=identity_relation(X1)))|X4=X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(71, plain,![X5]:![X6]:((~(relation(X6))|~(function(X6)))|![X7]:((~(relation(X7))|~(function(X7)))|![X8]:((~(relation(X8))|~(function(X8)))|(((~(relation_rng(X6)=X5)|~(relation_composition(X6,X7)=identity_relation(relation_dom(X8))))|~(relation_composition(X7,X8)=identity_relation(X5)))|X8=X6)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X5]:![X6]:![X7]:![X8]:((((~(relation(X8))|~(function(X8)))|(((~(relation_rng(X6)=X5)|~(relation_composition(X6,X7)=identity_relation(relation_dom(X8))))|~(relation_composition(X7,X8)=identity_relation(X5)))|X8=X6))|(~(relation(X7))|~(function(X7))))|(~(relation(X6))|~(function(X6)))),inference(shift_quantors,[status(thm)],[71])).
% cnf(73,plain,(X3=X1|~function(X1)|~relation(X1)|~function(X2)|~relation(X2)|relation_composition(X2,X3)!=identity_relation(X4)|relation_composition(X1,X2)!=identity_relation(relation_dom(X3))|relation_rng(X1)!=X4|~function(X3)|~relation(X3)),inference(split_conjunct,[status(thm)],[72])).
% fof(83, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|(relation_rng(X1)=relation_dom(function_inverse(X1))&relation_dom(X1)=relation_rng(function_inverse(X1))))),inference(fof_nnf,[status(thm)],[9])).
% fof(84, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|(relation_rng(X2)=relation_dom(function_inverse(X2))&relation_dom(X2)=relation_rng(function_inverse(X2))))),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X2]:(((relation_rng(X2)=relation_dom(function_inverse(X2))|~(one_to_one(X2)))|(~(relation(X2))|~(function(X2))))&((relation_dom(X2)=relation_rng(function_inverse(X2))|~(one_to_one(X2)))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[84])).
% cnf(86,plain,(relation_dom(X1)=relation_rng(function_inverse(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[85])).
% fof(88, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|(relation_composition(X1,function_inverse(X1))=identity_relation(relation_dom(X1))&relation_composition(function_inverse(X1),X1)=identity_relation(relation_rng(X1))))),inference(fof_nnf,[status(thm)],[10])).
% fof(89, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|(relation_composition(X2,function_inverse(X2))=identity_relation(relation_dom(X2))&relation_composition(function_inverse(X2),X2)=identity_relation(relation_rng(X2))))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X2]:(((relation_composition(X2,function_inverse(X2))=identity_relation(relation_dom(X2))|~(one_to_one(X2)))|(~(relation(X2))|~(function(X2))))&((relation_composition(function_inverse(X2),X2)=identity_relation(relation_rng(X2))|~(one_to_one(X2)))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[89])).
% cnf(91,plain,(relation_composition(function_inverse(X1),X1)=identity_relation(relation_rng(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(205, negated_conjecture,?[X1]:((relation(X1)&function(X1))&?[X2]:((relation(X2)&function(X2))&(((one_to_one(X1)&relation_rng(X1)=relation_dom(X2))&relation_composition(X1,X2)=identity_relation(relation_dom(X1)))&~(X2=function_inverse(X1))))),inference(fof_nnf,[status(thm)],[44])).
% fof(206, negated_conjecture,?[X3]:((relation(X3)&function(X3))&?[X4]:((relation(X4)&function(X4))&(((one_to_one(X3)&relation_rng(X3)=relation_dom(X4))&relation_composition(X3,X4)=identity_relation(relation_dom(X3)))&~(X4=function_inverse(X3))))),inference(variable_rename,[status(thm)],[205])).
% fof(207, negated_conjecture,((relation(esk12_0)&function(esk12_0))&((relation(esk13_0)&function(esk13_0))&(((one_to_one(esk12_0)&relation_rng(esk12_0)=relation_dom(esk13_0))&relation_composition(esk12_0,esk13_0)=identity_relation(relation_dom(esk12_0)))&~(esk13_0=function_inverse(esk12_0))))),inference(skolemize,[status(esa)],[206])).
% cnf(208,negated_conjecture,(esk13_0!=function_inverse(esk12_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(209,negated_conjecture,(relation_composition(esk12_0,esk13_0)=identity_relation(relation_dom(esk12_0))),inference(split_conjunct,[status(thm)],[207])).
% cnf(210,negated_conjecture,(relation_rng(esk12_0)=relation_dom(esk13_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(211,negated_conjecture,(one_to_one(esk12_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(212,negated_conjecture,(function(esk13_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(213,negated_conjecture,(relation(esk13_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(214,negated_conjecture,(function(esk12_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(215,negated_conjecture,(relation(esk12_0)),inference(split_conjunct,[status(thm)],[207])).
% cnf(283,negated_conjecture,(relation(function_inverse(esk12_0))|~relation(esk12_0)),inference(pm,[status(thm)],[56,214,theory(equality)])).
% cnf(290,negated_conjecture,(relation(function_inverse(esk12_0))|$false),inference(rw,[status(thm)],[283,215,theory(equality)])).
% cnf(291,negated_conjecture,(relation(function_inverse(esk12_0))),inference(cn,[status(thm)],[290,theory(equality)])).
% cnf(301,negated_conjecture,(function(function_inverse(esk12_0))|~function(esk12_0)),inference(pm,[status(thm)],[55,215,theory(equality)])).
% cnf(312,negated_conjecture,(function(function_inverse(esk12_0))|$false),inference(rw,[status(thm)],[301,214,theory(equality)])).
% cnf(313,negated_conjecture,(function(function_inverse(esk12_0))),inference(cn,[status(thm)],[312,theory(equality)])).
% cnf(327,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(pm,[status(thm)],[86,211,theory(equality)])).
% cnf(329,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)|$false|~relation(esk12_0)),inference(rw,[status(thm)],[327,214,theory(equality)])).
% cnf(330,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)|$false|$false),inference(rw,[status(thm)],[329,215,theory(equality)])).
% cnf(331,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)),inference(cn,[status(thm)],[330,theory(equality)])).
% cnf(423,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_rng(esk12_0))|~function(esk12_0)|~relation(esk12_0)),inference(pm,[status(thm)],[91,211,theory(equality)])).
% cnf(425,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_dom(esk13_0))|~function(esk12_0)|~relation(esk12_0)),inference(rw,[status(thm)],[423,210,theory(equality)])).
% cnf(426,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_dom(esk13_0))|$false|~relation(esk12_0)),inference(rw,[status(thm)],[425,214,theory(equality)])).
% cnf(427,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_dom(esk13_0))|$false|$false),inference(rw,[status(thm)],[426,215,theory(equality)])).
% cnf(428,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_dom(esk13_0))),inference(cn,[status(thm)],[427,theory(equality)])).
% cnf(432,plain,(X1=X2|identity_relation(relation_dom(X2))!=relation_composition(X1,X3)|relation_composition(X3,X2)!=identity_relation(relation_rng(X1))|~function(X2)|~function(X3)|~function(X1)|~relation(X2)|~relation(X3)|~relation(X1)),inference(er,[status(thm)],[73,theory(equality)])).
% cnf(3295,negated_conjecture,(X1=esk13_0|relation_composition(function_inverse(esk12_0),esk12_0)!=relation_composition(X1,X2)|relation_composition(X2,esk13_0)!=identity_relation(relation_rng(X1))|~function(esk13_0)|~function(X2)|~function(X1)|~relation(esk13_0)|~relation(X2)|~relation(X1)),inference(pm,[status(thm)],[432,428,theory(equality)])).
% cnf(3309,negated_conjecture,(X1=esk13_0|relation_composition(function_inverse(esk12_0),esk12_0)!=relation_composition(X1,X2)|relation_composition(X2,esk13_0)!=identity_relation(relation_rng(X1))|$false|~function(X2)|~function(X1)|~relation(esk13_0)|~relation(X2)|~relation(X1)),inference(rw,[status(thm)],[3295,212,theory(equality)])).
% cnf(3310,negated_conjecture,(X1=esk13_0|relation_composition(function_inverse(esk12_0),esk12_0)!=relation_composition(X1,X2)|relation_composition(X2,esk13_0)!=identity_relation(relation_rng(X1))|$false|~function(X2)|~function(X1)|$false|~relation(X2)|~relation(X1)),inference(rw,[status(thm)],[3309,213,theory(equality)])).
% cnf(3311,negated_conjecture,(X1=esk13_0|relation_composition(function_inverse(esk12_0),esk12_0)!=relation_composition(X1,X2)|relation_composition(X2,esk13_0)!=identity_relation(relation_rng(X1))|~function(X2)|~function(X1)|~relation(X2)|~relation(X1)),inference(cn,[status(thm)],[3310,theory(equality)])).
% cnf(404662,negated_conjecture,(function_inverse(esk12_0)=esk13_0|relation_composition(esk12_0,esk13_0)!=identity_relation(relation_rng(function_inverse(esk12_0)))|~function(esk12_0)|~function(function_inverse(esk12_0))|~relation(esk12_0)|~relation(function_inverse(esk12_0))),inference(er,[status(thm)],[3311,theory(equality)])).
% cnf(404691,negated_conjecture,(function_inverse(esk12_0)=esk13_0|$false|~function(esk12_0)|~function(function_inverse(esk12_0))|~relation(esk12_0)|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[404662,331,theory(equality)]),209,theory(equality)])).
% cnf(404692,negated_conjecture,(function_inverse(esk12_0)=esk13_0|$false|$false|~function(function_inverse(esk12_0))|~relation(esk12_0)|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[404691,214,theory(equality)])).
% cnf(404693,negated_conjecture,(function_inverse(esk12_0)=esk13_0|$false|$false|$false|~relation(esk12_0)|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[404692,313,theory(equality)])).
% cnf(404694,negated_conjecture,(function_inverse(esk12_0)=esk13_0|$false|$false|$false|$false|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[404693,215,theory(equality)])).
% cnf(404695,negated_conjecture,(function_inverse(esk12_0)=esk13_0|$false|$false|$false|$false|$false),inference(rw,[status(thm)],[404694,291,theory(equality)])).
% cnf(404696,negated_conjecture,(function_inverse(esk12_0)=esk13_0),inference(cn,[status(thm)],[404695,theory(equality)])).
% cnf(404697,negated_conjecture,($false),inference(sr,[status(thm)],[404696,208,theory(equality)])).
% cnf(404698,negated_conjecture,($false),404697,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 4030
% # ...of these trivial                : 131
% # ...subsumed                        : 799
% # ...remaining for further processing: 3100
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 908
% # Generated clauses                  : 392013
% # ...of the previous two non-trivial : 391414
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 392000
% # Factorizations                     : 0
% # Equation resolutions               : 7
% # Current number of processed clauses: 2190
% #    Positive orientable unit clauses: 1230
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 9
% #    Non-unit-clauses                : 951
% # Current number of unprocessed clauses: 183203
% # ...number of literals in the above : 258515
% # Clause-clause subsumption calls (NU) : 9543
% # Rec. Clause-clause subsumption calls : 9447
% # Unit Clause-clause subsumption calls : 181
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 22170
% # Indexed BW rewrite successes       : 221
% # Backwards rewriting index:  1521 leaves,   2.25+/-7.000 terms/leaf
% # Paramod-from index:          395 leaves,   3.38+/-7.354 terms/leaf
% # Paramod-into index:         1193 leaves,   1.88+/-4.409 terms/leaf
% # -------------------------------------------------
% # User time              : 7.072 s
% # System time            : 0.343 s
% # Total time             : 7.415 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.45 CPU 14.00 WC
% FINAL PrfWatch: 13.45 CPU 14.00 WC
% SZS output end Solution for /tmp/SystemOnTPTP18081/SEU030+1.tptp
% 
%------------------------------------------------------------------------------