TSTP Solution File: NUM835+2 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n004.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 : Mon Jul 18 11:36:57 EDT 2022

% Result   : Theorem 0.22s 0.69s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUM835+2 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Wed Jul  6 07:47:07 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.22/0.69  % SZS status Theorem
% 0.22/0.69  % SZS output begin IncompleteProof
% 0.22/0.69  cnf(c0, axiom,
% 0.22/0.69  	vd151 != vplus(vd165,X0)).
% 0.22/0.69  cnf(c1, plain,
% 0.22/0.69  	vd151 != vplus(vd165,X0),
% 0.22/0.69  	inference(start, [], [c0])).
% 0.22/0.69  
% 0.22/0.69  cnf(c2, axiom,
% 0.22/0.69  	vplus(X1,sK0(X1,X2)) = X2 | vplus(X2,sK1(X1,X2)) = X1 | X1 = X2 | ~m(X2)).
% 0.22/0.69  cnf(a0, assumption,
% 0.22/0.69  	vplus(vd165,X0) = vplus(X2,sK1(X1,X2))).
% 0.22/0.69  cnf(c3, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.69  cnf(c4, plain,
% 0.22/0.69  	vplus(X1,sK0(X1,X2)) = X2 | X1 = X2 | ~m(X2),
% 0.22/0.69  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.69  cnf(c5, plain,
% 0.22/0.69  	X3 != X1 | vd151 != X3,
% 0.22/0.69  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.69  
% 0.22/0.69  cnf(a1, assumption,
% 0.22/0.69  	X3 = X1).
% 0.22/0.69  cnf(c6, plain,
% 0.22/0.69  	vd151 != X3,
% 0.22/0.69  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.22/0.69  
% 0.22/0.69  cnf(a2, assumption,
% 0.22/0.69  	vd151 = X3).
% 0.22/0.69  cnf(c7, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.22/0.69  
% 0.22/0.69  cnf(c8, axiom,
% 0.22/0.69  	vd165 != vplus(vd151,X4)).
% 0.22/0.69  cnf(a3, assumption,
% 0.22/0.69  	vplus(vd151,X4) = vplus(X1,sK0(X1,X2))).
% 0.22/0.69  cnf(c9, plain,
% 0.22/0.69  	X1 = X2 | ~m(X2),
% 0.22/0.69  	inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 0.22/0.69  cnf(c10, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 0.22/0.69  cnf(c11, plain,
% 0.22/0.69  	vd165 != X2,
% 0.22/0.69  	inference(strict_subterm_extension, [assumptions([a3])], [c4, c8])).
% 0.22/0.69  
% 0.22/0.69  cnf(a4, assumption,
% 0.22/0.69  	vd165 = X2).
% 0.22/0.69  cnf(c12, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(reflexivity, [assumptions([a4])], [c11])).
% 0.22/0.69  
% 0.22/0.69  cnf(c13, axiom,
% 0.22/0.69  	vd165 != vd151).
% 0.22/0.69  cnf(a5, assumption,
% 0.22/0.69  	vd151 = X1).
% 0.22/0.69  cnf(c14, plain,
% 0.22/0.69  	~m(X2),
% 0.22/0.69  	inference(strict_subterm_extension, [assumptions([a5])], [c9, c13])).
% 0.22/0.69  cnf(c15, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(strict_subterm_extension, [assumptions([a5])], [c9, c13])).
% 0.22/0.69  cnf(c16, plain,
% 0.22/0.69  	vd165 != X2,
% 0.22/0.69  	inference(strict_subterm_extension, [assumptions([a5])], [c9, c13])).
% 0.22/0.69  
% 0.22/0.69  cnf(a6, assumption,
% 0.22/0.69  	vd165 = X2).
% 0.22/0.69  cnf(c17, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(reflexivity, [assumptions([a6])], [c16])).
% 0.22/0.69  
% 0.22/0.69  cnf(c18, axiom,
% 0.22/0.69  	m(X5)).
% 0.22/0.69  cnf(a7, assumption,
% 0.22/0.69  	X2 = X5).
% 0.22/0.69  cnf(c19, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(strict_predicate_extension, [assumptions([a7])], [c14, c18])).
% 0.22/0.69  cnf(c20, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(strict_predicate_extension, [assumptions([a7])], [c14, c18])).
% 0.22/0.69  
% 0.22/0.69  cnf(c21, plain,
% 0.22/0.69  	$false,
% 0.22/0.69  	inference(constraint_solving, [
% 0.22/0.69  		bind(X0, sK1(X1,X2)),
% 0.22/0.69  		bind(X1, vd151),
% 0.22/0.69  		bind(X2, vd165),
% 0.22/0.69  		bind(X3, vd151),
% 0.22/0.69  		bind(X4, sK0(X1,X2)),
% 0.22/0.69  		bind(X5, vd165)
% 0.22/0.69  	],
% 0.22/0.69  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.22/0.69  
% 0.22/0.69  % SZS output end IncompleteProof
%------------------------------------------------------------------------------