TSTP Solution File: NUM840+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : NUM840+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n002.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 : 300s
% DateTime : Wed Mar 6 09:16:18 EST 2024
% Result : Theorem 1.31s 1.48s
% Output : Proof 1.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM840+1 : TPTP v8.1.2. Released v4.1.0.
% 0.03/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Mar 3 17:13:11 EST 2024
% 0.12/0.33 % CPUTime :
% 1.31/1.48 % SZS status Theorem for theBenchmark
% 1.31/1.48 % SZS output start Proof for theBenchmark
% 1.31/1.48
% 1.31/1.48 % Formula: holds(conseq(conjunct2(conjunct2(204))), 336, 0) ( conjecture ) converted to clauses:
% 1.31/1.48 cnf(holds(conseq(conjunct2(conjunct2(204))), 336, 0)-1, negated_conjecture, ( ~less(vd328, vd329) )).
% 1.31/1.48
% 1.31/1.48 % Formula: holds(antec(conjunct2(conjunct2(204))), 335, 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(holds(antec(conjunct2(conjunct2(204))), 335, 0)-1, axiom, ( less(vplus(vd328, vd330), vplus(vd329, vd330)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(conjunct1(conjunct2(204)), 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(conjunct1(conjunct2(204)), 0), 0)-1, axiom, ( ( vplus(vd328, vd330) != vplus(vd329, vd330)) | ( vd328 = vd329) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(conjunct1(204), 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(conjunct1(204), 0), 0)-1, axiom, ( ~greater(vplus(vd328, vd330), vplus(vd329, vd330)) | greater(vd328, vd329) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(193), 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(193), 0), 0)-1, axiom, ( ~less(_u2, _u1) | less(vplus(_u2, _u0), vplus(_u1, _u0)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(193), 0), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(193), 0), 1)-1, axiom, ( ( _u5 != _u4) | ( vplus(_u5, _u3) = vplus(_u4, _u3)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(193), 0), 2) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(193), 0), 2)-1, axiom, ( ~greater(_u8, _u7) | greater(vplus(_u8, _u6), vplus(_u7, _u6)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(189, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(189, 0), 0)-1, axiom, ( greater(vplus(_u10, _u9), _u10) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(184, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(184, 0), 0)-1, axiom, ( ~leq(_u12, _u11) | ~leq(_u13, _u12) | leq(_u13, _u11) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(177), 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(177), 0), 0)-1, axiom, ( less(_u16, _u14) | ~less(_u15, _u14) | ~leq(_u16, _u15) )).
% 1.31/1.48 cnf(ass(cond(goal(177), 0), 0)-2, axiom, ( less(_u16, _u14) | ~leq(_u15, _u14) | ~less(_u16, _u15) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(168, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(168, 0), 0)-1, axiom, ( ~less(_u18, _u17) | ~less(_u19, _u18) | less(_u19, _u17) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(163, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(163, 0), 0)-1, axiom, ( ~leq(_u21, _u20) | geq(_u20, _u21) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(158, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(158, 0), 0)-1, axiom, ( ~geq(_u23, _u22) | leq(_u22, _u23) )).
% 1.31/1.48
% 1.31/1.48 % Formula: def(cond(conseq(axiom(3)), 17), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 17), 1)-1, axiom, ( ~leq(_u26, _u28) | less(_u26, _u28) | ( _u26 = _u28) )).
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 17), 1)-2, axiom, ( leq(_u27, _u29) | ~less(_u27, _u29) )).
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 17), 1)-3, axiom, ( leq(_u27, _u29) | ( _u27 != _u29) )).
% 1.31/1.48
% 1.31/1.48 % Formula: def(cond(conseq(axiom(3)), 16), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 16), 1)-1, axiom, ( ~geq(_u32, _u34) | greater(_u32, _u34) | ( _u32 = _u34) )).
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 16), 1)-2, axiom, ( geq(_u33, _u35) | ~greater(_u33, _u35) )).
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 16), 1)-3, axiom, ( geq(_u33, _u35) | ( _u33 != _u35) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(147, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(147, 0), 0)-1, axiom, ( ~less(_u37, _u36) | greater(_u36, _u37) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(140, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(140, 0), 0)-1, axiom, ( ~greater(_u39, _u38) | less(_u38, _u39) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(130), 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(130), 0), 0)-1, axiom, ( ( _u41 = _u40) | greater(_u41, _u40) | less(_u41, _u40) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(130), 0), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(130), 0), 1)-1, axiom, ( ( _u43 != _u42) | ~less(_u43, _u42) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(130), 0), 2) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(130), 0), 2)-1, axiom, ( ~greater(_u45, _u44) | ~less(_u45, _u44) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(130), 0), 3) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(130), 0), 3)-1, axiom, ( ( _u47 != _u46) | ~greater(_u47, _u46) )).
% 1.31/1.48
% 1.31/1.48 % Formula: def(cond(conseq(axiom(3)), 12), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 12), 1)-1, axiom, ( ~less(_u52, _u54) | ( _u54 = vplus(_u52, skolem1(_u54, _u52))) )).
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 12), 1)-2, axiom, ( ( _u55 != vplus(_u53, _u49)) | less(_u53, _u55) )).
% 1.31/1.48
% 1.31/1.48 % Formula: def(cond(conseq(axiom(3)), 11), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 11), 1)-1, axiom, ( ~greater(_u60, _u62) | ( _u60 = vplus(_u62, skolem2(_u62, _u60))) )).
% 1.31/1.48 cnf(def(cond(conseq(axiom(3)), 11), 1)-2, axiom, ( ( _u61 != vplus(_u63, _u57)) | greater(_u61, _u63) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(88), 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(88), 0), 0)-1, axiom, ( ( _u67 = _u66) | ( _u67 = vplus(_u66, skolem3(_u67, _u66))) | ( _u66 = vplus(_u67, skolem4(_u67, _u66))) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(88), 0), 1) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(88), 0), 1)-1, axiom, ( ( _u70 != _u69) | ( _u69 != vplus(_u70, _u68)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(88), 0), 2) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(88), 0), 2)-1, axiom, ( ( _u74 != vplus(_u73, _u71)) | ( _u73 != vplus(_u74, _u72)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(goal(88), 0), 3) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(goal(88), 0), 3)-1, axiom, ( ( _u77 != _u76) | ( _u77 != vplus(_u76, _u75)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(81, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(81, 0), 0)-1, axiom, ( ( _u80 = _u79) | ( vplus(_u78, _u80) != vplus(_u78, _u79)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(73, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(73, 0), 0)-1, axiom, ( ( _u81 != vplus(_u82, _u81)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(61, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(61, 0), 0)-1, axiom, ( ( vplus(_u83, _u84) = vplus(_u84, _u83)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(52, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(52, 0), 0)-1, axiom, ( ( vplus(vsucc(_u86), _u85) = vsucc(vplus(_u86, _u85))) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(43, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(43, 0), 0)-1, axiom, ( ( vplus(v1, _u87) = vsucc(_u87)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(33, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(33, 0), 0)-1, axiom, ( ( vplus(vplus(_u90, _u89), _u88) = vplus(_u90, vplus(_u89, _u88))) )).
% 1.31/1.48
% 1.31/1.48 % Formula: qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0))) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))-1, axiom, ( ( vplus(_u93, v1) = vsucc(_u93)) )).
% 1.31/1.48 cnf(qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))-2, axiom, ( ( vplus(_u94, vsucc(_u91)) = vsucc(vplus(_u94, _u91))) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(20, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(20, 0), 0)-1, axiom, ( ( _u95 = v1) | ( _u95 = vsucc(vskolem2(_u95))) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(12, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(12, 0), 0)-1, axiom, ( ( vsucc(_u96) != _u96) )).
% 1.31/1.48
% 1.31/1.48 % Formula: ass(cond(6, 0), 0) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(ass(cond(6, 0), 0)-1, axiom, ( ( _u98 = _u97) | ( vsucc(_u98) != vsucc(_u97)) )).
% 1.31/1.48
% 1.31/1.48 % Formula: qu(antec(axiom(3)), imp(antec(axiom(3)))) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(qu(antec(axiom(3)), imp(antec(axiom(3))))-1, axiom, ( ( vsucc(_u100) != vsucc(_u99)) | ( _u100 = _u99) )).
% 1.31/1.48
% 1.31/1.48 % Formula: qu(restrictor(axiom(1)), holds(scope(axiom(1)), 2, 0)) ( axiom ) converted to clauses:
% 1.31/1.48 cnf(qu(restrictor(axiom(1)), holds(scope(axiom(1)), 2, 0))-1, axiom, ( ( vsucc(_u101) != v1) )).
% 1.31/1.48
% 1.31/1.48 % Problem matrix:
% 1.31/1.48 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 1.31/1.48 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 1.31/1.48 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 1.31/1.48 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( vplus(__eqx_0, __eqx_1) = vplus(__eqy_0, __eqy_1)) )).
% 1.31/1.48 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( vsucc(__eqx_0) = vsucc(__eqy_0)) )).
% 1.31/1.48 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( vskolem2(__eqx_0) = vskolem2(__eqy_0)) )).
% 1.31/1.48 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 1.31/1.48 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 1.31/1.48 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 1.31/1.48 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem4(__eqx_0, __eqx_1) = skolem4(__eqy_0, __eqy_1)) )).
% 1.31/1.48 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~less(__eqx_0, __eqx_1) | less(__eqy_0, __eqy_1) )).
% 1.31/1.48 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 1.31/1.48 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~leq(__eqx_0, __eqx_1) | leq(__eqy_0, __eqy_1) )).
% 1.31/1.48 cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~geq(__eqx_0, __eqx_1) | geq(__eqy_0, __eqy_1) )).
% 1.31/1.48 cnf(matrix-14, plain, ( ~less(vd328, vd329) )).
% 1.31/1.48 cnf(matrix-15, plain, ( less(vplus(vd328, vd330), vplus(vd329, vd330)) )).
% 1.31/1.48 cnf(matrix-16, plain, ( ( vplus(vd328, vd330) != vplus(vd329, vd330)) | ( vd328 = vd329) )).
% 1.31/1.48 cnf(matrix-17, plain, ( ~greater(vplus(vd328, vd330), vplus(vd329, vd330)) | greater(vd328, vd329) )).
% 1.31/1.48 cnf(matrix-18, plain, ( ~less(_u2, _u1) | less(vplus(_u2, _u0), vplus(_u1, _u0)) )).
% 1.31/1.48 cnf(matrix-19, plain, ( ( _u5 != _u4) | ( vplus(_u5, _u3) = vplus(_u4, _u3)) )).
% 1.31/1.48 cnf(matrix-20, plain, ( ~greater(_u8, _u7) | greater(vplus(_u8, _u6), vplus(_u7, _u6)) )).
% 1.31/1.48 cnf(matrix-21, plain, ( greater(vplus(_u10, _u9), _u10) )).
% 1.31/1.48 cnf(matrix-22, plain, ( ~leq(_u12, _u11) | ~leq(_u13, _u12) | leq(_u13, _u11) )).
% 1.31/1.48 cnf(matrix-23, plain, ( less(_u16, _u14) | ~less(_u15, _u14) | ~leq(_u16, _u15) )).
% 1.31/1.48 cnf(matrix-24, plain, ( less(_u16, _u14) | ~leq(_u15, _u14) | ~less(_u16, _u15) )).
% 1.31/1.48 cnf(matrix-25, plain, ( ~less(_u18, _u17) | ~less(_u19, _u18) | less(_u19, _u17) )).
% 1.31/1.48 cnf(matrix-26, plain, ( ~leq(_u21, _u20) | geq(_u20, _u21) )).
% 1.31/1.48 cnf(matrix-27, plain, ( ~geq(_u23, _u22) | leq(_u22, _u23) )).
% 1.31/1.48 cnf(matrix-28, plain, ( ~leq(_u26, _u28) | less(_u26, _u28) | ( _u26 = _u28) )).
% 1.31/1.48 cnf(matrix-29, plain, ( leq(_u27, _u29) | ~less(_u27, _u29) )).
% 1.31/1.48 cnf(matrix-30, plain, ( leq(_u27, _u29) | ( _u27 != _u29) )).
% 1.31/1.48 cnf(matrix-31, plain, ( ~geq(_u32, _u34) | greater(_u32, _u34) | ( _u32 = _u34) )).
% 1.31/1.48 cnf(matrix-32, plain, ( geq(_u33, _u35) | ~greater(_u33, _u35) )).
% 1.31/1.48 cnf(matrix-33, plain, ( geq(_u33, _u35) | ( _u33 != _u35) )).
% 1.31/1.48 cnf(matrix-34, plain, ( ~less(_u37, _u36) | greater(_u36, _u37) )).
% 1.31/1.48 cnf(matrix-35, plain, ( ~greater(_u39, _u38) | less(_u38, _u39) )).
% 1.31/1.48 cnf(matrix-36, plain, ( ( _u41 = _u40) | greater(_u41, _u40) | less(_u41, _u40) )).
% 1.31/1.48 cnf(matrix-37, plain, ( ( _u43 != _u42) | ~less(_u43, _u42) )).
% 1.31/1.48 cnf(matrix-38, plain, ( ~greater(_u45, _u44) | ~less(_u45, _u44) )).
% 1.31/1.48 cnf(matrix-39, plain, ( ( _u47 != _u46) | ~greater(_u47, _u46) )).
% 1.31/1.48 cnf(matrix-40, plain, ( ~less(_u52, _u54) | ( _u54 = vplus(_u52, skolem1(_u54, _u52))) )).
% 1.31/1.48 cnf(matrix-41, plain, ( ( _u55 != vplus(_u53, _u49)) | less(_u53, _u55) )).
% 1.31/1.48 cnf(matrix-42, plain, ( ~greater(_u60, _u62) | ( _u60 = vplus(_u62, skolem2(_u62, _u60))) )).
% 1.31/1.48 cnf(matrix-43, plain, ( ( _u61 != vplus(_u63, _u57)) | greater(_u61, _u63) )).
% 1.31/1.48 cnf(matrix-44, plain, ( ( _u67 = _u66) | ( _u67 = vplus(_u66, skolem3(_u67, _u66))) | ( _u66 = vplus(_u67, skolem4(_u67, _u66))) )).
% 1.31/1.48 cnf(matrix-45, plain, ( ( _u70 != _u69) | ( _u69 != vplus(_u70, _u68)) )).
% 1.31/1.48 cnf(matrix-46, plain, ( ( _u74 != vplus(_u73, _u71)) | ( _u73 != vplus(_u74, _u72)) )).
% 1.31/1.48 cnf(matrix-47, plain, ( ( _u77 != _u76) | ( _u77 != vplus(_u76, _u75)) )).
% 1.31/1.48 cnf(matrix-48, plain, ( ( _u80 = _u79) | ( vplus(_u78, _u80) != vplus(_u78, _u79)) )).
% 1.31/1.48 cnf(matrix-49, plain, ( ( _u81 != vplus(_u82, _u81)) )).
% 1.31/1.48 cnf(matrix-50, plain, ( ( vplus(_u83, _u84) = vplus(_u84, _u83)) )).
% 1.31/1.48 cnf(matrix-51, plain, ( ( vplus(vsucc(_u86), _u85) = vsucc(vplus(_u86, _u85))) )).
% 1.31/1.48 cnf(matrix-52, plain, ( ( vplus(v1, _u87) = vsucc(_u87)) )).
% 1.31/1.48 cnf(matrix-53, plain, ( ( vplus(vplus(_u90, _u89), _u88) = vplus(_u90, vplus(_u89, _u88))) )).
% 1.31/1.48 cnf(matrix-54, plain, ( ( vplus(_u93, v1) = vsucc(_u93)) )).
% 1.31/1.48 cnf(matrix-55, plain, ( ( vplus(_u94, vsucc(_u91)) = vsucc(vplus(_u94, _u91))) )).
% 1.31/1.48 cnf(matrix-56, plain, ( ( _u95 = v1) | ( _u95 = vsucc(vskolem2(_u95))) )).
% 1.31/1.48 cnf(matrix-57, plain, ( ( vsucc(_u96) != _u96) )).
% 1.31/1.48 cnf(matrix-58, plain, ( ( _u98 = _u97) | ( vsucc(_u98) != vsucc(_u97)) )).
% 1.31/1.48 cnf(matrix-59, plain, ( ( vsucc(_u100) != vsucc(_u99)) | ( _u100 = _u99) )).
% 1.31/1.48 cnf(matrix-60, plain, ( ( vsucc(_u101) != v1) )).
% 1.31/1.48
% 1.31/1.48 % Proof stack:
% 1.31/1.48 cnf(proof-stack, plain,
% 1.31/1.48 proof_stack(
% 1.31/1.48 start(14),
% 1.31/1.48 left_branch(0, 36, 2, 2),
% 1.31/1.48 left_branch(0, 19, 0, 3),
% 1.31/1.48 left_branch(0, 37, 0, 4),
% 1.31/1.48 left_branch(0, 15, 0, 5),
% 1.31/1.48 right_branch(5),
% 1.31/1.48 right_branch(4),
% 1.31/1.48 right_branch(3),
% 1.31/1.48 left_branch(0, 20, 0, 4),
% 1.31/1.48 left_branch(0, 38, 0, 5),
% 1.31/1.48 left_branch(0, 15, 0, 6),
% 1.31/1.48 right_branch(6),
% 1.31/1.48 right_branch(5),
% 1.31/1.48 right_branch(4),
% 1.31/1.48 right_branch(2)
% 1.31/1.48 )).
% 1.31/1.48 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------