↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET920+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 : n022.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:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET920+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n022.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 : Sun Jul 10 14:42:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.39  % SZS status Theorem
% 0.12/0.39  % SZS output begin IncompleteProof
% 0.12/0.39  cnf(c0, axiom,
% 0.12/0.39  	unordered_pair(sK8,sK9) = set_intersection2(unordered_pair(sK8,sK9),sK10)).
% 0.12/0.39  cnf(c1, plain,
% 0.12/0.39  	unordered_pair(sK8,sK9) = set_intersection2(unordered_pair(sK8,sK9),sK10),
% 0.12/0.39  	inference(start, [], [c0])).
% 0.12/0.39  
% 0.12/0.39  cnf(c2, axiom,
% 0.12/0.39  	sP3(X0,X1,set_intersection2(X0,X1))).
% 0.12/0.39  cnf(a0, assumption,
% 0.12/0.39  	set_intersection2(X0,X1) = set_intersection2(unordered_pair(sK8,sK9),sK10)).
% 0.12/0.39  cnf(a1, assumption,
% 0.12/0.39  	unordered_pair(sK8,sK9) = X2).
% 0.12/0.39  cnf(c3, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.39  cnf(c4, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.39  cnf(c5, plain,
% 0.12/0.39  	sP3(X0,X1,X2),
% 0.12/0.39  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.39  
% 0.12/0.39  cnf(c6, axiom,
% 0.12/0.39  	sP2(X3,X4,X5) | ~in(X4,X6) | ~sP3(X5,X3,X6)).
% 0.12/0.39  cnf(a2, assumption,
% 0.12/0.39  	X0 = X5).
% 0.12/0.39  cnf(a3, assumption,
% 0.12/0.39  	X1 = X3).
% 0.12/0.39  cnf(a4, assumption,
% 0.12/0.39  	X2 = X6).
% 0.12/0.39  cnf(c7, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 0.12/0.39  cnf(c8, plain,
% 0.12/0.39  	sP2(X3,X4,X5) | ~in(X4,X6),
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 0.12/0.39  
% 0.12/0.39  cnf(c9, axiom,
% 0.12/0.39  	in(X7,X8) | ~sP2(X8,X7,X9)).
% 0.12/0.39  cnf(a5, assumption,
% 0.12/0.39  	X3 = X8).
% 0.12/0.39  cnf(a6, assumption,
% 0.12/0.39  	X4 = X7).
% 0.12/0.39  cnf(a7, assumption,
% 0.12/0.39  	X5 = X9).
% 0.12/0.39  cnf(c10, plain,
% 0.12/0.39  	~in(X4,X6),
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c8, c9])).
% 0.12/0.39  cnf(c11, plain,
% 0.12/0.39  	in(X7,X8),
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c8, c9])).
% 0.12/0.39  
% 0.12/0.39  cnf(c12, axiom,
% 0.12/0.39  	~in(sK8,sK10)).
% 0.12/0.39  cnf(a8, assumption,
% 0.12/0.39  	X7 = sK8).
% 0.12/0.39  cnf(a9, assumption,
% 0.12/0.39  	X8 = sK10).
% 0.12/0.39  cnf(c13, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c12])).
% 0.12/0.39  cnf(c14, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c11, c12])).
% 0.12/0.39  
% 0.12/0.39  cnf(c15, axiom,
% 0.12/0.39  	in(X10,X11) | ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11)).
% 0.12/0.39  cnf(a10, assumption,
% 0.12/0.39  	X4 = X10).
% 0.12/0.39  cnf(a11, assumption,
% 0.12/0.39  	X6 = X11).
% 0.12/0.39  cnf(c16, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c10, c15])).
% 0.12/0.39  cnf(c17, plain,
% 0.12/0.39  	~sP0(X10,X12,X13) | ~sP1(X13,X12,X11),
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c10, c15])).
% 0.12/0.39  
% 0.12/0.39  cnf(c18, axiom,
% 0.12/0.39  	sP0(X14,X15,X14)).
% 0.12/0.39  cnf(a12, assumption,
% 0.12/0.39  	X10 = X14).
% 0.12/0.39  cnf(a13, assumption,
% 0.12/0.39  	X12 = X15).
% 0.12/0.39  cnf(a14, assumption,
% 0.12/0.39  	X13 = X14).
% 0.12/0.39  cnf(c19, plain,
% 0.12/0.39  	~sP1(X13,X12,X11),
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c17, c18])).
% 0.12/0.39  cnf(c20, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c17, c18])).
% 0.12/0.39  
% 0.12/0.39  cnf(c21, axiom,
% 0.12/0.39  	sP1(X16,X17,unordered_pair(X16,X17))).
% 0.12/0.39  cnf(a15, assumption,
% 0.12/0.39  	X13 = X16).
% 0.12/0.39  cnf(a16, assumption,
% 0.12/0.39  	X12 = X17).
% 0.12/0.39  cnf(a17, assumption,
% 0.12/0.39  	X11 = unordered_pair(X16,X17)).
% 0.12/0.39  cnf(c22, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c19, c21])).
% 0.12/0.39  cnf(c23, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c19, c21])).
% 0.12/0.39  
% 0.12/0.39  cnf(c24, plain,
% 0.12/0.39  	$false,
% 0.12/0.39  	inference(constraint_solving, [
% 0.12/0.39  		bind(X0, unordered_pair(sK8,sK9)),
% 0.12/0.39  		bind(X1, sK10),
% 0.12/0.39  		bind(X2, unordered_pair(sK8,sK9)),
% 0.12/0.39  		bind(X3, sK10),
% 0.12/0.39  		bind(X4, sK8),
% 0.12/0.39  		bind(X5, unordered_pair(sK8,sK9)),
% 0.12/0.39  		bind(X6, unordered_pair(sK8,sK9)),
% 0.12/0.39  		bind(X7, sK8),
% 0.12/0.39  		bind(X8, sK10),
% 0.12/0.39  		bind(X9, unordered_pair(sK8,sK9)),
% 0.12/0.39  		bind(X10, sK8),
% 0.12/0.39  		bind(X11, unordered_pair(sK8,sK9)),
% 0.12/0.39  		bind(X12, sK9),
% 0.12/0.39  		bind(X13, sK8),
% 0.12/0.39  		bind(X14, sK8),
% 0.12/0.39  		bind(X15, sK9),
% 0.12/0.39  		bind(X16, sK8),
% 0.12/0.39  		bind(X17, sK9)
% 0.12/0.39  	],
% 0.12/0.39  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.12/0.39  
% 0.12/0.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------