TSTP Solution File: HAL006+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : HAL006+1 : TPTP v5.0.0. Released v2.6.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 : Wed Dec 29 07:29:15 EST 2010
% Result : Theorem 1.52s
% Output : Solution 1.52s
% 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/SystemOnTPTP8002/HAL006+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8002/HAL006+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8002/HAL006+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 8098
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:((element(X2,X1)&element(X3,X1))=>subtract(X1,X2,subtract(X1,X2,X3))=X3),file('/tmp/SRASS.s.p', subtract_cancellation)).
% fof(7, axiom,![X4]:![X1]:![X5]:(morphism(X4,X1,X5)=>![X2]:![X3]:((element(X2,X1)&element(X3,X1))=>apply(X4,subtract(X1,X2,X3))=subtract(X5,apply(X4,X2),apply(X4,X3)))),file('/tmp/SRASS.s.p', subtract_distribution)).
% fof(8, axiom,morphism(g,b,e),file('/tmp/SRASS.s.p', g_morphism)).
% fof(9, axiom,![X8]:(element(X8,e)=>?[X9]:?[X10]:?[X11]:(((((element(X9,b)&element(X10,e))&subtract(e,apply(g,X9),X8)=X10)&element(X11,a))&apply(gamma,apply(f,X11))=X10)&apply(g,apply(alpha,X11))=X10)),file('/tmp/SRASS.s.p', lemma8)).
% fof(12, axiom,![X4]:![X1]:![X5]:(morphism(X4,X1,X5)=>(![X12]:(element(X12,X1)=>element(apply(X4,X12),X5))&apply(X4,zero(X1))=zero(X5))),file('/tmp/SRASS.s.p', morphism)).
% fof(21, axiom,morphism(alpha,a,b),file('/tmp/SRASS.s.p', alpha_morphism)).
% fof(33, conjecture,![X8]:(element(X8,e)=>?[X9]:?[X24]:((element(X9,b)&element(X24,b))&apply(g,subtract(b,X9,X24))=X8)),file('/tmp/SRASS.s.p', lemma12)).
% fof(34, negated_conjecture,~(![X8]:(element(X8,e)=>?[X9]:?[X24]:((element(X9,b)&element(X24,b))&apply(g,subtract(b,X9,X24))=X8))),inference(assume_negation,[status(cth)],[33])).
% fof(38, plain,![X1]:![X2]:![X3]:((~(element(X2,X1))|~(element(X3,X1)))|subtract(X1,X2,subtract(X1,X2,X3))=X3),inference(fof_nnf,[status(thm)],[2])).
% fof(39, plain,![X4]:![X5]:![X6]:((~(element(X5,X4))|~(element(X6,X4)))|subtract(X4,X5,subtract(X4,X5,X6))=X6),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(57, plain,![X4]:![X1]:![X5]:(~(morphism(X4,X1,X5))|![X2]:![X3]:((~(element(X2,X1))|~(element(X3,X1)))|apply(X4,subtract(X1,X2,X3))=subtract(X5,apply(X4,X2),apply(X4,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(58, plain,![X6]:![X7]:![X8]:(~(morphism(X6,X7,X8))|![X9]:![X10]:((~(element(X9,X7))|~(element(X10,X7)))|apply(X6,subtract(X7,X9,X10))=subtract(X8,apply(X6,X9),apply(X6,X10)))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(element(X9,X7))|~(element(X10,X7)))|apply(X6,subtract(X7,X9,X10))=subtract(X8,apply(X6,X9),apply(X6,X10)))|~(morphism(X6,X7,X8))),inference(shift_quantors,[status(thm)],[58])).
% cnf(60,plain,(apply(X1,subtract(X2,X4,X5))=subtract(X3,apply(X1,X4),apply(X1,X5))|~morphism(X1,X2,X3)|~element(X5,X2)|~element(X4,X2)),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(morphism(g,b,e)),inference(split_conjunct,[status(thm)],[8])).
% fof(62, plain,![X8]:(~(element(X8,e))|?[X9]:?[X10]:?[X11]:(((((element(X9,b)&element(X10,e))&subtract(e,apply(g,X9),X8)=X10)&element(X11,a))&apply(gamma,apply(f,X11))=X10)&apply(g,apply(alpha,X11))=X10)),inference(fof_nnf,[status(thm)],[9])).
% fof(63, plain,![X12]:(~(element(X12,e))|?[X13]:?[X14]:?[X15]:(((((element(X13,b)&element(X14,e))&subtract(e,apply(g,X13),X12)=X14)&element(X15,a))&apply(gamma,apply(f,X15))=X14)&apply(g,apply(alpha,X15))=X14)),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X12]:(~(element(X12,e))|(((((element(esk3_1(X12),b)&element(esk4_1(X12),e))&subtract(e,apply(g,esk3_1(X12)),X12)=esk4_1(X12))&element(esk5_1(X12),a))&apply(gamma,apply(f,esk5_1(X12)))=esk4_1(X12))&apply(g,apply(alpha,esk5_1(X12)))=esk4_1(X12))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X12]:((((((element(esk3_1(X12),b)|~(element(X12,e)))&(element(esk4_1(X12),e)|~(element(X12,e))))&(subtract(e,apply(g,esk3_1(X12)),X12)=esk4_1(X12)|~(element(X12,e))))&(element(esk5_1(X12),a)|~(element(X12,e))))&(apply(gamma,apply(f,esk5_1(X12)))=esk4_1(X12)|~(element(X12,e))))&(apply(g,apply(alpha,esk5_1(X12)))=esk4_1(X12)|~(element(X12,e)))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(apply(g,apply(alpha,esk5_1(X1)))=esk4_1(X1)|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(element(esk5_1(X1),a)|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% cnf(69,plain,(subtract(e,apply(g,esk3_1(X1)),X1)=esk4_1(X1)|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% cnf(71,plain,(element(esk3_1(X1),b)|~element(X1,e)),inference(split_conjunct,[status(thm)],[65])).
% fof(84, plain,![X4]:![X1]:![X5]:(~(morphism(X4,X1,X5))|(![X12]:(~(element(X12,X1))|element(apply(X4,X12),X5))&apply(X4,zero(X1))=zero(X5))),inference(fof_nnf,[status(thm)],[12])).
% fof(85, plain,![X13]:![X14]:![X15]:(~(morphism(X13,X14,X15))|(![X16]:(~(element(X16,X14))|element(apply(X13,X16),X15))&apply(X13,zero(X14))=zero(X15))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X13]:![X14]:![X15]:![X16]:(((~(element(X16,X14))|element(apply(X13,X16),X15))&apply(X13,zero(X14))=zero(X15))|~(morphism(X13,X14,X15))),inference(shift_quantors,[status(thm)],[85])).
% fof(87, plain,![X13]:![X14]:![X15]:![X16]:(((~(element(X16,X14))|element(apply(X13,X16),X15))|~(morphism(X13,X14,X15)))&(apply(X13,zero(X14))=zero(X15)|~(morphism(X13,X14,X15)))),inference(distribute,[status(thm)],[86])).
% cnf(89,plain,(element(apply(X1,X4),X3)|~morphism(X1,X2,X3)|~element(X4,X2)),inference(split_conjunct,[status(thm)],[87])).
% cnf(133,plain,(morphism(alpha,a,b)),inference(split_conjunct,[status(thm)],[21])).
% fof(145, negated_conjecture,?[X8]:(element(X8,e)&![X9]:![X24]:((~(element(X9,b))|~(element(X24,b)))|~(apply(g,subtract(b,X9,X24))=X8))),inference(fof_nnf,[status(thm)],[34])).
% fof(146, negated_conjecture,?[X25]:(element(X25,e)&![X26]:![X27]:((~(element(X26,b))|~(element(X27,b)))|~(apply(g,subtract(b,X26,X27))=X25))),inference(variable_rename,[status(thm)],[145])).
% fof(147, negated_conjecture,(element(esk14_0,e)&![X26]:![X27]:((~(element(X26,b))|~(element(X27,b)))|~(apply(g,subtract(b,X26,X27))=esk14_0))),inference(skolemize,[status(esa)],[146])).
% fof(148, negated_conjecture,![X26]:![X27]:(((~(element(X26,b))|~(element(X27,b)))|~(apply(g,subtract(b,X26,X27))=esk14_0))&element(esk14_0,e)),inference(shift_quantors,[status(thm)],[147])).
% cnf(149,negated_conjecture,(element(esk14_0,e)),inference(split_conjunct,[status(thm)],[148])).
% cnf(150,negated_conjecture,(apply(g,subtract(b,X1,X2))!=esk14_0|~element(X2,b)|~element(X1,b)),inference(split_conjunct,[status(thm)],[148])).
% cnf(164,plain,(subtract(e,apply(g,esk3_1(X1)),esk4_1(X1))=X1|~element(X1,e)|~element(apply(g,esk3_1(X1)),e)),inference(spm,[status(thm)],[40,69,theory(equality)])).
% cnf(168,plain,(element(apply(alpha,X1),b)|~element(X1,a)),inference(spm,[status(thm)],[89,133,theory(equality)])).
% cnf(170,plain,(element(apply(g,X1),e)|~element(X1,b)),inference(spm,[status(thm)],[89,61,theory(equality)])).
% cnf(199,plain,(subtract(e,apply(g,X1),apply(g,X2))=apply(g,subtract(b,X1,X2))|~element(X2,b)|~element(X1,b)),inference(spm,[status(thm)],[60,61,theory(equality)])).
% cnf(510,plain,(subtract(e,apply(g,X1),esk4_1(X2))=apply(g,subtract(b,X1,apply(alpha,esk5_1(X2))))|~element(apply(alpha,esk5_1(X2)),b)|~element(X1,b)|~element(X2,e)),inference(spm,[status(thm)],[199,66,theory(equality)])).
% cnf(7629,negated_conjecture,(subtract(e,apply(g,X1),esk4_1(X2))!=esk14_0|~element(apply(alpha,esk5_1(X2)),b)|~element(X1,b)|~element(X2,e)),inference(spm,[status(thm)],[150,510,theory(equality)])).
% cnf(7795,negated_conjecture,(X1!=esk14_0|~element(apply(alpha,esk5_1(X1)),b)|~element(esk3_1(X1),b)|~element(X1,e)|~element(apply(g,esk3_1(X1)),e)),inference(spm,[status(thm)],[7629,164,theory(equality)])).
% cnf(11884,negated_conjecture,(X1!=esk14_0|~element(apply(alpha,esk5_1(X1)),b)|~element(esk3_1(X1),b)|~element(X1,e)),inference(csr,[status(thm)],[7795,170])).
% cnf(11885,negated_conjecture,(X1!=esk14_0|~element(apply(alpha,esk5_1(X1)),b)|~element(X1,e)),inference(csr,[status(thm)],[11884,71])).
% cnf(11886,negated_conjecture,(X1!=esk14_0|~element(X1,e)|~element(esk5_1(X1),a)),inference(spm,[status(thm)],[11885,168,theory(equality)])).
% cnf(11887,negated_conjecture,(X1!=esk14_0|~element(X1,e)),inference(csr,[status(thm)],[11886,68])).
% cnf(11888,negated_conjecture,($false),inference(spm,[status(thm)],[11887,149,theory(equality)])).
% cnf(11949,negated_conjecture,($false),11888,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1354
% # ...of these trivial : 7
% # ...subsumed : 692
% # ...remaining for further processing: 655
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 37
% # Backward-rewritten : 23
% # Generated clauses : 7426
% # ...of the previous two non-trivial : 6329
% # Contextual simplify-reflections : 699
% # Paramodulations : 7403
% # Factorizations : 0
% # Equation resolutions : 11
% # Current number of processed clauses: 533
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 478
% # Current number of unprocessed clauses: 4637
% # ...number of literals in the above : 26652
% # Clause-clause subsumption calls (NU) : 11571
% # Rec. Clause-clause subsumption calls : 7567
% # Unit Clause-clause subsumption calls : 353
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 22
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 469 leaves, 2.10+/-2.811 terms/leaf
% # Paramod-from index: 165 leaves, 1.76+/-1.546 terms/leaf
% # Paramod-into index: 367 leaves, 1.84+/-1.911 terms/leaf
% # -------------------------------------------------
% # User time : 0.426 s
% # System time : 0.022 s
% # Total time : 0.448 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.70 CPU 0.80 WC
% FINAL PrfWatch: 0.70 CPU 0.80 WC
% SZS output end Solution for /tmp/SystemOnTPTP8002/HAL006+1.tptp
%
%------------------------------------------------------------------------------