↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU112+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 : 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 : Tue Jul 19 11:53:11 EDT 2022

% Result   : Theorem 0.19s 0.48s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 20 11:31:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.48  % SZS status Theorem
% 0.19/0.48  % SZS output begin IncompleteProof
% 0.19/0.48  cnf(c0, axiom,
% 0.19/0.48  	~subset(set_union2(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(set_union2(sK12,sK13)))).
% 0.19/0.48  cnf(c1, plain,
% 0.19/0.48  	~subset(set_union2(finite_subsets(sK12),finite_subsets(sK13)),finite_subsets(set_union2(sK12,sK13))),
% 0.19/0.48  	inference(start, [], [c0])).
% 0.19/0.48  
% 0.19/0.48  cnf(c2, axiom,
% 0.19/0.48  	subset(set_union2(X0,X1),X2) | ~subset(X1,X2) | ~subset(X0,X2)).
% 0.19/0.48  cnf(a0, assumption,
% 0.19/0.48  	set_union2(finite_subsets(sK12),finite_subsets(sK13)) = set_union2(X0,X1)).
% 0.19/0.48  cnf(a1, assumption,
% 0.19/0.48  	finite_subsets(set_union2(sK12,sK13)) = X2).
% 0.19/0.48  cnf(c3, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.48  cnf(c4, plain,
% 0.19/0.48  	~subset(X1,X2) | ~subset(X0,X2),
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.48  
% 0.19/0.48  cnf(c5, axiom,
% 0.19/0.48  	subset(finite_subsets(X3),finite_subsets(X4)) | ~subset(X3,X4)).
% 0.19/0.48  cnf(a2, assumption,
% 0.19/0.48  	X1 = finite_subsets(X3)).
% 0.19/0.48  cnf(a3, assumption,
% 0.19/0.48  	X2 = finite_subsets(X4)).
% 0.19/0.48  cnf(c6, plain,
% 0.19/0.48  	~subset(X0,X2),
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.48  cnf(c7, plain,
% 0.19/0.48  	~subset(X3,X4),
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.48  
% 0.19/0.48  cnf(c8, axiom,
% 0.19/0.48  	subset(X5,set_union2(X5,X6))).
% 0.19/0.48  cnf(a4, assumption,
% 0.19/0.48  	X7 = X3).
% 0.19/0.48  cnf(a5, assumption,
% 0.19/0.48  	X8 = X4).
% 0.19/0.48  cnf(c9, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(lazy_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.48  cnf(c10, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(lazy_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.48  cnf(c11, plain,
% 0.19/0.48  	X5 != X7 | set_union2(X5,X6) != X8,
% 0.19/0.48  	inference(lazy_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.48  
% 0.19/0.48  cnf(a6, assumption,
% 0.19/0.48  	X5 = X7).
% 0.19/0.48  cnf(c12, plain,
% 0.19/0.48  	set_union2(X5,X6) != X8,
% 0.19/0.48  	inference(reflexivity, [assumptions([a6])], [c11])).
% 0.19/0.48  
% 0.19/0.48  cnf(c13, axiom,
% 0.19/0.48  	set_union2(X9,X10) = set_union2(X10,X9)).
% 0.19/0.48  cnf(a7, assumption,
% 0.19/0.48  	set_union2(X5,X6) = set_union2(X9,X10)).
% 0.19/0.48  cnf(c14, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(strict_function_extension, [assumptions([a7])], [c12, c13])).
% 0.19/0.48  cnf(c15, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(strict_function_extension, [assumptions([a7])], [c12, c13])).
% 0.19/0.48  cnf(c16, plain,
% 0.19/0.48  	X11 != set_union2(X10,X9) | X11 != X8,
% 0.19/0.48  	inference(strict_function_extension, [assumptions([a7])], [c12, c13])).
% 0.19/0.48  
% 0.19/0.48  cnf(a8, assumption,
% 0.19/0.48  	X11 = set_union2(X10,X9)).
% 0.19/0.48  cnf(c17, plain,
% 0.19/0.48  	X11 != X8,
% 0.19/0.48  	inference(reflexivity, [assumptions([a8])], [c16])).
% 0.19/0.48  
% 0.19/0.48  cnf(a9, assumption,
% 0.19/0.48  	X11 = X8).
% 0.19/0.48  cnf(c18, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(reflexivity, [assumptions([a9])], [c17])).
% 0.19/0.48  
% 0.19/0.48  cnf(c19, axiom,
% 0.19/0.48  	subset(finite_subsets(X12),finite_subsets(X13)) | ~subset(X12,X13)).
% 0.19/0.48  cnf(a10, assumption,
% 0.19/0.48  	X0 = finite_subsets(X12)).
% 0.19/0.48  cnf(a11, assumption,
% 0.19/0.48  	X2 = finite_subsets(X13)).
% 0.19/0.48  cnf(c20, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c19])).
% 0.19/0.48  cnf(c21, plain,
% 0.19/0.48  	~subset(X12,X13),
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c19])).
% 0.19/0.48  
% 0.19/0.48  cnf(c22, axiom,
% 0.19/0.48  	subset(X14,set_union2(X14,X15))).
% 0.19/0.48  cnf(a12, assumption,
% 0.19/0.48  	X12 = X14).
% 0.19/0.48  cnf(a13, assumption,
% 0.19/0.48  	X13 = set_union2(X14,X15)).
% 0.19/0.48  cnf(c23, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c21, c22])).
% 0.19/0.48  cnf(c24, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c21, c22])).
% 0.19/0.48  
% 0.19/0.48  cnf(c25, plain,
% 0.19/0.48  	$false,
% 0.19/0.48  	inference(constraint_solving, [
% 0.19/0.48  		bind(X0, finite_subsets(sK12)),
% 0.19/0.48  		bind(X1, finite_subsets(sK13)),
% 0.19/0.48  		bind(X2, finite_subsets(set_union2(sK12,sK13))),
% 0.19/0.48  		bind(X3, sK13),
% 0.19/0.48  		bind(X4, set_union2(sK12,sK13)),
% 0.19/0.48  		bind(X5, sK13),
% 0.19/0.48  		bind(X6, sK12),
% 0.19/0.48  		bind(X7, sK13),
% 0.19/0.48  		bind(X8, set_union2(sK12,sK13)),
% 0.19/0.48  		bind(X9, sK13),
% 0.19/0.48  		bind(X10, sK12),
% 0.19/0.48  		bind(X11, set_union2(X10,X9)),
% 0.19/0.48  		bind(X12, sK12),
% 0.19/0.48  		bind(X13, set_union2(sK12,sK13)),
% 0.19/0.48  		bind(X14, sK12),
% 0.19/0.48  		bind(X15, sK13)
% 0.19/0.48  	],
% 0.19/0.48  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.19/0.48  
% 0.19/0.48  % SZS output end IncompleteProof
%------------------------------------------------------------------------------