TSTP Solution File: SEU219+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU219+2 : TPTP v5.0.0. Released v3.3.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:20 EST 2010
% Result : Theorem 3.43s
% Output : Solution 3.43s
% 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/SystemOnTPTP32156/SEU219+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32156/SEU219+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32156/SEU219+2.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 32288
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.049 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, 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(11, 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(231, 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(232, 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)],[231])).
% fof(274, plain,![X1]:((~(relation(X1))|~(function(X1)))|(~(one_to_one(X1))|function_inverse(X1)=relation_inverse(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(275, plain,![X2]:((~(relation(X2))|~(function(X2)))|(~(one_to_one(X2))|function_inverse(X2)=relation_inverse(X2))),inference(variable_rename,[status(thm)],[274])).
% cnf(276,plain,(function_inverse(X1)=relation_inverse(X1)|~one_to_one(X1)|~function(X1)|~relation(X1)),inference(split_conjunct,[status(thm)],[275])).
% fof(321, 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)],[11])).
% fof(322, 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)],[321])).
% fof(323, 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)],[322])).
% cnf(324,plain,(relation_dom(X1)=relation_rng(relation_inverse(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[323])).
% cnf(325,plain,(relation_rng(X1)=relation_dom(relation_inverse(X1))|~relation(X1)),inference(split_conjunct,[status(thm)],[323])).
% fof(1223, 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)],[232])).
% fof(1224, 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)],[1223])).
% fof(1225, negated_conjecture,((relation(esk77_0)&function(esk77_0))&(one_to_one(esk77_0)&(~(relation_rng(esk77_0)=relation_dom(function_inverse(esk77_0)))|~(relation_dom(esk77_0)=relation_rng(function_inverse(esk77_0)))))),inference(skolemize,[status(esa)],[1224])).
% cnf(1226,negated_conjecture,(relation_dom(esk77_0)!=relation_rng(function_inverse(esk77_0))|relation_rng(esk77_0)!=relation_dom(function_inverse(esk77_0))),inference(split_conjunct,[status(thm)],[1225])).
% cnf(1227,negated_conjecture,(one_to_one(esk77_0)),inference(split_conjunct,[status(thm)],[1225])).
% cnf(1228,negated_conjecture,(function(esk77_0)),inference(split_conjunct,[status(thm)],[1225])).
% cnf(1229,negated_conjecture,(relation(esk77_0)),inference(split_conjunct,[status(thm)],[1225])).
% cnf(1577,plain,(relation_dom(function_inverse(X1))=relation_rng(X1)|~relation(X1)|~one_to_one(X1)|~function(X1)),inference(spm,[status(thm)],[325,276,theory(equality)])).
% cnf(1578,plain,(relation_rng(function_inverse(X1))=relation_dom(X1)|~relation(X1)|~one_to_one(X1)|~function(X1)),inference(spm,[status(thm)],[324,276,theory(equality)])).
% cnf(9237,negated_conjecture,(relation_dom(function_inverse(esk77_0))!=relation_rng(esk77_0)|~one_to_one(esk77_0)|~function(esk77_0)|~relation(esk77_0)),inference(spm,[status(thm)],[1226,1578,theory(equality)])).
% cnf(9243,negated_conjecture,(relation_dom(function_inverse(esk77_0))!=relation_rng(esk77_0)|$false|~function(esk77_0)|~relation(esk77_0)),inference(rw,[status(thm)],[9237,1227,theory(equality)])).
% cnf(9244,negated_conjecture,(relation_dom(function_inverse(esk77_0))!=relation_rng(esk77_0)|$false|$false|~relation(esk77_0)),inference(rw,[status(thm)],[9243,1228,theory(equality)])).
% cnf(9245,negated_conjecture,(relation_dom(function_inverse(esk77_0))!=relation_rng(esk77_0)|$false|$false|$false),inference(rw,[status(thm)],[9244,1229,theory(equality)])).
% cnf(9246,negated_conjecture,(relation_dom(function_inverse(esk77_0))!=relation_rng(esk77_0)),inference(cn,[status(thm)],[9245,theory(equality)])).
% cnf(9254,negated_conjecture,(~one_to_one(esk77_0)|~function(esk77_0)|~relation(esk77_0)),inference(spm,[status(thm)],[9246,1577,theory(equality)])).
% cnf(9257,negated_conjecture,($false|~function(esk77_0)|~relation(esk77_0)),inference(rw,[status(thm)],[9254,1227,theory(equality)])).
% cnf(9258,negated_conjecture,($false|$false|~relation(esk77_0)),inference(rw,[status(thm)],[9257,1228,theory(equality)])).
% cnf(9259,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[9258,1229,theory(equality)])).
% cnf(9260,negated_conjecture,($false),inference(cn,[status(thm)],[9259,theory(equality)])).
% cnf(9261,negated_conjecture,($false),9260,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1156
% # ...of these trivial : 11
% # ...subsumed : 254
% # ...remaining for further processing: 891
% # Other redundant clauses eliminated : 58
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 17
% # Generated clauses : 6454
% # ...of the previous two non-trivial : 5985
% # Contextual simplify-reflections : 148
% # Paramodulations : 6355
% # Factorizations : 14
% # Equation resolutions : 85
% # Current number of processed clauses: 493
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 25
% # Non-unit-clauses : 408
% # Current number of unprocessed clauses: 5514
% # ...number of literals in the above : 26726
% # Clause-clause subsumption calls (NU) : 10627
% # Rec. Clause-clause subsumption calls : 4233
% # Unit Clause-clause subsumption calls : 282
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 64
% # Indexed BW rewrite successes : 54
% # Backwards rewriting index: 457 leaves, 1.63+/-2.889 terms/leaf
% # Paramod-from index: 206 leaves, 1.18+/-1.171 terms/leaf
% # Paramod-into index: 412 leaves, 1.45+/-2.314 terms/leaf
% # -------------------------------------------------
% # User time : 0.356 s
% # System time : 0.013 s
% # Total time : 0.369 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.64 CPU 0.71 WC
% FINAL PrfWatch: 0.64 CPU 0.71 WC
% SZS output end Solution for /tmp/SystemOnTPTP32156/SEU219+2.tptp
%
%------------------------------------------------------------------------------