TSTP Solution File: SEU219+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU219+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 02:04:28 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP32505/SEU219+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32505/SEU219+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32505/SEU219+3.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 32637
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:((relation(X1)&function(X1))=>(one_to_one(X1)=>function_inverse(X1)=relation_inverse(X1))),file('/tmp/SRASS.s.p', d9_funct_1)).
% fof(6, axiom,![X1]:(relation(X1)=>(relation_rng(X1)=relation_dom(relation_inverse(X1))&relation_dom(X1)=relation_rng(relation_inverse(X1)))),file('/tmp/SRASS.s.p', t37_relat_1)).
% fof(40, conjecture,![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(41, negated_conjecture,~(![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(assume_negation,[status(cth)],[40])).
% fof(69, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|function_inverse(X1)=relation_inverse(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(70, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|function_inverse(X2)=relation_inverse(X2))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(function_inverse(X1)=relation_inverse(X1)|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(72, plain,![X1]:(~(relation(X1))|(relation_rng(X1)=relation_dom(relation_inverse(X1))&relation_dom(X1)=relation_rng(relation_inverse(X1)))),inference(fof_nnf,[status(thm)],[6])).
% fof(73, plain,![X2]:(~(relation(X2))|(relation_rng(X2)=relation_dom(relation_inverse(X2))&relation_dom(X2)=relation_rng(relation_inverse(X2)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X2]:((relation_rng(X2)=relation_dom(relation_inverse(X2))|~(relation(X2)))&(relation_dom(X2)=relation_rng(relation_inverse(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(relation_dom(X1)=relation_rng(relation_inverse(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(76,plain,(relation_rng(X1)=relation_dom(relation_inverse(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(189, negated_conjecture,?[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)],[41])).
% fof(190, negated_conjecture,?[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)],[189])).
% fof(191, negated_conjecture,((relation(esk12_0)&function(esk12_0))&(one_to_one(esk12_0)&(~(relation_rng(esk12_0)=relation_dom(function_inverse(esk12_0)))|~(relation_dom(esk12_0)=relation_rng(function_inverse(esk12_0)))))),inference(skolemize,[status(esa)],[190])).
% cnf(192,negated_conjecture,(relation_dom(esk12_0)!=relation_rng(function_inverse(esk12_0))|relation_rng(esk12_0)!=relation_dom(function_inverse(esk12_0))),inference(split_conjunct,[status(thm)],[191])).
% cnf(193,negated_conjecture,(one_to_one(esk12_0)),inference(split_conjunct,[status(thm)],[191])).
% cnf(194,negated_conjecture,(function(esk12_0)),inference(split_conjunct,[status(thm)],[191])).
% cnf(195,negated_conjecture,(relation(esk12_0)),inference(split_conjunct,[status(thm)],[191])).
% cnf(213,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_inverse(esk12_0))!=relation_rng(esk12_0)|~one_to_one(esk12_0)|~function(esk12_0)|~relation(esk12_0)),inference(spm,[status(thm)],[192,71,theory(equality)])).
% cnf(216,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_inverse(esk12_0))!=relation_rng(esk12_0)|$false|~function(esk12_0)|~relation(esk12_0)),inference(rw,[status(thm)],[213,193,theory(equality)])).
% cnf(217,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_inverse(esk12_0))!=relation_rng(esk12_0)|$false|$false|~relation(esk12_0)),inference(rw,[status(thm)],[216,194,theory(equality)])).
% cnf(218,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_inverse(esk12_0))!=relation_rng(esk12_0)|$false|$false|$false),inference(rw,[status(thm)],[217,195,theory(equality)])).
% cnf(219,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|relation_dom(relation_inverse(esk12_0))!=relation_rng(esk12_0)),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(260,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|~relation(esk12_0)),inference(spm,[status(thm)],[219,76,theory(equality)])).
% cnf(261,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)|$false),inference(rw,[status(thm)],[260,195,theory(equality)])).
% cnf(262,negated_conjecture,(relation_rng(relation_inverse(esk12_0))!=relation_dom(esk12_0)),inference(cn,[status(thm)],[261,theory(equality)])).
% cnf(263,negated_conjecture,(~relation(esk12_0)),inference(spm,[status(thm)],[262,75,theory(equality)])).
% cnf(264,negated_conjecture,($false),inference(rw,[status(thm)],[263,195,theory(equality)])).
% cnf(265,negated_conjecture,($false),inference(cn,[status(thm)],[264,theory(equality)])).
% cnf(266,negated_conjecture,($false),265,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 128
% # ...of these trivial : 3
% # ...subsumed : 1
% # ...remaining for further processing: 124
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 49
% # ...of the previous two non-trivial : 41
% # Contextual simplify-reflections : 4
% # Paramodulations : 49
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 59
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 86
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 70 leaves, 1.10+/-0.419 terms/leaf
% # Paramod-from index: 41 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 65 leaves, 1.05+/-0.210 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.005 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.17 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP32505/SEU219+3.tptp
%
%------------------------------------------------------------------------------