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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUN060+2 : 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 : n028.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:22 EDT 2022

% Result   : Theorem 0.14s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUN060+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  2 10:08:38 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % SZS status Theorem
% 0.14/0.35  % SZS output begin IncompleteProof
% 0.14/0.35  cnf(c0, axiom,
% 0.14/0.35  	~r2(X0,X1) | ~r1(X0) | ~r2(X1,X2) | ~r2(X2,X3) | ~r2(X3,X4) | ~r3(X5,X4,X6)).
% 0.14/0.35  cnf(c1, plain,
% 0.14/0.35  	~r2(X0,X1) | ~r1(X0) | ~r2(X1,X2) | ~r2(X2,X3) | ~r2(X3,X4) | ~r3(X5,X4,X6),
% 0.14/0.35  	inference(start, [], [c0])).
% 0.14/0.35  
% 0.14/0.35  cnf(c2, axiom,
% 0.14/0.35  	r2(X7,sK12(X8,X7))).
% 0.14/0.35  cnf(a0, assumption,
% 0.14/0.35  	X0 = X7).
% 0.14/0.35  cnf(a1, assumption,
% 0.14/0.35  	X1 = sK12(X8,X7)).
% 0.14/0.35  cnf(c3, plain,
% 0.14/0.35  	~r1(X0) | ~r2(X1,X2) | ~r2(X2,X3) | ~r2(X3,X4) | ~r3(X5,X4,X6),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35  cnf(c4, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35  
% 0.14/0.35  cnf(c5, axiom,
% 0.14/0.35  	r1(sK20(X9))).
% 0.14/0.35  cnf(a2, assumption,
% 0.14/0.35  	X0 = sK20(X9)).
% 0.14/0.35  cnf(c6, plain,
% 0.14/0.35  	~r2(X1,X2) | ~r2(X2,X3) | ~r2(X3,X4) | ~r3(X5,X4,X6),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c3, c5])).
% 0.14/0.35  cnf(c7, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c3, c5])).
% 0.14/0.35  
% 0.14/0.35  cnf(c8, axiom,
% 0.14/0.35  	r2(X10,sK16(X11,X10))).
% 0.14/0.35  cnf(a3, assumption,
% 0.14/0.35  	X1 = X10).
% 0.14/0.35  cnf(a4, assumption,
% 0.14/0.35  	X2 = sK16(X11,X10)).
% 0.14/0.35  cnf(c9, plain,
% 0.14/0.35  	~r2(X2,X3) | ~r2(X3,X4) | ~r3(X5,X4,X6),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.14/0.35  cnf(c10, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.14/0.35  
% 0.14/0.35  cnf(c11, axiom,
% 0.14/0.35  	r2(X12,sK12(X13,X12))).
% 0.14/0.35  cnf(a5, assumption,
% 0.14/0.35  	X2 = X12).
% 0.14/0.35  cnf(a6, assumption,
% 0.14/0.35  	X3 = sK12(X13,X12)).
% 0.14/0.35  cnf(c12, plain,
% 0.14/0.35  	~r2(X3,X4) | ~r3(X5,X4,X6),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.14/0.35  cnf(c13, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.14/0.35  
% 0.14/0.35  cnf(c14, axiom,
% 0.14/0.35  	r2(X14,sK12(X15,X14))).
% 0.14/0.35  cnf(a7, assumption,
% 0.14/0.35  	X3 = X14).
% 0.14/0.35  cnf(a8, assumption,
% 0.14/0.35  	X4 = sK12(X15,X14)).
% 0.14/0.35  cnf(c15, plain,
% 0.14/0.35  	~r3(X5,X4,X6),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 0.14/0.35  cnf(c16, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c12, c14])).
% 0.14/0.35  
% 0.14/0.35  cnf(c17, axiom,
% 0.14/0.35  	r3(X16,X17,sK10(X16,X17))).
% 0.14/0.35  cnf(a9, assumption,
% 0.14/0.35  	X5 = X16).
% 0.14/0.35  cnf(a10, assumption,
% 0.14/0.35  	X4 = X17).
% 0.14/0.35  cnf(a11, assumption,
% 0.14/0.35  	X6 = sK10(X16,X17)).
% 0.14/0.35  cnf(c18, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c15, c17])).
% 0.14/0.35  cnf(c19, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c15, c17])).
% 0.14/0.35  
% 0.14/0.35  cnf(c20, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(constraint_solving, [
% 0.14/0.35  		bind(X0, sK20(X9)),
% 0.14/0.35  		bind(X1, sK12(X8,X7)),
% 0.14/0.35  		bind(X2, sK16(X11,X10)),
% 0.14/0.35  		bind(X3, sK12(X13,X12)),
% 0.14/0.35  		bind(X4, sK12(X15,X14)),
% 0.14/0.35  		bind(X5, X16),
% 0.14/0.35  		bind(X6, sK10(X16,X17)),
% 0.14/0.35  		bind(X7, sK20(X9)),
% 0.14/0.35  		bind(X8, X8),
% 0.14/0.35  		bind(X9, X9),
% 0.14/0.35  		bind(X10, sK12(X8,X7)),
% 0.14/0.35  		bind(X11, X11),
% 0.14/0.35  		bind(X12, sK16(X11,X10)),
% 0.14/0.35  		bind(X13, X13),
% 0.14/0.35  		bind(X14, sK12(X13,X12)),
% 0.14/0.35  		bind(X15, X15),
% 0.14/0.35  		bind(X16, X16),
% 0.14/0.35  		bind(X17, sK12(X15,X14))
% 0.14/0.35  	],
% 0.14/0.35  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.14/0.35  
% 0.14/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------