↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SET885+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 : n025.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:48:59 EDT 2022

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

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