TSTP Solution File: HAL002+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : HAL002+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 : 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 : Wed Dec 29 07:24:35 EST 2010
% Result : Theorem 9.13s
% Output : Solution 9.13s
% 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/SystemOnTPTP2607/HAL002+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2607/HAL002+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2607/HAL002+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 2703
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.92 CPU 4.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,morphism(x,any1,any2),file('/tmp/SRASS.s.p', x_morphism)).
% fof(2, axiom,![X1]:![X2]:![X3]:((injection(X1)&morphism(X1,X2,X3))=>![X4]:![X5]:(((element(X4,X2)&element(X5,X2))&apply(X1,X4)=apply(X1,X5))=>X4=X5)),file('/tmp/SRASS.s.p', injection_properties)).
% fof(3, axiom,![X1]:![X2]:![X3]:((morphism(X1,X2,X3)&![X4]:![X5]:(((element(X4,X2)&element(X5,X2))&apply(X1,X4)=apply(X1,X5))=>X4=X5))=>injection(X1)),file('/tmp/SRASS.s.p', properties_for_injection)).
% fof(4, axiom,![X1]:![X2]:![X3]:((injection_2(X1)&morphism(X1,X2,X3))=>![X6]:((element(X6,X2)&apply(X1,X6)=zero(X3))=>X6=zero(X2))),file('/tmp/SRASS.s.p', injection_properties_2)).
% fof(5, axiom,![X1]:![X2]:![X3]:((morphism(X1,X2,X3)&![X6]:((element(X6,X2)&apply(X1,X6)=zero(X3))=>X6=zero(X2)))=>injection_2(X1)),file('/tmp/SRASS.s.p', properties_for_injection_2)).
% fof(6, axiom,![X1]:![X2]:![X3]:(morphism(X1,X2,X3)=>(![X6]:(element(X6,X2)=>element(apply(X1,X6),X3))&apply(X1,zero(X2))=zero(X3))),file('/tmp/SRASS.s.p', morphism)).
% fof(7, axiom,![X2]:![X4]:![X5]:((element(X4,X2)&element(X5,X2))=>element(subtract(X2,X4,X5),X2)),file('/tmp/SRASS.s.p', subtract_in_domain)).
% fof(8, axiom,![X2]:![X4]:![X5]:((element(X4,X2)&element(X5,X2))=>subtract(X2,X4,subtract(X2,X4,X5))=X5),file('/tmp/SRASS.s.p', subtract_cancellation)).
% fof(11, axiom,![X2]:![X6]:(element(X6,X2)=>subtract(X2,X6,X6)=zero(X2)),file('/tmp/SRASS.s.p', subtract_to_0)).
% fof(12, axiom,![X1]:![X2]:![X3]:(morphism(X1,X2,X3)=>![X4]:![X5]:((element(X4,X2)&element(X5,X2))=>apply(X1,subtract(X2,X4,X5))=subtract(X3,apply(X1,X4),apply(X1,X5)))),file('/tmp/SRASS.s.p', subtract_distribution)).
% fof(17, conjecture,(injection(x)<=>injection_2(x)),file('/tmp/SRASS.s.p', my)).
% fof(18, negated_conjecture,~((injection(x)<=>injection_2(x))),inference(assume_negation,[status(cth)],[17])).
% cnf(19,plain,(morphism(x,any1,any2)),inference(split_conjunct,[status(thm)],[1])).
% fof(20, plain,![X1]:![X2]:![X3]:((~(injection(X1))|~(morphism(X1,X2,X3)))|![X4]:![X5]:(((~(element(X4,X2))|~(element(X5,X2)))|~(apply(X1,X4)=apply(X1,X5)))|X4=X5)),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X6]:![X7]:![X8]:((~(injection(X6))|~(morphism(X6,X7,X8)))|![X9]:![X10]:(((~(element(X9,X7))|~(element(X10,X7)))|~(apply(X6,X9)=apply(X6,X10)))|X9=X10)),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((((~(element(X9,X7))|~(element(X10,X7)))|~(apply(X6,X9)=apply(X6,X10)))|X9=X10)|(~(injection(X6))|~(morphism(X6,X7,X8)))),inference(shift_quantors,[status(thm)],[21])).
% cnf(23,plain,(X4=X5|~morphism(X1,X2,X3)|~injection(X1)|apply(X1,X4)!=apply(X1,X5)|~element(X5,X2)|~element(X4,X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:![X3]:((~(morphism(X1,X2,X3))|?[X4]:?[X5]:(((element(X4,X2)&element(X5,X2))&apply(X1,X4)=apply(X1,X5))&~(X4=X5)))|injection(X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(25, plain,![X6]:![X7]:![X8]:((~(morphism(X6,X7,X8))|?[X9]:?[X10]:(((element(X9,X7)&element(X10,X7))&apply(X6,X9)=apply(X6,X10))&~(X9=X10)))|injection(X6)),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X6]:![X7]:![X8]:((~(morphism(X6,X7,X8))|(((element(esk1_3(X6,X7,X8),X7)&element(esk2_3(X6,X7,X8),X7))&apply(X6,esk1_3(X6,X7,X8))=apply(X6,esk2_3(X6,X7,X8)))&~(esk1_3(X6,X7,X8)=esk2_3(X6,X7,X8))))|injection(X6)),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X6]:![X7]:![X8]:(((((element(esk1_3(X6,X7,X8),X7)|~(morphism(X6,X7,X8)))|injection(X6))&((element(esk2_3(X6,X7,X8),X7)|~(morphism(X6,X7,X8)))|injection(X6)))&((apply(X6,esk1_3(X6,X7,X8))=apply(X6,esk2_3(X6,X7,X8))|~(morphism(X6,X7,X8)))|injection(X6)))&((~(esk1_3(X6,X7,X8)=esk2_3(X6,X7,X8))|~(morphism(X6,X7,X8)))|injection(X6))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(injection(X1)|~morphism(X1,X2,X3)|esk1_3(X1,X2,X3)!=esk2_3(X1,X2,X3)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(injection(X1)|apply(X1,esk1_3(X1,X2,X3))=apply(X1,esk2_3(X1,X2,X3))|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,plain,(injection(X1)|element(esk2_3(X1,X2,X3),X2)|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[27])).
% cnf(31,plain,(injection(X1)|element(esk1_3(X1,X2,X3),X2)|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(32, plain,![X1]:![X2]:![X3]:((~(injection_2(X1))|~(morphism(X1,X2,X3)))|![X6]:((~(element(X6,X2))|~(apply(X1,X6)=zero(X3)))|X6=zero(X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(33, plain,![X7]:![X8]:![X9]:((~(injection_2(X7))|~(morphism(X7,X8,X9)))|![X10]:((~(element(X10,X8))|~(apply(X7,X10)=zero(X9)))|X10=zero(X8))),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X7]:![X8]:![X9]:![X10]:(((~(element(X10,X8))|~(apply(X7,X10)=zero(X9)))|X10=zero(X8))|(~(injection_2(X7))|~(morphism(X7,X8,X9)))),inference(shift_quantors,[status(thm)],[33])).
% cnf(35,plain,(X4=zero(X2)|~morphism(X1,X2,X3)|~injection_2(X1)|apply(X1,X4)!=zero(X3)|~element(X4,X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X1]:![X2]:![X3]:((~(morphism(X1,X2,X3))|?[X6]:((element(X6,X2)&apply(X1,X6)=zero(X3))&~(X6=zero(X2))))|injection_2(X1)),inference(fof_nnf,[status(thm)],[5])).
% fof(37, plain,![X7]:![X8]:![X9]:((~(morphism(X7,X8,X9))|?[X10]:((element(X10,X8)&apply(X7,X10)=zero(X9))&~(X10=zero(X8))))|injection_2(X7)),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X7]:![X8]:![X9]:((~(morphism(X7,X8,X9))|((element(esk3_3(X7,X8,X9),X8)&apply(X7,esk3_3(X7,X8,X9))=zero(X9))&~(esk3_3(X7,X8,X9)=zero(X8))))|injection_2(X7)),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X7]:![X8]:![X9]:((((element(esk3_3(X7,X8,X9),X8)|~(morphism(X7,X8,X9)))|injection_2(X7))&((apply(X7,esk3_3(X7,X8,X9))=zero(X9)|~(morphism(X7,X8,X9)))|injection_2(X7)))&((~(esk3_3(X7,X8,X9)=zero(X8))|~(morphism(X7,X8,X9)))|injection_2(X7))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(injection_2(X1)|~morphism(X1,X2,X3)|esk3_3(X1,X2,X3)!=zero(X2)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,plain,(injection_2(X1)|apply(X1,esk3_3(X1,X2,X3))=zero(X3)|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,plain,(injection_2(X1)|element(esk3_3(X1,X2,X3),X2)|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[39])).
% fof(43, plain,![X1]:![X2]:![X3]:(~(morphism(X1,X2,X3))|(![X6]:(~(element(X6,X2))|element(apply(X1,X6),X3))&apply(X1,zero(X2))=zero(X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(44, plain,![X7]:![X8]:![X9]:(~(morphism(X7,X8,X9))|(![X10]:(~(element(X10,X8))|element(apply(X7,X10),X9))&apply(X7,zero(X8))=zero(X9))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X7]:![X8]:![X9]:![X10]:(((~(element(X10,X8))|element(apply(X7,X10),X9))&apply(X7,zero(X8))=zero(X9))|~(morphism(X7,X8,X9))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X7]:![X8]:![X9]:![X10]:(((~(element(X10,X8))|element(apply(X7,X10),X9))|~(morphism(X7,X8,X9)))&(apply(X7,zero(X8))=zero(X9)|~(morphism(X7,X8,X9)))),inference(distribute,[status(thm)],[45])).
% cnf(47,plain,(apply(X1,zero(X2))=zero(X3)|~morphism(X1,X2,X3)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,plain,(element(apply(X1,X4),X3)|~morphism(X1,X2,X3)|~element(X4,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(49, plain,![X2]:![X4]:![X5]:((~(element(X4,X2))|~(element(X5,X2)))|element(subtract(X2,X4,X5),X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(50, plain,![X6]:![X7]:![X8]:((~(element(X7,X6))|~(element(X8,X6)))|element(subtract(X6,X7,X8),X6)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(element(subtract(X1,X2,X3),X1)|~element(X3,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X2]:![X4]:![X5]:((~(element(X4,X2))|~(element(X5,X2)))|subtract(X2,X4,subtract(X2,X4,X5))=X5),inference(fof_nnf,[status(thm)],[8])).
% fof(53, plain,![X6]:![X7]:![X8]:((~(element(X7,X6))|~(element(X8,X6)))|subtract(X6,X7,subtract(X6,X7,X8))=X8),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(subtract(X1,X2,subtract(X1,X2,X3))=X3|~element(X3,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(74, plain,![X2]:![X6]:(~(element(X6,X2))|subtract(X2,X6,X6)=zero(X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(75, plain,![X7]:![X8]:(~(element(X8,X7))|subtract(X7,X8,X8)=zero(X7)),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(subtract(X1,X2,X2)=zero(X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(77, plain,![X1]:![X2]:![X3]:(~(morphism(X1,X2,X3))|![X4]:![X5]:((~(element(X4,X2))|~(element(X5,X2)))|apply(X1,subtract(X2,X4,X5))=subtract(X3,apply(X1,X4),apply(X1,X5)))),inference(fof_nnf,[status(thm)],[12])).
% fof(78, 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)],[77])).
% fof(79, 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)],[78])).
% cnf(80,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)],[79])).
% fof(105, negated_conjecture,((~(injection(x))|~(injection_2(x)))&(injection(x)|injection_2(x))),inference(fof_nnf,[status(thm)],[18])).
% cnf(106,negated_conjecture,(injection_2(x)|injection(x)),inference(split_conjunct,[status(thm)],[105])).
% cnf(107,negated_conjecture,(~injection_2(x)|~injection(x)),inference(split_conjunct,[status(thm)],[105])).
% cnf(109,plain,(apply(x,zero(any1))=zero(any2)),inference(spm,[status(thm)],[47,19,theory(equality)])).
% cnf(110,plain,(element(apply(x,X1),any2)|~element(X1,any1)),inference(spm,[status(thm)],[48,19,theory(equality)])).
% cnf(111,plain,(element(zero(X1),X1)|~element(X2,X1)),inference(spm,[status(thm)],[51,76,theory(equality)])).
% cnf(113,plain,(subtract(X1,X2,zero(X1))=X2|~element(X2,X1)),inference(spm,[status(thm)],[54,76,theory(equality)])).
% cnf(120,plain,(zero(any1)=X1|apply(x,X1)!=zero(any2)|~injection_2(x)|~element(X1,any1)),inference(spm,[status(thm)],[35,19,theory(equality)])).
% cnf(121,plain,(X1=X2|apply(x,X1)!=apply(x,X2)|~element(X2,any1)|~element(X1,any1)|~injection(x)),inference(spm,[status(thm)],[23,19,theory(equality)])).
% cnf(124,plain,(subtract(any2,apply(x,X1),apply(x,X2))=apply(x,subtract(any1,X1,X2))|~element(X2,any1)|~element(X1,any1)),inference(spm,[status(thm)],[80,19,theory(equality)])).
% cnf(142,plain,(element(zero(X1),X1)|injection_2(X2)|~morphism(X2,X1,X3)),inference(spm,[status(thm)],[111,42,theory(equality)])).
% cnf(143,plain,(element(zero(X1),X1)|injection(X2)|~morphism(X2,X1,X3)),inference(spm,[status(thm)],[111,30,theory(equality)])).
% cnf(157,plain,(injection_2(x)|element(zero(any1),any1)),inference(spm,[status(thm)],[142,19,theory(equality)])).
% cnf(158,negated_conjecture,(element(zero(any1),any1)|~injection(x)),inference(spm,[status(thm)],[107,157,theory(equality)])).
% cnf(164,plain,(element(zero(any1),any1)|injection(x)),inference(spm,[status(thm)],[143,19,theory(equality)])).
% cnf(165,plain,(element(zero(any1),any1)),inference(csr,[status(thm)],[164,158])).
% cnf(175,negated_conjecture,(zero(any1)=X1|injection(x)|apply(x,X1)!=zero(any2)|~element(X1,any1)),inference(spm,[status(thm)],[120,106,theory(equality)])).
% cnf(207,plain,(subtract(any2,apply(x,X1),apply(x,subtract(any1,X1,X2)))=apply(x,X2)|~element(apply(x,X2),any2)|~element(apply(x,X1),any2)|~element(X2,any1)|~element(X1,any1)),inference(spm,[status(thm)],[54,124,theory(equality)])).
% cnf(212,plain,(subtract(any2,apply(x,X1),zero(any2))=apply(x,subtract(any1,X1,zero(any1)))|~element(zero(any1),any1)|~element(X1,any1)),inference(spm,[status(thm)],[124,109,theory(equality)])).
% cnf(218,plain,(subtract(any2,apply(x,X1),zero(any2))=apply(x,subtract(any1,X1,zero(any1)))|$false|~element(X1,any1)),inference(rw,[status(thm)],[212,165,theory(equality)])).
% cnf(219,plain,(subtract(any2,apply(x,X1),zero(any2))=apply(x,subtract(any1,X1,zero(any1)))|~element(X1,any1)),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(239,plain,(apply(x,subtract(any1,X1,zero(any1)))=apply(x,X1)|~element(apply(x,X1),any2)|~element(X1,any1)),inference(spm,[status(thm)],[113,219,theory(equality)])).
% cnf(243,plain,(subtract(any2,apply(x,esk1_3(x,X1,X2)),zero(any2))=apply(x,subtract(any1,esk2_3(x,X1,X2),zero(any1)))|injection(x)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[219,29,theory(equality)])).
% cnf(260,plain,(apply(x,subtract(any1,X1,zero(any1)))=apply(x,X1)|~element(X1,any1)),inference(csr,[status(thm)],[239,110])).
% cnf(264,plain,(subtract(any2,apply(x,X1),apply(x,X2))=apply(x,subtract(any1,subtract(any1,X1,zero(any1)),X2))|~element(X2,any1)|~element(subtract(any1,X1,zero(any1)),any1)|~element(X1,any1)),inference(spm,[status(thm)],[124,260,theory(equality)])).
% cnf(1193,plain,(subtract(any2,apply(x,X1),apply(x,subtract(any1,X1,X2)))=apply(x,X2)|~element(apply(x,X2),any2)|~element(X2,any1)|~element(X1,any1)),inference(csr,[status(thm)],[207,110])).
% cnf(1194,plain,(subtract(any2,apply(x,X1),apply(x,subtract(any1,X1,X2)))=apply(x,X2)|~element(X2,any1)|~element(X1,any1)),inference(csr,[status(thm)],[1193,110])).
% cnf(1200,plain,(subtract(any2,apply(x,X1),apply(x,zero(any1)))=apply(x,X1)|~element(X1,any1)),inference(spm,[status(thm)],[1194,76,theory(equality)])).
% cnf(1232,plain,(subtract(any2,apply(x,X1),zero(any2))=apply(x,X1)|~element(X1,any1)),inference(rw,[status(thm)],[1200,109,theory(equality)])).
% cnf(1301,plain,(subtract(any2,apply(x,esk1_3(x,X1,X2)),zero(any2))=apply(x,esk1_3(x,X1,X2))|injection(x)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[1232,29,theory(equality)])).
% cnf(3283,negated_conjecture,(zero(any1)=subtract(any1,subtract(any1,X1,zero(any1)),X2)|injection(x)|subtract(any2,apply(x,X1),apply(x,X2))!=zero(any2)|~element(subtract(any1,subtract(any1,X1,zero(any1)),X2),any1)|~element(subtract(any1,X1,zero(any1)),any1)|~element(X2,any1)|~element(X1,any1)),inference(spm,[status(thm)],[175,264,theory(equality)])).
% cnf(28717,plain,(apply(x,esk1_3(x,X1,X2))=apply(x,subtract(any1,esk2_3(x,X1,X2),zero(any1)))|injection(x)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[243,1301,theory(equality)])).
% cnf(28795,plain,(subtract(any2,apply(x,esk2_3(x,X1,X2)),apply(x,esk1_3(x,X1,X2)))=apply(x,zero(any1))|injection(x)|~element(zero(any1),any1)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[1194,28717,theory(equality)])).
% cnf(28821,plain,(subtract(any2,apply(x,esk2_3(x,X1,X2)),apply(x,esk1_3(x,X1,X2)))=zero(any2)|injection(x)|~element(zero(any1),any1)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(rw,[status(thm)],[28795,109,theory(equality)])).
% cnf(28822,plain,(subtract(any2,apply(x,esk2_3(x,X1,X2)),apply(x,esk1_3(x,X1,X2)))=zero(any2)|injection(x)|$false|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(rw,[status(thm)],[28821,165,theory(equality)])).
% cnf(28823,plain,(subtract(any2,apply(x,esk2_3(x,X1,X2)),apply(x,esk1_3(x,X1,X2)))=zero(any2)|injection(x)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(cn,[status(thm)],[28822,theory(equality)])).
% cnf(129670,negated_conjecture,(subtract(any1,subtract(any1,X1,zero(any1)),X2)=zero(any1)|injection(x)|subtract(any2,apply(x,X1),apply(x,X2))!=zero(any2)|~element(subtract(any1,X1,zero(any1)),any1)|~element(X2,any1)|~element(X1,any1)),inference(csr,[status(thm)],[3283,51])).
% cnf(129935,negated_conjecture,(subtract(any1,X1,X2)=zero(any1)|injection(x)|subtract(any2,apply(x,X1),apply(x,X2))!=zero(any2)|~element(X1,any1)|~element(X2,any1)),inference(spm,[status(thm)],[129670,113,theory(equality)])).
% cnf(132933,negated_conjecture,(subtract(any1,esk2_3(x,X1,X2),esk1_3(x,X1,X2))=zero(any1)|injection(x)|~element(esk2_3(x,X1,X2),any1)|~element(esk1_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[129935,28823,theory(equality)])).
% cnf(143284,negated_conjecture,(subtract(any1,esk2_3(x,X1,X2),zero(any1))=esk1_3(x,X1,X2)|injection(x)|~element(esk1_3(x,X1,X2),any1)|~element(esk2_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[54,132933,theory(equality)])).
% cnf(144373,negated_conjecture,(esk1_3(x,X1,X2)=esk2_3(x,X1,X2)|injection(x)|~element(esk2_3(x,X1,X2),any1)|~element(esk1_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[113,143284,theory(equality)])).
% cnf(144570,negated_conjecture,(injection(x)|~element(esk2_3(x,X1,X2),any1)|~element(esk1_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(csr,[status(thm)],[144373,28])).
% cnf(144571,negated_conjecture,(injection(x)|~element(esk1_3(x,any1,X1),any1)|~morphism(x,any1,X1)),inference(spm,[status(thm)],[144570,30,theory(equality)])).
% cnf(144572,negated_conjecture,(injection(x)|~morphism(x,any1,X1)),inference(csr,[status(thm)],[144571,31])).
% cnf(144573,negated_conjecture,(injection(x)),inference(spm,[status(thm)],[144572,19,theory(equality)])).
% cnf(144774,plain,(X1=X2|apply(x,X1)!=apply(x,X2)|~element(X2,any1)|~element(X1,any1)|$false),inference(rw,[status(thm)],[121,144573,theory(equality)])).
% cnf(144775,plain,(X1=X2|apply(x,X1)!=apply(x,X2)|~element(X2,any1)|~element(X1,any1)),inference(cn,[status(thm)],[144774,theory(equality)])).
% cnf(144777,negated_conjecture,(~injection_2(x)|$false),inference(rw,[status(thm)],[107,144573,theory(equality)])).
% cnf(144778,negated_conjecture,(~injection_2(x)),inference(cn,[status(thm)],[144777,theory(equality)])).
% cnf(144891,plain,(X1=zero(any1)|apply(x,X1)!=zero(any2)|~element(zero(any1),any1)|~element(X1,any1)),inference(spm,[status(thm)],[144775,109,theory(equality)])).
% cnf(145004,plain,(X1=zero(any1)|apply(x,X1)!=zero(any2)|$false|~element(X1,any1)),inference(rw,[status(thm)],[144891,165,theory(equality)])).
% cnf(145005,plain,(X1=zero(any1)|apply(x,X1)!=zero(any2)|~element(X1,any1)),inference(cn,[status(thm)],[145004,theory(equality)])).
% cnf(145013,plain,(esk3_3(x,X1,X2)=zero(any1)|injection_2(x)|zero(X2)!=zero(any2)|~element(esk3_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(spm,[status(thm)],[145005,41,theory(equality)])).
% cnf(145479,plain,(esk3_3(x,X1,X2)=zero(any1)|zero(X2)!=zero(any2)|~element(esk3_3(x,X1,X2),any1)|~morphism(x,X1,X2)),inference(sr,[status(thm)],[145013,144778,theory(equality)])).
% cnf(145480,plain,(esk3_3(x,any1,X1)=zero(any1)|injection_2(x)|zero(X1)!=zero(any2)|~morphism(x,any1,X1)),inference(spm,[status(thm)],[145479,42,theory(equality)])).
% cnf(145481,plain,(esk3_3(x,any1,X1)=zero(any1)|zero(X1)!=zero(any2)|~morphism(x,any1,X1)),inference(sr,[status(thm)],[145480,144778,theory(equality)])).
% cnf(145482,plain,(injection_2(x)|~morphism(x,any1,X1)|zero(X1)!=zero(any2)),inference(spm,[status(thm)],[40,145481,theory(equality)])).
% cnf(145580,plain,(~morphism(x,any1,X1)|zero(X1)!=zero(any2)),inference(sr,[status(thm)],[145482,144778,theory(equality)])).
% cnf(146134,plain,(~morphism(x,any1,any2)),inference(er,[status(thm)],[145580,theory(equality)])).
% cnf(146135,plain,($false),inference(rw,[status(thm)],[146134,19,theory(equality)])).
% cnf(146136,plain,($false),inference(cn,[status(thm)],[146135,theory(equality)])).
% cnf(146137,plain,($false),146136,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6227
% # ...of these trivial : 11
% # ...subsumed : 5086
% # ...remaining for further processing: 1130
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 125
% # Backward-rewritten : 208
% # Generated clauses : 79935
% # ...of the previous two non-trivial : 70214
% # Contextual simplify-reflections : 7542
% # Paramodulations : 79931
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 763
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 753
% # Current number of unprocessed clauses: 29423
% # ...number of literals in the above : 240751
% # Clause-clause subsumption calls (NU) : 167011
% # Rec. Clause-clause subsumption calls : 51118
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 179 leaves, 8.14+/-16.259 terms/leaf
% # Paramod-from index: 78 leaves, 6.13+/-14.135 terms/leaf
% # Paramod-into index: 144 leaves, 7.45+/-14.236 terms/leaf
% # -------------------------------------------------
% # User time : 5.613 s
% # System time : 0.120 s
% # Total time : 5.733 s
% # Maximum resident set size: 0 pages
% PrfWatch: 8.30 CPU 8.44 WC
% FINAL PrfWatch: 8.30 CPU 8.44 WC
% SZS output end Solution for /tmp/SystemOnTPTP2607/HAL002+1.tptp
%
%------------------------------------------------------------------------------