TSTP Solution File: PUZ133+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ133+2 : TPTP v5.0.0. Released v4.1.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 : Wed Dec 29 21:38:24 EST 2010
% Result : Theorem 5.01s
% Output : Solution 5.01s
% 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/SystemOnTPTP21363/PUZ133+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21363/PUZ133+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21363/PUZ133+2.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 21495
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.93 CPU 4.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:minus(X2,X1)=minus(perm(X1),perm(X2)),file('/tmp/SRASS.s.p', permutation_another_one)).
% fof(2, axiom,![X2]:((le(s(n0),X2)&le(X2,n))=>perm(X2)=minus(s(n),X2)),file('/tmp/SRASS.s.p', permutation)).
% fof(3, axiom,![X2]:((le(s(n0),X2)&le(X2,n))=>(le(s(n0),perm(X2))&le(perm(X2),n))),file('/tmp/SRASS.s.p', permutation_range)).
% fof(4, axiom,![X3]:![X4]:![X5]:((le(X3,X4)&le(X4,X5))=>le(X3,X5)),file('/tmp/SRASS.s.p', le_trans)).
% fof(5, axiom,![X3]:le(X3,s(X3)),file('/tmp/SRASS.s.p', succ_le)).
% fof(6, axiom,![X2]:![X1]:![X6]:![X7]:(minus(X2,X1)=minus(X6,X7)<=>minus(X2,X6)=minus(X1,X7)),file('/tmp/SRASS.s.p', minus1)).
% fof(7, axiom,(![X2]:![X1]:(((((le(s(n0),X2)&le(X2,n))&le(s(X2),X1))&le(X1,n))&(le(s(X2),X1)<=>le(s(perm(X1)),perm(X2))))=>((~(q(X2)=q(X1))&~(plus(q(X2),X2)=plus(q(X1),X1)))&~(minus(q(X2),X2)=minus(q(X1),X1))))=>queens_q),file('/tmp/SRASS.s.p', queens_q)).
% fof(8, axiom,(queens_p=>![X2]:![X1]:((((le(s(n0),X2)&le(X2,n))&le(s(X2),X1))&le(X1,n))=>((~(p(X2)=p(X1))&~(plus(p(X2),X2)=plus(p(X1),X1)))&~(minus(p(X2),X2)=minus(p(X1),X1))))),file('/tmp/SRASS.s.p', queens_p)).
% fof(9, axiom,![X2]:![X1]:![X6]:![X7]:(plus(X2,X1)=plus(X6,X7)<=>minus(X2,X6)=minus(X7,X1)),file('/tmp/SRASS.s.p', plus1)).
% fof(10, conjecture,((queens_p&![X2]:q(X2)=p(perm(X2)))=>queens_q),file('/tmp/SRASS.s.p', queens_sym)).
% fof(11, negated_conjecture,~(((queens_p&![X2]:q(X2)=p(perm(X2)))=>queens_q)),inference(assume_negation,[status(cth)],[10])).
% fof(12, plain,![X3]:![X4]:minus(X4,X3)=minus(perm(X3),perm(X4)),inference(variable_rename,[status(thm)],[1])).
% cnf(13,plain,(minus(X1,X2)=minus(perm(X2),perm(X1))),inference(split_conjunct,[status(thm)],[12])).
% fof(14, plain,![X2]:((~(le(s(n0),X2))|~(le(X2,n)))|perm(X2)=minus(s(n),X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(15, plain,![X3]:((~(le(s(n0),X3))|~(le(X3,n)))|perm(X3)=minus(s(n),X3)),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(perm(X1)=minus(s(n),X1)|~le(X1,n)|~le(s(n0),X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X2]:((~(le(s(n0),X2))|~(le(X2,n)))|(le(s(n0),perm(X2))&le(perm(X2),n))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X3]:((~(le(s(n0),X3))|~(le(X3,n)))|(le(s(n0),perm(X3))&le(perm(X3),n))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:((le(s(n0),perm(X3))|(~(le(s(n0),X3))|~(le(X3,n))))&(le(perm(X3),n)|(~(le(s(n0),X3))|~(le(X3,n))))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(le(perm(X1),n)|~le(X1,n)|~le(s(n0),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(le(s(n0),perm(X1))|~le(X1,n)|~le(s(n0),X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(22, plain,![X3]:![X4]:![X5]:((~(le(X3,X4))|~(le(X4,X5)))|le(X3,X5)),inference(fof_nnf,[status(thm)],[4])).
% fof(23, plain,![X6]:![X7]:![X8]:((~(le(X6,X7))|~(le(X7,X8)))|le(X6,X8)),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(le(X1,X2)|~le(X3,X2)|~le(X1,X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:le(X4,s(X4)),inference(variable_rename,[status(thm)],[5])).
% cnf(26,plain,(le(X1,s(X1))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:![X1]:![X6]:![X7]:((~(minus(X2,X1)=minus(X6,X7))|minus(X2,X6)=minus(X1,X7))&(~(minus(X2,X6)=minus(X1,X7))|minus(X2,X1)=minus(X6,X7))),inference(fof_nnf,[status(thm)],[6])).
% fof(28, plain,![X8]:![X9]:![X10]:![X11]:((~(minus(X8,X9)=minus(X10,X11))|minus(X8,X10)=minus(X9,X11))&(~(minus(X8,X10)=minus(X9,X11))|minus(X8,X9)=minus(X10,X11))),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(minus(X1,X2)=minus(X3,X4)|minus(X1,X3)!=minus(X2,X4)),inference(split_conjunct,[status(thm)],[28])).
% fof(31, plain,(?[X2]:?[X1]:(((((le(s(n0),X2)&le(X2,n))&le(s(X2),X1))&le(X1,n))&((~(le(s(X2),X1))|le(s(perm(X1)),perm(X2)))&(~(le(s(perm(X1)),perm(X2)))|le(s(X2),X1))))&((q(X2)=q(X1)|plus(q(X2),X2)=plus(q(X1),X1))|minus(q(X2),X2)=minus(q(X1),X1)))|queens_q),inference(fof_nnf,[status(thm)],[7])).
% fof(32, plain,(?[X3]:?[X4]:(((((le(s(n0),X3)&le(X3,n))&le(s(X3),X4))&le(X4,n))&((~(le(s(X3),X4))|le(s(perm(X4)),perm(X3)))&(~(le(s(perm(X4)),perm(X3)))|le(s(X3),X4))))&((q(X3)=q(X4)|plus(q(X3),X3)=plus(q(X4),X4))|minus(q(X3),X3)=minus(q(X4),X4)))|queens_q),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,((((((le(s(n0),esk1_0)&le(esk1_0,n))&le(s(esk1_0),esk2_0))&le(esk2_0,n))&((~(le(s(esk1_0),esk2_0))|le(s(perm(esk2_0)),perm(esk1_0)))&(~(le(s(perm(esk2_0)),perm(esk1_0)))|le(s(esk1_0),esk2_0))))&((q(esk1_0)=q(esk2_0)|plus(q(esk1_0),esk1_0)=plus(q(esk2_0),esk2_0))|minus(q(esk1_0),esk1_0)=minus(q(esk2_0),esk2_0)))|queens_q),inference(skolemize,[status(esa)],[32])).
% fof(34, plain,((((((le(s(n0),esk1_0)|queens_q)&(le(esk1_0,n)|queens_q))&(le(s(esk1_0),esk2_0)|queens_q))&(le(esk2_0,n)|queens_q))&(((~(le(s(esk1_0),esk2_0))|le(s(perm(esk2_0)),perm(esk1_0)))|queens_q)&((~(le(s(perm(esk2_0)),perm(esk1_0)))|le(s(esk1_0),esk2_0))|queens_q)))&(((q(esk1_0)=q(esk2_0)|plus(q(esk1_0),esk1_0)=plus(q(esk2_0),esk2_0))|minus(q(esk1_0),esk1_0)=minus(q(esk2_0),esk2_0))|queens_q)),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(queens_q|minus(q(esk1_0),esk1_0)=minus(q(esk2_0),esk2_0)|plus(q(esk1_0),esk1_0)=plus(q(esk2_0),esk2_0)|q(esk1_0)=q(esk2_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,plain,(queens_q|le(s(perm(esk2_0)),perm(esk1_0))|~le(s(esk1_0),esk2_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(38,plain,(queens_q|le(esk2_0,n)),inference(split_conjunct,[status(thm)],[34])).
% cnf(39,plain,(queens_q|le(s(esk1_0),esk2_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(40,plain,(queens_q|le(esk1_0,n)),inference(split_conjunct,[status(thm)],[34])).
% cnf(41,plain,(queens_q|le(s(n0),esk1_0)),inference(split_conjunct,[status(thm)],[34])).
% fof(42, plain,(~(queens_p)|![X2]:![X1]:((((~(le(s(n0),X2))|~(le(X2,n)))|~(le(s(X2),X1)))|~(le(X1,n)))|((~(p(X2)=p(X1))&~(plus(p(X2),X2)=plus(p(X1),X1)))&~(minus(p(X2),X2)=minus(p(X1),X1))))),inference(fof_nnf,[status(thm)],[8])).
% fof(43, plain,(~(queens_p)|![X3]:![X4]:((((~(le(s(n0),X3))|~(le(X3,n)))|~(le(s(X3),X4)))|~(le(X4,n)))|((~(p(X3)=p(X4))&~(plus(p(X3),X3)=plus(p(X4),X4)))&~(minus(p(X3),X3)=minus(p(X4),X4))))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X3]:![X4]:(((((~(le(s(n0),X3))|~(le(X3,n)))|~(le(s(X3),X4)))|~(le(X4,n)))|((~(p(X3)=p(X4))&~(plus(p(X3),X3)=plus(p(X4),X4)))&~(minus(p(X3),X3)=minus(p(X4),X4))))|~(queens_p)),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X3]:![X4]:((((~(p(X3)=p(X4))|(((~(le(s(n0),X3))|~(le(X3,n)))|~(le(s(X3),X4)))|~(le(X4,n))))|~(queens_p))&((~(plus(p(X3),X3)=plus(p(X4),X4))|(((~(le(s(n0),X3))|~(le(X3,n)))|~(le(s(X3),X4)))|~(le(X4,n))))|~(queens_p)))&((~(minus(p(X3),X3)=minus(p(X4),X4))|(((~(le(s(n0),X3))|~(le(X3,n)))|~(le(s(X3),X4)))|~(le(X4,n))))|~(queens_p))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(~queens_p|~le(X1,n)|~le(s(X2),X1)|~le(X2,n)|~le(s(n0),X2)|minus(p(X2),X2)!=minus(p(X1),X1)),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(~queens_p|~le(X1,n)|~le(s(X2),X1)|~le(X2,n)|~le(s(n0),X2)|plus(p(X2),X2)!=plus(p(X1),X1)),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,plain,(~queens_p|~le(X1,n)|~le(s(X2),X1)|~le(X2,n)|~le(s(n0),X2)|p(X2)!=p(X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X2]:![X1]:![X6]:![X7]:((~(plus(X2,X1)=plus(X6,X7))|minus(X2,X6)=minus(X7,X1))&(~(minus(X2,X6)=minus(X7,X1))|plus(X2,X1)=plus(X6,X7))),inference(fof_nnf,[status(thm)],[9])).
% fof(50, plain,![X8]:![X9]:![X10]:![X11]:((~(plus(X8,X9)=plus(X10,X11))|minus(X8,X10)=minus(X11,X9))&(~(minus(X8,X10)=minus(X11,X9))|plus(X8,X9)=plus(X10,X11))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(plus(X1,X2)=plus(X3,X4)|minus(X1,X3)!=minus(X4,X2)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(minus(X1,X2)=minus(X3,X4)|plus(X1,X4)!=plus(X2,X3)),inference(split_conjunct,[status(thm)],[50])).
% fof(53, negated_conjecture,((queens_p&![X2]:q(X2)=p(perm(X2)))&~(queens_q)),inference(fof_nnf,[status(thm)],[11])).
% fof(54, negated_conjecture,((queens_p&![X3]:q(X3)=p(perm(X3)))&~(queens_q)),inference(variable_rename,[status(thm)],[53])).
% fof(55, negated_conjecture,![X3]:((q(X3)=p(perm(X3))&queens_p)&~(queens_q)),inference(shift_quantors,[status(thm)],[54])).
% cnf(56,negated_conjecture,(~queens_q),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,(queens_p),inference(split_conjunct,[status(thm)],[55])).
% cnf(58,negated_conjecture,(q(X1)=p(perm(X1))),inference(split_conjunct,[status(thm)],[55])).
% cnf(59,plain,(p(perm(esk2_0))=p(perm(esk1_0))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|plus(p(perm(esk2_0)),esk2_0)=plus(p(perm(esk1_0)),esk1_0)|queens_q),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[35,58,theory(equality)]),58,theory(equality)]),58,theory(equality)]),58,theory(equality)]),58,theory(equality)]),58,theory(equality)]),['unfolding']).
% cnf(60,plain,(le(esk1_0,n)),inference(sr,[status(thm)],[40,56,theory(equality)])).
% cnf(61,plain,(le(esk2_0,n)),inference(sr,[status(thm)],[38,56,theory(equality)])).
% cnf(62,plain,(le(s(n0),esk1_0)),inference(sr,[status(thm)],[41,56,theory(equality)])).
% cnf(63,plain,(le(s(esk1_0),esk2_0)),inference(sr,[status(thm)],[39,56,theory(equality)])).
% cnf(64,plain,(queens_q|le(s(perm(esk2_0)),perm(esk1_0))|$false),inference(rw,[status(thm)],[37,63,theory(equality)])).
% cnf(65,plain,(queens_q|le(s(perm(esk2_0)),perm(esk1_0))),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(66,plain,(le(s(perm(esk2_0)),perm(esk1_0))),inference(sr,[status(thm)],[65,56,theory(equality)])).
% cnf(70,plain,(p(X1)!=p(X2)|$false|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(rw,[status(thm)],[48,57,theory(equality)])).
% cnf(71,plain,(p(X1)!=p(X2)|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(cn,[status(thm)],[70,theory(equality)])).
% cnf(72,plain,(minus(p(X1),X1)!=minus(p(X2),X2)|$false|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(rw,[status(thm)],[46,57,theory(equality)])).
% cnf(73,plain,(minus(p(X1),X1)!=minus(p(X2),X2)|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(cn,[status(thm)],[72,theory(equality)])).
% cnf(74,plain,(plus(p(X1),X1)!=plus(p(X2),X2)|$false|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(rw,[status(thm)],[47,57,theory(equality)])).
% cnf(75,plain,(plus(p(X1),X1)!=plus(p(X2),X2)|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(cn,[status(thm)],[74,theory(equality)])).
% cnf(76,plain,(p(perm(esk2_0))=p(perm(esk1_0))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|plus(p(perm(esk2_0)),esk2_0)=plus(p(perm(esk1_0)),esk1_0)),inference(sr,[status(thm)],[59,56,theory(equality)])).
% cnf(79,plain,(le(X1,esk2_0)|~le(X1,s(esk1_0))),inference(spm,[status(thm)],[24,63,theory(equality)])).
% cnf(83,plain,(le(perm(esk2_0),n)|~le(s(n0),esk2_0)),inference(spm,[status(thm)],[20,61,theory(equality)])).
% cnf(84,plain,(le(perm(esk1_0),n)|~le(s(n0),esk1_0)),inference(spm,[status(thm)],[20,60,theory(equality)])).
% cnf(85,plain,(le(perm(esk1_0),n)|$false),inference(rw,[status(thm)],[84,62,theory(equality)])).
% cnf(86,plain,(le(perm(esk1_0),n)),inference(cn,[status(thm)],[85,theory(equality)])).
% cnf(88,plain,(minus(s(n),esk1_0)=perm(esk1_0)|~le(s(n0),esk1_0)),inference(spm,[status(thm)],[16,60,theory(equality)])).
% cnf(89,plain,(minus(s(n),esk1_0)=perm(esk1_0)|$false),inference(rw,[status(thm)],[88,62,theory(equality)])).
% cnf(90,plain,(minus(s(n),esk1_0)=perm(esk1_0)),inference(cn,[status(thm)],[89,theory(equality)])).
% cnf(91,plain,(le(s(n0),perm(esk2_0))|~le(s(n0),esk2_0)),inference(spm,[status(thm)],[21,61,theory(equality)])).
% cnf(92,plain,(le(s(n0),perm(esk1_0))|~le(s(n0),esk1_0)),inference(spm,[status(thm)],[21,60,theory(equality)])).
% cnf(93,plain,(le(s(n0),perm(esk1_0))|$false),inference(rw,[status(thm)],[92,62,theory(equality)])).
% cnf(94,plain,(le(s(n0),perm(esk1_0))),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(96,plain,(minus(X1,perm(X2))=minus(X3,perm(X4))|minus(X1,X3)!=minus(X4,X2)),inference(spm,[status(thm)],[29,13,theory(equality)])).
% cnf(97,plain,(minus(perm(X1),X2)=minus(perm(X3),X4)|minus(X3,X1)!=minus(X2,X4)),inference(spm,[status(thm)],[29,13,theory(equality)])).
% cnf(99,plain,(plus(X1,X2)=plus(X2,X1)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(100,plain,(plus(X1,perm(X2))=plus(X3,perm(X4))|minus(X1,X3)!=minus(X2,X4)),inference(spm,[status(thm)],[51,13,theory(equality)])).
% cnf(108,plain,(le(perm(perm(esk1_0)),n)|~le(s(n0),perm(esk1_0))),inference(spm,[status(thm)],[20,86,theory(equality)])).
% cnf(110,plain,(le(s(n0),perm(perm(esk1_0)))|~le(s(n0),perm(esk1_0))),inference(spm,[status(thm)],[21,86,theory(equality)])).
% cnf(144,plain,(plus(X1,p(X1))!=plus(p(X2),X2)|~le(s(n0),X2)|~le(s(X2),X1)|~le(X2,n)|~le(X1,n)),inference(rw,[status(thm)],[75,99,theory(equality)])).
% cnf(145,plain,(plus(X1,p(X1))!=plus(X2,p(X2))|~le(s(n0),X2)|~le(s(X2),X1)|~le(X2,n)|~le(X1,n)),inference(rw,[status(thm)],[144,99,theory(equality)])).
% cnf(146,plain,(minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|plus(esk2_0,p(perm(esk2_0)))=plus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))),inference(rw,[status(thm)],[76,99,theory(equality)])).
% cnf(147,plain,(minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|plus(esk2_0,p(perm(esk2_0)))=plus(esk1_0,p(perm(esk1_0)))|p(perm(esk2_0))=p(perm(esk1_0))),inference(rw,[status(thm)],[146,99,theory(equality)])).
% cnf(149,plain,(minus(esk2_0,X1)=minus(X2,p(perm(esk2_0)))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))|plus(esk1_0,p(perm(esk1_0)))!=plus(X1,X2)),inference(spm,[status(thm)],[52,147,theory(equality)])).
% cnf(151,plain,(le(esk1_0,esk2_0)),inference(spm,[status(thm)],[79,26,theory(equality)])).
% cnf(152,plain,(le(X1,esk2_0)|~le(X1,esk1_0)),inference(spm,[status(thm)],[24,151,theory(equality)])).
% cnf(155,plain,(le(s(n0),esk2_0)),inference(spm,[status(thm)],[152,62,theory(equality)])).
% cnf(188,plain,(le(perm(esk2_0),n)|$false),inference(rw,[status(thm)],[83,155,theory(equality)])).
% cnf(189,plain,(le(perm(esk2_0),n)),inference(cn,[status(thm)],[188,theory(equality)])).
% cnf(237,plain,(le(s(n0),perm(esk2_0))|$false),inference(rw,[status(thm)],[91,155,theory(equality)])).
% cnf(238,plain,(le(s(n0),perm(esk2_0))),inference(cn,[status(thm)],[237,theory(equality)])).
% cnf(257,plain,(minus(X1,perm(X2))=minus(X2,perm(X1))),inference(er,[status(thm)],[96,theory(equality)])).
% cnf(286,plain,(minus(perm(X1),X2)=minus(perm(X2),X1)),inference(er,[status(thm)],[97,theory(equality)])).
% cnf(319,plain,(plus(X1,perm(perm(X2)))=plus(X3,perm(perm(X4)))|minus(X1,X3)!=minus(X4,X2)),inference(spm,[status(thm)],[100,13,theory(equality)])).
% cnf(347,plain,(minus(X1,perm(p(perm(X1))))!=minus(p(X2),X2)|~le(s(n0),X2)|~le(s(X2),perm(X1))|~le(X2,n)|~le(perm(X1),n)),inference(spm,[status(thm)],[73,257,theory(equality)])).
% cnf(349,plain,(minus(X2,perm(perm(X1)))=minus(X2,X1)),inference(spm,[status(thm)],[13,257,theory(equality)])).
% cnf(393,plain,(minus(perm(perm(X2)),X1)=minus(X2,X1)),inference(spm,[status(thm)],[13,286,theory(equality)])).
% cnf(501,plain,(le(perm(perm(esk1_0)),n)|$false),inference(rw,[status(thm)],[108,94,theory(equality)])).
% cnf(502,plain,(le(perm(perm(esk1_0)),n)),inference(cn,[status(thm)],[501,theory(equality)])).
% cnf(506,plain,(minus(s(n),perm(perm(esk1_0)))=perm(perm(perm(esk1_0)))|~le(s(n0),perm(perm(esk1_0)))),inference(spm,[status(thm)],[16,502,theory(equality)])).
% cnf(566,plain,(le(s(n0),perm(perm(esk1_0)))|$false),inference(rw,[status(thm)],[110,94,theory(equality)])).
% cnf(567,plain,(le(s(n0),perm(perm(esk1_0)))),inference(cn,[status(thm)],[566,theory(equality)])).
% cnf(794,plain,(plus(X1,X2)=plus(perm(perm(X3)),X4)|minus(X1,X3)!=minus(X4,X2)),inference(spm,[status(thm)],[51,349,theory(equality)])).
% cnf(1441,plain,(minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|minus(esk2_0,esk1_0)=minus(p(perm(esk1_0)),p(perm(esk2_0)))|p(perm(esk2_0))=p(perm(esk1_0))),inference(er,[status(thm)],[149,theory(equality)])).
% cnf(3049,plain,(plus(X1,perm(perm(X2)))=plus(X2,perm(perm(X1)))),inference(er,[status(thm)],[319,theory(equality)])).
% cnf(3100,plain,(plus(X2,perm(perm(X1)))=plus(perm(perm(X2)),X1)),inference(spm,[status(thm)],[99,3049,theory(equality)])).
% cnf(3553,plain,(minus(X1,perm(p(perm(X1))))!=minus(p(perm(esk2_0)),perm(esk2_0))|~le(s(perm(esk2_0)),perm(X1))|~le(s(n0),perm(esk2_0))|~le(perm(X1),n)),inference(spm,[status(thm)],[347,189,theory(equality)])).
% cnf(3568,plain,(minus(X1,perm(p(perm(X1))))!=minus(p(perm(esk2_0)),perm(esk2_0))|~le(s(perm(esk2_0)),perm(X1))|$false|~le(perm(X1),n)),inference(rw,[status(thm)],[3553,238,theory(equality)])).
% cnf(3569,plain,(minus(X1,perm(p(perm(X1))))!=minus(p(perm(esk2_0)),perm(esk2_0))|~le(s(perm(esk2_0)),perm(X1))|~le(perm(X1),n)),inference(cn,[status(thm)],[3568,theory(equality)])).
% cnf(6356,plain,(perm(esk1_0)=perm(perm(perm(esk1_0)))|~le(s(n0),perm(perm(esk1_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[506,349,theory(equality)]),90,theory(equality)])).
% cnf(6357,plain,(perm(esk1_0)=perm(perm(perm(esk1_0)))|$false),inference(rw,[status(thm)],[6356,567,theory(equality)])).
% cnf(6358,plain,(perm(esk1_0)=perm(perm(perm(esk1_0)))),inference(cn,[status(thm)],[6357,theory(equality)])).
% cnf(9164,plain,(plus(X1,X2)=plus(X3,perm(perm(X4)))|minus(X1,X3)!=minus(X4,X2)),inference(rw,[status(thm)],[794,3100,theory(equality)])).
% cnf(9165,plain,(plus(X1,X2)=plus(X2,perm(perm(X1)))),inference(er,[status(thm)],[9164,theory(equality)])).
% cnf(9241,plain,(plus(perm(perm(X1)),X2)=plus(X2,X1)),inference(rw,[status(thm)],[3100,9165,theory(equality)])).
% cnf(9296,plain,(plus(p(perm(perm(X1))),X1)!=plus(X2,p(X2))|~le(s(n0),X2)|~le(s(X2),perm(perm(X1)))|~le(X2,n)|~le(perm(perm(X1)),n)),inference(spm,[status(thm)],[145,9241,theory(equality)])).
% cnf(12041,plain,(minus(p(perm(esk1_0)),perm(X1))=minus(p(perm(esk2_0)),perm(X2))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))|minus(esk2_0,esk1_0)!=minus(X2,X1)),inference(spm,[status(thm)],[96,1441,theory(equality)])).
% cnf(18315,plain,(minus(X1,perm(p(perm(X1))))!=minus(esk2_0,perm(p(perm(esk2_0))))|~le(s(perm(esk2_0)),perm(X1))|~le(perm(X1),n)),inference(rw,[status(thm)],[3569,257,theory(equality)])).
% cnf(18316,plain,(minus(perm(perm(esk1_0)),perm(p(perm(esk1_0))))!=minus(esk2_0,perm(p(perm(esk2_0))))|~le(s(perm(esk2_0)),perm(esk1_0))|~le(perm(esk1_0),n)),inference(spm,[status(thm)],[18315,6358,theory(equality)])).
% cnf(18328,plain,(minus(esk1_0,perm(p(perm(esk1_0))))!=minus(esk2_0,perm(p(perm(esk2_0))))|~le(s(perm(esk2_0)),perm(esk1_0))|~le(perm(esk1_0),n)),inference(rw,[status(thm)],[18316,393,theory(equality)])).
% cnf(18329,plain,(minus(esk1_0,perm(p(perm(esk1_0))))!=minus(esk2_0,perm(p(perm(esk2_0))))|$false|~le(perm(esk1_0),n)),inference(rw,[status(thm)],[18328,66,theory(equality)])).
% cnf(18330,plain,(minus(esk1_0,perm(p(perm(esk1_0))))!=minus(esk2_0,perm(p(perm(esk2_0))))|$false|$false),inference(rw,[status(thm)],[18329,86,theory(equality)])).
% cnf(18331,plain,(minus(esk1_0,perm(p(perm(esk1_0))))!=minus(esk2_0,perm(p(perm(esk2_0))))),inference(cn,[status(thm)],[18330,theory(equality)])).
% cnf(35135,plain,(plus(X1,p(perm(perm(X1))))!=plus(X2,p(X2))|~le(s(n0),X2)|~le(s(X2),perm(perm(X1)))|~le(X2,n)|~le(perm(perm(X1)),n)),inference(rw,[status(thm)],[9296,99,theory(equality)])).
% cnf(35142,plain,(plus(X1,p(perm(perm(X1))))!=plus(perm(esk2_0),p(perm(esk2_0)))|~le(s(perm(esk2_0)),perm(perm(X1)))|~le(perm(perm(X1)),n)|~le(s(n0),perm(esk2_0))),inference(spm,[status(thm)],[35135,189,theory(equality)])).
% cnf(35158,plain,(plus(X1,p(perm(perm(X1))))!=plus(perm(esk2_0),p(perm(esk2_0)))|~le(s(perm(esk2_0)),perm(perm(X1)))|~le(perm(perm(X1)),n)|$false),inference(rw,[status(thm)],[35142,238,theory(equality)])).
% cnf(35159,plain,(plus(X1,p(perm(perm(X1))))!=plus(perm(esk2_0),p(perm(esk2_0)))|~le(s(perm(esk2_0)),perm(perm(X1)))|~le(perm(perm(X1)),n)),inference(cn,[status(thm)],[35158,theory(equality)])).
% cnf(39622,plain,(minus(p(perm(esk1_0)),perm(esk1_0))=minus(p(perm(esk2_0)),perm(esk2_0))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))),inference(er,[status(thm)],[12041,theory(equality)])).
% cnf(39644,plain,(minus(esk1_0,perm(p(perm(esk1_0))))=minus(p(perm(esk2_0)),perm(esk2_0))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))),inference(rw,[status(thm)],[39622,257,theory(equality)])).
% cnf(39645,plain,(minus(esk1_0,perm(p(perm(esk1_0))))=minus(esk2_0,perm(p(perm(esk2_0))))|minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))),inference(rw,[status(thm)],[39644,257,theory(equality)])).
% cnf(39646,plain,(minus(p(perm(esk2_0)),esk2_0)=minus(p(perm(esk1_0)),esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))),inference(sr,[status(thm)],[39645,18331,theory(equality)])).
% cnf(39760,plain,(minus(p(perm(esk2_0)),X1)=minus(esk2_0,X2)|p(perm(esk2_0))=p(perm(esk1_0))|minus(p(perm(esk1_0)),esk1_0)!=minus(X1,X2)),inference(spm,[status(thm)],[29,39646,theory(equality)])).
% cnf(44844,plain,(minus(p(perm(esk2_0)),p(perm(esk1_0)))=minus(esk2_0,esk1_0)|p(perm(esk2_0))=p(perm(esk1_0))),inference(er,[status(thm)],[39760,theory(equality)])).
% cnf(44962,plain,(plus(p(perm(esk2_0)),perm(X1))=plus(p(perm(esk1_0)),perm(X2))|p(perm(esk2_0))=p(perm(esk1_0))|minus(esk2_0,esk1_0)!=minus(X1,X2)),inference(spm,[status(thm)],[100,44844,theory(equality)])).
% cnf(59051,plain,(plus(perm(esk1_0),p(perm(esk1_0)))!=plus(perm(esk2_0),p(perm(esk2_0)))|~le(s(perm(esk2_0)),perm(esk1_0))|~le(perm(esk1_0),n)),inference(spm,[status(thm)],[35159,6358,theory(equality)])).
% cnf(59068,plain,(plus(perm(esk1_0),p(perm(esk1_0)))!=plus(perm(esk2_0),p(perm(esk2_0)))|$false|~le(perm(esk1_0),n)),inference(rw,[status(thm)],[59051,66,theory(equality)])).
% cnf(59069,plain,(plus(perm(esk1_0),p(perm(esk1_0)))!=plus(perm(esk2_0),p(perm(esk2_0)))|$false|$false),inference(rw,[status(thm)],[59068,86,theory(equality)])).
% cnf(59070,plain,(plus(perm(esk1_0),p(perm(esk1_0)))!=plus(perm(esk2_0),p(perm(esk2_0)))),inference(cn,[status(thm)],[59069,theory(equality)])).
% cnf(68518,plain,(plus(p(perm(esk2_0)),perm(esk2_0))=plus(p(perm(esk1_0)),perm(esk1_0))|p(perm(esk2_0))=p(perm(esk1_0))),inference(er,[status(thm)],[44962,theory(equality)])).
% cnf(68542,plain,(plus(perm(esk2_0),p(perm(esk2_0)))=plus(p(perm(esk1_0)),perm(esk1_0))|p(perm(esk2_0))=p(perm(esk1_0))),inference(rw,[status(thm)],[68518,99,theory(equality)])).
% cnf(68543,plain,(plus(perm(esk2_0),p(perm(esk2_0)))=plus(perm(esk1_0),p(perm(esk1_0)))|p(perm(esk2_0))=p(perm(esk1_0))),inference(rw,[status(thm)],[68542,99,theory(equality)])).
% cnf(68544,plain,(p(perm(esk2_0))=p(perm(esk1_0))),inference(sr,[status(thm)],[68543,59070,theory(equality)])).
% cnf(68604,plain,(p(X1)!=p(perm(esk1_0))|~le(s(n0),perm(esk2_0))|~le(s(perm(esk2_0)),X1)|~le(perm(esk2_0),n)|~le(X1,n)),inference(spm,[status(thm)],[71,68544,theory(equality)])).
% cnf(69828,plain,(p(X1)!=p(perm(esk1_0))|$false|~le(s(perm(esk2_0)),X1)|~le(perm(esk2_0),n)|~le(X1,n)),inference(rw,[status(thm)],[68604,238,theory(equality)])).
% cnf(69829,plain,(p(X1)!=p(perm(esk1_0))|$false|~le(s(perm(esk2_0)),X1)|$false|~le(X1,n)),inference(rw,[status(thm)],[69828,189,theory(equality)])).
% cnf(69830,plain,(p(X1)!=p(perm(esk1_0))|~le(s(perm(esk2_0)),X1)|~le(X1,n)),inference(cn,[status(thm)],[69829,theory(equality)])).
% cnf(69841,plain,(~le(s(perm(esk2_0)),perm(esk1_0))|~le(perm(esk1_0),n)),inference(er,[status(thm)],[69830,theory(equality)])).
% cnf(69843,plain,($false|~le(perm(esk1_0),n)),inference(rw,[status(thm)],[69841,66,theory(equality)])).
% cnf(69844,plain,($false|$false),inference(rw,[status(thm)],[69843,86,theory(equality)])).
% cnf(69845,plain,($false),inference(cn,[status(thm)],[69844,theory(equality)])).
% cnf(69846,plain,($false),69845,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23890
% # ...of these trivial : 6542
% # ...subsumed : 13309
% # ...remaining for further processing: 4039
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 191
% # Backward-rewritten : 693
% # Generated clauses : 43454
% # ...of the previous two non-trivial : 38618
% # Contextual simplify-reflections : 0
% # Paramodulations : 43251
% # Factorizations : 0
% # Equation resolutions : 203
% # Current number of processed clauses: 3135
% # Positive orientable unit clauses: 1082
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 16
% # Non-unit-clauses : 2032
% # Current number of unprocessed clauses: 11888
% # ...number of literals in the above : 12569
% # Clause-clause subsumption calls (NU) : 1060774
% # Rec. Clause-clause subsumption calls : 1040455
% # Unit Clause-clause subsumption calls : 155
% # Rewrite failures with RHS unbound : 52
% # Indexed BW rewrite attempts : 104233
% # Indexed BW rewrite successes : 45
% # Backwards rewriting index: 322 leaves, 6.84+/-31.723 terms/leaf
% # Paramod-from index: 78 leaves, 14.00+/-45.520 terms/leaf
% # Paramod-into index: 189 leaves, 8.48+/-36.381 terms/leaf
% # -------------------------------------------------
% # User time : 3.255 s
% # System time : 0.055 s
% # Total time : 3.309 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.98 CPU 4.09 WC
% FINAL PrfWatch: 3.98 CPU 4.09 WC
% SZS output end Solution for /tmp/SystemOnTPTP21363/PUZ133+2.tptp
%
%------------------------------------------------------------------------------