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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU247+1 : TPTP v8.1.0. Released v3.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 : n003.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 : Tue Jul 19 11:54:27 EDT 2022

% Result   : Theorem 0.20s 0.43s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 19 18:16:29 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.43  % SZS status Theorem
% 0.20/0.43  % SZS output begin IncompleteProof
% 0.20/0.43  cnf(c0, axiom,
% 0.20/0.43  	relation_restriction(sK1,sK0) != relation_rng_restriction(sK0,relation_dom_restriction(sK1,sK0))).
% 0.20/0.43  cnf(c1, plain,
% 0.20/0.43  	relation_restriction(sK1,sK0) != relation_rng_restriction(sK0,relation_dom_restriction(sK1,sK0)),
% 0.20/0.43  	inference(start, [], [c0])).
% 0.20/0.43  
% 0.20/0.43  cnf(c2, axiom,
% 0.20/0.43  	relation_dom_restriction(relation_rng_restriction(X0,X1),X2) = relation_rng_restriction(X0,relation_dom_restriction(X1,X2)) | ~relation(X1)).
% 0.20/0.43  cnf(a0, assumption,
% 0.20/0.43  	relation_rng_restriction(sK0,relation_dom_restriction(sK1,sK0)) = relation_rng_restriction(X0,relation_dom_restriction(X1,X2))).
% 0.20/0.43  cnf(c3, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.43  cnf(c4, plain,
% 0.20/0.43  	~relation(X1),
% 0.20/0.43  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.43  cnf(c5, plain,
% 0.20/0.43  	X3 != relation_dom_restriction(relation_rng_restriction(X0,X1),X2) | relation_restriction(sK1,sK0) != X3,
% 0.20/0.43  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.20/0.43  
% 0.20/0.43  cnf(c6, axiom,
% 0.20/0.43  	relation_restriction(X4,X5) = relation_dom_restriction(relation_rng_restriction(X5,X4),X5) | ~relation(X4)).
% 0.20/0.43  cnf(a1, assumption,
% 0.20/0.43  	relation_dom_restriction(relation_rng_restriction(X0,X1),X2) = relation_dom_restriction(relation_rng_restriction(X5,X4),X5)).
% 0.20/0.43  cnf(c7, plain,
% 0.20/0.43  	relation_restriction(sK1,sK0) != X3,
% 0.20/0.43  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.20/0.43  cnf(c8, plain,
% 0.20/0.43  	~relation(X4),
% 0.20/0.43  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.20/0.43  cnf(c9, plain,
% 0.20/0.43  	X6 != relation_restriction(X4,X5) | X3 != X6,
% 0.20/0.43  	inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 0.20/0.43  
% 0.20/0.43  cnf(a2, assumption,
% 0.20/0.43  	X6 = relation_restriction(X4,X5)).
% 0.20/0.43  cnf(c10, plain,
% 0.20/0.43  	X3 != X6,
% 0.20/0.43  	inference(reflexivity, [assumptions([a2])], [c9])).
% 0.20/0.43  
% 0.20/0.43  cnf(a3, assumption,
% 0.20/0.43  	X3 = X6).
% 0.20/0.43  cnf(c11, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(reflexivity, [assumptions([a3])], [c10])).
% 0.20/0.43  
% 0.20/0.43  cnf(c12, axiom,
% 0.20/0.43  	relation(sK1)).
% 0.20/0.43  cnf(a4, assumption,
% 0.20/0.43  	X4 = sK1).
% 0.20/0.43  cnf(c13, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 0.20/0.43  cnf(c14, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(strict_predicate_extension, [assumptions([a4])], [c8, c12])).
% 0.20/0.43  
% 0.20/0.43  cnf(a5, assumption,
% 0.20/0.43  	relation_restriction(sK1,sK0) = X3).
% 0.20/0.43  cnf(c15, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(reflexivity, [assumptions([a5])], [c7])).
% 0.20/0.43  
% 0.20/0.43  cnf(c16, plain,
% 0.20/0.43  	relation(X4)).
% 0.20/0.43  cnf(a6, assumption,
% 0.20/0.43  	X1 = X4).
% 0.20/0.43  cnf(c17, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(predicate_reduction, [assumptions([a6])], [c4, c16])).
% 0.20/0.43  
% 0.20/0.43  cnf(c18, plain,
% 0.20/0.43  	$false,
% 0.20/0.43  	inference(constraint_solving, [
% 0.20/0.43  		bind(X0, sK0),
% 0.20/0.43  		bind(X1, sK1),
% 0.20/0.43  		bind(X2, sK0),
% 0.20/0.43  		bind(X3, relation_restriction(X4,X5)),
% 0.20/0.43  		bind(X4, sK1),
% 0.20/0.43  		bind(X5, sK0),
% 0.20/0.43  		bind(X6, relation_restriction(X4,X5))
% 0.20/0.43  	],
% 0.20/0.43  	[a0, a1, a2, a3, a4, a5, a6])).
% 0.20/0.43  
% 0.20/0.43  % SZS output end IncompleteProof
%------------------------------------------------------------------------------