TSTP Solution File: NUM837+2 by ConnectPP---0.2.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : NUM837+2 : 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 : n026.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:17 EST 2024

% Result   : Theorem 0.13s 0.35s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM837+2 : TPTP v8.1.2. Released v4.1.0.
% 0.11/0.12  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33  % Computer : n026.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  : 300
% 0.13/0.33  % DateTime : Sun Mar  3 16:58:22 EST 2024
% 0.13/0.33  % CPUTime  : 
% 0.13/0.35  % SZS status Theorem for theBenchmark
% 0.13/0.35  % SZS output start Proof for theBenchmark
% 0.13/0.35  
% 0.13/0.35  % Formula: qe(171) ( conjecture ) converted to clauses:
% 0.13/0.35  cnf(qe(171)-1, negated_conjecture, ( ( vd269 != vplus(vd268, _u0)) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: (conjunct2(170),272,0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf((conjunct2(170),272,0)-1, axiom, ( less(vd269, vd271) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: holds(conjunct1(170), 270, 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(holds(conjunct1(170), 270, 0)-1, axiom, ( less(vd268, vd269) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(163, 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(163, 0), 0)-1, axiom, ( ~leq(_u2, _u1) | geq(_u1, _u2) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(158, 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(158, 0), 0)-1, axiom, ( ~geq(_u4, _u3) | leq(_u3, _u4) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: def(cond(conseq(axiom(3)), 17), 1) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 17), 1)-1, axiom, ( ~leq(_u7, _u9) | less(_u7, _u9) | ( _u7 = _u9) )).
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 17), 1)-2, axiom, ( leq(_u8, _u10) | ~less(_u8, _u10) )).
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 17), 1)-3, axiom, ( leq(_u8, _u10) | ( _u8 != _u10) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: def(cond(conseq(axiom(3)), 16), 1) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 16), 1)-1, axiom, ( ~geq(_u13, _u15) | greater(_u13, _u15) | ( _u13 = _u15) )).
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 16), 1)-2, axiom, ( geq(_u14, _u16) | ~greater(_u14, _u16) )).
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 16), 1)-3, axiom, ( geq(_u14, _u16) | ( _u14 != _u16) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(147, 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(147, 0), 0)-1, axiom, ( ~less(_u18, _u17) | greater(_u17, _u18) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(140, 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(140, 0), 0)-1, axiom, ( ~greater(_u20, _u19) | less(_u19, _u20) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(130), 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(130), 0), 0)-1, axiom, ( ( _u22 = _u21) | greater(_u22, _u21) | less(_u22, _u21) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(130), 0), 1) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(130), 0), 1)-1, axiom, ( ( _u24 != _u23) | ~less(_u24, _u23) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(130), 0), 2) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(130), 0), 2)-1, axiom, ( ~greater(_u26, _u25) | ~less(_u26, _u25) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(130), 0), 3) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(130), 0), 3)-1, axiom, ( ( _u28 != _u27) | ~greater(_u28, _u27) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: def(cond(conseq(axiom(3)), 12), 1) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 12), 1)-1, axiom, ( ~less(_u33, _u35) | ( _u35 = vplus(_u33, skolem1(_u35, _u33))) )).
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 12), 1)-2, axiom, ( ( _u36 != vplus(_u34, _u30)) | less(_u34, _u36) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: def(cond(conseq(axiom(3)), 11), 1) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 11), 1)-1, axiom, ( ~greater(_u41, _u43) | ( _u41 = vplus(_u43, skolem2(_u43, _u41))) )).
% 0.13/0.35  cnf(def(cond(conseq(axiom(3)), 11), 1)-2, axiom, ( ( _u42 != vplus(_u44, _u38)) | greater(_u42, _u44) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(88), 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(88), 0), 0)-1, axiom, ( ( _u48 = _u47) | ( _u48 = vplus(_u47, skolem3(_u48, _u47))) | ( _u47 = vplus(_u48, skolem4(_u48, _u47))) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(88), 0), 1) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(88), 0), 1)-1, axiom, ( ( _u51 != _u50) | ( _u50 != vplus(_u51, _u49)) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(88), 0), 2) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(88), 0), 2)-1, axiom, ( ( _u55 != vplus(_u54, _u52)) | ( _u54 != vplus(_u55, _u53)) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(goal(88), 0), 3) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(goal(88), 0), 3)-1, axiom, ( ( _u58 != _u57) | ( _u58 != vplus(_u57, _u56)) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(81, 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(81, 0), 0)-1, axiom, ( ( _u61 = _u60) | ( vplus(_u59, _u61) != vplus(_u59, _u60)) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: ass(cond(33, 0), 0) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(ass(cond(33, 0), 0)-1, axiom, ( ( vplus(vplus(_u64, _u63), _u62) = vplus(_u64, vplus(_u63, _u62))) )).
% 0.13/0.35  
% 0.13/0.35  % Formula: qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0))) ( axiom ) converted to clauses:
% 0.13/0.35  cnf(qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))-1, axiom, ( ( vplus(_u67, v1) = vsucc(_u67)) )).
% 0.13/0.35  cnf(qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))-2, axiom, ( ( vplus(_u68, vsucc(_u65)) = vsucc(vplus(_u68, _u65))) )).
% 0.13/0.35  
% 0.13/0.35  % Problem matrix:
% 0.13/0.35  cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.35  cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.35  cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.35  cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( vplus(__eqx_0, __eqx_1) = vplus(__eqy_0, __eqy_1)) )).
% 0.13/0.35  cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( vsucc(__eqx_0) = vsucc(__eqy_0)) )).
% 0.13/0.35  cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem1(__eqx_0, __eqx_1) = skolem1(__eqy_0, __eqy_1)) )).
% 0.13/0.35  cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem2(__eqx_0, __eqx_1) = skolem2(__eqy_0, __eqy_1)) )).
% 0.13/0.35  cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem3(__eqx_0, __eqx_1) = skolem3(__eqy_0, __eqy_1)) )).
% 0.13/0.35  cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( skolem4(__eqx_0, __eqx_1) = skolem4(__eqy_0, __eqy_1)) )).
% 0.13/0.35  cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~less(__eqx_0, __eqx_1) | less(__eqy_0, __eqy_1) )).
% 0.13/0.35  cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~leq(__eqx_0, __eqx_1) | leq(__eqy_0, __eqy_1) )).
% 0.13/0.35  cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~geq(__eqx_0, __eqx_1) | geq(__eqy_0, __eqy_1) )).
% 0.13/0.35  cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~greater(__eqx_0, __eqx_1) | greater(__eqy_0, __eqy_1) )).
% 0.13/0.35  cnf(matrix-13, plain, ( ( vd269 != vplus(vd268, _u0)) )).
% 0.13/0.35  cnf(matrix-14, plain, ( less(vd269, vd271) )).
% 0.13/0.35  cnf(matrix-15, plain, ( less(vd268, vd269) )).
% 0.13/0.35  cnf(matrix-16, plain, ( ~leq(_u2, _u1) | geq(_u1, _u2) )).
% 0.13/0.35  cnf(matrix-17, plain, ( ~geq(_u4, _u3) | leq(_u3, _u4) )).
% 0.13/0.35  cnf(matrix-18, plain, ( ~leq(_u7, _u9) | less(_u7, _u9) | ( _u7 = _u9) )).
% 0.13/0.35  cnf(matrix-19, plain, ( leq(_u8, _u10) | ~less(_u8, _u10) )).
% 0.13/0.35  cnf(matrix-20, plain, ( leq(_u8, _u10) | ( _u8 != _u10) )).
% 0.13/0.35  cnf(matrix-21, plain, ( ~geq(_u13, _u15) | greater(_u13, _u15) | ( _u13 = _u15) )).
% 0.13/0.35  cnf(matrix-22, plain, ( geq(_u14, _u16) | ~greater(_u14, _u16) )).
% 0.13/0.35  cnf(matrix-23, plain, ( geq(_u14, _u16) | ( _u14 != _u16) )).
% 0.13/0.35  cnf(matrix-24, plain, ( ~less(_u18, _u17) | greater(_u17, _u18) )).
% 0.13/0.35  cnf(matrix-25, plain, ( ~greater(_u20, _u19) | less(_u19, _u20) )).
% 0.13/0.35  cnf(matrix-26, plain, ( ( _u22 = _u21) | greater(_u22, _u21) | less(_u22, _u21) )).
% 0.13/0.35  cnf(matrix-27, plain, ( ( _u24 != _u23) | ~less(_u24, _u23) )).
% 0.13/0.35  cnf(matrix-28, plain, ( ~greater(_u26, _u25) | ~less(_u26, _u25) )).
% 0.13/0.35  cnf(matrix-29, plain, ( ( _u28 != _u27) | ~greater(_u28, _u27) )).
% 0.13/0.35  cnf(matrix-30, plain, ( ~less(_u33, _u35) | ( _u35 = vplus(_u33, skolem1(_u35, _u33))) )).
% 0.13/0.35  cnf(matrix-31, plain, ( ( _u36 != vplus(_u34, _u30)) | less(_u34, _u36) )).
% 0.13/0.35  cnf(matrix-32, plain, ( ~greater(_u41, _u43) | ( _u41 = vplus(_u43, skolem2(_u43, _u41))) )).
% 0.13/0.35  cnf(matrix-33, plain, ( ( _u42 != vplus(_u44, _u38)) | greater(_u42, _u44) )).
% 0.13/0.35  cnf(matrix-34, plain, ( ( _u48 = _u47) | ( _u48 = vplus(_u47, skolem3(_u48, _u47))) | ( _u47 = vplus(_u48, skolem4(_u48, _u47))) )).
% 0.13/0.35  cnf(matrix-35, plain, ( ( _u51 != _u50) | ( _u50 != vplus(_u51, _u49)) )).
% 0.13/0.35  cnf(matrix-36, plain, ( ( _u55 != vplus(_u54, _u52)) | ( _u54 != vplus(_u55, _u53)) )).
% 0.13/0.35  cnf(matrix-37, plain, ( ( _u58 != _u57) | ( _u58 != vplus(_u57, _u56)) )).
% 0.13/0.35  cnf(matrix-38, plain, ( ( _u61 = _u60) | ( vplus(_u59, _u61) != vplus(_u59, _u60)) )).
% 0.13/0.35  cnf(matrix-39, plain, ( ( vplus(vplus(_u64, _u63), _u62) = vplus(_u64, vplus(_u63, _u62))) )).
% 0.13/0.35  cnf(matrix-40, plain, ( ( vplus(_u67, v1) = vsucc(_u67)) )).
% 0.13/0.35  cnf(matrix-41, plain, ( ( vplus(_u68, vsucc(_u65)) = vsucc(vplus(_u68, _u65))) )).
% 0.13/0.35  
% 0.13/0.35  % Proof stack:
% 0.13/0.35  cnf(proof-stack, plain, 
% 0.13/0.35  proof_stack(
% 0.13/0.35  start(13), 
% 0.13/0.35  left_branch(0, 30, 1, 2), 
% 0.13/0.35  left_branch(0, 15, 0, 3), 
% 0.13/0.35  right_branch(3), 
% 0.13/0.35  right_branch(2)
% 0.13/0.35  )).
% 0.13/0.35  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------