TSTP Solution File: SEU025+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU025+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 : art04.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:39:40 EST 2010
% Result : Theorem 1.03s
% Output : Solution 1.03s
% 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/SystemOnTPTP13926/SEU025+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13926/SEU025+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13926/SEU025+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 14022
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 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(6, 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(8, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(relation_rng(X1),relation_dom(X2))=>relation_dom(relation_composition(X1,X2))=relation_dom(X1)))),file('/tmp/SRASS.s.p', t46_relat_1)).
% fof(9, axiom,![X1]:(relation(X1)=>![X2]:(relation(X2)=>(subset(relation_dom(X1),relation_rng(X2))=>relation_rng(relation_composition(X2,X1))=relation_rng(X1)))),file('/tmp/SRASS.s.p', t47_relat_1)).
% fof(25, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(41, conjecture,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_dom(relation_composition(X1,function_inverse(X1)))=relation_dom(X1)&relation_rng(relation_composition(X1,function_inverse(X1)))=relation_dom(X1)))),file('/tmp/SRASS.s.p', t58_funct_1)).
% fof(42, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>(relation_dom(relation_composition(X1,function_inverse(X1)))=relation_dom(X1)&relation_rng(relation_composition(X1,function_inverse(X1)))=relation_dom(X1))))),inference(assume_negation,[status(cth)],[41])).
% fof(50, plain,![X1]:((~(relation(X1))|~(function(X1)))|(relation(function_inverse(X1))&function(function_inverse(X1)))),inference(fof_nnf,[status(thm)],[1])).
% fof(51, plain,![X2]:((~(relation(X2))|~(function(X2)))|(relation(function_inverse(X2))&function(function_inverse(X2)))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X2]:((relation(function_inverse(X2))|(~(relation(X2))|~(function(X2))))&(function(function_inverse(X2))|(~(relation(X2))|~(function(X2))))),inference(distribute,[status(thm)],[51])).
% cnf(54,plain,(relation(function_inverse(X1))|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(72, 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)],[6])).
% fof(73, 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)],[72])).
% fof(74, 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)],[73])).
% cnf(75,plain,(relation_dom(X1)=relation_rng(function_inverse(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(76,plain,(relation_rng(X1)=relation_dom(function_inverse(X1))|~function(X1)|~relation(X1)|~one_to_one(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(83, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|(~(subset(relation_rng(X1),relation_dom(X2)))|relation_dom(relation_composition(X1,X2))=relation_dom(X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(84, plain,![X3]:(~(relation(X3))|![X4]:(~(relation(X4))|(~(subset(relation_rng(X3),relation_dom(X4)))|relation_dom(relation_composition(X3,X4))=relation_dom(X3)))),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X3]:![X4]:((~(relation(X4))|(~(subset(relation_rng(X3),relation_dom(X4)))|relation_dom(relation_composition(X3,X4))=relation_dom(X3)))|~(relation(X3))),inference(shift_quantors,[status(thm)],[84])).
% cnf(86,plain,(relation_dom(relation_composition(X1,X2))=relation_dom(X1)|~relation(X1)|~subset(relation_rng(X1),relation_dom(X2))|~relation(X2)),inference(split_conjunct,[status(thm)],[85])).
% fof(87, plain,![X1]:(~(relation(X1))|![X2]:(~(relation(X2))|(~(subset(relation_dom(X1),relation_rng(X2)))|relation_rng(relation_composition(X2,X1))=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(88, plain,![X3]:(~(relation(X3))|![X4]:(~(relation(X4))|(~(subset(relation_dom(X3),relation_rng(X4)))|relation_rng(relation_composition(X4,X3))=relation_rng(X3)))),inference(variable_rename,[status(thm)],[87])).
% fof(89, plain,![X3]:![X4]:((~(relation(X4))|(~(subset(relation_dom(X3),relation_rng(X4)))|relation_rng(relation_composition(X4,X3))=relation_rng(X3)))|~(relation(X3))),inference(shift_quantors,[status(thm)],[88])).
% cnf(90,plain,(relation_rng(relation_composition(X2,X1))=relation_rng(X1)|~relation(X1)|~subset(relation_dom(X1),relation_rng(X2))|~relation(X2)),inference(split_conjunct,[status(thm)],[89])).
% fof(146, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[25])).
% cnf(147,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[146])).
% fof(197, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(one_to_one(X1)&(~(relation_dom(relation_composition(X1,function_inverse(X1)))=relation_dom(X1))|~(relation_rng(relation_composition(X1,function_inverse(X1)))=relation_dom(X1))))),inference(fof_nnf,[status(thm)],[42])).
% fof(198, negated_conjecture,?[X2]:((relation(X2)&function(X2))&(one_to_one(X2)&(~(relation_dom(relation_composition(X2,function_inverse(X2)))=relation_dom(X2))|~(relation_rng(relation_composition(X2,function_inverse(X2)))=relation_dom(X2))))),inference(variable_rename,[status(thm)],[197])).
% fof(199, negated_conjecture,((relation(esk12_0)&function(esk12_0))&(one_to_one(esk12_0)&(~(relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))=relation_dom(esk12_0))|~(relation_rng(relation_composition(esk12_0,function_inverse(esk12_0)))=relation_dom(esk12_0))))),inference(skolemize,[status(esa)],[198])).
% cnf(200,negated_conjecture,(relation_rng(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)|relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)),inference(split_conjunct,[status(thm)],[199])).
% cnf(201,negated_conjecture,(one_to_one(esk12_0)),inference(split_conjunct,[status(thm)],[199])).
% cnf(202,negated_conjecture,(function(esk12_0)),inference(split_conjunct,[status(thm)],[199])).
% cnf(203,negated_conjecture,(relation(esk12_0)),inference(split_conjunct,[status(thm)],[199])).
% cnf(249,plain,(relation_rng(relation_composition(X1,function_inverse(X2)))=relation_rng(function_inverse(X2))|~subset(relation_rng(X2),relation_rng(X1))|~relation(X1)|~relation(function_inverse(X2))|~one_to_one(X2)|~function(X2)|~relation(X2)),inference(spm,[status(thm)],[90,76,theory(equality)])).
% cnf(250,plain,(relation_dom(relation_composition(X1,function_inverse(X2)))=relation_dom(X1)|~subset(relation_rng(X1),relation_rng(X2))|~relation(function_inverse(X2))|~relation(X1)|~one_to_one(X2)|~function(X2)|~relation(X2)),inference(spm,[status(thm)],[86,76,theory(equality)])).
% cnf(628,plain,(relation_rng(relation_composition(X1,function_inverse(X2)))=relation_rng(function_inverse(X2))|~subset(relation_rng(X2),relation_rng(X1))|~one_to_one(X2)|~function(X2)|~relation(X2)|~relation(X1)),inference(csr,[status(thm)],[249,54])).
% cnf(645,plain,(relation_rng(relation_composition(X1,function_inverse(X1)))=relation_rng(function_inverse(X1))|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[628,147,theory(equality)])).
% cnf(714,plain,(relation_dom(relation_composition(X1,function_inverse(X2)))=relation_dom(X1)|~subset(relation_rng(X1),relation_rng(X2))|~one_to_one(X2)|~function(X2)|~relation(X1)|~relation(X2)),inference(csr,[status(thm)],[250,54])).
% cnf(731,plain,(relation_dom(relation_composition(X1,function_inverse(X1)))=relation_dom(X1)|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(spm,[status(thm)],[714,147,theory(equality)])).
% cnf(2864,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)|~one_to_one(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(spm,[status(thm)],[200,645,theory(equality)])).
% cnf(2874,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)|$false|~function(esk12_0)|~relation(esk12_0)),inference(rw,[status(thm)],[2864,201,theory(equality)])).
% cnf(2875,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)|$false|$false|~relation(esk12_0)),inference(rw,[status(thm)],[2874,202,theory(equality)])).
% cnf(2876,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)|$false|$false|$false),inference(rw,[status(thm)],[2875,203,theory(equality)])).
% cnf(2877,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_composition(esk12_0,function_inverse(esk12_0)))!=relation_dom(esk12_0)),inference(cn,[status(thm)],[2876,theory(equality)])).
% cnf(2911,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|~one_to_one(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(spm,[status(thm)],[2877,731,theory(equality)])).
% cnf(2922,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|$false|~function(esk12_0)|~relation(esk12_0)),inference(rw,[status(thm)],[2911,201,theory(equality)])).
% cnf(2923,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|$false|$false|~relation(esk12_0)),inference(rw,[status(thm)],[2922,202,theory(equality)])).
% cnf(2924,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)|$false|$false|$false),inference(rw,[status(thm)],[2923,203,theory(equality)])).
% cnf(2925,negated_conjecture,(relation_rng(function_inverse(esk12_0))!=relation_dom(esk12_0)),inference(cn,[status(thm)],[2924,theory(equality)])).
% cnf(2935,negated_conjecture,(~one_to_one(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(spm,[status(thm)],[2925,75,theory(equality)])).
% cnf(2938,negated_conjecture,($false|~function(esk12_0)|~relation(esk12_0)),inference(rw,[status(thm)],[2935,201,theory(equality)])).
% cnf(2939,negated_conjecture,($false|$false|~relation(esk12_0)),inference(rw,[status(thm)],[2938,202,theory(equality)])).
% cnf(2940,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[2939,203,theory(equality)])).
% cnf(2941,negated_conjecture,($false),inference(cn,[status(thm)],[2940,theory(equality)])).
% cnf(2942,negated_conjecture,($false),2941,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 483
% # ...of these trivial : 3
% # ...subsumed : 273
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 25
% # Generated clauses : 1548
% # ...of the previous two non-trivial : 1402
% # Contextual simplify-reflections : 152
% # Paramodulations : 1545
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 169
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 132
% # Current number of unprocessed clauses: 715
% # ...number of literals in the above : 3911
% # Clause-clause subsumption calls (NU) : 2635
% # Rec. Clause-clause subsumption calls : 2184
% # Unit Clause-clause subsumption calls : 247
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 122 leaves, 1.27+/-0.628 terms/leaf
% # Paramod-from index: 67 leaves, 1.06+/-0.340 terms/leaf
% # Paramod-into index: 108 leaves, 1.14+/-0.419 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.009 s
% # Total time : 0.074 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.26 WC
% FINAL PrfWatch: 0.18 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP13926/SEU025+1.tptp
%
%------------------------------------------------------------------------------