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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : ROB030-1 : TPTP v8.1.0. Released v3.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 : n032.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 20:53:56 EDT 2022

% Result   : Unsatisfiable 0.13s 0.29s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : ROB030-1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.09  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Thu Jun  9 13:16:07 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.13/0.29  % SZS status Unsatisfiable
% 0.13/0.29  % SZS output begin IncompleteProof
% 0.13/0.29  cnf(c0, axiom,
% 0.13/0.29  	negate(add(X0,X1)) != negate(X1)).
% 0.13/0.29  cnf(c1, plain,
% 0.13/0.29  	negate(add(X0,X1)) != negate(X1),
% 0.13/0.29  	inference(start, [], [c0])).
% 0.13/0.29  
% 0.13/0.29  cnf(c2, axiom,
% 0.13/0.29  	d = add(c,d)).
% 0.13/0.29  cnf(a0, assumption,
% 0.13/0.29  	add(X0,X1) = add(c,d)).
% 0.13/0.29  cnf(c3, plain,
% 0.13/0.29  	$false,
% 0.13/0.29  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.29  cnf(c4, plain,
% 0.13/0.29  	$false,
% 0.13/0.29  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.29  cnf(c5, plain,
% 0.13/0.29  	X2 != d | negate(X2) != negate(X1),
% 0.13/0.29  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.29  
% 0.13/0.29  cnf(a1, assumption,
% 0.13/0.29  	X2 = d).
% 0.13/0.29  cnf(c6, plain,
% 0.13/0.29  	negate(X2) != negate(X1),
% 0.13/0.29  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.13/0.29  
% 0.13/0.29  cnf(a2, assumption,
% 0.13/0.29  	negate(X2) = negate(X1)).
% 0.13/0.29  cnf(c7, plain,
% 0.13/0.29  	$false,
% 0.13/0.29  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.13/0.29  
% 0.13/0.29  cnf(c8, plain,
% 0.13/0.29  	$false,
% 0.13/0.29  	inference(constraint_solving, [
% 0.13/0.29  		bind(X0, c),
% 0.13/0.29  		bind(X1, d),
% 0.13/0.29  		bind(X2, d)
% 0.13/0.29  	],
% 0.13/0.29  	[a0, a1, a2])).
% 0.13/0.29  
% 0.13/0.29  % SZS output end IncompleteProof
%------------------------------------------------------------------------------