TSTP Solution File: NUM490+3 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n015.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:33:22 EDT 2022

% Result   : Theorem 0.16s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : NUM490+3 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.15  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.16/0.37  % Computer : n015.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 600
% 0.16/0.37  % DateTime : Thu Jul  7 19:35:05 EDT 2022
% 0.16/0.37  % CPUTime  : 
% 0.16/0.38  % SZS status Theorem
% 0.16/0.38  % SZS output begin IncompleteProof
% 0.16/0.38  cnf(c0, axiom,
% 0.16/0.38  	sdtasdt0(xn,xm) != sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))).
% 0.16/0.38  cnf(c1, plain,
% 0.16/0.38  	sdtasdt0(xn,xm) != sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
% 0.16/0.38  	inference(start, [], [c0])).
% 0.16/0.38  
% 0.16/0.38  cnf(c2, axiom,
% 0.16/0.38  	sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))).
% 0.16/0.38  cnf(a0, assumption,
% 0.16/0.38  	sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))).
% 0.16/0.38  cnf(c3, plain,
% 0.16/0.38  	$false,
% 0.16/0.38  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.16/0.38  cnf(c4, plain,
% 0.16/0.38  	$false,
% 0.16/0.38  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.16/0.38  cnf(c5, plain,
% 0.16/0.38  	X0 != sdtasdt0(xn,xm) | sdtasdt0(xn,xm) != X0,
% 0.16/0.38  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.16/0.38  
% 0.16/0.38  cnf(a1, assumption,
% 0.16/0.38  	X0 = sdtasdt0(xn,xm)).
% 0.16/0.38  cnf(c6, plain,
% 0.16/0.38  	sdtasdt0(xn,xm) != X0,
% 0.16/0.38  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.16/0.38  
% 0.16/0.38  cnf(a2, assumption,
% 0.16/0.38  	sdtasdt0(xn,xm) = X0).
% 0.16/0.38  cnf(c7, plain,
% 0.16/0.38  	$false,
% 0.16/0.38  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.16/0.38  
% 0.16/0.38  cnf(c8, plain,
% 0.16/0.38  	$false,
% 0.16/0.38  	inference(constraint_solving, [
% 0.16/0.38  		bind(X0, sdtasdt0(xn,xm))
% 0.16/0.38  	],
% 0.16/0.38  	[a0, a1, a2])).
% 0.16/0.38  
% 0.16/0.38  % SZS output end IncompleteProof
%------------------------------------------------------------------------------