TSTP Solution File: LCL686+1.005 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL686+1.005 : 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 : n011.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 : Sun Jul 17 12:11:18 EDT 2022

% Result   : Theorem 2.18s 0.70s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL686+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul  4 10:37:36 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.18/0.70  % SZS status Theorem
% 2.18/0.70  % SZS output begin IncompleteProof
% 2.18/0.70  cnf(c0, axiom,
% 2.18/0.70  	sP27(X0) | ~r1(sK44,X0)).
% 2.18/0.70  cnf(c1, plain,
% 2.18/0.70  	sP27(X0) | ~r1(sK44,X0),
% 2.18/0.70  	inference(start, [], [c0])).
% 2.18/0.70  
% 2.18/0.70  cnf(c2, axiom,
% 2.18/0.70  	sP24(X1) | ~sP27(X1)).
% 2.18/0.70  cnf(a0, assumption,
% 2.18/0.70  	X0 = X1).
% 2.18/0.70  cnf(c3, plain,
% 2.18/0.70  	~r1(sK44,X0),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.18/0.70  cnf(c4, plain,
% 2.18/0.70  	sP24(X1),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.18/0.70  
% 2.18/0.70  cnf(c5, axiom,
% 2.18/0.70  	r1(X2,sK29(X2)) | ~sP24(X2)).
% 2.18/0.70  cnf(a1, assumption,
% 2.18/0.70  	X1 = X2).
% 2.18/0.70  cnf(c6, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 2.18/0.70  cnf(c7, plain,
% 2.18/0.70  	r1(X2,sK29(X2)),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 2.18/0.70  
% 2.18/0.70  cnf(c8, axiom,
% 2.18/0.70  	p1(X3) | ~p2(X3) | ~r1(X4,X3) | ~sP25(X4)).
% 2.18/0.70  cnf(a2, assumption,
% 2.18/0.70  	X2 = X4).
% 2.18/0.70  cnf(a3, assumption,
% 2.18/0.70  	sK29(X2) = X3).
% 2.18/0.70  cnf(c9, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 2.18/0.70  cnf(c10, plain,
% 2.18/0.70  	p1(X3) | ~p2(X3) | ~sP25(X4),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 2.18/0.70  
% 2.18/0.70  cnf(c11, axiom,
% 2.18/0.70  	~p1(sK29(X5)) | ~p2(sK29(X5)) | ~sP24(X5)).
% 2.18/0.70  cnf(a4, assumption,
% 2.18/0.70  	X3 = sK29(X5)).
% 2.18/0.70  cnf(c12, plain,
% 2.18/0.70  	~p2(X3) | ~sP25(X4),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 2.18/0.70  cnf(c13, plain,
% 2.18/0.70  	~p2(sK29(X5)) | ~sP24(X5),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 2.18/0.70  
% 2.18/0.70  cnf(c14, axiom,
% 2.18/0.70  	~p1(X6) | p2(X6) | ~r1(X7,X6) | ~sP25(X7)).
% 2.18/0.70  cnf(a5, assumption,
% 2.18/0.70  	sK29(X5) = X6).
% 2.18/0.70  cnf(c15, plain,
% 2.18/0.70  	~sP24(X5),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 2.18/0.70  cnf(c16, plain,
% 2.18/0.70  	~p1(X6) | ~r1(X7,X6) | ~sP25(X7),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 2.18/0.70  
% 2.18/0.70  cnf(c17, plain,
% 2.18/0.70  	p1(X3)).
% 2.18/0.70  cnf(a6, assumption,
% 2.18/0.70  	X6 = X3).
% 2.18/0.70  cnf(c18, plain,
% 2.18/0.70  	~r1(X7,X6) | ~sP25(X7),
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a6])], [c16, c17])).
% 2.18/0.70  
% 2.18/0.70  cnf(c19, plain,
% 2.18/0.70  	r1(X2,sK29(X2))).
% 2.18/0.70  cnf(a7, assumption,
% 2.18/0.70  	X7 = X2).
% 2.18/0.70  cnf(a8, assumption,
% 2.18/0.70  	X6 = sK29(X2)).
% 2.18/0.70  cnf(c20, plain,
% 2.18/0.70  	~sP25(X7),
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a7, a8])], [c18, c19])).
% 2.18/0.70  
% 2.18/0.70  cnf(c21, axiom,
% 2.18/0.70  	sP25(X8) | ~sP27(X8)).
% 2.18/0.70  cnf(a9, assumption,
% 2.18/0.70  	X7 = X8).
% 2.18/0.70  cnf(c22, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a9])], [c20, c21])).
% 2.18/0.70  cnf(c23, plain,
% 2.18/0.70  	~sP27(X8),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a9])], [c20, c21])).
% 2.18/0.70  
% 2.18/0.70  cnf(c24, plain,
% 2.18/0.70  	sP27(X0)).
% 2.18/0.70  cnf(a10, assumption,
% 2.18/0.70  	X8 = X0).
% 2.18/0.70  cnf(c25, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a10])], [c23, c24])).
% 2.18/0.70  
% 2.18/0.70  cnf(c26, plain,
% 2.18/0.70  	sP24(X1)).
% 2.18/0.70  cnf(a11, assumption,
% 2.18/0.70  	X5 = X1).
% 2.18/0.70  cnf(c27, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a11])], [c15, c26])).
% 2.18/0.70  
% 2.18/0.70  cnf(c28, axiom,
% 2.18/0.70  	p2(sK29(X9)) | p1(sK29(X9)) | ~sP24(X9)).
% 2.18/0.70  cnf(a12, assumption,
% 2.18/0.70  	X3 = sK29(X9)).
% 2.18/0.70  cnf(c29, plain,
% 2.18/0.70  	~sP25(X4),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a12])], [c12, c28])).
% 2.18/0.70  cnf(c30, plain,
% 2.18/0.70  	p1(sK29(X9)) | ~sP24(X9),
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a12])], [c12, c28])).
% 2.18/0.70  
% 2.18/0.70  cnf(c31, plain,
% 2.18/0.70  	~p1(X3)).
% 2.18/0.70  cnf(a13, assumption,
% 2.18/0.70  	sK29(X9) = X3).
% 2.18/0.70  cnf(c32, plain,
% 2.18/0.70  	~sP24(X9),
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a13])], [c30, c31])).
% 2.18/0.70  
% 2.18/0.70  cnf(c33, plain,
% 2.18/0.70  	sP24(X1)).
% 2.18/0.70  cnf(a14, assumption,
% 2.18/0.70  	X9 = X1).
% 2.18/0.70  cnf(c34, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a14])], [c32, c33])).
% 2.18/0.70  
% 2.18/0.70  cnf(c35, plain,
% 2.18/0.70  	sP25(X7)).
% 2.18/0.70  cnf(a15, assumption,
% 2.18/0.70  	X4 = X7).
% 2.18/0.70  cnf(c36, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(predicate_reduction, [assumptions([a15])], [c29, c35])).
% 2.18/0.70  
% 2.18/0.70  cnf(c37, axiom,
% 2.18/0.70  	r1(X10,X10)).
% 2.18/0.70  cnf(a16, assumption,
% 2.18/0.70  	sK44 = X10).
% 2.18/0.70  cnf(a17, assumption,
% 2.18/0.70  	X0 = X10).
% 2.18/0.70  cnf(c38, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])).
% 2.18/0.70  cnf(c39, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])).
% 2.18/0.70  
% 2.18/0.70  cnf(c40, plain,
% 2.18/0.70  	$false,
% 2.18/0.70  	inference(constraint_solving, [
% 2.18/0.70  		bind(X0, sK44),
% 2.18/0.70  		bind(X1, sK44),
% 2.18/0.70  		bind(X2, sK44),
% 2.18/0.70  		bind(X3, sK29(X2)),
% 2.18/0.70  		bind(X4, sK44),
% 2.18/0.70  		bind(X5, sK44),
% 2.18/0.70  		bind(X6, sK29(X5)),
% 2.18/0.70  		bind(X7, sK44),
% 2.18/0.70  		bind(X8, sK44),
% 2.18/0.70  		bind(X9, sK44),
% 2.18/0.70  		bind(X10, sK44)
% 2.18/0.70  	],
% 2.18/0.70  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 2.18/0.70  
% 2.18/0.70  % SZS output end IncompleteProof
%------------------------------------------------------------------------------