TSTP Solution File: PUZ133+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ133+1 : 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:04 EST 2010
% Result : Theorem 14.12s
% Output : Solution 14.12s
% 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/SystemOnTPTP21014/PUZ133+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21014/PUZ133+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21014/PUZ133+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 21146
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.91 CPU 10.04 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.90 CPU 12.05 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))=>(le(s(n0),perm(X2))&le(perm(X2),n))),file('/tmp/SRASS.s.p', permutation_range)).
% fof(3, axiom,![X3]:![X4]:![X5]:((le(X3,X4)&le(X4,X5))=>le(X3,X5)),file('/tmp/SRASS.s.p', le_trans)).
% fof(4, axiom,![X3]:le(X3,s(X3)),file('/tmp/SRASS.s.p', succ_le)).
% fof(5, axiom,![X2]:![X1]:![X6]:![X7]:(minus(X2,X1)=minus(X6,X7)<=>minus(X2,X6)=minus(X1,X7)),file('/tmp/SRASS.s.p', minus1)).
% fof(6, 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(7, 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(8, axiom,![X2]:perm(X2)=minus(s(n),X2),file('/tmp/SRASS.s.p', permutation)).
% 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)))|(le(s(n0),perm(X2))&le(perm(X2),n))),inference(fof_nnf,[status(thm)],[2])).
% fof(15, plain,![X3]:((~(le(s(n0),X3))|~(le(X3,n)))|(le(s(n0),perm(X3))&le(perm(X3),n))),inference(variable_rename,[status(thm)],[14])).
% fof(16, 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)],[15])).
% cnf(17,plain,(le(perm(X1),n)|~le(X1,n)|~le(s(n0),X1)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(le(s(n0),perm(X1))|~le(X1,n)|~le(s(n0),X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(19, plain,![X3]:![X4]:![X5]:((~(le(X3,X4))|~(le(X4,X5)))|le(X3,X5)),inference(fof_nnf,[status(thm)],[3])).
% fof(20, plain,![X6]:![X7]:![X8]:((~(le(X6,X7))|~(le(X7,X8)))|le(X6,X8)),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(le(X1,X2)|~le(X3,X2)|~le(X1,X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:le(X4,s(X4)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(le(X1,s(X1))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, 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)],[5])).
% fof(25, 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)],[24])).
% cnf(26,plain,(minus(X1,X2)=minus(X3,X4)|minus(X1,X3)!=minus(X2,X4)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, 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)],[6])).
% fof(29, 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)],[28])).
% fof(30, 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)],[29])).
% fof(31, 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)],[30])).
% cnf(32,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)],[31])).
% cnf(34,plain,(queens_q|le(s(perm(esk2_0)),perm(esk1_0))|~le(s(esk1_0),esk2_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(35,plain,(queens_q|le(esk2_0,n)),inference(split_conjunct,[status(thm)],[31])).
% cnf(36,plain,(queens_q|le(s(esk1_0),esk2_0)),inference(split_conjunct,[status(thm)],[31])).
% cnf(37,plain,(queens_q|le(esk1_0,n)),inference(split_conjunct,[status(thm)],[31])).
% cnf(38,plain,(queens_q|le(s(n0),esk1_0)),inference(split_conjunct,[status(thm)],[31])).
% fof(39, 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)],[7])).
% fof(40, 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)],[39])).
% fof(41, 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)],[40])).
% fof(42, 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)],[41])).
% cnf(43,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)],[42])).
% cnf(44,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)],[42])).
% cnf(45,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)],[42])).
% fof(46, plain,![X3]:perm(X3)=minus(s(n),X3),inference(variable_rename,[status(thm)],[8])).
% cnf(47,plain,(perm(X1)=minus(s(n),X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, 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(49, 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)],[48])).
% cnf(50,plain,(plus(X1,X2)=plus(X3,X4)|minus(X1,X3)!=minus(X4,X2)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(minus(X1,X2)=minus(X3,X4)|plus(X1,X4)!=plus(X2,X3)),inference(split_conjunct,[status(thm)],[49])).
% fof(52, negated_conjecture,((queens_p&![X2]:q(X2)=p(perm(X2)))&~(queens_q)),inference(fof_nnf,[status(thm)],[11])).
% fof(53, negated_conjecture,((queens_p&![X3]:q(X3)=p(perm(X3)))&~(queens_q)),inference(variable_rename,[status(thm)],[52])).
% fof(54, negated_conjecture,![X3]:((q(X3)=p(perm(X3))&queens_p)&~(queens_q)),inference(shift_quantors,[status(thm)],[53])).
% cnf(55,negated_conjecture,(~queens_q),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,negated_conjecture,(queens_p),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,negated_conjecture,(q(X1)=p(perm(X1))),inference(split_conjunct,[status(thm)],[54])).
% cnf(58,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)],[32,57,theory(equality)]),57,theory(equality)]),57,theory(equality)]),57,theory(equality)]),57,theory(equality)]),57,theory(equality)]),['unfolding']).
% cnf(59,plain,(minus(minus(s(n),X2),minus(s(n),X1))=minus(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13,47,theory(equality)]),47,theory(equality)]),['unfolding']).
% cnf(60,plain,(p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|plus(p(minus(s(n),esk2_0)),esk2_0)=plus(p(minus(s(n),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)],[58,47,theory(equality)]),47,theory(equality)]),47,theory(equality)]),47,theory(equality)]),47,theory(equality)]),47,theory(equality)]),['unfolding']).
% cnf(62,plain,(queens_q|le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))|~le(s(esk1_0),esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[34,47,theory(equality)]),47,theory(equality)]),['unfolding']).
% cnf(63,plain,(le(minus(s(n),X1),n)|~le(X1,n)|~le(s(n0),X1)),inference(rw,[status(thm)],[17,47,theory(equality)]),['unfolding']).
% cnf(64,plain,(le(s(n0),minus(s(n),X1))|~le(X1,n)|~le(s(n0),X1)),inference(rw,[status(thm)],[18,47,theory(equality)]),['unfolding']).
% cnf(65,plain,(le(esk1_0,n)),inference(sr,[status(thm)],[37,55,theory(equality)])).
% cnf(66,plain,(le(esk2_0,n)),inference(sr,[status(thm)],[35,55,theory(equality)])).
% cnf(67,plain,(le(s(n0),esk1_0)),inference(sr,[status(thm)],[38,55,theory(equality)])).
% cnf(68,plain,(le(s(esk1_0),esk2_0)),inference(sr,[status(thm)],[36,55,theory(equality)])).
% cnf(69,plain,(queens_q|le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))|$false),inference(rw,[status(thm)],[62,68,theory(equality)])).
% cnf(70,plain,(queens_q|le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))),inference(cn,[status(thm)],[69,theory(equality)])).
% cnf(71,plain,(le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))),inference(sr,[status(thm)],[70,55,theory(equality)])).
% cnf(75,plain,(p(X1)!=p(X2)|$false|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(rw,[status(thm)],[45,56,theory(equality)])).
% cnf(76,plain,(p(X1)!=p(X2)|~le(X2,n)|~le(X1,n)|~le(s(X2),X1)|~le(s(n0),X2)),inference(cn,[status(thm)],[75,theory(equality)])).
% cnf(77,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)],[43,56,theory(equality)])).
% cnf(78,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)],[77,theory(equality)])).
% cnf(79,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)],[44,56,theory(equality)])).
% cnf(80,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)],[79,theory(equality)])).
% cnf(81,plain,(p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|plus(p(minus(s(n),esk2_0)),esk2_0)=plus(p(minus(s(n),esk1_0)),esk1_0)),inference(sr,[status(thm)],[60,55,theory(equality)])).
% cnf(84,plain,(le(X1,esk2_0)|~le(X1,s(esk1_0))),inference(spm,[status(thm)],[21,68,theory(equality)])).
% cnf(87,plain,(minus(X1,X1)=minus(X2,X2)),inference(er,[status(thm)],[26,theory(equality)])).
% cnf(89,plain,(le(minus(s(n),esk2_0),n)|~le(s(n0),esk2_0)),inference(spm,[status(thm)],[63,66,theory(equality)])).
% cnf(90,plain,(le(minus(s(n),esk1_0),n)|~le(s(n0),esk1_0)),inference(spm,[status(thm)],[63,65,theory(equality)])).
% cnf(91,plain,(le(minus(s(n),esk1_0),n)|$false),inference(rw,[status(thm)],[90,67,theory(equality)])).
% cnf(92,plain,(le(minus(s(n),esk1_0),n)),inference(cn,[status(thm)],[91,theory(equality)])).
% cnf(93,plain,(plus(X1,X2)=plus(X2,X1)),inference(er,[status(thm)],[50,theory(equality)])).
% cnf(97,plain,(minus(X1,minus(s(n),X2))=minus(X3,minus(s(n),X4))|minus(X1,X3)!=minus(X4,X2)),inference(spm,[status(thm)],[26,59,theory(equality)])).
% cnf(98,plain,(plus(X1,minus(s(n),X2))=plus(X3,minus(s(n),X4))|minus(X1,X3)!=minus(X2,X4)),inference(spm,[status(thm)],[50,59,theory(equality)])).
% cnf(99,plain,(le(s(n0),minus(s(n),esk2_0))|~le(s(n0),esk2_0)),inference(spm,[status(thm)],[64,66,theory(equality)])).
% cnf(108,plain,(minus(minus(s(n),X1),minus(X2,X2))=minus(s(n),X1)),inference(spm,[status(thm)],[59,87,theory(equality)])).
% cnf(114,plain,(plus(X1,X2)=plus(X3,X2)|minus(X1,X3)!=minus(X4,X4)),inference(spm,[status(thm)],[50,87,theory(equality)])).
% cnf(130,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)],[80,93,theory(equality)])).
% cnf(131,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)],[130,93,theory(equality)])).
% cnf(132,plain,(minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|plus(esk2_0,p(minus(s(n),esk2_0)))=plus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(rw,[status(thm)],[81,93,theory(equality)])).
% cnf(133,plain,(minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|plus(esk2_0,p(minus(s(n),esk2_0)))=plus(esk1_0,p(minus(s(n),esk1_0)))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(rw,[status(thm)],[132,93,theory(equality)])).
% cnf(135,plain,(minus(esk2_0,X1)=minus(X2,p(minus(s(n),esk2_0)))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|plus(esk1_0,p(minus(s(n),esk1_0)))!=plus(X1,X2)),inference(spm,[status(thm)],[51,133,theory(equality)])).
% cnf(149,plain,(le(esk1_0,esk2_0)),inference(spm,[status(thm)],[84,23,theory(equality)])).
% cnf(151,plain,(le(X1,esk2_0)|~le(X1,esk1_0)),inference(spm,[status(thm)],[21,149,theory(equality)])).
% cnf(159,plain,(le(s(n0),esk2_0)),inference(spm,[status(thm)],[151,67,theory(equality)])).
% cnf(200,plain,(le(minus(s(n),esk2_0),n)|$false),inference(rw,[status(thm)],[89,159,theory(equality)])).
% cnf(201,plain,(le(minus(s(n),esk2_0),n)),inference(cn,[status(thm)],[200,theory(equality)])).
% cnf(277,plain,(minus(X1,minus(s(n),X2))=minus(X2,minus(s(n),X1))),inference(er,[status(thm)],[97,theory(equality)])).
% cnf(329,plain,(le(s(n0),minus(s(n),esk2_0))|$false),inference(rw,[status(thm)],[99,159,theory(equality)])).
% cnf(330,plain,(le(s(n0),minus(s(n),esk2_0))),inference(cn,[status(thm)],[329,theory(equality)])).
% cnf(404,plain,(minus(X1,minus(s(n),X2))=minus(X3,minus(X4,X4))|minus(X1,X3)!=minus(s(n),X2)),inference(spm,[status(thm)],[26,108,theory(equality)])).
% cnf(409,plain,(minus(X1,minus(s(n),minus(X2,X2)))=minus(X3,minus(s(n),minus(s(n),X4)))|minus(X1,X3)!=minus(s(n),X4)),inference(spm,[status(thm)],[97,108,theory(equality)])).
% cnf(868,plain,(minus(X1,minus(s(n),p(minus(s(n),X1))))!=minus(p(X2),X2)|~le(s(n0),X2)|~le(s(X2),minus(s(n),X1))|~le(X2,n)|~le(minus(s(n),X1),n)),inference(spm,[status(thm)],[78,277,theory(equality)])).
% cnf(1395,plain,(minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(esk2_0,esk1_0)=minus(p(minus(s(n),esk1_0)),p(minus(s(n),esk2_0)))),inference(er,[status(thm)],[135,theory(equality)])).
% cnf(3936,plain,(minus(s(n),minus(s(n),X1))=minus(X1,minus(X2,X2))),inference(er,[status(thm)],[404,theory(equality)])).
% cnf(4176,plain,(minus(X1,minus(X2,minus(X3,X3)))=minus(minus(s(n),X2),minus(s(n),X1))),inference(spm,[status(thm)],[277,3936,theory(equality)])).
% cnf(4275,plain,(minus(X1,minus(X2,minus(X3,X3)))=minus(X1,X2)),inference(rw,[status(thm)],[4176,59,theory(equality)])).
% cnf(4959,plain,(minus(X1,s(n))=minus(X3,minus(s(n),minus(s(n),X4)))|minus(X1,X3)!=minus(s(n),X4)),inference(rw,[status(thm)],[409,4275,theory(equality)])).
% cnf(4960,plain,(minus(s(n),s(n))=minus(X1,minus(s(n),minus(s(n),X1)))),inference(er,[status(thm)],[4959,theory(equality)])).
% cnf(5111,plain,(plus(X1,X2)=plus(minus(s(n),minus(s(n),X1)),X2)|minus(s(n),s(n))!=minus(X3,X3)),inference(spm,[status(thm)],[114,4960,theory(equality)])).
% cnf(5178,plain,(plus(minus(s(n),minus(s(n),X1)),X2)=plus(X1,X2)),inference(sr,[status(thm)],[5111,87,theory(equality)])).
% cnf(5427,plain,(plus(X1,p(minus(s(n),minus(s(n),X1))))!=plus(X2,p(X2))|~le(s(n0),X2)|~le(s(X2),minus(s(n),minus(s(n),X1)))|~le(X2,n)|~le(minus(s(n),minus(s(n),X1)),n)),inference(spm,[status(thm)],[131,5178,theory(equality)])).
% cnf(10810,plain,(minus(X1,minus(s(n),p(minus(s(n),X1))))!=minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))|~le(s(minus(s(n),esk2_0)),minus(s(n),X1))|~le(minus(s(n),X1),n)|~le(s(n0),minus(s(n),esk2_0))),inference(spm,[status(thm)],[868,201,theory(equality)])).
% cnf(10830,plain,(minus(X1,minus(s(n),p(minus(s(n),X1))))!=minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))|~le(s(minus(s(n),esk2_0)),minus(s(n),X1))|~le(minus(s(n),X1),n)|$false),inference(rw,[status(thm)],[10810,330,theory(equality)])).
% cnf(10831,plain,(minus(X1,minus(s(n),p(minus(s(n),X1))))!=minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))|~le(s(minus(s(n),esk2_0)),minus(s(n),X1))|~le(minus(s(n),X1),n)),inference(cn,[status(thm)],[10830,theory(equality)])).
% cnf(14402,plain,(minus(p(minus(s(n),esk1_0)),minus(s(n),X1))=minus(p(minus(s(n),esk2_0)),minus(s(n),X2))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(esk2_0,esk1_0)!=minus(X2,X1)),inference(spm,[status(thm)],[97,1395,theory(equality)])).
% cnf(39576,plain,(plus(X1,p(minus(s(n),minus(s(n),X1))))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),minus(s(n),X1)))|~le(minus(s(n),minus(s(n),X1)),n)|~le(s(n0),minus(s(n),esk2_0))),inference(spm,[status(thm)],[5427,201,theory(equality)])).
% cnf(39598,plain,(plus(X1,p(minus(s(n),minus(s(n),X1))))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),minus(s(n),X1)))|~le(minus(s(n),minus(s(n),X1)),n)|$false),inference(rw,[status(thm)],[39576,330,theory(equality)])).
% cnf(39599,plain,(plus(X1,p(minus(s(n),minus(s(n),X1))))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),minus(s(n),X1)))|~le(minus(s(n),minus(s(n),X1)),n)),inference(cn,[status(thm)],[39598,theory(equality)])).
% cnf(54511,plain,(minus(X1,minus(s(n),p(minus(s(n),X1))))!=minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))|~le(s(minus(s(n),esk2_0)),minus(s(n),X1))|~le(minus(s(n),X1),n)),inference(rw,[status(thm)],[10831,277,theory(equality)])).
% cnf(54521,plain,(minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0))))!=minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))|~le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))),inference(spm,[status(thm)],[54511,92,theory(equality)])).
% cnf(54532,plain,(minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0))))!=minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))|$false),inference(rw,[status(thm)],[54521,71,theory(equality)])).
% cnf(54533,plain,(minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0))))!=minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))),inference(cn,[status(thm)],[54532,theory(equality)])).
% cnf(69367,plain,(minus(p(minus(s(n),esk1_0)),minus(s(n),esk1_0))=minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(er,[status(thm)],[14402,theory(equality)])).
% cnf(69390,plain,(minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0))))=minus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(rw,[status(thm)],[69367,277,theory(equality)])).
% cnf(69391,plain,(minus(esk1_0,minus(s(n),p(minus(s(n),esk1_0))))=minus(esk2_0,minus(s(n),p(minus(s(n),esk2_0))))|minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(rw,[status(thm)],[69390,277,theory(equality)])).
% cnf(69392,plain,(minus(p(minus(s(n),esk2_0)),esk2_0)=minus(p(minus(s(n),esk1_0)),esk1_0)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(sr,[status(thm)],[69391,54533,theory(equality)])).
% cnf(69416,plain,(minus(p(minus(s(n),esk2_0)),X1)=minus(esk2_0,X2)|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(p(minus(s(n),esk1_0)),esk1_0)!=minus(X1,X2)),inference(spm,[status(thm)],[26,69392,theory(equality)])).
% cnf(100580,plain,(p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(p(minus(s(n),esk2_0)),p(minus(s(n),esk1_0)))=minus(esk2_0,esk1_0)),inference(er,[status(thm)],[69416,theory(equality)])).
% cnf(100611,plain,(plus(p(minus(s(n),esk2_0)),minus(s(n),X1))=plus(p(minus(s(n),esk1_0)),minus(s(n),X2))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))|minus(esk2_0,esk1_0)!=minus(X1,X2)),inference(spm,[status(thm)],[98,100580,theory(equality)])).
% cnf(119845,plain,(plus(minus(s(n),X1),p(minus(s(n),minus(X1,minus(s(n),s(n))))))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),minus(X1,minus(s(n),s(n)))))|~le(minus(s(n),minus(X1,minus(s(n),s(n)))),n)),inference(spm,[status(thm)],[39599,277,theory(equality)])).
% cnf(119862,plain,(plus(minus(s(n),X1),p(minus(s(n),X1)))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),minus(X1,minus(s(n),s(n)))))|~le(minus(s(n),minus(X1,minus(s(n),s(n)))),n)),inference(rw,[status(thm)],[119845,4275,theory(equality)])).
% cnf(119863,plain,(plus(minus(s(n),X1),p(minus(s(n),X1)))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),X1))|~le(minus(s(n),minus(X1,minus(s(n),s(n)))),n)),inference(rw,[status(thm)],[119862,4275,theory(equality)])).
% cnf(119864,plain,(plus(minus(s(n),X1),p(minus(s(n),X1)))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),X1))|~le(minus(s(n),X1),n)),inference(rw,[status(thm)],[119863,4275,theory(equality)])).
% cnf(186573,plain,(plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|~le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))),inference(spm,[status(thm)],[119864,92,theory(equality)])).
% cnf(186582,plain,(plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|$false),inference(rw,[status(thm)],[186573,71,theory(equality)])).
% cnf(186583,plain,(plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))!=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))),inference(cn,[status(thm)],[186582,theory(equality)])).
% cnf(193580,plain,(plus(p(minus(s(n),esk2_0)),minus(s(n),esk2_0))=plus(p(minus(s(n),esk1_0)),minus(s(n),esk1_0))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(er,[status(thm)],[100611,theory(equality)])).
% cnf(193605,plain,(plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))=plus(p(minus(s(n),esk1_0)),minus(s(n),esk1_0))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(rw,[status(thm)],[193580,93,theory(equality)])).
% cnf(193632,plain,(plus(minus(s(n),esk1_0),p(minus(s(n),esk1_0)))=plus(minus(s(n),esk2_0),p(minus(s(n),esk2_0)))|p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(rw,[status(thm)],[193605,93,theory(equality)])).
% cnf(193633,plain,(p(minus(s(n),esk2_0))=p(minus(s(n),esk1_0))),inference(sr,[status(thm)],[193632,186583,theory(equality)])).
% cnf(193645,plain,(p(X1)!=p(minus(s(n),esk1_0))|~le(s(n0),minus(s(n),esk2_0))|~le(s(minus(s(n),esk2_0)),X1)|~le(minus(s(n),esk2_0),n)|~le(X1,n)),inference(spm,[status(thm)],[76,193633,theory(equality)])).
% cnf(194802,plain,(p(X1)!=p(minus(s(n),esk1_0))|$false|~le(s(minus(s(n),esk2_0)),X1)|~le(minus(s(n),esk2_0),n)|~le(X1,n)),inference(rw,[status(thm)],[193645,330,theory(equality)])).
% cnf(194803,plain,(p(X1)!=p(minus(s(n),esk1_0))|$false|~le(s(minus(s(n),esk2_0)),X1)|$false|~le(X1,n)),inference(rw,[status(thm)],[194802,201,theory(equality)])).
% cnf(194804,plain,(p(X1)!=p(minus(s(n),esk1_0))|~le(s(minus(s(n),esk2_0)),X1)|~le(X1,n)),inference(cn,[status(thm)],[194803,theory(equality)])).
% cnf(194854,plain,(~le(s(minus(s(n),esk2_0)),minus(s(n),esk1_0))|~le(minus(s(n),esk1_0),n)),inference(er,[status(thm)],[194804,theory(equality)])).
% cnf(194856,plain,($false|~le(minus(s(n),esk1_0),n)),inference(rw,[status(thm)],[194854,71,theory(equality)])).
% cnf(194857,plain,($false|$false),inference(rw,[status(thm)],[194856,92,theory(equality)])).
% cnf(194858,plain,($false),inference(cn,[status(thm)],[194857,theory(equality)])).
% cnf(194859,plain,($false),194858,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 66232
% # ...of these trivial : 18095
% # ...subsumed : 43214
% # ...remaining for further processing: 4923
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 280
% # Backward-rewritten : 586
% # Generated clauses : 117120
% # ...of the previous two non-trivial : 98773
% # Contextual simplify-reflections : 3
% # Paramodulations : 116296
% # Factorizations : 0
% # Equation resolutions : 824
% # Current number of processed clauses: 4038
% # Positive orientable unit clauses: 1824
% # Positive unorientable unit clauses: 11
% # Negative unit clauses : 23
% # Non-unit-clauses : 2180
% # Current number of unprocessed clauses: 22555
% # ...number of literals in the above : 28886
% # Clause-clause subsumption calls (NU) : 7501094
% # Rec. Clause-clause subsumption calls : 7365692
% # Unit Clause-clause subsumption calls : 315
% # Rewrite failures with RHS unbound : 473
% # Indexed BW rewrite attempts : 308379
% # Indexed BW rewrite successes : 74
% # Backwards rewriting index: 263 leaves, 13.12+/-63.515 terms/leaf
% # Paramod-from index: 96 leaves, 19.21+/-73.204 terms/leaf
% # Paramod-into index: 212 leaves, 12.83+/-61.075 terms/leaf
% # -------------------------------------------------
% # User time : 11.206 s
% # System time : 0.146 s
% # Total time : 11.352 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.06 CPU 13.22 WC
% FINAL PrfWatch: 13.06 CPU 13.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP21014/PUZ133+1.tptp
%
%------------------------------------------------------------------------------