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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : KLE053+1 : 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 02:09:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KLE053+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 12:12:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.40  % SZS status Theorem
% 0.12/0.40  % SZS output begin IncompleteProof
% 0.12/0.40  cnf(c0, axiom,
% 0.12/0.40  	domain(sK0) != domain(domain(sK0))).
% 0.12/0.40  cnf(c1, plain,
% 0.12/0.40  	domain(sK0) != domain(domain(sK0)),
% 0.12/0.40  	inference(start, [], [c0])).
% 0.12/0.40  
% 0.12/0.40  cnf(c2, axiom,
% 0.12/0.40  	domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1)))).
% 0.12/0.40  cnf(a0, assumption,
% 0.12/0.40  	domain(X2) = domain(domain(sK0))).
% 0.12/0.40  cnf(c3, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.40  cnf(c4, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.40  cnf(c5, plain,
% 0.12/0.40  	X2 != multiplication(X0,domain(X1)) | X3 != domain(multiplication(X0,X1)) | domain(sK0) != X3,
% 0.12/0.40  	inference(lazy_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.40  
% 0.12/0.40  cnf(c6, axiom,
% 0.12/0.40  	multiplication(one,X4) = X4).
% 0.12/0.40  cnf(a1, assumption,
% 0.12/0.40  	multiplication(X0,domain(X1)) = multiplication(one,X4)).
% 0.12/0.40  cnf(c7, plain,
% 0.12/0.40  	X3 != domain(multiplication(X0,X1)) | domain(sK0) != X3,
% 0.12/0.40  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.40  cnf(c8, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.40  cnf(c9, plain,
% 0.12/0.40  	X5 != X4 | X2 != X5,
% 0.12/0.40  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.12/0.40  
% 0.12/0.40  cnf(a2, assumption,
% 0.12/0.40  	X5 = X4).
% 0.12/0.40  cnf(c10, plain,
% 0.12/0.40  	X2 != X5,
% 0.12/0.40  	inference(reflexivity, [assumptions([a2])], [c9])).
% 0.12/0.40  
% 0.12/0.40  cnf(a3, assumption,
% 0.12/0.40  	X2 = X5).
% 0.12/0.40  cnf(c11, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(reflexivity, [assumptions([a3])], [c10])).
% 0.12/0.40  
% 0.12/0.40  cnf(c12, axiom,
% 0.12/0.40  	multiplication(one,X6) = X6).
% 0.12/0.40  cnf(a4, assumption,
% 0.12/0.40  	multiplication(X0,X1) = multiplication(one,X6)).
% 0.12/0.40  cnf(c13, plain,
% 0.12/0.40  	domain(sK0) != X3,
% 0.12/0.40  	inference(strict_function_extension, [assumptions([a4])], [c7, c12])).
% 0.12/0.40  cnf(c14, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(strict_function_extension, [assumptions([a4])], [c7, c12])).
% 0.12/0.40  cnf(c15, plain,
% 0.12/0.40  	X7 != X6 | X3 != domain(X7),
% 0.12/0.40  	inference(strict_function_extension, [assumptions([a4])], [c7, c12])).
% 0.12/0.40  
% 0.12/0.40  cnf(a5, assumption,
% 0.12/0.40  	X7 = X6).
% 0.12/0.40  cnf(c16, plain,
% 0.12/0.40  	X3 != domain(X7),
% 0.12/0.40  	inference(reflexivity, [assumptions([a5])], [c15])).
% 0.12/0.40  
% 0.12/0.40  cnf(a6, assumption,
% 0.12/0.40  	X3 = domain(X7)).
% 0.12/0.40  cnf(c17, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(reflexivity, [assumptions([a6])], [c16])).
% 0.12/0.40  
% 0.12/0.40  cnf(a7, assumption,
% 0.12/0.40  	domain(sK0) = X3).
% 0.12/0.40  cnf(c18, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(reflexivity, [assumptions([a7])], [c13])).
% 0.12/0.40  
% 0.12/0.40  cnf(c19, plain,
% 0.12/0.40  	$false,
% 0.12/0.40  	inference(constraint_solving, [
% 0.12/0.40  		bind(X0, one),
% 0.12/0.40  		bind(X1, sK0),
% 0.12/0.40  		bind(X3, domain(X7)),
% 0.12/0.40  		bind(X2, domain(sK0)),
% 0.12/0.40  		bind(X4, domain(X1)),
% 0.12/0.40  		bind(X5, domain(X1)),
% 0.12/0.40  		bind(X6, sK0),
% 0.12/0.40  		bind(X7, sK0)
% 0.12/0.40  	],
% 0.12/0.40  	[a0, a1, a2, a3, a4, a5, a6, a7])).
% 0.12/0.40  
% 0.12/0.40  % SZS output end IncompleteProof
%------------------------------------------------------------------------------