TSTP Solution File: SEU032+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU032+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 : 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 00:41:06 EST 2010
% Result : Theorem 2.51s
% Output : Solution 2.51s
% 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/SystemOnTPTP26956/SEU032+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26956/SEU032+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26956/SEU032+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 27052
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(4, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>one_to_one(function_inverse(X1)))),file('/tmp/SRASS.s.p', t62_funct_1)).
% fof(7, 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(12, 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(13, axiom,![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, conjecture,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>function_inverse(function_inverse(X1))=X1)),file('/tmp/SRASS.s.p', t65_funct_1)).
% fof(45, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>function_inverse(function_inverse(X1))=X1))),inference(assume_negation,[status(cth)],[44])).
% fof(53, plain,![X1]:((~(relation(X1))|~(function(X1)))|(relation(function_inverse(X1))&function(function_inverse(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(54, plain,![X2]:((~(relation(X2))|~(function(X2)))|(relation(function_inverse(X2))&function(function_inverse(X2)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X2]:((relation(function_inverse(X2))|(~(relation(X2))|~(function(X2))))&(function(function_inverse(X2))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(function(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(relation(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(67, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|one_to_one(function_inverse(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(68, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|one_to_one(function_inverse(X2)))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(one_to_one(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(81, 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)],[7])).
% fof(82, 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)],[81])).
% fof(83, 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)],[82])).
% cnf(84,plain,(relation_dom(X1)=relation_rng(function_inverse(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[83])).
% cnf(85,plain,(relation_rng(X1)=relation_dom(function_inverse(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(100, 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)],[12])).
% fof(101, 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)],[100])).
% fof(102, 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)],[101])).
% cnf(103,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)],[102])).
% fof(105, plain,![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)],[13])).
% fof(106, plain,![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)],[105])).
% fof(107, plain,![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)))|(~(relation(X3))|~(function(X3)))),inference(shift_quantors,[status(thm)],[106])).
% cnf(108,plain,(X2=function_inverse(X1)|~function(X1)|~relation(X1)|relation_composition(X1,X2)!=identity_relation(relation_dom(X1))|relation_rng(X1)!=relation_dom(X2)|~one_to_one(X1)|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[107])).
% fof(209, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(one_to_one(X1)&~(function_inverse(function_inverse(X1))=X1))),inference(fof_nnf,[status(thm)],[45])).
% fof(210, negated_conjecture,?[X2]:((relation(X2)&function(X2))&(one_to_one(X2)&~(function_inverse(function_inverse(X2))=X2))),inference(variable_rename,[status(thm)],[209])).
% fof(211, negated_conjecture,((relation(esk12_0)&function(esk12_0))&(one_to_one(esk12_0)&~(function_inverse(function_inverse(esk12_0))=esk12_0))),inference(skolemize,[status(esa)],[210])).
% cnf(212,negated_conjecture,(function_inverse(function_inverse(esk12_0))!=esk12_0),inference(split_conjunct,[status(thm)],[211])).
% cnf(213,negated_conjecture,(one_to_one(esk12_0)),inference(split_conjunct,[status(thm)],[211])).
% cnf(214,negated_conjecture,(function(esk12_0)),inference(split_conjunct,[status(thm)],[211])).
% cnf(215,negated_conjecture,(relation(esk12_0)),inference(split_conjunct,[status(thm)],[211])).
% cnf(263,negated_conjecture,(relation(function_inverse(esk12_0))|~relation(esk12_0)),inference(pm,[status(thm)],[57,214,theory(equality)])).
% cnf(268,negated_conjecture,(relation(function_inverse(esk12_0))|$false),inference(rw,[status(thm)],[263,215,theory(equality)])).
% cnf(269,negated_conjecture,(relation(function_inverse(esk12_0))),inference(cn,[status(thm)],[268,theory(equality)])).
% cnf(278,negated_conjecture,(function(function_inverse(esk12_0))|~function(esk12_0)),inference(pm,[status(thm)],[56,215,theory(equality)])).
% cnf(287,negated_conjecture,(function(function_inverse(esk12_0))|$false),inference(rw,[status(thm)],[278,214,theory(equality)])).
% cnf(288,negated_conjecture,(function(function_inverse(esk12_0))),inference(cn,[status(thm)],[287,theory(equality)])).
% cnf(313,negated_conjecture,(one_to_one(function_inverse(esk12_0))|~one_to_one(esk12_0)|~relation(esk12_0)),inference(pm,[status(thm)],[69,214,theory(equality)])).
% cnf(318,negated_conjecture,(one_to_one(function_inverse(esk12_0))|$false|~relation(esk12_0)),inference(rw,[status(thm)],[313,213,theory(equality)])).
% cnf(319,negated_conjecture,(one_to_one(function_inverse(esk12_0))|$false|$false),inference(rw,[status(thm)],[318,215,theory(equality)])).
% cnf(320,negated_conjecture,(one_to_one(function_inverse(esk12_0))),inference(cn,[status(thm)],[319,theory(equality)])).
% cnf(352,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(pm,[status(thm)],[84,213,theory(equality)])).
% cnf(354,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)|$false|~relation(esk12_0)),inference(rw,[status(thm)],[352,214,theory(equality)])).
% cnf(355,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)|$false|$false),inference(rw,[status(thm)],[354,215,theory(equality)])).
% cnf(356,negated_conjecture,(relation_rng(function_inverse(esk12_0))=relation_dom(esk12_0)),inference(cn,[status(thm)],[355,theory(equality)])).
% cnf(383,negated_conjecture,(relation_dom(function_inverse(esk12_0))=relation_rng(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(pm,[status(thm)],[85,213,theory(equality)])).
% cnf(385,negated_conjecture,(relation_dom(function_inverse(esk12_0))=relation_rng(esk12_0)|$false|~relation(esk12_0)),inference(rw,[status(thm)],[383,214,theory(equality)])).
% cnf(386,negated_conjecture,(relation_dom(function_inverse(esk12_0))=relation_rng(esk12_0)|$false|$false),inference(rw,[status(thm)],[385,215,theory(equality)])).
% cnf(387,negated_conjecture,(relation_dom(function_inverse(esk12_0))=relation_rng(esk12_0)),inference(cn,[status(thm)],[386,theory(equality)])).
% cnf(421,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)],[103,213,theory(equality)])).
% cnf(423,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_rng(esk12_0))|$false|~relation(esk12_0)),inference(rw,[status(thm)],[421,214,theory(equality)])).
% cnf(424,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_rng(esk12_0))|$false|$false),inference(rw,[status(thm)],[423,215,theory(equality)])).
% cnf(425,negated_conjecture,(relation_composition(function_inverse(esk12_0),esk12_0)=identity_relation(relation_rng(esk12_0))),inference(cn,[status(thm)],[424,theory(equality)])).
% cnf(1416,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|identity_relation(relation_rng(esk12_0))!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_rng(function_inverse(esk12_0))|~one_to_one(function_inverse(esk12_0))|~function(X1)|~function(function_inverse(esk12_0))|~relation(X1)|~relation(function_inverse(esk12_0))),inference(pm,[status(thm)],[108,387,theory(equality)])).
% cnf(1419,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|identity_relation(relation_rng(esk12_0))!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_dom(esk12_0)|~one_to_one(function_inverse(esk12_0))|~function(X1)|~function(function_inverse(esk12_0))|~relation(X1)|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[1416,356,theory(equality)])).
% cnf(1420,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|identity_relation(relation_rng(esk12_0))!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_dom(esk12_0)|$false|~function(X1)|~function(function_inverse(esk12_0))|~relation(X1)|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[1419,320,theory(equality)])).
% cnf(1421,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|identity_relation(relation_rng(esk12_0))!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_dom(esk12_0)|$false|~function(X1)|$false|~relation(X1)|~relation(function_inverse(esk12_0))),inference(rw,[status(thm)],[1420,288,theory(equality)])).
% cnf(1422,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|identity_relation(relation_rng(esk12_0))!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_dom(esk12_0)|$false|~function(X1)|$false|~relation(X1)|$false),inference(rw,[status(thm)],[1421,269,theory(equality)])).
% cnf(1423,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|identity_relation(relation_rng(esk12_0))!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_dom(esk12_0)|~function(X1)|~relation(X1)),inference(cn,[status(thm)],[1422,theory(equality)])).
% cnf(51197,negated_conjecture,(function_inverse(function_inverse(esk12_0))=X1|relation_composition(function_inverse(esk12_0),esk12_0)!=relation_composition(function_inverse(esk12_0),X1)|relation_dom(X1)!=relation_dom(esk12_0)|~function(X1)|~relation(X1)),inference(rw,[status(thm)],[1423,425,theory(equality)])).
% cnf(51198,negated_conjecture,(function_inverse(function_inverse(esk12_0))=esk12_0|~function(esk12_0)|~relation(esk12_0)),inference(er,[status(thm)],[51197,theory(equality)])).
% cnf(51199,negated_conjecture,(function_inverse(function_inverse(esk12_0))=esk12_0|$false|~relation(esk12_0)),inference(rw,[status(thm)],[51198,214,theory(equality)])).
% cnf(51200,negated_conjecture,(function_inverse(function_inverse(esk12_0))=esk12_0|$false|$false),inference(rw,[status(thm)],[51199,215,theory(equality)])).
% cnf(51201,negated_conjecture,(function_inverse(function_inverse(esk12_0))=esk12_0),inference(cn,[status(thm)],[51200,theory(equality)])).
% cnf(51202,negated_conjecture,($false),inference(sr,[status(thm)],[51201,212,theory(equality)])).
% cnf(51203,negated_conjecture,($false),51202,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1270
% # ...of these trivial : 37
% # ...subsumed : 122
% # ...remaining for further processing: 1111
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 159
% # Generated clauses : 47520
% # ...of the previous two non-trivial : 47324
% # Contextual simplify-reflections : 0
% # Paramodulations : 47513
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 952
% # Positive orientable unit clauses: 526
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 417
% # Current number of unprocessed clauses: 39759
% # ...number of literals in the above : 48543
% # Clause-clause subsumption calls (NU) : 2098
% # Rec. Clause-clause subsumption calls : 2017
% # Unit Clause-clause subsumption calls : 160
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3370
% # Indexed BW rewrite successes : 51
% # Backwards rewriting index: 793 leaves, 1.95+/-4.392 terms/leaf
% # Paramod-from index: 178 leaves, 2.98+/-5.261 terms/leaf
% # Paramod-into index: 601 leaves, 1.66+/-3.023 terms/leaf
% # -------------------------------------------------
% # User time : 0.746 s
% # System time : 0.055 s
% # Total time : 0.801 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.67 CPU 1.75 WC
% FINAL PrfWatch: 1.67 CPU 1.75 WC
% SZS output end Solution for /tmp/SystemOnTPTP26956/SEU032+1.tptp
%
%------------------------------------------------------------------------------