TSTP Solution File: SEU020+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU020+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 : art05.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:12 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP15211/SEU020+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15211/SEU020+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15211/SEU020+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 15307
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:one_to_one(identity_relation(X1)),file('/tmp/SRASS.s.p', t52_funct_1)).
% fof(11, axiom,![X1]:(relation_dom(identity_relation(X1))=X1&relation_rng(identity_relation(X1))=X1),file('/tmp/SRASS.s.p', t71_relat_1)).
% fof(12, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:((relation(X2)&function(X2))=>(relation_dom(relation_composition(X2,X1))=relation_dom(X2)=>subset(relation_rng(X2),relation_dom(X1))))),file('/tmp/SRASS.s.p', t27_funct_1)).
% fof(13, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:((relation(X2)&function(X2))=>((one_to_one(relation_composition(X2,X1))&subset(relation_rng(X2),relation_dom(X1)))=>one_to_one(X2)))),file('/tmp/SRASS.s.p', t47_funct_1)).
% fof(40, conjecture,![X1]:((relation(X1)&function(X1))=>(?[X2]:((relation(X2)&function(X2))&relation_composition(X1,X2)=identity_relation(relation_dom(X1)))=>one_to_one(X1))),file('/tmp/SRASS.s.p', t53_funct_1)).
% fof(41, negated_conjecture,~(![X1]:((relation(X1)&function(X1))=>(?[X2]:((relation(X2)&function(X2))&relation_composition(X1,X2)=identity_relation(relation_dom(X1)))=>one_to_one(X1)))),inference(assume_negation,[status(cth)],[40])).
% fof(66, plain,![X2]:one_to_one(identity_relation(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(67,plain,(one_to_one(identity_relation(X1))),inference(split_conjunct,[status(thm)],[66])).
% fof(86, plain,![X2]:(relation_dom(identity_relation(X2))=X2&relation_rng(identity_relation(X2))=X2),inference(variable_rename,[status(thm)],[11])).
% cnf(88,plain,(relation_dom(identity_relation(X1))=X1),inference(split_conjunct,[status(thm)],[86])).
% fof(89, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:((~(relation(X2))|~(function(X2)))|(~(relation_dom(relation_composition(X2,X1))=relation_dom(X2))|subset(relation_rng(X2),relation_dom(X1))))),inference(fof_nnf,[status(thm)],[12])).
% fof(90, plain,![X3]:((~(relation(X3))|~(function(X3)))|![X4]:((~(relation(X4))|~(function(X4)))|(~(relation_dom(relation_composition(X4,X3))=relation_dom(X4))|subset(relation_rng(X4),relation_dom(X3))))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X3]:![X4]:(((~(relation(X4))|~(function(X4)))|(~(relation_dom(relation_composition(X4,X3))=relation_dom(X4))|subset(relation_rng(X4),relation_dom(X3))))|(~(relation(X3))|~(function(X3)))),inference(shift_quantors,[status(thm)],[90])).
% cnf(92,plain,(subset(relation_rng(X2),relation_dom(X1))|~function(X1)|~relation(X1)|relation_dom(relation_composition(X2,X1))!=relation_dom(X2)|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[91])).
% fof(93, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:((~(relation(X2))|~(function(X2)))|((~(one_to_one(relation_composition(X2,X1)))|~(subset(relation_rng(X2),relation_dom(X1))))|one_to_one(X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(94, plain,![X3]:((~(relation(X3))|~(function(X3)))|![X4]:((~(relation(X4))|~(function(X4)))|((~(one_to_one(relation_composition(X4,X3)))|~(subset(relation_rng(X4),relation_dom(X3))))|one_to_one(X4)))),inference(variable_rename,[status(thm)],[93])).
% fof(95, plain,![X3]:![X4]:(((~(relation(X4))|~(function(X4)))|((~(one_to_one(relation_composition(X4,X3)))|~(subset(relation_rng(X4),relation_dom(X3))))|one_to_one(X4)))|(~(relation(X3))|~(function(X3)))),inference(shift_quantors,[status(thm)],[94])).
% cnf(96,plain,(one_to_one(X2)|~function(X1)|~relation(X1)|~subset(relation_rng(X2),relation_dom(X1))|~one_to_one(relation_composition(X2,X1))|~function(X2)|~relation(X2)),inference(split_conjunct,[status(thm)],[95])).
% fof(180, negated_conjecture,?[X1]:((relation(X1)&function(X1))&(?[X2]:((relation(X2)&function(X2))&relation_composition(X1,X2)=identity_relation(relation_dom(X1)))&~(one_to_one(X1)))),inference(fof_nnf,[status(thm)],[41])).
% fof(181, negated_conjecture,?[X3]:((relation(X3)&function(X3))&(?[X4]:((relation(X4)&function(X4))&relation_composition(X3,X4)=identity_relation(relation_dom(X3)))&~(one_to_one(X3)))),inference(variable_rename,[status(thm)],[180])).
% fof(182, negated_conjecture,((relation(esk10_0)&function(esk10_0))&(((relation(esk11_0)&function(esk11_0))&relation_composition(esk10_0,esk11_0)=identity_relation(relation_dom(esk10_0)))&~(one_to_one(esk10_0)))),inference(skolemize,[status(esa)],[181])).
% cnf(183,negated_conjecture,(~one_to_one(esk10_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(184,negated_conjecture,(relation_composition(esk10_0,esk11_0)=identity_relation(relation_dom(esk10_0))),inference(split_conjunct,[status(thm)],[182])).
% cnf(185,negated_conjecture,(function(esk11_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(186,negated_conjecture,(relation(esk11_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(187,negated_conjecture,(function(esk10_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(188,negated_conjecture,(relation(esk10_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(231,negated_conjecture,(one_to_one(relation_composition(esk10_0,esk11_0))),inference(pm,[status(thm)],[67,184,theory(equality)])).
% cnf(232,negated_conjecture,(relation_dom(relation_composition(esk10_0,esk11_0))=relation_dom(esk10_0)),inference(pm,[status(thm)],[88,184,theory(equality)])).
% cnf(506,negated_conjecture,(subset(relation_rng(esk10_0),relation_dom(esk11_0))|~function(esk10_0)|~function(esk11_0)|~relation(esk10_0)|~relation(esk11_0)),inference(pm,[status(thm)],[92,232,theory(equality)])).
% cnf(512,negated_conjecture,(subset(relation_rng(esk10_0),relation_dom(esk11_0))|$false|~function(esk11_0)|~relation(esk10_0)|~relation(esk11_0)),inference(rw,[status(thm)],[506,187,theory(equality)])).
% cnf(513,negated_conjecture,(subset(relation_rng(esk10_0),relation_dom(esk11_0))|$false|$false|~relation(esk10_0)|~relation(esk11_0)),inference(rw,[status(thm)],[512,185,theory(equality)])).
% cnf(514,negated_conjecture,(subset(relation_rng(esk10_0),relation_dom(esk11_0))|$false|$false|$false|~relation(esk11_0)),inference(rw,[status(thm)],[513,188,theory(equality)])).
% cnf(515,negated_conjecture,(subset(relation_rng(esk10_0),relation_dom(esk11_0))|$false|$false|$false|$false),inference(rw,[status(thm)],[514,186,theory(equality)])).
% cnf(516,negated_conjecture,(subset(relation_rng(esk10_0),relation_dom(esk11_0))),inference(cn,[status(thm)],[515,theory(equality)])).
% cnf(2324,negated_conjecture,(one_to_one(esk10_0)|~one_to_one(relation_composition(esk10_0,esk11_0))|~function(esk10_0)|~function(esk11_0)|~relation(esk10_0)|~relation(esk11_0)),inference(pm,[status(thm)],[96,516,theory(equality)])).
% cnf(2325,negated_conjecture,(one_to_one(esk10_0)|$false|~function(esk10_0)|~function(esk11_0)|~relation(esk10_0)|~relation(esk11_0)),inference(rw,[status(thm)],[2324,231,theory(equality)])).
% cnf(2326,negated_conjecture,(one_to_one(esk10_0)|$false|$false|~function(esk11_0)|~relation(esk10_0)|~relation(esk11_0)),inference(rw,[status(thm)],[2325,187,theory(equality)])).
% cnf(2327,negated_conjecture,(one_to_one(esk10_0)|$false|$false|$false|~relation(esk10_0)|~relation(esk11_0)),inference(rw,[status(thm)],[2326,185,theory(equality)])).
% cnf(2328,negated_conjecture,(one_to_one(esk10_0)|$false|$false|$false|$false|~relation(esk11_0)),inference(rw,[status(thm)],[2327,188,theory(equality)])).
% cnf(2329,negated_conjecture,(one_to_one(esk10_0)|$false|$false|$false|$false|$false),inference(rw,[status(thm)],[2328,186,theory(equality)])).
% cnf(2330,negated_conjecture,(one_to_one(esk10_0)),inference(cn,[status(thm)],[2329,theory(equality)])).
% cnf(2331,negated_conjecture,($false),inference(sr,[status(thm)],[2330,183,theory(equality)])).
% cnf(2332,negated_conjecture,($false),2331,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 306
% # ...of these trivial : 15
% # ...subsumed : 35
% # ...remaining for further processing: 256
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 74
% # Generated clauses : 1751
% # ...of the previous two non-trivial : 1688
% # Contextual simplify-reflections : 0
% # Paramodulations : 1745
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 182
% # Positive orientable unit clauses: 89
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 85
% # Current number of unprocessed clauses: 542
% # ...number of literals in the above : 856
% # Clause-clause subsumption calls (NU) : 147
% # Rec. Clause-clause subsumption calls : 132
% # Unit Clause-clause subsumption calls : 127
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 68
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 249 leaves, 1.06+/-0.292 terms/leaf
% # Paramod-from index: 93 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 170 leaves, 1.06+/-0.259 terms/leaf
% # -------------------------------------------------
% # User time : 0.051 s
% # System time : 0.004 s
% # Total time : 0.055 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.25 WC
% FINAL PrfWatch: 0.16 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP15211/SEU020+1.tptp
%
%------------------------------------------------------------------------------