TSTP Solution File: ALG072+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG072+1 : TPTP v5.0.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 : Tue Dec 28 20:47:47 EST 2010
% Result : Theorem 4.45s
% Output : Solution 4.45s
% 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/SystemOnTPTP5158/ALG072+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5158/ALG072+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5158/ALG072+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 5254
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(sorti2(X1)=>![X2]:(sorti2(X2)=>sorti2(op2(X1,X2)))),file('/tmp/SRASS.s.p', ax6)).
% fof(3, axiom,(![X1]:(sorti1(X1)=>(op1(unit1,X1)=X1&op1(X1,unit1)=X1))&?[X2]:(sorti1(X2)&unit1=X2)),file('/tmp/SRASS.s.p', ax2)).
% fof(4, axiom,(![X1]:(sorti2(X1)=>(op2(unit2,X1)=X1&op2(X1,unit2)=X1))&?[X2]:(sorti2(X2)&unit2=X2)),file('/tmp/SRASS.s.p', ax4)).
% fof(5, axiom,?[X1]:(sorti1(X1)&![X2]:(sorti1(X2)=>![X3]:(sorti1(X3)=>(~(op1(X2,X3)=X1)|(op1(X2,X1)=X3&~(X1=unit1)))))),file('/tmp/SRASS.s.p', ax7)).
% fof(6, axiom,~(?[X1]:(sorti2(X1)&![X2]:(sorti2(X2)=>![X3]:(sorti2(X3)=>(~(op2(X2,X3)=X1)|(op2(X2,X1)=X3&~(X1=unit2))))))),file('/tmp/SRASS.s.p', ax8)).
% fof(7, axiom,sorti1(unit1),file('/tmp/SRASS.s.p', ax1)).
% fof(8, axiom,sorti2(unit2),file('/tmp/SRASS.s.p', ax3)).
% fof(9, conjecture,((![X1]:(sorti1(X1)=>sorti2(h(X1)))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(sorti1(X4)=>h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(sorti2(X5)=>![X6]:(sorti2(X6)=>j(op2(X5,X6))=op1(j(X5),j(X6)))))&![X7]:(sorti2(X7)=>h(j(X7))=X7))&![X8]:(sorti1(X8)=>j(h(X8))=X8)))),file('/tmp/SRASS.s.p', co1)).
% fof(10, negated_conjecture,~(((![X1]:(sorti1(X1)=>sorti2(h(X1)))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(sorti1(X4)=>h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(sorti2(X5)=>![X6]:(sorti2(X6)=>j(op2(X5,X6))=op1(j(X5),j(X6)))))&![X7]:(sorti2(X7)=>h(j(X7))=X7))&![X8]:(sorti1(X8)=>j(h(X8))=X8))))),inference(assume_negation,[status(cth)],[9])).
% fof(15, plain,![X1]:(~(sorti2(X1))|![X2]:(~(sorti2(X2))|sorti2(op2(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X3]:(~(sorti2(X3))|![X4]:(~(sorti2(X4))|sorti2(op2(X3,X4)))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X3]:![X4]:((~(sorti2(X4))|sorti2(op2(X3,X4)))|~(sorti2(X3))),inference(shift_quantors,[status(thm)],[16])).
% cnf(18,plain,(sorti2(op2(X1,X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,(![X1]:(~(sorti1(X1))|(op1(unit1,X1)=X1&op1(X1,unit1)=X1))&?[X2]:(sorti1(X2)&unit1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(20, plain,(![X3]:(~(sorti1(X3))|(op1(unit1,X3)=X3&op1(X3,unit1)=X3))&?[X4]:(sorti1(X4)&unit1=X4)),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,(![X3]:(~(sorti1(X3))|(op1(unit1,X3)=X3&op1(X3,unit1)=X3))&(sorti1(esk1_0)&unit1=esk1_0)),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X3]:((~(sorti1(X3))|(op1(unit1,X3)=X3&op1(X3,unit1)=X3))&(sorti1(esk1_0)&unit1=esk1_0)),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X3]:(((op1(unit1,X3)=X3|~(sorti1(X3)))&(op1(X3,unit1)=X3|~(sorti1(X3))))&(sorti1(esk1_0)&unit1=esk1_0)),inference(distribute,[status(thm)],[22])).
% cnf(26,plain,(op1(X1,unit1)=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(27,plain,(op1(unit1,X1)=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(28, plain,(![X1]:(~(sorti2(X1))|(op2(unit2,X1)=X1&op2(X1,unit2)=X1))&?[X2]:(sorti2(X2)&unit2=X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(29, plain,(![X3]:(~(sorti2(X3))|(op2(unit2,X3)=X3&op2(X3,unit2)=X3))&?[X4]:(sorti2(X4)&unit2=X4)),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,(![X3]:(~(sorti2(X3))|(op2(unit2,X3)=X3&op2(X3,unit2)=X3))&(sorti2(esk2_0)&unit2=esk2_0)),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X3]:((~(sorti2(X3))|(op2(unit2,X3)=X3&op2(X3,unit2)=X3))&(sorti2(esk2_0)&unit2=esk2_0)),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X3]:(((op2(unit2,X3)=X3|~(sorti2(X3)))&(op2(X3,unit2)=X3|~(sorti2(X3))))&(sorti2(esk2_0)&unit2=esk2_0)),inference(distribute,[status(thm)],[31])).
% cnf(36,plain,(op2(unit2,X1)=X1|~sorti2(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(37, plain,?[X1]:(sorti1(X1)&![X2]:(~(sorti1(X2))|![X3]:(~(sorti1(X3))|(~(op1(X2,X3)=X1)|(op1(X2,X1)=X3&~(X1=unit1)))))),inference(fof_nnf,[status(thm)],[5])).
% fof(38, plain,?[X4]:(sorti1(X4)&![X5]:(~(sorti1(X5))|![X6]:(~(sorti1(X6))|(~(op1(X5,X6)=X4)|(op1(X5,X4)=X6&~(X4=unit1)))))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,(sorti1(esk3_0)&![X5]:(~(sorti1(X5))|![X6]:(~(sorti1(X6))|(~(op1(X5,X6)=esk3_0)|(op1(X5,esk3_0)=X6&~(esk3_0=unit1)))))),inference(skolemize,[status(esa)],[38])).
% fof(40, plain,![X5]:![X6]:(((~(sorti1(X6))|(~(op1(X5,X6)=esk3_0)|(op1(X5,esk3_0)=X6&~(esk3_0=unit1))))|~(sorti1(X5)))&sorti1(esk3_0)),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X5]:![X6]:(((((op1(X5,esk3_0)=X6|~(op1(X5,X6)=esk3_0))|~(sorti1(X6)))|~(sorti1(X5)))&(((~(esk3_0=unit1)|~(op1(X5,X6)=esk3_0))|~(sorti1(X6)))|~(sorti1(X5))))&sorti1(esk3_0)),inference(distribute,[status(thm)],[40])).
% cnf(42,plain,(sorti1(esk3_0)),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,plain,(~sorti1(X1)|~sorti1(X2)|op1(X1,X2)!=esk3_0|esk3_0!=unit1),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,plain,(op1(X1,esk3_0)=X2|~sorti1(X1)|~sorti1(X2)|op1(X1,X2)!=esk3_0),inference(split_conjunct,[status(thm)],[41])).
% fof(45, plain,![X1]:(~(sorti2(X1))|?[X2]:(sorti2(X2)&?[X3]:(sorti2(X3)&(op2(X2,X3)=X1&(~(op2(X2,X1)=X3)|X1=unit2))))),inference(fof_nnf,[status(thm)],[6])).
% fof(46, plain,![X4]:(~(sorti2(X4))|?[X5]:(sorti2(X5)&?[X6]:(sorti2(X6)&(op2(X5,X6)=X4&(~(op2(X5,X4)=X6)|X4=unit2))))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X4]:(~(sorti2(X4))|(sorti2(esk4_1(X4))&(sorti2(esk5_1(X4))&(op2(esk4_1(X4),esk5_1(X4))=X4&(~(op2(esk4_1(X4),X4)=esk5_1(X4))|X4=unit2))))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X4]:((sorti2(esk4_1(X4))|~(sorti2(X4)))&((sorti2(esk5_1(X4))|~(sorti2(X4)))&((op2(esk4_1(X4),esk5_1(X4))=X4|~(sorti2(X4)))&((~(op2(esk4_1(X4),X4)=esk5_1(X4))|X4=unit2)|~(sorti2(X4)))))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(X1=unit2|~sorti2(X1)|op2(esk4_1(X1),X1)!=esk5_1(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(op2(esk4_1(X1),esk5_1(X1))=X1|~sorti2(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(sorti2(esk5_1(X1))|~sorti2(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,plain,(sorti2(esk4_1(X1))|~sorti2(X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(53,plain,(sorti1(unit1)),inference(split_conjunct,[status(thm)],[7])).
% cnf(54,plain,(sorti2(unit2)),inference(split_conjunct,[status(thm)],[8])).
% fof(55, negated_conjecture,((![X1]:(~(sorti1(X1))|sorti2(h(X1)))&![X2]:(~(sorti2(X2))|sorti1(j(X2))))&(((![X3]:(~(sorti1(X3))|![X4]:(~(sorti1(X4))|h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(~(sorti2(X5))|![X6]:(~(sorti2(X6))|j(op2(X5,X6))=op1(j(X5),j(X6)))))&![X7]:(~(sorti2(X7))|h(j(X7))=X7))&![X8]:(~(sorti1(X8))|j(h(X8))=X8))),inference(fof_nnf,[status(thm)],[10])).
% fof(56, negated_conjecture,((![X9]:(~(sorti1(X9))|sorti2(h(X9)))&![X10]:(~(sorti2(X10))|sorti1(j(X10))))&(((![X11]:(~(sorti1(X11))|![X12]:(~(sorti1(X12))|h(op1(X11,X12))=op2(h(X11),h(X12))))&![X13]:(~(sorti2(X13))|![X14]:(~(sorti2(X14))|j(op2(X13,X14))=op1(j(X13),j(X14)))))&![X15]:(~(sorti2(X15))|h(j(X15))=X15))&![X16]:(~(sorti1(X16))|j(h(X16))=X16))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:(((~(sorti1(X16))|j(h(X16))=X16)&((~(sorti2(X15))|h(j(X15))=X15)&(((~(sorti2(X14))|j(op2(X13,X14))=op1(j(X13),j(X14)))|~(sorti2(X13)))&((~(sorti1(X12))|h(op1(X11,X12))=op2(h(X11),h(X12)))|~(sorti1(X11))))))&((~(sorti2(X10))|sorti1(j(X10)))&(~(sorti1(X9))|sorti2(h(X9))))),inference(shift_quantors,[status(thm)],[56])).
% cnf(58,negated_conjecture,(sorti2(h(X1))|~sorti1(X1)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(sorti1(j(X1))|~sorti2(X1)),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(h(op1(X1,X2))=op2(h(X1),h(X2))|~sorti1(X1)|~sorti1(X2)),inference(split_conjunct,[status(thm)],[57])).
% cnf(61,negated_conjecture,(j(op2(X1,X2))=op1(j(X1),j(X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[57])).
% cnf(62,negated_conjecture,(h(j(X1))=X1|~sorti2(X1)),inference(split_conjunct,[status(thm)],[57])).
% cnf(63,negated_conjecture,(j(h(X1))=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[57])).
% cnf(82,negated_conjecture,(op1(j(X1),X2)=j(op2(X1,h(X2)))|~sorti2(h(X2))|~sorti2(X1)|~sorti1(X2)),inference(spm,[status(thm)],[61,63,theory(equality)])).
% cnf(84,negated_conjecture,(sorti2(h(op1(X1,X2)))|~sorti2(h(X2))|~sorti2(h(X1))|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[18,60,theory(equality)])).
% cnf(86,negated_conjecture,(op2(X1,h(X2))=h(op1(j(X1),X2))|~sorti1(X2)|~sorti1(j(X1))|~sorti2(X1)),inference(spm,[status(thm)],[60,62,theory(equality)])).
% cnf(87,negated_conjecture,(op1(j(X1),esk3_0)=j(X2)|j(op2(X1,X2))!=esk3_0|~sorti1(j(X2))|~sorti1(j(X1))|~sorti2(X2)|~sorti2(X1)),inference(spm,[status(thm)],[44,61,theory(equality)])).
% cnf(88,plain,(op1(unit1,esk3_0)=X1|X1!=esk3_0|~sorti1(X1)|~sorti1(unit1)),inference(spm,[status(thm)],[44,27,theory(equality)])).
% cnf(90,plain,(op1(unit1,esk3_0)=X1|X1!=esk3_0|~sorti1(X1)|$false),inference(rw,[status(thm)],[88,53,theory(equality)])).
% cnf(91,plain,(op1(unit1,esk3_0)=X1|X1!=esk3_0|~sorti1(X1)),inference(cn,[status(thm)],[90,theory(equality)])).
% cnf(115,plain,(op1(unit1,esk3_0)=esk3_0|~sorti1(esk3_0)),inference(er,[status(thm)],[91,theory(equality)])).
% cnf(116,plain,(op1(unit1,esk3_0)=esk3_0|$false),inference(rw,[status(thm)],[115,42,theory(equality)])).
% cnf(117,plain,(op1(unit1,esk3_0)=esk3_0),inference(cn,[status(thm)],[116,theory(equality)])).
% cnf(131,negated_conjecture,(j(op2(X1,h(X2)))=op1(j(X1),X2)|~sorti2(X1)|~sorti1(X2)),inference(csr,[status(thm)],[82,58])).
% cnf(139,negated_conjecture,(j(h(X1))=op1(j(unit2),X1)|~sorti2(unit2)|~sorti1(X1)|~sorti2(h(X1))),inference(spm,[status(thm)],[131,36,theory(equality)])).
% cnf(140,negated_conjecture,(j(h(X1))=op1(j(unit2),X1)|$false|~sorti1(X1)|~sorti2(h(X1))),inference(rw,[status(thm)],[139,54,theory(equality)])).
% cnf(141,negated_conjecture,(j(h(X1))=op1(j(unit2),X1)|~sorti1(X1)|~sorti2(h(X1))),inference(cn,[status(thm)],[140,theory(equality)])).
% cnf(142,negated_conjecture,(j(h(X1))=op1(j(unit2),X1)|~sorti1(X1)),inference(csr,[status(thm)],[141,58])).
% cnf(147,negated_conjecture,(op1(j(unit2),X1)=X1|~sorti1(X1)),inference(spm,[status(thm)],[63,142,theory(equality)])).
% cnf(149,negated_conjecture,(unit1=j(unit2)|~sorti1(j(unit2))|~sorti1(unit1)),inference(spm,[status(thm)],[26,147,theory(equality)])).
% cnf(153,negated_conjecture,(unit1=j(unit2)|~sorti1(j(unit2))|$false),inference(rw,[status(thm)],[149,53,theory(equality)])).
% cnf(154,negated_conjecture,(unit1=j(unit2)|~sorti1(j(unit2))),inference(cn,[status(thm)],[153,theory(equality)])).
% cnf(157,negated_conjecture,(j(unit2)=unit1|~sorti2(unit2)),inference(spm,[status(thm)],[154,59,theory(equality)])).
% cnf(158,negated_conjecture,(j(unit2)=unit1|$false),inference(rw,[status(thm)],[157,54,theory(equality)])).
% cnf(159,negated_conjecture,(j(unit2)=unit1),inference(cn,[status(thm)],[158,theory(equality)])).
% cnf(161,negated_conjecture,(h(unit1)=unit2|~sorti2(unit2)),inference(spm,[status(thm)],[62,159,theory(equality)])).
% cnf(168,negated_conjecture,(j(h(X1))=op1(unit1,X1)|~sorti1(X1)),inference(rw,[status(thm)],[142,159,theory(equality)])).
% cnf(172,negated_conjecture,(h(unit1)=unit2|$false),inference(rw,[status(thm)],[161,54,theory(equality)])).
% cnf(173,negated_conjecture,(h(unit1)=unit2),inference(cn,[status(thm)],[172,theory(equality)])).
% cnf(180,negated_conjecture,(op2(unit2,h(X1))=h(op1(unit1,X1))|~sorti1(X1)|~sorti1(unit1)),inference(spm,[status(thm)],[60,173,theory(equality)])).
% cnf(189,negated_conjecture,(op2(unit2,h(X1))=h(op1(unit1,X1))|~sorti1(X1)|$false),inference(rw,[status(thm)],[180,53,theory(equality)])).
% cnf(190,negated_conjecture,(op2(unit2,h(X1))=h(op1(unit1,X1))|~sorti1(X1)),inference(cn,[status(thm)],[189,theory(equality)])).
% cnf(207,negated_conjecture,(sorti2(h(op1(X1,X2)))|~sorti2(h(X2))|~sorti1(X2)|~sorti1(X1)),inference(csr,[status(thm)],[84,58])).
% cnf(208,negated_conjecture,(sorti2(h(op1(X1,X2)))|~sorti1(X2)|~sorti1(X1)),inference(csr,[status(thm)],[207,58])).
% cnf(211,negated_conjecture,(sorti2(h(esk3_0))|~sorti1(esk3_0)|~sorti1(unit1)),inference(spm,[status(thm)],[208,117,theory(equality)])).
% cnf(217,negated_conjecture,(sorti2(h(esk3_0))|$false|~sorti1(unit1)),inference(rw,[status(thm)],[211,42,theory(equality)])).
% cnf(218,negated_conjecture,(sorti2(h(esk3_0))|$false|$false),inference(rw,[status(thm)],[217,53,theory(equality)])).
% cnf(219,negated_conjecture,(sorti2(h(esk3_0))),inference(cn,[status(thm)],[218,theory(equality)])).
% cnf(231,negated_conjecture,(j(unit2)=op1(unit1,unit1)|~sorti1(unit1)),inference(spm,[status(thm)],[168,173,theory(equality)])).
% cnf(232,negated_conjecture,(unit1=op1(unit1,unit1)|~sorti1(unit1)),inference(rw,[status(thm)],[231,159,theory(equality)])).
% cnf(233,negated_conjecture,(unit1=op1(unit1,unit1)|$false),inference(rw,[status(thm)],[232,53,theory(equality)])).
% cnf(234,negated_conjecture,(unit1=op1(unit1,unit1)),inference(cn,[status(thm)],[233,theory(equality)])).
% cnf(387,negated_conjecture,(j(h(op1(unit1,X1)))=op1(j(unit2),X1)|~sorti2(unit2)|~sorti1(X1)),inference(spm,[status(thm)],[131,190,theory(equality)])).
% cnf(396,negated_conjecture,(j(h(op1(unit1,X1)))=op1(unit1,X1)|~sorti2(unit2)|~sorti1(X1)),inference(rw,[status(thm)],[387,159,theory(equality)])).
% cnf(397,negated_conjecture,(j(h(op1(unit1,X1)))=op1(unit1,X1)|$false|~sorti1(X1)),inference(rw,[status(thm)],[396,54,theory(equality)])).
% cnf(398,negated_conjecture,(j(h(op1(unit1,X1)))=op1(unit1,X1)|~sorti1(X1)),inference(cn,[status(thm)],[397,theory(equality)])).
% cnf(687,negated_conjecture,(j(h(esk3_0))=esk3_0|~sorti1(esk3_0)),inference(spm,[status(thm)],[398,117,theory(equality)])).
% cnf(700,negated_conjecture,(j(h(esk3_0))=esk3_0|$false),inference(rw,[status(thm)],[687,42,theory(equality)])).
% cnf(701,negated_conjecture,(j(h(esk3_0))=esk3_0),inference(cn,[status(thm)],[700,theory(equality)])).
% cnf(778,negated_conjecture,(h(op1(j(X1),X2))=op2(X1,h(X2))|~sorti2(X1)|~sorti1(X2)),inference(csr,[status(thm)],[86,59])).
% cnf(1042,negated_conjecture,(op1(j(X1),esk3_0)=j(X2)|j(op2(X1,X2))!=esk3_0|~sorti2(X2)|~sorti2(X1)|~sorti1(j(X2))),inference(csr,[status(thm)],[87,59])).
% cnf(1043,negated_conjecture,(op1(j(X1),esk3_0)=j(X2)|j(op2(X1,X2))!=esk3_0|~sorti2(X2)|~sorti2(X1)),inference(csr,[status(thm)],[1042,59])).
% cnf(1044,negated_conjecture,(op1(j(esk4_1(X1)),esk3_0)=j(esk5_1(X1))|j(X1)!=esk3_0|~sorti2(esk5_1(X1))|~sorti2(esk4_1(X1))|~sorti2(X1)),inference(spm,[status(thm)],[1043,50,theory(equality)])).
% cnf(69536,negated_conjecture,(op1(j(esk4_1(X1)),esk3_0)=j(esk5_1(X1))|j(X1)!=esk3_0|~sorti2(esk5_1(X1))|~sorti2(X1)),inference(csr,[status(thm)],[1044,52])).
% cnf(69537,negated_conjecture,(op1(j(esk4_1(X1)),esk3_0)=j(esk5_1(X1))|j(X1)!=esk3_0|~sorti2(X1)),inference(csr,[status(thm)],[69536,51])).
% cnf(69538,negated_conjecture,(op1(j(esk4_1(h(esk3_0))),esk3_0)=j(esk5_1(h(esk3_0)))|~sorti2(h(esk3_0))),inference(spm,[status(thm)],[69537,701,theory(equality)])).
% cnf(69623,negated_conjecture,(op1(j(esk4_1(h(esk3_0))),esk3_0)=j(esk5_1(h(esk3_0)))|$false),inference(rw,[status(thm)],[69538,219,theory(equality)])).
% cnf(69624,negated_conjecture,(op1(j(esk4_1(h(esk3_0))),esk3_0)=j(esk5_1(h(esk3_0)))),inference(cn,[status(thm)],[69623,theory(equality)])).
% cnf(69651,negated_conjecture,(h(j(esk5_1(h(esk3_0))))=op2(esk4_1(h(esk3_0)),h(esk3_0))|~sorti2(esk4_1(h(esk3_0)))|~sorti1(esk3_0)),inference(spm,[status(thm)],[778,69624,theory(equality)])).
% cnf(69685,negated_conjecture,(h(j(esk5_1(h(esk3_0))))=op2(esk4_1(h(esk3_0)),h(esk3_0))|~sorti2(esk4_1(h(esk3_0)))|$false),inference(rw,[status(thm)],[69651,42,theory(equality)])).
% cnf(69686,negated_conjecture,(h(j(esk5_1(h(esk3_0))))=op2(esk4_1(h(esk3_0)),h(esk3_0))|~sorti2(esk4_1(h(esk3_0)))),inference(cn,[status(thm)],[69685,theory(equality)])).
% cnf(88656,negated_conjecture,(h(j(esk5_1(h(esk3_0))))=op2(esk4_1(h(esk3_0)),h(esk3_0))|~sorti2(h(esk3_0))),inference(spm,[status(thm)],[69686,52,theory(equality)])).
% cnf(88657,negated_conjecture,(h(j(esk5_1(h(esk3_0))))=op2(esk4_1(h(esk3_0)),h(esk3_0))|$false),inference(rw,[status(thm)],[88656,219,theory(equality)])).
% cnf(88658,negated_conjecture,(h(j(esk5_1(h(esk3_0))))=op2(esk4_1(h(esk3_0)),h(esk3_0))),inference(cn,[status(thm)],[88657,theory(equality)])).
% cnf(88768,negated_conjecture,(op2(esk4_1(h(esk3_0)),h(esk3_0))=esk5_1(h(esk3_0))|~sorti2(esk5_1(h(esk3_0)))),inference(spm,[status(thm)],[62,88658,theory(equality)])).
% cnf(119241,negated_conjecture,(op2(esk4_1(h(esk3_0)),h(esk3_0))=esk5_1(h(esk3_0))|~sorti2(h(esk3_0))),inference(spm,[status(thm)],[88768,51,theory(equality)])).
% cnf(119242,negated_conjecture,(op2(esk4_1(h(esk3_0)),h(esk3_0))=esk5_1(h(esk3_0))|$false),inference(rw,[status(thm)],[119241,219,theory(equality)])).
% cnf(119243,negated_conjecture,(op2(esk4_1(h(esk3_0)),h(esk3_0))=esk5_1(h(esk3_0))),inference(cn,[status(thm)],[119242,theory(equality)])).
% cnf(119276,negated_conjecture,(unit2=h(esk3_0)|~sorti2(h(esk3_0))),inference(spm,[status(thm)],[49,119243,theory(equality)])).
% cnf(119359,negated_conjecture,(unit2=h(esk3_0)|$false),inference(rw,[status(thm)],[119276,219,theory(equality)])).
% cnf(119360,negated_conjecture,(unit2=h(esk3_0)),inference(cn,[status(thm)],[119359,theory(equality)])).
% cnf(119582,negated_conjecture,(unit1=esk3_0),inference(rw,[status(thm)],[inference(rw,[status(thm)],[701,119360,theory(equality)]),159,theory(equality)])).
% cnf(120383,plain,(op1(X1,X2)!=unit1|esk3_0!=unit1|~sorti1(X2)|~sorti1(X1)),inference(rw,[status(thm)],[43,119582,theory(equality)])).
% cnf(120384,plain,(op1(X1,X2)!=unit1|$false|~sorti1(X2)|~sorti1(X1)),inference(rw,[status(thm)],[120383,119582,theory(equality)])).
% cnf(120385,plain,(op1(X1,X2)!=unit1|~sorti1(X2)|~sorti1(X1)),inference(cn,[status(thm)],[120384,theory(equality)])).
% cnf(120411,negated_conjecture,(~sorti1(unit1)),inference(spm,[status(thm)],[120385,234,theory(equality)])).
% cnf(120532,negated_conjecture,($false),inference(rw,[status(thm)],[120411,53,theory(equality)])).
% cnf(120533,negated_conjecture,($false),inference(cn,[status(thm)],[120532,theory(equality)])).
% cnf(120534,negated_conjecture,($false),120533,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6946
% # ...of these trivial : 369
% # ...subsumed : 5737
% # ...remaining for further processing: 840
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 365
% # Generated clauses : 73472
% # ...of the previous two non-trivial : 67776
% # Contextual simplify-reflections : 2573
% # Paramodulations : 73467
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 475
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 466
% # Current number of unprocessed clauses: 35848
% # ...number of literals in the above : 127421
% # Clause-clause subsumption calls (NU) : 88531
% # Rec. Clause-clause subsumption calls : 87286
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 629
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 184 leaves, 1.92+/-1.989 terms/leaf
% # Paramod-from index: 123 leaves, 2.02+/-2.293 terms/leaf
% # Paramod-into index: 173 leaves, 1.91+/-1.989 terms/leaf
% # -------------------------------------------------
% # User time : 2.012 s
% # System time : 0.075 s
% # Total time : 2.087 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.50 CPU 3.61 WC
% FINAL PrfWatch: 3.50 CPU 3.61 WC
% SZS output end Solution for /tmp/SystemOnTPTP5158/ALG072+1.tptp
%
%------------------------------------------------------------------------------