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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU150+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 : n007.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:53:31 EDT 2022

% Result   : Theorem 0.21s 0.44s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SEU150+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jun 19 11:29:44 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.44  % SZS status Theorem
% 0.21/0.44  % SZS output begin IncompleteProof
% 0.21/0.44  cnf(c0, axiom,
% 0.21/0.44  	sK1 != sK2).
% 0.21/0.44  cnf(c1, plain,
% 0.21/0.44  	sK1 != sK2,
% 0.21/0.44  	inference(start, [], [c0])).
% 0.21/0.44  
% 0.21/0.44  cnf(c2, axiom,
% 0.21/0.44  	X0 = X1 | singleton(X0) != unordered_pair(X1,X2)).
% 0.21/0.44  cnf(a0, assumption,
% 0.21/0.44  	sK2 = X1).
% 0.21/0.44  cnf(c3, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.21/0.44  cnf(c4, plain,
% 0.21/0.44  	singleton(X0) != unordered_pair(X1,X2),
% 0.21/0.44  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.21/0.44  cnf(c5, plain,
% 0.21/0.44  	X0 != X3 | sK1 != X3,
% 0.21/0.44  	inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.21/0.44  
% 0.21/0.44  cnf(a1, assumption,
% 0.21/0.44  	X0 = X3).
% 0.21/0.44  cnf(c6, plain,
% 0.21/0.44  	sK1 != X3,
% 0.21/0.44  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.21/0.44  
% 0.21/0.44  cnf(a2, assumption,
% 0.21/0.44  	sK1 = X3).
% 0.21/0.44  cnf(c7, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(reflexivity, [assumptions([a2])], [c6])).
% 0.21/0.44  
% 0.21/0.44  cnf(c8, axiom,
% 0.21/0.44  	unordered_pair(X4,X5) = unordered_pair(X5,X4)).
% 0.21/0.44  cnf(a3, assumption,
% 0.21/0.44  	unordered_pair(X1,X2) = unordered_pair(X4,X5)).
% 0.21/0.44  cnf(c9, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(strict_function_extension, [assumptions([a3])], [c4, c8])).
% 0.21/0.44  cnf(c10, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(strict_function_extension, [assumptions([a3])], [c4, c8])).
% 0.21/0.44  cnf(c11, plain,
% 0.21/0.44  	X6 != unordered_pair(X5,X4) | singleton(X0) != X6,
% 0.21/0.44  	inference(strict_function_extension, [assumptions([a3])], [c4, c8])).
% 0.21/0.44  
% 0.21/0.44  cnf(c12, axiom,
% 0.21/0.44  	singleton(sK0) = unordered_pair(sK1,sK2)).
% 0.21/0.44  cnf(a4, assumption,
% 0.21/0.44  	unordered_pair(X5,X4) = unordered_pair(sK1,sK2)).
% 0.21/0.44  cnf(c13, plain,
% 0.21/0.44  	singleton(X0) != X6,
% 0.21/0.44  	inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 0.21/0.44  cnf(c14, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 0.21/0.44  cnf(c15, plain,
% 0.21/0.44  	X7 != singleton(sK0) | X6 != X7,
% 0.21/0.44  	inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 0.21/0.44  
% 0.21/0.44  cnf(c16, axiom,
% 0.21/0.44  	X8 = X9 | singleton(X8) != unordered_pair(X9,X10)).
% 0.21/0.44  cnf(a5, assumption,
% 0.21/0.44  	sK0 = X8).
% 0.21/0.44  cnf(c17, plain,
% 0.21/0.44  	X6 != X7,
% 0.21/0.44  	inference(variable_extension, [assumptions([a5])], [c15, c16])).
% 0.21/0.44  cnf(c18, plain,
% 0.21/0.44  	singleton(X8) != unordered_pair(X9,X10),
% 0.21/0.44  	inference(variable_extension, [assumptions([a5])], [c15, c16])).
% 0.21/0.44  cnf(c19, plain,
% 0.21/0.44  	X9 != X11 | X7 != singleton(X11),
% 0.21/0.44  	inference(variable_extension, [assumptions([a5])], [c15, c16])).
% 0.21/0.44  
% 0.21/0.44  cnf(a6, assumption,
% 0.21/0.44  	X9 = X11).
% 0.21/0.44  cnf(c20, plain,
% 0.21/0.44  	X7 != singleton(X11),
% 0.21/0.44  	inference(reflexivity, [assumptions([a6])], [c19])).
% 0.21/0.44  
% 0.21/0.44  cnf(a7, assumption,
% 0.21/0.44  	X7 = singleton(X11)).
% 0.21/0.44  cnf(c21, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(reflexivity, [assumptions([a7])], [c20])).
% 0.21/0.44  
% 0.21/0.44  cnf(c22, plain,
% 0.21/0.44  	singleton(sK0) = unordered_pair(sK1,sK2)).
% 0.21/0.44  cnf(a8, assumption,
% 0.21/0.44  	unordered_pair(X9,X10) = unordered_pair(sK1,sK2)).
% 0.21/0.44  cnf(a9, assumption,
% 0.21/0.44  	singleton(sK0) = X12).
% 0.21/0.44  cnf(c23, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(equality_reduction, [assumptions([a8, a9])], [c18, c22])).
% 0.21/0.44  cnf(c24, plain,
% 0.21/0.44  	singleton(X8) != X12,
% 0.21/0.44  	inference(equality_reduction, [assumptions([a8, a9])], [c18, c22])).
% 0.21/0.44  
% 0.21/0.44  cnf(a10, assumption,
% 0.21/0.44  	singleton(X8) = X12).
% 0.21/0.44  cnf(c25, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(reflexivity, [assumptions([a10])], [c24])).
% 0.21/0.44  
% 0.21/0.44  cnf(a11, assumption,
% 0.21/0.44  	X6 = X7).
% 0.21/0.44  cnf(c26, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(reflexivity, [assumptions([a11])], [c17])).
% 0.21/0.44  
% 0.21/0.44  cnf(a12, assumption,
% 0.21/0.44  	singleton(X0) = X6).
% 0.21/0.44  cnf(c27, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(reflexivity, [assumptions([a12])], [c13])).
% 0.21/0.44  
% 0.21/0.44  cnf(c28, plain,
% 0.21/0.44  	$false,
% 0.21/0.44  	inference(constraint_solving, [
% 0.21/0.44  		bind(X0, sK1),
% 0.21/0.44  		bind(X1, sK2),
% 0.21/0.44  		bind(X2, sK1),
% 0.21/0.44  		bind(X3, sK1),
% 0.21/0.44  		bind(X4, sK2),
% 0.21/0.44  		bind(X5, sK1),
% 0.21/0.44  		bind(X6, singleton(X11)),
% 0.21/0.44  		bind(X7, singleton(X11)),
% 0.21/0.44  		bind(X8, sK0),
% 0.21/0.44  		bind(X9, sK1),
% 0.21/0.44  		bind(X10, sK2),
% 0.21/0.44  		bind(X11, sK1),
% 0.21/0.44  		bind(X12, singleton(sK0))
% 0.21/0.44  	],
% 0.21/0.44  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])).
% 0.21/0.44  
% 0.21/0.44  % SZS output end IncompleteProof
%------------------------------------------------------------------------------