TSTP Solution File: CSR115+4 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR115+4 : 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 : 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 : Fri Jul 15 20:37:39 EDT 2022

% Result   : Theorem 1.76s 0.66s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : CSR115+4 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.09  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Sat Jun 11 12:44:09 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 1.76/0.66  % SZS status Theorem
% 1.76/0.66  % SZS output begin IncompleteProof
% 1.76/0.66  cnf(c0, axiom,
% 1.76/0.66  	~obj(X0,X1)).
% 1.76/0.66  cnf(c1, plain,
% 1.76/0.66  	~obj(X0,X1),
% 1.76/0.66  	inference(start, [], [c0])).
% 1.76/0.66  
% 1.76/0.66  cnf(c2, axiom,
% 1.76/0.66  	obj(sK103(X2,X3,X4),X3) | ~sP38(X2,X3,X4)).
% 1.76/0.66  cnf(a0, assumption,
% 1.76/0.66  	X0 = sK103(X2,X3,X4)).
% 1.76/0.66  cnf(a1, assumption,
% 1.76/0.66  	X1 = X3).
% 1.76/0.66  cnf(c3, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.76/0.66  cnf(c4, plain,
% 1.76/0.66  	~sP38(X2,X3,X4),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 1.76/0.66  
% 1.76/0.66  cnf(c5, axiom,
% 1.76/0.66  	sP38(X5,X6,X7) | ~subr(X7,sub_0) | ~arg2(X7,X5) | ~arg1(X7,X6)).
% 1.76/0.66  cnf(a2, assumption,
% 1.76/0.66  	X2 = X5).
% 1.76/0.66  cnf(a3, assumption,
% 1.76/0.66  	X3 = X6).
% 1.76/0.66  cnf(a4, assumption,
% 1.76/0.66  	X4 = X7).
% 1.76/0.66  cnf(c6, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 1.76/0.66  cnf(c7, plain,
% 1.76/0.66  	~subr(X7,sub_0) | ~arg2(X7,X5) | ~arg1(X7,X6),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 1.76/0.66  
% 1.76/0.66  cnf(c8, axiom,
% 1.76/0.66  	subr(sK106(X8,X9),sub_0) | ~sP39(X8,X9)).
% 1.76/0.66  cnf(a5, assumption,
% 1.76/0.66  	X7 = sK106(X8,X9)).
% 1.76/0.66  cnf(a6, assumption,
% 1.76/0.66  	sub_0 = sub_0).
% 1.76/0.66  cnf(c9, plain,
% 1.76/0.66  	~arg2(X7,X5) | ~arg1(X7,X6),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 1.76/0.66  cnf(c10, plain,
% 1.76/0.66  	~sP39(X8,X9),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 1.76/0.66  
% 1.76/0.66  cnf(c11, axiom,
% 1.76/0.66  	sP39(X10,X11) | ~sub(X11,X10)).
% 1.76/0.66  cnf(a7, assumption,
% 1.76/0.66  	X8 = X10).
% 1.76/0.66  cnf(a8, assumption,
% 1.76/0.66  	X9 = X11).
% 1.76/0.66  cnf(c12, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 1.76/0.66  cnf(c13, plain,
% 1.76/0.66  	~sub(X11,X10),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 1.76/0.66  
% 1.76/0.66  cnf(c14, axiom,
% 1.76/0.66  	sub(algerierin_1_1,algerier_1_1)).
% 1.76/0.66  cnf(a9, assumption,
% 1.76/0.66  	X11 = algerierin_1_1).
% 1.76/0.66  cnf(a10, assumption,
% 1.76/0.66  	X10 = algerier_1_1).
% 1.76/0.66  cnf(c15, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])).
% 1.76/0.66  cnf(c16, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])).
% 1.76/0.66  
% 1.76/0.66  cnf(c17, axiom,
% 1.76/0.66  	arg2(sK106(X12,X13),X12) | ~sP39(X12,X13)).
% 1.76/0.66  cnf(a11, assumption,
% 1.76/0.66  	X7 = sK106(X12,X13)).
% 1.76/0.66  cnf(a12, assumption,
% 1.76/0.66  	X5 = X12).
% 1.76/0.66  cnf(c18, plain,
% 1.76/0.66  	~arg1(X7,X6),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c17])).
% 1.76/0.66  cnf(c19, plain,
% 1.76/0.66  	~sP39(X12,X13),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c17])).
% 1.76/0.66  
% 1.76/0.66  cnf(c20, plain,
% 1.76/0.66  	sP39(X8,X9)).
% 1.76/0.66  cnf(a13, assumption,
% 1.76/0.66  	X12 = X8).
% 1.76/0.66  cnf(a14, assumption,
% 1.76/0.66  	X13 = X9).
% 1.76/0.66  cnf(c21, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(predicate_reduction, [assumptions([a13, a14])], [c19, c20])).
% 1.76/0.66  
% 1.76/0.66  cnf(c22, axiom,
% 1.76/0.66  	arg1(sK106(X14,X15),X15) | ~sP39(X14,X15)).
% 1.76/0.66  cnf(a15, assumption,
% 1.76/0.66  	X7 = sK106(X14,X15)).
% 1.76/0.66  cnf(a16, assumption,
% 1.76/0.66  	X6 = X15).
% 1.76/0.66  cnf(c23, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c18, c22])).
% 1.76/0.66  cnf(c24, plain,
% 1.76/0.66  	~sP39(X14,X15),
% 1.76/0.66  	inference(strict_predicate_extension, [assumptions([a15, a16])], [c18, c22])).
% 1.76/0.66  
% 1.76/0.66  cnf(c25, plain,
% 1.76/0.66  	sP39(X8,X9)).
% 1.76/0.66  cnf(a17, assumption,
% 1.76/0.66  	X14 = X8).
% 1.76/0.66  cnf(a18, assumption,
% 1.76/0.66  	X15 = X9).
% 1.76/0.66  cnf(c26, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(predicate_reduction, [assumptions([a17, a18])], [c24, c25])).
% 1.76/0.66  
% 1.76/0.66  cnf(c27, plain,
% 1.76/0.66  	$false,
% 1.76/0.66  	inference(constraint_solving, [
% 1.76/0.66  		bind(X0, sK103(X2,X3,X4)),
% 1.76/0.66  		bind(X1, algerierin_1_1),
% 1.76/0.66  		bind(X2, algerier_1_1),
% 1.76/0.66  		bind(X3, algerierin_1_1),
% 1.76/0.66  		bind(X4, sK106(X8,X9)),
% 1.76/0.66  		bind(X5, algerier_1_1),
% 1.76/0.66  		bind(X6, algerierin_1_1),
% 1.76/0.66  		bind(X7, sK106(X8,X9)),
% 1.76/0.66  		bind(X8, algerier_1_1),
% 1.76/0.66  		bind(X9, algerierin_1_1),
% 1.76/0.66  		bind(X10, algerier_1_1),
% 1.76/0.66  		bind(X11, algerierin_1_1),
% 1.76/0.66  		bind(X12, algerier_1_1),
% 1.76/0.66  		bind(X13, algerierin_1_1),
% 1.76/0.66  		bind(X14, algerier_1_1),
% 1.76/0.66  		bind(X15, algerierin_1_1)
% 1.76/0.66  	],
% 1.76/0.66  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 1.76/0.66  
% 1.76/0.66  % SZS output end IncompleteProof
%------------------------------------------------------------------------------