TSTP Solution File: SYO666-1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYO666-1 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 17:24:53 EDT 2022

% Result   : Unsatisfiable 39.98s 5.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYO666-1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jul  9 12:53:37 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 39.98/5.39  % SZS status Unsatisfiable
% 39.98/5.39  % SZS output begin IncompleteProof
% 39.98/5.39  cnf(c0, axiom,
% 39.98/5.39  	~'LE'(f(z),'0')).
% 39.98/5.39  cnf(c1, plain,
% 39.98/5.39  	~'LE'(f(z),'0'),
% 39.98/5.39  	inference(start, [], [c0])).
% 39.98/5.39  
% 39.98/5.39  cnf(c2, axiom,
% 39.98/5.39  	'LE'(f(X0),'0') | 'E'('0',f(suc(X0))) | ~'LE'(f(suc(X0)),s('0'))).
% 39.98/5.39  cnf(a0, assumption,
% 39.98/5.39  	f(z) = f(X0)).
% 39.98/5.39  cnf(a1, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(c3, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 39.98/5.39  cnf(c4, plain,
% 39.98/5.39  	'E'('0',f(suc(X0))) | ~'LE'(f(suc(X0)),s('0')),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 39.98/5.39  
% 39.98/5.39  cnf(c5, axiom,
% 39.98/5.39  	~'E'('0',f(X1)) | ~'E'('0',f(X2)) | ~'E'('0',f(suc(X1))) | ~iLEQ(suc(X3),suc(X4)) | ~'E'('0',f(X4)) | ~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(suc(X4))) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6))).
% 39.98/5.39  cnf(a2, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a3, assumption,
% 39.98/5.39  	f(suc(X0)) = f(suc(X4))).
% 39.98/5.39  cnf(c6, plain,
% 39.98/5.39  	~'LE'(f(suc(X0)),s('0')),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 39.98/5.39  cnf(c7, plain,
% 39.98/5.39  	~'E'('0',f(X1)) | ~'E'('0',f(X2)) | ~'E'('0',f(suc(X1))) | ~iLEQ(suc(X3),suc(X4)) | ~'E'('0',f(X4)) | ~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 39.98/5.39  
% 39.98/5.39  cnf(c8, axiom,
% 39.98/5.39  	'LE'(f(X7),'0') | 'E'('0',f(X7)) | ~'LE'(f(X7),s('0'))).
% 39.98/5.39  cnf(a4, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a5, assumption,
% 39.98/5.39  	f(X1) = f(X7)).
% 39.98/5.39  cnf(c9, plain,
% 39.98/5.39  	~'E'('0',f(X2)) | ~'E'('0',f(suc(X1))) | ~iLEQ(suc(X3),suc(X4)) | ~'E'('0',f(X4)) | ~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 39.98/5.39  cnf(c10, plain,
% 39.98/5.39  	'LE'(f(X7),'0') | ~'LE'(f(X7),s('0')),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 39.98/5.39  
% 39.98/5.39  cnf(c11, plain,
% 39.98/5.39  	~'LE'(f(z),'0')).
% 39.98/5.39  cnf(a6, assumption,
% 39.98/5.39  	f(X7) = f(z)).
% 39.98/5.39  cnf(a7, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(c12, plain,
% 39.98/5.39  	~'LE'(f(X7),s('0')),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])).
% 39.98/5.39  
% 39.98/5.39  cnf(c13, axiom,
% 39.98/5.39  	'LE'(f(X8),s('0')) | 'E'(s('0'),f(X8)) | ~'LE'(f(X8),s(s('0')))).
% 39.98/5.39  cnf(a8, assumption,
% 39.98/5.39  	f(X7) = f(X8)).
% 39.98/5.39  cnf(a9, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(c14, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])).
% 39.98/5.39  cnf(c15, plain,
% 39.98/5.39  	'E'(s('0'),f(X8)) | ~'LE'(f(X8),s(s('0'))),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])).
% 39.98/5.39  
% 39.98/5.39  cnf(c16, axiom,
% 39.98/5.39  	~'E'(s('0'),f(suc(X9))) | ~'E'(s('0'),f(X10)) | ~'E'(s('0'),f(X11)) | ~iLEQ(suc(X12),suc(X13)) | ~'E'(s('0'),f(suc(X10))) | ~'E'(s('0'),f(X9)) | ~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13))).
% 39.98/5.39  cnf(a10, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a11, assumption,
% 39.98/5.39  	f(X8) = f(X9)).
% 39.98/5.39  cnf(c17, plain,
% 39.98/5.39  	~'LE'(f(X8),s(s('0'))),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])).
% 39.98/5.39  cnf(c18, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X9))) | ~'E'(s('0'),f(X10)) | ~'E'(s('0'),f(X11)) | ~iLEQ(suc(X12),suc(X13)) | ~'E'(s('0'),f(suc(X10))) | ~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])).
% 39.98/5.39  
% 39.98/5.39  cnf(c19, axiom,
% 39.98/5.39  	'LE'(f(X15),s('0')) | 'E'(s('0'),f(suc(X15))) | ~'LE'(f(suc(X15)),s(s('0')))).
% 39.98/5.39  cnf(a12, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a13, assumption,
% 39.98/5.39  	f(suc(X9)) = f(suc(X15))).
% 39.98/5.39  cnf(c20, plain,
% 39.98/5.39  	~'E'(s('0'),f(X10)) | ~'E'(s('0'),f(X11)) | ~iLEQ(suc(X12),suc(X13)) | ~'E'(s('0'),f(suc(X10))) | ~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 39.98/5.39  cnf(c21, plain,
% 39.98/5.39  	'LE'(f(X15),s('0')) | ~'LE'(f(suc(X15)),s(s('0'))),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 39.98/5.39  
% 39.98/5.39  cnf(c22, plain,
% 39.98/5.39  	~'LE'(f(X7),s('0'))).
% 39.98/5.39  cnf(a14, assumption,
% 39.98/5.39  	f(X15) = f(X7)).
% 39.98/5.39  cnf(a15, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(c23, plain,
% 39.98/5.39  	~'LE'(f(suc(X15)),s(s('0'))),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a14, a15])], [c21, c22])).
% 39.98/5.39  
% 39.98/5.39  cnf(c24, axiom,
% 39.98/5.39  	'LE'(f(X16),s(s('0')))).
% 39.98/5.39  cnf(a16, assumption,
% 39.98/5.39  	f(suc(X15)) = f(X16)).
% 39.98/5.39  cnf(a17, assumption,
% 39.98/5.39  	s(s('0')) = s(s('0'))).
% 39.98/5.39  cnf(c25, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 39.98/5.39  cnf(c26, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 39.98/5.39  
% 39.98/5.39  cnf(c27, plain,
% 39.98/5.39  	'E'(s('0'),f(X8))).
% 39.98/5.39  cnf(a18, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a19, assumption,
% 39.98/5.39  	f(X10) = f(X8)).
% 39.98/5.39  cnf(c28, plain,
% 39.98/5.39  	~'E'(s('0'),f(X11)) | ~iLEQ(suc(X12),suc(X13)) | ~'E'(s('0'),f(suc(X10))) | ~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a18, a19])], [c20, c27])).
% 39.98/5.39  
% 39.98/5.39  cnf(c29, plain,
% 39.98/5.39  	'E'(s('0'),f(X8))).
% 39.98/5.39  cnf(a20, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a21, assumption,
% 39.98/5.39  	f(X11) = f(X8)).
% 39.98/5.39  cnf(c30, plain,
% 39.98/5.39  	~iLEQ(suc(X12),suc(X13)) | ~'E'(s('0'),f(suc(X10))) | ~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a20, a21])], [c28, c29])).
% 39.98/5.39  
% 39.98/5.39  cnf(c31, axiom,
% 39.98/5.39  	iLEQ(suc(X17),suc(X17)) | ~'E'(s('0'),f(suc(X17))) | ~'E'(s('0'),f(X17))).
% 39.98/5.39  cnf(a22, assumption,
% 39.98/5.39  	suc(X12) = suc(X17)).
% 39.98/5.39  cnf(a23, assumption,
% 39.98/5.39  	suc(X13) = suc(X17)).
% 39.98/5.39  cnf(c32, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X10))) | ~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c30, c31])).
% 39.98/5.39  cnf(c33, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X17))) | ~'E'(s('0'),f(X17)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c30, c31])).
% 39.98/5.39  
% 39.98/5.39  cnf(c34, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X9)))).
% 39.98/5.39  cnf(a24, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a25, assumption,
% 39.98/5.39  	f(suc(X17)) = f(suc(X9))).
% 39.98/5.39  cnf(c35, plain,
% 39.98/5.39  	~'E'(s('0'),f(X17)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a24, a25])], [c33, c34])).
% 39.98/5.39  
% 39.98/5.39  cnf(c36, plain,
% 39.98/5.39  	'E'(s('0'),f(X8))).
% 39.98/5.39  cnf(a26, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a27, assumption,
% 39.98/5.39  	f(X17) = f(X8)).
% 39.98/5.39  cnf(c37, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a26, a27])], [c35, c36])).
% 39.98/5.39  
% 39.98/5.39  cnf(c38, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X9)))).
% 39.98/5.39  cnf(a28, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a29, assumption,
% 39.98/5.39  	f(suc(X10)) = f(suc(X9))).
% 39.98/5.39  cnf(c39, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X11))) | ~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a28, a29])], [c32, c38])).
% 39.98/5.39  
% 39.98/5.39  cnf(c40, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X9)))).
% 39.98/5.39  cnf(a30, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a31, assumption,
% 39.98/5.39  	f(suc(X11)) = f(suc(X9))).
% 39.98/5.39  cnf(c41, plain,
% 39.98/5.39  	~iLEQ(suc(X10),suc(X9)) | ~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a30, a31])], [c39, c40])).
% 39.98/5.39  
% 39.98/5.39  cnf(c42, plain,
% 39.98/5.39  	iLEQ(suc(X12),suc(X13))).
% 39.98/5.39  cnf(a32, assumption,
% 39.98/5.39  	suc(X10) = suc(X12)).
% 39.98/5.39  cnf(a33, assumption,
% 39.98/5.39  	suc(X9) = suc(X13)).
% 39.98/5.39  cnf(c43, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X13))) | ~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a32, a33])], [c41, c42])).
% 39.98/5.39  
% 39.98/5.39  cnf(c44, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X9)))).
% 39.98/5.39  cnf(a34, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a35, assumption,
% 39.98/5.39  	f(suc(X13)) = f(suc(X9))).
% 39.98/5.39  cnf(c45, plain,
% 39.98/5.39  	~iLEQ(suc(X13),suc(X11)) | ~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a34, a35])], [c43, c44])).
% 39.98/5.39  
% 39.98/5.39  cnf(c46, plain,
% 39.98/5.39  	iLEQ(suc(X12),suc(X13))).
% 39.98/5.39  cnf(a36, assumption,
% 39.98/5.39  	suc(X13) = suc(X12)).
% 39.98/5.39  cnf(a37, assumption,
% 39.98/5.39  	suc(X11) = suc(X13)).
% 39.98/5.39  cnf(c47, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X14))) | ~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a36, a37])], [c45, c46])).
% 39.98/5.39  
% 39.98/5.39  cnf(c48, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X9)))).
% 39.98/5.39  cnf(a38, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a39, assumption,
% 39.98/5.39  	f(suc(X14)) = f(suc(X9))).
% 39.98/5.39  cnf(c49, plain,
% 39.98/5.39  	~'E'(s('0'),f(X14)) | ~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a38, a39])], [c47, c48])).
% 39.98/5.39  
% 39.98/5.39  cnf(c50, plain,
% 39.98/5.39  	'E'(s('0'),f(X8))).
% 39.98/5.39  cnf(a40, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a41, assumption,
% 39.98/5.39  	f(X14) = f(X8)).
% 39.98/5.39  cnf(c51, plain,
% 39.98/5.39  	~iLEQ(suc(X11),suc(X14)) | ~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a40, a41])], [c49, c50])).
% 39.98/5.39  
% 39.98/5.39  cnf(c52, plain,
% 39.98/5.39  	iLEQ(suc(X12),suc(X13))).
% 39.98/5.39  cnf(a42, assumption,
% 39.98/5.39  	suc(X11) = suc(X12)).
% 39.98/5.39  cnf(a43, assumption,
% 39.98/5.39  	suc(X14) = suc(X13)).
% 39.98/5.39  cnf(c53, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X12))) | ~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a42, a43])], [c51, c52])).
% 39.98/5.39  
% 39.98/5.39  cnf(c54, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X9)))).
% 39.98/5.39  cnf(a44, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a45, assumption,
% 39.98/5.39  	f(suc(X12)) = f(suc(X9))).
% 39.98/5.39  cnf(c55, plain,
% 39.98/5.39  	~'E'(s('0'),f(X12)) | ~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a44, a45])], [c53, c54])).
% 39.98/5.39  
% 39.98/5.39  cnf(c56, plain,
% 39.98/5.39  	'E'(s('0'),f(X8))).
% 39.98/5.39  cnf(a46, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a47, assumption,
% 39.98/5.39  	f(X12) = f(X8)).
% 39.98/5.39  cnf(c57, plain,
% 39.98/5.39  	~iLEQ(suc(X14),suc(X10)) | ~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a46, a47])], [c55, c56])).
% 39.98/5.39  
% 39.98/5.39  cnf(c58, plain,
% 39.98/5.39  	iLEQ(suc(X12),suc(X13))).
% 39.98/5.39  cnf(a48, assumption,
% 39.98/5.39  	suc(X14) = suc(X12)).
% 39.98/5.39  cnf(a49, assumption,
% 39.98/5.39  	suc(X10) = suc(X13)).
% 39.98/5.39  cnf(c59, plain,
% 39.98/5.39  	~'E'(s('0'),f(X13)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a48, a49])], [c57, c58])).
% 39.98/5.39  
% 39.98/5.39  cnf(c60, plain,
% 39.98/5.39  	'E'(s('0'),f(X8))).
% 39.98/5.39  cnf(a50, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a51, assumption,
% 39.98/5.39  	f(X13) = f(X8)).
% 39.98/5.39  cnf(c61, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a50, a51])], [c59, c60])).
% 39.98/5.39  
% 39.98/5.39  cnf(c62, axiom,
% 39.98/5.39  	'LE'(f(X18),s(s('0')))).
% 39.98/5.39  cnf(a52, assumption,
% 39.98/5.39  	f(X8) = f(X18)).
% 39.98/5.39  cnf(a53, assumption,
% 39.98/5.39  	s(s('0')) = s(s('0'))).
% 39.98/5.39  cnf(c63, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a52, a53])], [c17, c62])).
% 39.98/5.39  cnf(c64, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a52, a53])], [c17, c62])).
% 39.98/5.39  
% 39.98/5.39  cnf(c65, plain,
% 39.98/5.39  	'E'('0',f(X1))).
% 39.98/5.39  cnf(a54, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a55, assumption,
% 39.98/5.39  	f(X2) = f(X1)).
% 39.98/5.39  cnf(c66, plain,
% 39.98/5.39  	~'E'('0',f(suc(X1))) | ~iLEQ(suc(X3),suc(X4)) | ~'E'('0',f(X4)) | ~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a54, a55])], [c9, c65])).
% 39.98/5.39  
% 39.98/5.39  cnf(c67, plain,
% 39.98/5.39  	'E'('0',f(suc(X0)))).
% 39.98/5.39  cnf(a56, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a57, assumption,
% 39.98/5.39  	f(suc(X1)) = f(suc(X0))).
% 39.98/5.39  cnf(c68, plain,
% 39.98/5.39  	~iLEQ(suc(X3),suc(X4)) | ~'E'('0',f(X4)) | ~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a56, a57])], [c66, c67])).
% 39.98/5.39  
% 39.98/5.39  cnf(c69, axiom,
% 39.98/5.39  	iLEQ(suc(X19),suc(X19)) | ~'E'('0',f(suc(X19))) | ~'E'('0',f(X19))).
% 39.98/5.39  cnf(a58, assumption,
% 39.98/5.39  	suc(X3) = suc(X19)).
% 39.98/5.39  cnf(a59, assumption,
% 39.98/5.39  	suc(X4) = suc(X19)).
% 39.98/5.39  cnf(c70, plain,
% 39.98/5.39  	~'E'('0',f(X4)) | ~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a58, a59])], [c68, c69])).
% 39.98/5.39  cnf(c71, plain,
% 39.98/5.39  	~'E'('0',f(suc(X19))) | ~'E'('0',f(X19)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a58, a59])], [c68, c69])).
% 39.98/5.39  
% 39.98/5.39  cnf(c72, plain,
% 39.98/5.39  	'E'('0',f(suc(X0)))).
% 39.98/5.39  cnf(a60, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a61, assumption,
% 39.98/5.39  	f(suc(X19)) = f(suc(X0))).
% 39.98/5.39  cnf(c73, plain,
% 39.98/5.39  	~'E'('0',f(X19)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a60, a61])], [c71, c72])).
% 39.98/5.39  
% 39.98/5.39  cnf(c74, plain,
% 39.98/5.39  	'E'('0',f(X1))).
% 39.98/5.39  cnf(a62, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a63, assumption,
% 39.98/5.39  	f(X19) = f(X1)).
% 39.98/5.39  cnf(c75, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a62, a63])], [c73, c74])).
% 39.98/5.39  
% 39.98/5.39  cnf(c76, plain,
% 39.98/5.39  	'E'('0',f(X1))).
% 39.98/5.39  cnf(a64, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a65, assumption,
% 39.98/5.39  	f(X4) = f(X1)).
% 39.98/5.39  cnf(c77, plain,
% 39.98/5.39  	~'E'('0',f(suc(X2))) | ~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a64, a65])], [c70, c76])).
% 39.98/5.39  
% 39.98/5.39  cnf(c78, plain,
% 39.98/5.39  	'E'('0',f(suc(X0)))).
% 39.98/5.39  cnf(a66, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a67, assumption,
% 39.98/5.39  	f(suc(X2)) = f(suc(X0))).
% 39.98/5.39  cnf(c79, plain,
% 39.98/5.39  	~iLEQ(suc(X4),suc(X1)) | ~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a66, a67])], [c77, c78])).
% 39.98/5.39  
% 39.98/5.39  cnf(c80, plain,
% 39.98/5.39  	iLEQ(suc(X3),suc(X4))).
% 39.98/5.39  cnf(a68, assumption,
% 39.98/5.39  	suc(X4) = suc(X3)).
% 39.98/5.39  cnf(a69, assumption,
% 39.98/5.39  	suc(X1) = suc(X4)).
% 39.98/5.39  cnf(c81, plain,
% 39.98/5.39  	~'E'('0',f(X5)) | ~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a68, a69])], [c79, c80])).
% 39.98/5.39  
% 39.98/5.39  cnf(c82, plain,
% 39.98/5.39  	'E'('0',f(X1))).
% 39.98/5.39  cnf(a70, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a71, assumption,
% 39.98/5.39  	f(X5) = f(X1)).
% 39.98/5.39  cnf(c83, plain,
% 39.98/5.39  	~iLEQ(suc(X1),suc(X5)) | ~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a70, a71])], [c81, c82])).
% 39.98/5.39  
% 39.98/5.39  cnf(c84, plain,
% 39.98/5.39  	iLEQ(suc(X3),suc(X4))).
% 39.98/5.39  cnf(a72, assumption,
% 39.98/5.39  	suc(X1) = suc(X3)).
% 39.98/5.39  cnf(a73, assumption,
% 39.98/5.39  	suc(X5) = suc(X4)).
% 39.98/5.39  cnf(c85, plain,
% 39.98/5.39  	~'E'('0',f(X6)) | ~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a72, a73])], [c83, c84])).
% 39.98/5.39  
% 39.98/5.39  cnf(c86, plain,
% 39.98/5.39  	'E'('0',f(X1))).
% 39.98/5.39  cnf(a74, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a75, assumption,
% 39.98/5.39  	f(X6) = f(X1)).
% 39.98/5.39  cnf(c87, plain,
% 39.98/5.39  	~'E'('0',f(X3)) | ~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a74, a75])], [c85, c86])).
% 39.98/5.39  
% 39.98/5.39  cnf(c88, plain,
% 39.98/5.39  	'E'('0',f(X1))).
% 39.98/5.39  cnf(a76, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a77, assumption,
% 39.98/5.39  	f(X3) = f(X1)).
% 39.98/5.39  cnf(c89, plain,
% 39.98/5.39  	~'E'('0',f(suc(X6))) | ~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a76, a77])], [c87, c88])).
% 39.98/5.39  
% 39.98/5.39  cnf(c90, plain,
% 39.98/5.39  	'E'('0',f(suc(X0)))).
% 39.98/5.39  cnf(a78, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a79, assumption,
% 39.98/5.39  	f(suc(X6)) = f(suc(X0))).
% 39.98/5.39  cnf(c91, plain,
% 39.98/5.39  	~iLEQ(suc(X6),suc(X2)) | ~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a78, a79])], [c89, c90])).
% 39.98/5.39  
% 39.98/5.39  cnf(c92, plain,
% 39.98/5.39  	iLEQ(suc(X3),suc(X4))).
% 39.98/5.39  cnf(a80, assumption,
% 39.98/5.39  	suc(X6) = suc(X3)).
% 39.98/5.39  cnf(a81, assumption,
% 39.98/5.39  	suc(X2) = suc(X4)).
% 39.98/5.39  cnf(c93, plain,
% 39.98/5.39  	~'E'('0',f(suc(X5))) | ~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a80, a81])], [c91, c92])).
% 39.98/5.39  
% 39.98/5.39  cnf(c94, plain,
% 39.98/5.39  	'E'('0',f(suc(X0)))).
% 39.98/5.39  cnf(a82, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a83, assumption,
% 39.98/5.39  	f(suc(X5)) = f(suc(X0))).
% 39.98/5.39  cnf(c95, plain,
% 39.98/5.39  	~'E'('0',f(suc(X3))) | ~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a82, a83])], [c93, c94])).
% 39.98/5.39  
% 39.98/5.39  cnf(c96, plain,
% 39.98/5.39  	'E'('0',f(suc(X0)))).
% 39.98/5.39  cnf(a84, assumption,
% 39.98/5.39  	'0' = '0').
% 39.98/5.39  cnf(a85, assumption,
% 39.98/5.39  	f(suc(X3)) = f(suc(X0))).
% 39.98/5.39  cnf(c97, plain,
% 39.98/5.39  	~iLEQ(suc(X5),suc(X6)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a84, a85])], [c95, c96])).
% 39.98/5.39  
% 39.98/5.39  cnf(c98, plain,
% 39.98/5.39  	iLEQ(suc(X3),suc(X4))).
% 39.98/5.39  cnf(a86, assumption,
% 39.98/5.39  	suc(X5) = suc(X3)).
% 39.98/5.39  cnf(a87, assumption,
% 39.98/5.39  	suc(X6) = suc(X4)).
% 39.98/5.39  cnf(c99, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a86, a87])], [c97, c98])).
% 39.98/5.39  
% 39.98/5.39  cnf(c100, axiom,
% 39.98/5.39  	'LE'(f(X20),s('0')) | 'E'(s('0'),f(suc(X20))) | ~'LE'(f(suc(X20)),s(s('0')))).
% 39.98/5.39  cnf(a88, assumption,
% 39.98/5.39  	f(suc(X0)) = f(X20)).
% 39.98/5.39  cnf(a89, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(c101, plain,
% 39.98/5.39  	$false,
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a88, a89])], [c6, c100])).
% 39.98/5.39  cnf(c102, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X20))) | ~'LE'(f(suc(X20)),s(s('0'))),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a88, a89])], [c6, c100])).
% 39.98/5.39  
% 39.98/5.39  cnf(c103, axiom,
% 39.98/5.39  	iLEQ(suc(X21),suc(X21)) | ~'E'(s('0'),f(suc(X21))) | ~'E'(s('0'),f(X21))).
% 39.98/5.39  cnf(a90, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a91, assumption,
% 39.98/5.39  	f(suc(X20)) = f(suc(X21))).
% 39.98/5.39  cnf(c104, plain,
% 39.98/5.39  	~'LE'(f(suc(X20)),s(s('0'))),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a90, a91])], [c102, c103])).
% 39.98/5.39  cnf(c105, plain,
% 39.98/5.39  	iLEQ(suc(X21),suc(X21)) | ~'E'(s('0'),f(X21)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a90, a91])], [c102, c103])).
% 39.98/5.39  
% 39.98/5.39  cnf(c106, axiom,
% 39.98/5.39  	~'E'(s('0'),f(suc(X22))) | ~'E'(s('0'),f(X23)) | ~'E'(s('0'),f(X24)) | ~iLEQ(suc(X25),suc(X26)) | ~'E'(s('0'),f(suc(X23))) | ~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~iLEQ(suc(X26),suc(X24)) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26))).
% 39.98/5.39  cnf(a92, assumption,
% 39.98/5.39  	suc(X21) = suc(X26)).
% 39.98/5.39  cnf(a93, assumption,
% 39.98/5.39  	suc(X21) = suc(X24)).
% 39.98/5.39  cnf(c107, plain,
% 39.98/5.39  	~'E'(s('0'),f(X21)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a92, a93])], [c105, c106])).
% 39.98/5.39  cnf(c108, plain,
% 39.98/5.39  	~'E'(s('0'),f(suc(X22))) | ~'E'(s('0'),f(X23)) | ~'E'(s('0'),f(X24)) | ~iLEQ(suc(X25),suc(X26)) | ~'E'(s('0'),f(suc(X23))) | ~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.39  	inference(strict_predicate_extension, [assumptions([a92, a93])], [c105, c106])).
% 39.98/5.39  
% 39.98/5.39  cnf(c109, plain,
% 39.98/5.39  	'E'(s('0'),f(suc(X20)))).
% 39.98/5.39  cnf(a94, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a95, assumption,
% 39.98/5.39  	f(suc(X22)) = f(suc(X20))).
% 39.98/5.39  cnf(c110, plain,
% 39.98/5.39  	~'E'(s('0'),f(X23)) | ~'E'(s('0'),f(X24)) | ~iLEQ(suc(X25),suc(X26)) | ~'E'(s('0'),f(suc(X23))) | ~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.39  	inference(predicate_reduction, [assumptions([a94, a95])], [c108, c109])).
% 39.98/5.39  
% 39.98/5.39  cnf(c111, axiom,
% 39.98/5.39  	'LE'(f(X28),s('0')) | 'E'(s('0'),f(X28)) | ~'LE'(f(X28),s(s('0')))).
% 39.98/5.39  cnf(a96, assumption,
% 39.98/5.39  	s('0') = s('0')).
% 39.98/5.39  cnf(a97, assumption,
% 39.98/5.40  	f(X23) = f(X28)).
% 39.98/5.40  cnf(c112, plain,
% 39.98/5.40  	~'E'(s('0'),f(X24)) | ~iLEQ(suc(X25),suc(X26)) | ~'E'(s('0'),f(suc(X23))) | ~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(strict_predicate_extension, [assumptions([a96, a97])], [c110, c111])).
% 39.98/5.40  cnf(c113, plain,
% 39.98/5.40  	'LE'(f(X28),s('0')) | ~'LE'(f(X28),s(s('0'))),
% 39.98/5.40  	inference(strict_predicate_extension, [assumptions([a96, a97])], [c110, c111])).
% 39.98/5.40  
% 39.98/5.40  cnf(c114, plain,
% 39.98/5.40  	~'LE'(f(suc(X0)),s('0'))).
% 39.98/5.40  cnf(a98, assumption,
% 39.98/5.40  	f(X28) = f(suc(X0))).
% 39.98/5.40  cnf(a99, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(c115, plain,
% 39.98/5.40  	~'LE'(f(X28),s(s('0'))),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a98, a99])], [c113, c114])).
% 39.98/5.40  
% 39.98/5.40  cnf(c116, plain,
% 39.98/5.40  	'LE'(f(suc(X15)),s(s('0')))).
% 39.98/5.40  cnf(a100, assumption,
% 39.98/5.40  	f(X28) = f(suc(X15))).
% 39.98/5.40  cnf(a101, assumption,
% 39.98/5.40  	s(s('0')) = s(s('0'))).
% 39.98/5.40  cnf(c117, plain,
% 39.98/5.40  	$false,
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a100, a101])], [c115, c116])).
% 39.98/5.40  
% 39.98/5.40  cnf(c118, plain,
% 39.98/5.40  	'E'(s('0'),f(X23))).
% 39.98/5.40  cnf(a102, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a103, assumption,
% 39.98/5.40  	f(X24) = f(X23)).
% 39.98/5.40  cnf(c119, plain,
% 39.98/5.40  	~iLEQ(suc(X25),suc(X26)) | ~'E'(s('0'),f(suc(X23))) | ~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a102, a103])], [c112, c118])).
% 39.98/5.40  
% 39.98/5.40  cnf(c120, plain,
% 39.98/5.40  	iLEQ(suc(X21),suc(X21))).
% 39.98/5.40  cnf(a104, assumption,
% 39.98/5.40  	suc(X25) = suc(X21)).
% 39.98/5.40  cnf(a105, assumption,
% 39.98/5.40  	suc(X26) = suc(X21)).
% 39.98/5.40  cnf(c121, plain,
% 39.98/5.40  	~'E'(s('0'),f(suc(X23))) | ~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a104, a105])], [c119, c120])).
% 39.98/5.40  
% 39.98/5.40  cnf(c122, plain,
% 39.98/5.40  	'E'(s('0'),f(suc(X20)))).
% 39.98/5.40  cnf(a106, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a107, assumption,
% 39.98/5.40  	f(suc(X23)) = f(suc(X20))).
% 39.98/5.40  cnf(c123, plain,
% 39.98/5.40  	~'E'(s('0'),f(X22)) | ~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a106, a107])], [c121, c122])).
% 39.98/5.40  
% 39.98/5.40  cnf(c124, plain,
% 39.98/5.40  	'E'(s('0'),f(X23))).
% 39.98/5.40  cnf(a108, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a109, assumption,
% 39.98/5.40  	f(X22) = f(X23)).
% 39.98/5.40  cnf(c125, plain,
% 39.98/5.40  	~'E'(s('0'),f(suc(X24))) | ~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a108, a109])], [c123, c124])).
% 39.98/5.40  
% 39.98/5.40  cnf(c126, plain,
% 39.98/5.40  	'E'(s('0'),f(suc(X20)))).
% 39.98/5.40  cnf(a110, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a111, assumption,
% 39.98/5.40  	f(suc(X24)) = f(suc(X20))).
% 39.98/5.40  cnf(c127, plain,
% 39.98/5.40  	~iLEQ(suc(X23),suc(X22)) | ~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a110, a111])], [c125, c126])).
% 39.98/5.40  
% 39.98/5.40  cnf(c128, plain,
% 39.98/5.40  	iLEQ(suc(X21),suc(X21))).
% 39.98/5.40  cnf(a112, assumption,
% 39.98/5.40  	suc(X23) = suc(X21)).
% 39.98/5.40  cnf(a113, assumption,
% 39.98/5.40  	suc(X22) = suc(X21)).
% 39.98/5.40  cnf(c129, plain,
% 39.98/5.40  	~'E'(s('0'),f(suc(X26))) | ~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a112, a113])], [c127, c128])).
% 39.98/5.40  
% 39.98/5.40  cnf(c130, plain,
% 39.98/5.40  	'E'(s('0'),f(suc(X20)))).
% 39.98/5.40  cnf(a114, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a115, assumption,
% 39.98/5.40  	f(suc(X26)) = f(suc(X20))).
% 39.98/5.40  cnf(c131, plain,
% 39.98/5.40  	~'E'(s('0'),f(suc(X27))) | ~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a114, a115])], [c129, c130])).
% 39.98/5.40  
% 39.98/5.40  cnf(c132, plain,
% 39.98/5.40  	'E'(s('0'),f(suc(X20)))).
% 39.98/5.40  cnf(a116, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a117, assumption,
% 39.98/5.40  	f(suc(X27)) = f(suc(X20))).
% 39.98/5.40  cnf(c133, plain,
% 39.98/5.40  	~'E'(s('0'),f(X27)) | ~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a116, a117])], [c131, c132])).
% 39.98/5.40  
% 39.98/5.40  cnf(c134, plain,
% 39.98/5.40  	'E'(s('0'),f(X23))).
% 39.98/5.40  cnf(a118, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a119, assumption,
% 39.98/5.40  	f(X27) = f(X23)).
% 39.98/5.40  cnf(c135, plain,
% 39.98/5.40  	~iLEQ(suc(X24),suc(X27)) | ~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a118, a119])], [c133, c134])).
% 39.98/5.40  
% 39.98/5.40  cnf(c136, plain,
% 39.98/5.40  	iLEQ(suc(X21),suc(X21))).
% 39.98/5.40  cnf(a120, assumption,
% 39.98/5.40  	suc(X24) = suc(X21)).
% 39.98/5.40  cnf(a121, assumption,
% 39.98/5.40  	suc(X27) = suc(X21)).
% 39.98/5.40  cnf(c137, plain,
% 39.98/5.40  	~'E'(s('0'),f(suc(X25))) | ~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a120, a121])], [c135, c136])).
% 39.98/5.40  
% 39.98/5.40  cnf(c138, plain,
% 39.98/5.40  	'E'(s('0'),f(suc(X20)))).
% 39.98/5.40  cnf(a122, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a123, assumption,
% 39.98/5.40  	f(suc(X25)) = f(suc(X20))).
% 39.98/5.40  cnf(c139, plain,
% 39.98/5.40  	~'E'(s('0'),f(X25)) | ~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a122, a123])], [c137, c138])).
% 39.98/5.40  
% 39.98/5.40  cnf(c140, plain,
% 39.98/5.40  	'E'(s('0'),f(X23))).
% 39.98/5.40  cnf(a124, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a125, assumption,
% 39.98/5.40  	f(X25) = f(X23)).
% 39.98/5.40  cnf(c141, plain,
% 39.98/5.40  	~iLEQ(suc(X27),suc(X23)) | ~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a124, a125])], [c139, c140])).
% 39.98/5.40  
% 39.98/5.40  cnf(c142, plain,
% 39.98/5.40  	iLEQ(suc(X21),suc(X21))).
% 39.98/5.40  cnf(a126, assumption,
% 39.98/5.40  	suc(X27) = suc(X21)).
% 39.98/5.40  cnf(a127, assumption,
% 39.98/5.40  	suc(X23) = suc(X21)).
% 39.98/5.40  cnf(c143, plain,
% 39.98/5.40  	~'E'(s('0'),f(X26)),
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a126, a127])], [c141, c142])).
% 39.98/5.40  
% 39.98/5.40  cnf(c144, plain,
% 39.98/5.40  	'E'(s('0'),f(X23))).
% 39.98/5.40  cnf(a128, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a129, assumption,
% 39.98/5.40  	f(X26) = f(X23)).
% 39.98/5.40  cnf(c145, plain,
% 39.98/5.40  	$false,
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a128, a129])], [c143, c144])).
% 39.98/5.40  
% 39.98/5.40  cnf(c146, plain,
% 39.98/5.40  	'E'(s('0'),f(X23))).
% 39.98/5.40  cnf(a130, assumption,
% 39.98/5.40  	s('0') = s('0')).
% 39.98/5.40  cnf(a131, assumption,
% 39.98/5.40  	f(X21) = f(X23)).
% 39.98/5.40  cnf(c147, plain,
% 39.98/5.40  	$false,
% 39.98/5.40  	inference(predicate_reduction, [assumptions([a130, a131])], [c107, c146])).
% 39.98/5.40  
% 39.98/5.40  cnf(c148, axiom,
% 39.98/5.40  	'LE'(f(X29),s(s('0')))).
% 39.98/5.40  cnf(a132, assumption,
% 39.98/5.40  	f(suc(X20)) = f(X29)).
% 39.98/5.40  cnf(a133, assumption,
% 39.98/5.40  	s(s('0')) = s(s('0'))).
% 39.98/5.40  cnf(c149, plain,
% 39.98/5.40  	$false,
% 39.98/5.40  	inference(strict_predicate_extension, [assumptions([a132, a133])], [c104, c148])).
% 39.98/5.40  cnf(c150, plain,
% 39.98/5.40  	$false,
% 39.98/5.40  	inference(strict_predicate_extension, [assumptions([a132, a133])], [c104, c148])).
% 39.98/5.40  
% 39.98/5.40  cnf(c151, plain,
% 39.98/5.40  	$false,
% 39.98/5.40  	inference(constraint_solving, [
% 39.98/5.40  		bind(X0, z),
% 39.98/5.40  		bind(X1, z),
% 39.98/5.40  		bind(X2, z),
% 39.98/5.40  		bind(X3, z),
% 39.98/5.40  		bind(X4, z),
% 39.98/5.40  		bind(X5, z),
% 39.98/5.40  		bind(X6, z),
% 39.98/5.40  		bind(X7, z),
% 39.98/5.40  		bind(X8, z),
% 39.98/5.40  		bind(X9, z),
% 39.98/5.40  		bind(X10, z),
% 39.98/5.40  		bind(X11, z),
% 39.98/5.40  		bind(X12, z),
% 39.98/5.40  		bind(X13, z),
% 39.98/5.40  		bind(X14, z),
% 39.98/5.40  		bind(X15, z),
% 39.98/5.40  		bind(X16, suc(X15)),
% 39.98/5.40  		bind(X17, z),
% 39.98/5.40  		bind(X18, z),
% 39.98/5.40  		bind(X19, z),
% 39.98/5.40  		bind(X20, suc(X0)),
% 39.98/5.40  		bind(X21, suc(X0)),
% 39.98/5.40  		bind(X22, suc(X0)),
% 39.98/5.40  		bind(X23, suc(X0)),
% 39.98/5.40  		bind(X24, suc(X0)),
% 39.98/5.40  		bind(X25, suc(X0)),
% 39.98/5.40  		bind(X26, suc(X0)),
% 39.98/5.40  		bind(X27, suc(X0)),
% 39.98/5.40  		bind(X28, suc(X0)),
% 39.98/5.40  		bind(X29, suc(X20))
% 39.98/5.40  	],
% 39.98/5.40  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39, a40, a41, a42, a43, a44, a45, a46, a47, a48, a49, a50, a51, a52, a53, a54, a55, a56, a57, a58, a59, a60, a61, a62, a63, a64, a65, a66, a67, a68, a69, a70, a71, a72, a73, a74, a75, a76, a77, a78, a79, a80, a81, a82, a83, a84, a85, a86, a87, a88, a89, a90, a91, a92, a93, a94, a95, a96, a97, a98, a99, a100, a101, a102, a103, a104, a105, a106, a107, a108, a109, a110, a111, a112, a113, a114, a115, a116, a117, a118, a119, a120, a121, a122, a123, a124, a125, a126, a127, a128, a129, a130, a131, a132, a133])).
% 39.98/5.40  
% 39.98/5.40  % SZS output end IncompleteProof
%------------------------------------------------------------------------------