TSTP Solution File: SET991+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET991+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 : 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 00:35:22 EST 2010

% Result   : Theorem 1.15s
% Output   : Solution 1.15s
% 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/SystemOnTPTP7739/SET991+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP7739/SET991+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7739/SET991+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 7871
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:((relation(X1)&function(X1))=>![X2]:(X2=relation_rng(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:(in(X4,relation_dom(X1))&X3=apply(X1,X4))))),file('/tmp/SRASS.s.p', d5_funct_1)).
% fof(31, conjecture,![X1]:![X2]:((relation(X2)&function(X2))=>(in(X1,relation_dom(X2))=>in(apply(X2,X1),relation_rng(X2)))),file('/tmp/SRASS.s.p', t12_funct_1)).
% fof(32, negated_conjecture,~(![X1]:![X2]:((relation(X2)&function(X2))=>(in(X1,relation_dom(X2))=>in(apply(X2,X1),relation_rng(X2))))),inference(assume_negation,[status(cth)],[31])).
% fof(47, plain,![X1]:((~(relation(X1))|~(function(X1)))|![X2]:((~(X2=relation_rng(X1))|![X3]:((~(in(X3,X2))|?[X4]:(in(X4,relation_dom(X1))&X3=apply(X1,X4)))&(![X4]:(~(in(X4,relation_dom(X1)))|~(X3=apply(X1,X4)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:(~(in(X4,relation_dom(X1)))|~(X3=apply(X1,X4))))&(in(X3,X2)|?[X4]:(in(X4,relation_dom(X1))&X3=apply(X1,X4))))|X2=relation_rng(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(48, plain,![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|?[X8]:(in(X8,relation_dom(X5))&X7=apply(X5,X8)))&(![X9]:(~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:(~(in(X11,relation_dom(X5)))|~(X10=apply(X5,X11))))&(in(X10,X6)|?[X12]:(in(X12,relation_dom(X5))&X10=apply(X5,X12))))|X6=relation_rng(X5)))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X5]:((~(relation(X5))|~(function(X5)))|![X6]:((~(X6=relation_rng(X5))|![X7]:((~(in(X7,X6))|(in(esk2_3(X5,X6,X7),relation_dom(X5))&X7=apply(X5,esk2_3(X5,X6,X7))))&(![X9]:(~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))))&(((~(in(esk3_2(X5,X6),X6))|![X11]:(~(in(X11,relation_dom(X5)))|~(esk3_2(X5,X6)=apply(X5,X11))))&(in(esk3_2(X5,X6),X6)|(in(esk4_2(X5,X6),relation_dom(X5))&esk3_2(X5,X6)=apply(X5,esk4_2(X5,X6)))))|X6=relation_rng(X5)))),inference(skolemize,[status(esa)],[48])).
% fof(50, plain,![X5]:![X6]:![X7]:![X9]:![X11]:((((((~(in(X11,relation_dom(X5)))|~(esk3_2(X5,X6)=apply(X5,X11)))|~(in(esk3_2(X5,X6),X6)))&(in(esk3_2(X5,X6),X6)|(in(esk4_2(X5,X6),relation_dom(X5))&esk3_2(X5,X6)=apply(X5,esk4_2(X5,X6)))))|X6=relation_rng(X5))&((((~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))&(~(in(X7,X6))|(in(esk2_3(X5,X6,X7),relation_dom(X5))&X7=apply(X5,esk2_3(X5,X6,X7)))))|~(X6=relation_rng(X5))))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[49])).
% fof(51, plain,![X5]:![X6]:![X7]:![X9]:![X11]:((((((~(in(X11,relation_dom(X5)))|~(esk3_2(X5,X6)=apply(X5,X11)))|~(in(esk3_2(X5,X6),X6)))|X6=relation_rng(X5))|(~(relation(X5))|~(function(X5))))&((((in(esk4_2(X5,X6),relation_dom(X5))|in(esk3_2(X5,X6),X6))|X6=relation_rng(X5))|(~(relation(X5))|~(function(X5))))&(((esk3_2(X5,X6)=apply(X5,esk4_2(X5,X6))|in(esk3_2(X5,X6),X6))|X6=relation_rng(X5))|(~(relation(X5))|~(function(X5))))))&(((((~(in(X9,relation_dom(X5)))|~(X7=apply(X5,X9)))|in(X7,X6))|~(X6=relation_rng(X5)))|(~(relation(X5))|~(function(X5))))&((((in(esk2_3(X5,X6,X7),relation_dom(X5))|~(in(X7,X6)))|~(X6=relation_rng(X5)))|(~(relation(X5))|~(function(X5))))&(((X7=apply(X5,esk2_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=relation_rng(X5)))|(~(relation(X5))|~(function(X5))))))),inference(distribute,[status(thm)],[50])).
% cnf(54,plain,(in(X3,X2)|~function(X1)|~relation(X1)|X2!=relation_rng(X1)|X3!=apply(X1,X4)|~in(X4,relation_dom(X1))),inference(split_conjunct,[status(thm)],[51])).
% fof(146, negated_conjecture,?[X1]:?[X2]:((relation(X2)&function(X2))&(in(X1,relation_dom(X2))&~(in(apply(X2,X1),relation_rng(X2))))),inference(fof_nnf,[status(thm)],[32])).
% fof(147, negated_conjecture,?[X3]:?[X4]:((relation(X4)&function(X4))&(in(X3,relation_dom(X4))&~(in(apply(X4,X3),relation_rng(X4))))),inference(variable_rename,[status(thm)],[146])).
% fof(148, negated_conjecture,((relation(esk14_0)&function(esk14_0))&(in(esk13_0,relation_dom(esk14_0))&~(in(apply(esk14_0,esk13_0),relation_rng(esk14_0))))),inference(skolemize,[status(esa)],[147])).
% cnf(149,negated_conjecture,(~in(apply(esk14_0,esk13_0),relation_rng(esk14_0))),inference(split_conjunct,[status(thm)],[148])).
% cnf(150,negated_conjecture,(in(esk13_0,relation_dom(esk14_0))),inference(split_conjunct,[status(thm)],[148])).
% cnf(151,negated_conjecture,(function(esk14_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(152,negated_conjecture,(relation(esk14_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(194,plain,(in(apply(X1,X2),X3)|relation_rng(X1)!=X3|~function(X1)|~relation(X1)|~in(X2,relation_dom(X1))),inference(er,[status(thm)],[54,theory(equality)])).
% cnf(510,negated_conjecture,(~function(esk14_0)|~relation(esk14_0)|~in(esk13_0,relation_dom(esk14_0))),inference(spm,[status(thm)],[149,194,theory(equality)])).
% cnf(512,negated_conjecture,($false|~relation(esk14_0)|~in(esk13_0,relation_dom(esk14_0))),inference(rw,[status(thm)],[510,151,theory(equality)])).
% cnf(513,negated_conjecture,($false|$false|~in(esk13_0,relation_dom(esk14_0))),inference(rw,[status(thm)],[512,152,theory(equality)])).
% cnf(514,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[513,150,theory(equality)])).
% cnf(515,negated_conjecture,($false),inference(cn,[status(thm)],[514,theory(equality)])).
% cnf(516,negated_conjecture,($false),515,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 231
% # ...of these trivial                : 3
% # ...subsumed                        : 67
% # ...remaining for further processing: 161
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 11
% # Generated clauses                  : 268
% # ...of the previous two non-trivial : 241
% # Contextual simplify-reflections    : 26
% # Paramodulations                    : 256
% # Factorizations                     : 0
% # Equation resolutions               : 3
% # Current number of processed clauses: 99
% #    Positive orientable unit clauses: 25
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 15
% #    Non-unit-clauses                : 59
% # Current number of unprocessed clauses: 94
% # ...number of literals in the above : 387
% # Clause-clause subsumption calls (NU) : 480
% # Rec. Clause-clause subsumption calls : 439
% # Unit Clause-clause subsumption calls : 294
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 9
% # Indexed BW rewrite successes       : 6
% # Backwards rewriting index:    92 leaves,   1.28+/-0.712 terms/leaf
% # Paramod-from index:           46 leaves,   1.07+/-0.247 terms/leaf
% # Paramod-into index:           87 leaves,   1.18+/-0.468 terms/leaf
% # -------------------------------------------------
% # User time              : 0.024 s
% # System time            : 0.005 s
% # Total time             : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP7739/SET991+1.tptp
% 
%------------------------------------------------------------------------------