↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : ALG227+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n027.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 : Thu Jul 14 17:20:54 EDT 2022

% Result   : Theorem 2.32s 0.64s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ALG227+1 : TPTP v8.1.0. Released v3.4.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 : n027.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 : Wed Jun  8 09:24:26 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.32/0.64  % SZS status Theorem
% 2.32/0.64  % SZS output begin IncompleteProof
% 2.32/0.64  cnf(c0, axiom,
% 2.32/0.64  	~v1_xboole_0(sK3)).
% 2.32/0.64  cnf(c1, plain,
% 2.32/0.64  	~v1_xboole_0(sK3),
% 2.32/0.64  	inference(start, [], [c0])).
% 2.32/0.64  
% 2.32/0.64  cnf(c2, axiom,
% 2.32/0.64  	k1_closure3(X0,X1) = a_2_0_closure3(X0,X1) | ~m1_pboole(X1,X0) | v1_xboole_0(X0)).
% 2.32/0.64  cnf(a0, assumption,
% 2.32/0.64  	sK3 = X0).
% 2.32/0.64  cnf(c3, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.32/0.64  cnf(c4, plain,
% 2.32/0.64  	k1_closure3(X0,X1) = a_2_0_closure3(X0,X1) | ~m1_pboole(X1,X0),
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.32/0.64  
% 2.32/0.64  cnf(c5, axiom,
% 2.32/0.64  	r2_hidden(X2,a_2_0_closure3(X3,X4)) | ~sP1(X4,X2,X3) | ~sP2(X3,X2,X4)).
% 2.32/0.64  cnf(a1, assumption,
% 2.32/0.64  	a_2_0_closure3(X3,X4) = a_2_0_closure3(X0,X1)).
% 2.32/0.64  cnf(a2, assumption,
% 2.32/0.64  	k1_closure3(X0,X1) = X5).
% 2.32/0.64  cnf(c6, plain,
% 2.32/0.64  	~m1_pboole(X1,X0),
% 2.32/0.64  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 2.32/0.64  cnf(c7, plain,
% 2.32/0.64  	~sP1(X4,X2,X3) | ~sP2(X3,X2,X4),
% 2.32/0.64  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 2.32/0.64  cnf(c8, plain,
% 2.32/0.64  	r2_hidden(X2,X5),
% 2.32/0.64  	inference(strict_subterm_extension, [assumptions([a1, a2])], [c4, c5])).
% 2.32/0.64  
% 2.32/0.64  cnf(c9, axiom,
% 2.32/0.64  	~r2_hidden(sK5,k1_closure3(sK3,sK4))).
% 2.32/0.64  cnf(a3, assumption,
% 2.32/0.64  	X2 = sK5).
% 2.32/0.64  cnf(a4, assumption,
% 2.32/0.64  	X5 = k1_closure3(sK3,sK4)).
% 2.32/0.64  cnf(c10, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])).
% 2.32/0.64  cnf(c11, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])).
% 2.32/0.64  
% 2.32/0.64  cnf(c12, axiom,
% 2.32/0.64  	sP1(X6,X7,X8) | k1_xboole_0 = k1_funct_1(X6,X7) | ~m1_subset_1(X7,X8)).
% 2.32/0.64  cnf(a5, assumption,
% 2.32/0.64  	X4 = X6).
% 2.32/0.64  cnf(a6, assumption,
% 2.32/0.64  	X2 = X7).
% 2.32/0.64  cnf(a7, assumption,
% 2.32/0.64  	X3 = X8).
% 2.32/0.64  cnf(c13, plain,
% 2.32/0.64  	~sP2(X3,X2,X4),
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c12])).
% 2.32/0.64  cnf(c14, plain,
% 2.32/0.64  	k1_xboole_0 = k1_funct_1(X6,X7) | ~m1_subset_1(X7,X8),
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c12])).
% 2.32/0.64  
% 2.32/0.64  cnf(c15, axiom,
% 2.32/0.64  	k1_xboole_0 != k1_funct_1(sK4,sK5)).
% 2.32/0.64  cnf(a8, assumption,
% 2.32/0.64  	k1_funct_1(sK4,sK5) = k1_funct_1(X6,X7)).
% 2.32/0.64  cnf(a9, assumption,
% 2.32/0.64  	k1_xboole_0 = X9).
% 2.32/0.64  cnf(c16, plain,
% 2.32/0.64  	~m1_subset_1(X7,X8),
% 2.32/0.64  	inference(strict_subterm_extension, [assumptions([a8, a9])], [c14, c15])).
% 2.32/0.64  cnf(c17, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_subterm_extension, [assumptions([a8, a9])], [c14, c15])).
% 2.32/0.64  cnf(c18, plain,
% 2.32/0.64  	k1_xboole_0 != X9,
% 2.32/0.64  	inference(strict_subterm_extension, [assumptions([a8, a9])], [c14, c15])).
% 2.32/0.64  
% 2.32/0.64  cnf(a10, assumption,
% 2.32/0.64  	k1_xboole_0 = X9).
% 2.32/0.64  cnf(c19, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(reflexivity, [assumptions([a10])], [c18])).
% 2.32/0.64  
% 2.32/0.64  cnf(c20, axiom,
% 2.32/0.64  	m1_subset_1(sK5,sK3)).
% 2.32/0.64  cnf(a11, assumption,
% 2.32/0.64  	X7 = sK5).
% 2.32/0.64  cnf(a12, assumption,
% 2.32/0.64  	X8 = sK3).
% 2.32/0.64  cnf(c21, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c20])).
% 2.32/0.64  cnf(c22, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c20])).
% 2.32/0.64  
% 2.32/0.64  cnf(c23, axiom,
% 2.32/0.64  	sP2(X10,X11,X12) | ~m1_pboole(X12,X10) | v1_xboole_0(X10)).
% 2.32/0.64  cnf(a13, assumption,
% 2.32/0.64  	X3 = X10).
% 2.32/0.64  cnf(a14, assumption,
% 2.32/0.64  	X2 = X11).
% 2.32/0.64  cnf(a15, assumption,
% 2.32/0.64  	X4 = X12).
% 2.32/0.64  cnf(c24, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c13, c23])).
% 2.32/0.64  cnf(c25, plain,
% 2.32/0.64  	~m1_pboole(X12,X10) | v1_xboole_0(X10),
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a13, a14, a15])], [c13, c23])).
% 2.32/0.64  
% 2.32/0.64  cnf(c26, axiom,
% 2.32/0.64  	m1_pboole(sK4,sK3)).
% 2.32/0.64  cnf(a16, assumption,
% 2.32/0.64  	X12 = sK4).
% 2.32/0.64  cnf(a17, assumption,
% 2.32/0.64  	X10 = sK3).
% 2.32/0.64  cnf(c27, plain,
% 2.32/0.64  	v1_xboole_0(X10),
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])).
% 2.32/0.64  cnf(c28, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])).
% 2.32/0.64  
% 2.32/0.64  cnf(c29, plain,
% 2.32/0.64  	~v1_xboole_0(sK3)).
% 2.32/0.64  cnf(a18, assumption,
% 2.32/0.64  	X10 = sK3).
% 2.32/0.64  cnf(c30, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(predicate_reduction, [assumptions([a18])], [c27, c29])).
% 2.32/0.64  
% 2.32/0.64  cnf(c31, plain,
% 2.32/0.64  	m1_pboole(X12,X10)).
% 2.32/0.64  cnf(a19, assumption,
% 2.32/0.64  	X1 = X12).
% 2.32/0.64  cnf(a20, assumption,
% 2.32/0.64  	X0 = X10).
% 2.32/0.64  cnf(c32, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(predicate_reduction, [assumptions([a19, a20])], [c6, c31])).
% 2.32/0.64  
% 2.32/0.64  cnf(c33, plain,
% 2.32/0.64  	$false,
% 2.32/0.64  	inference(constraint_solving, [
% 2.32/0.64  		bind(X0, sK3),
% 2.32/0.64  		bind(X1, sK4),
% 2.32/0.64  		bind(X2, sK5),
% 2.32/0.64  		bind(X3, sK3),
% 2.32/0.64  		bind(X4, sK4),
% 2.32/0.64  		bind(X5, k1_closure3(X0,X1)),
% 2.32/0.64  		bind(X6, sK4),
% 2.32/0.64  		bind(X7, sK5),
% 2.32/0.64  		bind(X8, sK3),
% 2.32/0.64  		bind(X9, k1_xboole_0),
% 2.32/0.64  		bind(X10, sK3),
% 2.32/0.64  		bind(X11, sK5),
% 2.32/0.64  		bind(X12, sK4)
% 2.32/0.64  	],
% 2.32/0.64  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 2.32/0.64  
% 2.32/0.64  % SZS output end IncompleteProof
%------------------------------------------------------------------------------