TSTP Solution File: LCL678+1.001 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL678+1.001 : 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 : n019.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:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n019.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 : Sun Jul  3 07:03:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % SZS status Theorem
% 0.13/0.35  % SZS output begin IncompleteProof
% 0.13/0.35  cnf(c0, axiom,
% 0.13/0.35  	sP1(X0) | ~r1(sK4,X0)).
% 0.13/0.35  cnf(c1, plain,
% 0.13/0.35  	sP1(X0) | ~r1(sK4,X0),
% 0.13/0.35  	inference(start, [], [c0])).
% 0.13/0.35  
% 0.13/0.35  cnf(c2, axiom,
% 0.13/0.35  	p1(X1) | ~r1(sK2(X2),X1) | ~sP1(X2)).
% 0.13/0.35  cnf(a0, assumption,
% 0.13/0.35  	X0 = X2).
% 0.13/0.35  cnf(c3, plain,
% 0.13/0.35  	~r1(sK4,X0),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35  cnf(c4, plain,
% 0.13/0.35  	p1(X1) | ~r1(sK2(X2),X1),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35  
% 0.13/0.35  cnf(c5, axiom,
% 0.13/0.35  	~p1(sK3(X3)) | ~sP0(X3)).
% 0.13/0.35  cnf(a1, assumption,
% 0.13/0.35  	X1 = sK3(X3)).
% 0.13/0.35  cnf(c6, plain,
% 0.13/0.35  	~r1(sK2(X2),X1),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35  cnf(c7, plain,
% 0.13/0.35  	~sP0(X3),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.35  
% 0.13/0.35  cnf(c8, axiom,
% 0.13/0.35  	sP0(sK2(X4)) | ~sP1(X4)).
% 0.13/0.35  cnf(a2, assumption,
% 0.13/0.35  	X3 = sK2(X4)).
% 0.13/0.35  cnf(c9, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35  cnf(c10, plain,
% 0.13/0.35  	~sP1(X4),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.13/0.35  
% 0.13/0.35  cnf(c11, plain,
% 0.13/0.35  	sP1(X0)).
% 0.13/0.35  cnf(a3, assumption,
% 0.13/0.35  	X4 = X0).
% 0.13/0.35  cnf(c12, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a3])], [c10, c11])).
% 0.13/0.35  
% 0.13/0.35  cnf(c13, axiom,
% 0.13/0.35  	r1(X5,sK3(X5)) | ~sP0(X5)).
% 0.13/0.35  cnf(a4, assumption,
% 0.13/0.35  	sK2(X2) = X5).
% 0.13/0.35  cnf(a5, assumption,
% 0.13/0.35  	X1 = sK3(X5)).
% 0.13/0.35  cnf(c14, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c13])).
% 0.13/0.35  cnf(c15, plain,
% 0.13/0.35  	~sP0(X5),
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c13])).
% 0.13/0.35  
% 0.13/0.35  cnf(c16, plain,
% 0.13/0.35  	sP0(X3)).
% 0.13/0.35  cnf(a6, assumption,
% 0.13/0.35  	X5 = X3).
% 0.13/0.35  cnf(c17, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(predicate_reduction, [assumptions([a6])], [c15, c16])).
% 0.13/0.35  
% 0.13/0.35  cnf(c18, axiom,
% 0.13/0.35  	r1(X6,X6)).
% 0.13/0.35  cnf(a7, assumption,
% 0.13/0.35  	sK4 = X6).
% 0.13/0.35  cnf(a8, assumption,
% 0.13/0.35  	X0 = X6).
% 0.13/0.35  cnf(c19, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c3, c18])).
% 0.13/0.35  cnf(c20, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c3, c18])).
% 0.13/0.35  
% 0.13/0.35  cnf(c21, plain,
% 0.13/0.35  	$false,
% 0.13/0.35  	inference(constraint_solving, [
% 0.13/0.35  		bind(X0, sK4),
% 0.13/0.35  		bind(X1, sK3(X3)),
% 0.13/0.35  		bind(X2, sK4),
% 0.13/0.35  		bind(X3, sK2(X4)),
% 0.13/0.35  		bind(X4, sK4),
% 0.13/0.35  		bind(X5, sK2(X2)),
% 0.13/0.35  		bind(X6, sK4)
% 0.13/0.35  	],
% 0.13/0.35  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.13/0.35  
% 0.13/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------