TSTP Solution File: NUN073+1 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n022.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 16:33:24 EDT 2022

% Result   : Theorem 0.12s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUN073+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n022.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  : 600
% 0.12/0.33  % DateTime : Thu Jun  2 07:30:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.36  % SZS status Theorem
% 0.12/0.36  % SZS output begin IncompleteProof
% 0.12/0.36  cnf(c0, axiom,
% 0.12/0.36  	r2(sK33,sK32)).
% 0.12/0.36  cnf(c1, plain,
% 0.12/0.36  	r2(sK33,sK32),
% 0.12/0.36  	inference(start, [], [c0])).
% 0.12/0.36  
% 0.12/0.36  cnf(c2, axiom,
% 0.12/0.36  	id(X0,X1) | ~r2(X1,X2) | ~r2(X0,X3) | ~id(X3,X2)).
% 0.12/0.36  cnf(a0, assumption,
% 0.12/0.36  	sK33 = X0).
% 0.12/0.36  cnf(a1, assumption,
% 0.12/0.36  	sK32 = X3).
% 0.12/0.36  cnf(c3, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.36  cnf(c4, plain,
% 0.12/0.36  	id(X0,X1) | ~r2(X1,X2) | ~id(X3,X2),
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.36  
% 0.12/0.36  cnf(c5, axiom,
% 0.12/0.36  	~r2(X4,X5) | ~r1(X6) | ~id(X6,X5)).
% 0.12/0.36  cnf(a2, assumption,
% 0.12/0.36  	X0 = X6).
% 0.12/0.36  cnf(a3, assumption,
% 0.12/0.36  	X1 = X5).
% 0.12/0.36  cnf(c6, plain,
% 0.12/0.36  	~r2(X1,X2) | ~id(X3,X2),
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.36  cnf(c7, plain,
% 0.12/0.36  	~r2(X4,X5) | ~r1(X6),
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.36  
% 0.12/0.36  cnf(c8, axiom,
% 0.12/0.36  	r2(sK31,sK30)).
% 0.12/0.36  cnf(a4, assumption,
% 0.12/0.36  	X4 = sK31).
% 0.12/0.36  cnf(a5, assumption,
% 0.12/0.36  	X5 = sK30).
% 0.12/0.36  cnf(c9, plain,
% 0.12/0.36  	~r1(X6),
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.36  cnf(c10, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.36  
% 0.12/0.36  cnf(c11, axiom,
% 0.12/0.36  	r1(sK33)).
% 0.12/0.36  cnf(a6, assumption,
% 0.12/0.36  	X6 = sK33).
% 0.12/0.36  cnf(c12, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])).
% 0.12/0.36  cnf(c13, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a6])], [c9, c11])).
% 0.12/0.36  
% 0.12/0.36  cnf(c14, axiom,
% 0.12/0.36  	r2(sK30,sK29)).
% 0.12/0.36  cnf(a7, assumption,
% 0.12/0.36  	X1 = sK30).
% 0.12/0.36  cnf(a8, assumption,
% 0.12/0.36  	X2 = sK29).
% 0.12/0.36  cnf(c15, plain,
% 0.12/0.36  	~id(X3,X2),
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c14])).
% 0.12/0.36  cnf(c16, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c6, c14])).
% 0.12/0.36  
% 0.12/0.36  cnf(c17, axiom,
% 0.12/0.36  	id(sK32,sK29)).
% 0.12/0.36  cnf(a9, assumption,
% 0.12/0.36  	X3 = sK32).
% 0.12/0.36  cnf(a10, assumption,
% 0.12/0.36  	X2 = sK29).
% 0.12/0.36  cnf(c18, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])).
% 0.12/0.36  cnf(c19, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c17])).
% 0.12/0.36  
% 0.12/0.36  cnf(c20, plain,
% 0.12/0.36  	$false,
% 0.12/0.36  	inference(constraint_solving, [
% 0.12/0.36  		bind(X0, sK33),
% 0.12/0.36  		bind(X1, sK30),
% 0.12/0.36  		bind(X2, sK29),
% 0.12/0.36  		bind(X3, sK32),
% 0.12/0.36  		bind(X4, sK31),
% 0.12/0.36  		bind(X5, sK30),
% 0.12/0.36  		bind(X6, sK33)
% 0.12/0.36  	],
% 0.12/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.12/0.36  
% 0.12/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------