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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n012.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 02:49:11 EDT 2022

% Result   : Theorem 156.64s 20.20s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n012.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 10 23:01:43 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 156.64/20.20  % SZS status Theorem
% 156.64/20.20  % SZS output begin IncompleteProof
% 156.64/20.20  cnf(c0, axiom,
% 156.64/20.20  	singleton(sK10) = set_intersection2(unordered_pair(sK10,sK11),sK12)).
% 156.64/20.20  cnf(c1, plain,
% 156.64/20.20  	singleton(sK10) = set_intersection2(unordered_pair(sK10,sK11),sK12),
% 156.64/20.20  	inference(start, [], [c0])).
% 156.64/20.20  
% 156.64/20.20  cnf(c2, axiom,
% 156.64/20.20  	sP4(X0,X1,set_intersection2(X0,X1))).
% 156.64/20.20  cnf(a0, assumption,
% 156.64/20.20  	set_intersection2(X0,X1) = set_intersection2(unordered_pair(sK10,sK11),sK12)).
% 156.64/20.20  cnf(a1, assumption,
% 156.64/20.20  	singleton(sK10) = X2).
% 156.64/20.20  cnf(c3, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 156.64/20.20  cnf(c4, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 156.64/20.20  cnf(c5, plain,
% 156.64/20.20  	sP4(X0,X1,X2),
% 156.64/20.20  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 156.64/20.20  
% 156.64/20.20  cnf(c6, axiom,
% 156.64/20.20  	in(X3,X4) | ~sP3(X5,X3,X6) | ~sP4(X6,X5,X4)).
% 156.64/20.20  cnf(a2, assumption,
% 156.64/20.20  	X0 = X6).
% 156.64/20.20  cnf(a3, assumption,
% 156.64/20.20  	X1 = X5).
% 156.64/20.20  cnf(a4, assumption,
% 156.64/20.20  	X2 = X4).
% 156.64/20.20  cnf(c7, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 156.64/20.20  cnf(c8, plain,
% 156.64/20.20  	in(X3,X4) | ~sP3(X5,X3,X6),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 156.64/20.20  
% 156.64/20.20  cnf(c9, axiom,
% 156.64/20.20  	X7 = X8 | ~in(X8,X9) | ~sP0(X7,X9)).
% 156.64/20.20  cnf(a5, assumption,
% 156.64/20.20  	X3 = X8).
% 156.64/20.20  cnf(a6, assumption,
% 156.64/20.20  	X4 = X9).
% 156.64/20.20  cnf(c10, plain,
% 156.64/20.20  	~sP3(X5,X3,X6),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])).
% 156.64/20.20  cnf(c11, plain,
% 156.64/20.20  	X7 = X8 | ~sP0(X7,X9),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])).
% 156.64/20.20  
% 156.64/20.20  cnf(c12, axiom,
% 156.64/20.20  	sK10 != sK11).
% 156.64/20.20  cnf(a7, assumption,
% 156.64/20.20  	sK11 = X8).
% 156.64/20.20  cnf(c13, plain,
% 156.64/20.20  	~sP0(X7,X9),
% 156.64/20.20  	inference(strict_subterm_extension, [assumptions([a7])], [c11, c12])).
% 156.64/20.20  cnf(c14, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_subterm_extension, [assumptions([a7])], [c11, c12])).
% 156.64/20.20  cnf(c15, plain,
% 156.64/20.20  	sK10 != X7,
% 156.64/20.20  	inference(strict_subterm_extension, [assumptions([a7])], [c11, c12])).
% 156.64/20.20  
% 156.64/20.20  cnf(a8, assumption,
% 156.64/20.20  	sK10 = X7).
% 156.64/20.20  cnf(c16, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(reflexivity, [assumptions([a8])], [c15])).
% 156.64/20.20  
% 156.64/20.20  cnf(c17, axiom,
% 156.64/20.20  	sP0(X10,singleton(X10))).
% 156.64/20.20  cnf(a9, assumption,
% 156.64/20.20  	X7 = X10).
% 156.64/20.20  cnf(a10, assumption,
% 156.64/20.20  	X9 = singleton(X10)).
% 156.64/20.20  cnf(c18, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c17])).
% 156.64/20.20  cnf(c19, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c17])).
% 156.64/20.20  
% 156.64/20.20  cnf(c20, axiom,
% 156.64/20.20  	sP3(X11,X12,X13) | ~in(X12,X11) | ~in(X12,X13)).
% 156.64/20.20  cnf(a11, assumption,
% 156.64/20.20  	X5 = X11).
% 156.64/20.20  cnf(a12, assumption,
% 156.64/20.20  	X3 = X12).
% 156.64/20.20  cnf(a13, assumption,
% 156.64/20.20  	X6 = X13).
% 156.64/20.20  cnf(c21, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c10, c20])).
% 156.64/20.20  cnf(c22, plain,
% 156.64/20.20  	~in(X12,X11) | ~in(X12,X13),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c10, c20])).
% 156.64/20.20  
% 156.64/20.20  cnf(c23, axiom,
% 156.64/20.20  	in(sK11,sK12)).
% 156.64/20.20  cnf(a14, assumption,
% 156.64/20.20  	X12 = sK11).
% 156.64/20.20  cnf(a15, assumption,
% 156.64/20.20  	X11 = sK12).
% 156.64/20.20  cnf(c24, plain,
% 156.64/20.20  	~in(X12,X13),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 156.64/20.20  cnf(c25, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 156.64/20.20  
% 156.64/20.20  cnf(c26, axiom,
% 156.64/20.20  	in(X14,X15) | ~sP1(X14,X16,X17) | ~sP2(X17,X16,X15)).
% 156.64/20.20  cnf(a16, assumption,
% 156.64/20.20  	X12 = X14).
% 156.64/20.20  cnf(a17, assumption,
% 156.64/20.20  	X13 = X15).
% 156.64/20.20  cnf(c27, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])).
% 156.64/20.20  cnf(c28, plain,
% 156.64/20.20  	~sP1(X14,X16,X17) | ~sP2(X17,X16,X15),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])).
% 156.64/20.20  
% 156.64/20.20  cnf(c29, axiom,
% 156.64/20.20  	sP1(X18,X18,X19)).
% 156.64/20.20  cnf(a18, assumption,
% 156.64/20.20  	X14 = X18).
% 156.64/20.20  cnf(a19, assumption,
% 156.64/20.20  	X16 = X18).
% 156.64/20.20  cnf(a20, assumption,
% 156.64/20.20  	X17 = X19).
% 156.64/20.20  cnf(c30, plain,
% 156.64/20.20  	~sP2(X17,X16,X15),
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c28, c29])).
% 156.64/20.20  cnf(c31, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c28, c29])).
% 156.64/20.20  
% 156.64/20.20  cnf(c32, axiom,
% 156.64/20.20  	sP2(X20,X21,unordered_pair(X20,X21))).
% 156.64/20.20  cnf(a21, assumption,
% 156.64/20.20  	X17 = X20).
% 156.64/20.20  cnf(a22, assumption,
% 156.64/20.20  	X16 = X21).
% 156.64/20.20  cnf(a23, assumption,
% 156.64/20.20  	X15 = unordered_pair(X20,X21)).
% 156.64/20.20  cnf(c33, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c30, c32])).
% 156.64/20.20  cnf(c34, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(strict_predicate_extension, [assumptions([a21, a22, a23])], [c30, c32])).
% 156.64/20.20  
% 156.64/20.20  cnf(c35, plain,
% 156.64/20.20  	$false,
% 156.64/20.20  	inference(constraint_solving, [
% 156.64/20.20  		bind(X0, unordered_pair(sK10,sK11)),
% 156.64/20.20  		bind(X1, sK12),
% 156.64/20.20  		bind(X2, singleton(sK10)),
% 156.64/20.20  		bind(X3, sK11),
% 156.64/20.20  		bind(X4, singleton(sK10)),
% 156.64/20.20  		bind(X5, sK12),
% 156.64/20.20  		bind(X6, unordered_pair(sK10,sK11)),
% 156.64/20.20  		bind(X7, sK10),
% 156.64/20.20  		bind(X8, sK11),
% 156.64/20.20  		bind(X9, singleton(sK10)),
% 156.64/20.20  		bind(X10, sK10),
% 156.64/20.20  		bind(X11, sK12),
% 156.64/20.20  		bind(X12, sK11),
% 156.64/20.20  		bind(X13, unordered_pair(sK10,sK11)),
% 156.64/20.20  		bind(X14, sK11),
% 156.64/20.20  		bind(X15, unordered_pair(sK10,sK11)),
% 156.64/20.20  		bind(X16, sK11),
% 156.64/20.20  		bind(X17, sK10),
% 156.64/20.20  		bind(X18, sK11),
% 156.64/20.20  		bind(X19, sK10),
% 156.64/20.20  		bind(X20, sK10),
% 156.64/20.20  		bind(X21, sK11)
% 156.64/20.20  	],
% 156.64/20.20  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23])).
% 156.64/20.20  
% 156.64/20.20  % SZS output end IncompleteProof
%------------------------------------------------------------------------------