↑ Up

lazyCoP---0.1.THM-Ass.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SET932+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n004.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 Jul 11 05:10:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.36  % SZS status Theorem
% 0.20/0.36  % SZS output begin IncompleteProof
% 0.20/0.36  cnf(c0, axiom,
% 0.20/0.36  	subset(sK5,sK6)).
% 0.20/0.36  cnf(c1, plain,
% 0.20/0.36  	subset(sK5,sK6),
% 0.20/0.36  	inference(start, [], [c0])).
% 0.20/0.36  
% 0.20/0.36  cnf(c2, axiom,
% 0.20/0.36  	subset(X0,X1) | ~subset(X2,X1) | ~subset(X0,X2)).
% 0.20/0.36  cnf(a0, assumption,
% 0.20/0.36  	sK5 = X2).
% 0.20/0.36  cnf(a1, assumption,
% 0.20/0.36  	sK6 = X1).
% 0.20/0.36  cnf(c3, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.36  cnf(c4, plain,
% 0.20/0.36  	subset(X0,X1) | ~subset(X0,X2),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.36  
% 0.20/0.36  cnf(c5, axiom,
% 0.20/0.36  	in(X3,X4) | ~subset(X3,X5) | ~sP0(X5,X4)).
% 0.20/0.36  cnf(a2, assumption,
% 0.20/0.36  	X0 = X3).
% 0.20/0.36  cnf(a3, assumption,
% 0.20/0.36  	X1 = X5).
% 0.20/0.36  cnf(c6, plain,
% 0.20/0.36  	~subset(X0,X2),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.36  cnf(c7, plain,
% 0.20/0.36  	in(X3,X4) | ~sP0(X5,X4),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.36  
% 0.20/0.36  cnf(c8, axiom,
% 0.20/0.36  	subset(X6,X7) | ~in(sK2(X6,X7),X7)).
% 0.20/0.36  cnf(a4, assumption,
% 0.20/0.36  	X3 = sK2(X6,X7)).
% 0.20/0.36  cnf(a5, assumption,
% 0.20/0.36  	X4 = X7).
% 0.20/0.36  cnf(c9, plain,
% 0.20/0.36  	~sP0(X5,X4),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.36  cnf(c10, plain,
% 0.20/0.36  	subset(X6,X7),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.20/0.36  
% 0.20/0.36  cnf(c11, axiom,
% 0.20/0.36  	~subset(powerset(sK5),powerset(sK6))).
% 0.20/0.36  cnf(a6, assumption,
% 0.20/0.36  	X6 = powerset(sK5)).
% 0.20/0.36  cnf(a7, assumption,
% 0.20/0.36  	X7 = powerset(sK6)).
% 0.20/0.36  cnf(c12, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.20/0.36  cnf(c13, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.20/0.36  
% 0.20/0.36  cnf(c14, axiom,
% 0.20/0.36  	sP0(X8,powerset(X8))).
% 0.20/0.36  cnf(a8, assumption,
% 0.20/0.36  	X5 = X8).
% 0.20/0.36  cnf(a9, assumption,
% 0.20/0.36  	X4 = powerset(X8)).
% 0.20/0.36  cnf(c15, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.20/0.36  cnf(c16, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.20/0.36  
% 0.20/0.36  cnf(c17, axiom,
% 0.20/0.36  	subset(X9,X10) | ~in(X9,X11) | ~sP0(X10,X11)).
% 0.20/0.36  cnf(a10, assumption,
% 0.20/0.36  	X0 = X9).
% 0.20/0.36  cnf(a11, assumption,
% 0.20/0.36  	X2 = X10).
% 0.20/0.36  cnf(c18, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])).
% 0.20/0.36  cnf(c19, plain,
% 0.20/0.36  	~in(X9,X11) | ~sP0(X10,X11),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])).
% 0.20/0.36  
% 0.20/0.36  cnf(c20, axiom,
% 0.20/0.36  	subset(X12,X13) | in(sK2(X12,X13),X12)).
% 0.20/0.36  cnf(a12, assumption,
% 0.20/0.36  	X9 = sK2(X12,X13)).
% 0.20/0.36  cnf(a13, assumption,
% 0.20/0.36  	X11 = X12).
% 0.20/0.36  cnf(c21, plain,
% 0.20/0.36  	~sP0(X10,X11),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.20/0.36  cnf(c22, plain,
% 0.20/0.36  	subset(X12,X13),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.20/0.36  
% 0.20/0.36  cnf(c23, plain,
% 0.20/0.36  	~subset(X6,X7)).
% 0.20/0.36  cnf(a14, assumption,
% 0.20/0.36  	X12 = X6).
% 0.20/0.36  cnf(a15, assumption,
% 0.20/0.36  	X13 = X7).
% 0.20/0.36  cnf(c24, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(predicate_reduction, [assumptions([a14, a15])], [c22, c23])).
% 0.20/0.36  
% 0.20/0.36  cnf(c25, axiom,
% 0.20/0.36  	sP0(X14,powerset(X14))).
% 0.20/0.36  cnf(a16, assumption,
% 0.20/0.36  	X10 = X14).
% 0.20/0.36  cnf(a17, assumption,
% 0.20/0.36  	X11 = powerset(X14)).
% 0.20/0.36  cnf(c26, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c25])).
% 0.20/0.36  cnf(c27, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c25])).
% 0.20/0.36  
% 0.20/0.36  cnf(c28, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(constraint_solving, [
% 0.20/0.36  		bind(X0, sK2(X6,X7)),
% 0.20/0.36  		bind(X1, sK6),
% 0.20/0.36  		bind(X2, sK5),
% 0.20/0.36  		bind(X3, sK2(X6,X7)),
% 0.20/0.36  		bind(X4, powerset(sK6)),
% 0.20/0.36  		bind(X5, sK6),
% 0.20/0.36  		bind(X6, powerset(sK5)),
% 0.20/0.36  		bind(X7, powerset(sK6)),
% 0.20/0.36  		bind(X8, sK6),
% 0.20/0.36  		bind(X9, sK2(X6,X7)),
% 0.20/0.36  		bind(X10, sK5),
% 0.20/0.36  		bind(X11, powerset(sK5)),
% 0.20/0.36  		bind(X12, powerset(sK5)),
% 0.20/0.36  		bind(X13, powerset(sK6)),
% 0.20/0.36  		bind(X14, sK5)
% 0.20/0.36  	],
% 0.20/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.20/0.36  
% 0.20/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------