↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEU413+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 : n026.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:55:49 EDT 2022

% Result   : Theorem 161.67s 21.12s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 21:09:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 161.67/21.12  % SZS status Theorem
% 161.67/21.12  % SZS output begin IncompleteProof
% 161.67/21.12  cnf(c0, axiom,
% 161.67/21.12  	l1_orders_2(sK0)).
% 161.67/21.12  cnf(c1, plain,
% 161.67/21.12  	l1_orders_2(sK0),
% 161.67/21.12  	inference(start, [], [c0])).
% 161.67/21.12  
% 161.67/21.12  cnf(c2, axiom,
% 161.67/21.12  	l1_orders_2(k1_latsum_1(X0,X1)) | ~l1_orders_2(X1) | ~l1_orders_2(X0)).
% 161.67/21.12  cnf(a0, assumption,
% 161.67/21.12  	sK0 = X0).
% 161.67/21.12  cnf(c3, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 161.67/21.12  cnf(c4, plain,
% 161.67/21.12  	l1_orders_2(k1_latsum_1(X0,X1)) | ~l1_orders_2(X1),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 161.67/21.12  
% 161.67/21.12  cnf(c5, axiom,
% 161.67/21.12  	r2_hidden(k4_tarski(X2,X3),u1_orders_2(X4)) | ~r1_orders_2(X4,X2,X3) | ~m1_subset_1(X3,u1_struct_0(X4)) | ~m1_subset_1(X2,u1_struct_0(X4)) | ~l1_orders_2(X4)).
% 161.67/21.12  cnf(a1, assumption,
% 161.67/21.12  	k1_latsum_1(X0,X1) = X4).
% 161.67/21.12  cnf(c6, plain,
% 161.67/21.12  	~l1_orders_2(X1),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 161.67/21.12  cnf(c7, plain,
% 161.67/21.12  	r2_hidden(k4_tarski(X2,X3),u1_orders_2(X4)) | ~r1_orders_2(X4,X2,X3) | ~m1_subset_1(X3,u1_struct_0(X4)) | ~m1_subset_1(X2,u1_struct_0(X4)),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 161.67/21.12  
% 161.67/21.12  cnf(c8, axiom,
% 161.67/21.12  	r2_hidden(X5,u1_struct_0(X6)) | ~r2_hidden(X7,u1_struct_0(X6)) | ~r2_hidden(k4_tarski(X5,X7),u1_orders_2(k1_latsum_1(X6,X8))) | ~m1_subset_1(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),k1_zfmisc_1(u1_struct_0(X8))) | ~v12_waybel_0(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),X8) | ~l1_orders_2(X8) | ~l1_orders_2(X6)).
% 161.67/21.12  cnf(a2, assumption,
% 161.67/21.12  	k4_tarski(X2,X3) = k4_tarski(X5,X7)).
% 161.67/21.12  cnf(a3, assumption,
% 161.67/21.12  	u1_orders_2(X4) = u1_orders_2(k1_latsum_1(X6,X8))).
% 161.67/21.12  cnf(c9, plain,
% 161.67/21.12  	~r1_orders_2(X4,X2,X3) | ~m1_subset_1(X3,u1_struct_0(X4)) | ~m1_subset_1(X2,u1_struct_0(X4)),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 161.67/21.12  cnf(c10, plain,
% 161.67/21.12  	r2_hidden(X5,u1_struct_0(X6)) | ~r2_hidden(X7,u1_struct_0(X6)) | ~m1_subset_1(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),k1_zfmisc_1(u1_struct_0(X8))) | ~v12_waybel_0(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),X8) | ~l1_orders_2(X8) | ~l1_orders_2(X6),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 161.67/21.12  
% 161.67/21.12  cnf(c11, axiom,
% 161.67/21.12  	~r2_hidden(sK2,u1_struct_0(sK0))).
% 161.67/21.12  cnf(a4, assumption,
% 161.67/21.12  	X5 = sK2).
% 161.67/21.12  cnf(a5, assumption,
% 161.67/21.12  	u1_struct_0(X6) = u1_struct_0(sK0)).
% 161.67/21.12  cnf(c12, plain,
% 161.67/21.12  	~r2_hidden(X7,u1_struct_0(X6)) | ~m1_subset_1(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),k1_zfmisc_1(u1_struct_0(X8))) | ~v12_waybel_0(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),X8) | ~l1_orders_2(X8) | ~l1_orders_2(X6),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 161.67/21.12  cnf(c13, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 161.67/21.12  
% 161.67/21.12  cnf(c14, axiom,
% 161.67/21.12  	r2_hidden(sK3,u1_struct_0(sK0))).
% 161.67/21.12  cnf(a6, assumption,
% 161.67/21.12  	X7 = sK3).
% 161.67/21.12  cnf(a7, assumption,
% 161.67/21.12  	u1_struct_0(X6) = u1_struct_0(sK0)).
% 161.67/21.12  cnf(c15, plain,
% 161.67/21.12  	~m1_subset_1(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),k1_zfmisc_1(u1_struct_0(X8))) | ~v12_waybel_0(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),X8) | ~l1_orders_2(X8) | ~l1_orders_2(X6),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c14])).
% 161.67/21.12  cnf(c16, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c12, c14])).
% 161.67/21.12  
% 161.67/21.12  cnf(c17, axiom,
% 161.67/21.12  	m1_subset_1(k3_xboole_0(u1_struct_0(sK0),u1_struct_0(sK1)),k1_zfmisc_1(u1_struct_0(sK1)))).
% 161.67/21.12  cnf(a8, assumption,
% 161.67/21.12  	k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)) = k3_xboole_0(u1_struct_0(sK0),u1_struct_0(sK1))).
% 161.67/21.12  cnf(a9, assumption,
% 161.67/21.12  	k1_zfmisc_1(u1_struct_0(X8)) = k1_zfmisc_1(u1_struct_0(sK1))).
% 161.67/21.12  cnf(c18, plain,
% 161.67/21.12  	~v12_waybel_0(k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)),X8) | ~l1_orders_2(X8) | ~l1_orders_2(X6),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c15, c17])).
% 161.67/21.12  cnf(c19, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c15, c17])).
% 161.67/21.12  
% 161.67/21.12  cnf(c20, axiom,
% 161.67/21.12  	v12_waybel_0(k3_xboole_0(u1_struct_0(sK0),u1_struct_0(sK1)),sK1)).
% 161.67/21.12  cnf(a10, assumption,
% 161.67/21.12  	k3_xboole_0(u1_struct_0(X6),u1_struct_0(X8)) = k3_xboole_0(u1_struct_0(sK0),u1_struct_0(sK1))).
% 161.67/21.12  cnf(a11, assumption,
% 161.67/21.12  	X8 = sK1).
% 161.67/21.12  cnf(c21, plain,
% 161.67/21.12  	~l1_orders_2(X8) | ~l1_orders_2(X6),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c20])).
% 161.67/21.12  cnf(c22, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c20])).
% 161.67/21.12  
% 161.67/21.12  cnf(c23, axiom,
% 161.67/21.12  	l1_orders_2(sK1)).
% 161.67/21.12  cnf(a12, assumption,
% 161.67/21.12  	X8 = sK1).
% 161.67/21.12  cnf(c24, plain,
% 161.67/21.12  	~l1_orders_2(X6),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a12])], [c21, c23])).
% 161.67/21.12  cnf(c25, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a12])], [c21, c23])).
% 161.67/21.12  
% 161.67/21.12  cnf(c26, plain,
% 161.67/21.12  	l1_orders_2(sK0)).
% 161.67/21.12  cnf(a13, assumption,
% 161.67/21.12  	X6 = sK0).
% 161.67/21.12  cnf(c27, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(predicate_reduction, [assumptions([a13])], [c24, c26])).
% 161.67/21.12  
% 161.67/21.12  cnf(c28, axiom,
% 161.67/21.12  	r1_orders_2(k1_latsum_1(sK0,sK1),sK2,sK3)).
% 161.67/21.12  cnf(a14, assumption,
% 161.67/21.12  	X4 = k1_latsum_1(sK0,sK1)).
% 161.67/21.12  cnf(a15, assumption,
% 161.67/21.12  	X2 = sK2).
% 161.67/21.12  cnf(a16, assumption,
% 161.67/21.12  	X3 = sK3).
% 161.67/21.12  cnf(c29, plain,
% 161.67/21.12  	~m1_subset_1(X3,u1_struct_0(X4)) | ~m1_subset_1(X2,u1_struct_0(X4)),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c9, c28])).
% 161.67/21.12  cnf(c30, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c9, c28])).
% 161.67/21.12  
% 161.67/21.12  cnf(c31, axiom,
% 161.67/21.12  	m1_subset_1(sK3,u1_struct_0(k1_latsum_1(sK0,sK1)))).
% 161.67/21.12  cnf(a17, assumption,
% 161.67/21.12  	X3 = sK3).
% 161.67/21.12  cnf(a18, assumption,
% 161.67/21.12  	u1_struct_0(X4) = u1_struct_0(k1_latsum_1(sK0,sK1))).
% 161.67/21.12  cnf(c32, plain,
% 161.67/21.12  	~m1_subset_1(X2,u1_struct_0(X4)),
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c29, c31])).
% 161.67/21.12  cnf(c33, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c29, c31])).
% 161.67/21.12  
% 161.67/21.12  cnf(c34, axiom,
% 161.67/21.12  	m1_subset_1(sK2,u1_struct_0(k1_latsum_1(sK0,sK1)))).
% 161.67/21.12  cnf(a19, assumption,
% 161.67/21.12  	X2 = sK2).
% 161.67/21.12  cnf(a20, assumption,
% 161.67/21.12  	u1_struct_0(X4) = u1_struct_0(k1_latsum_1(sK0,sK1))).
% 161.67/21.12  cnf(c35, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c32, c34])).
% 161.67/21.12  cnf(c36, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(strict_predicate_extension, [assumptions([a19, a20])], [c32, c34])).
% 161.67/21.12  
% 161.67/21.12  cnf(c37, plain,
% 161.67/21.12  	l1_orders_2(X8)).
% 161.67/21.12  cnf(a21, assumption,
% 161.67/21.12  	X1 = X8).
% 161.67/21.12  cnf(c38, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(predicate_reduction, [assumptions([a21])], [c6, c37])).
% 161.67/21.12  
% 161.67/21.12  cnf(c39, plain,
% 161.67/21.12  	$false,
% 161.67/21.12  	inference(constraint_solving, [
% 161.67/21.12  		bind(X0, sK0),
% 161.67/21.12  		bind(X1, sK1),
% 161.67/21.12  		bind(X2, sK2),
% 161.67/21.12  		bind(X3, sK3),
% 161.67/21.12  		bind(X4, k1_latsum_1(X0,X1)),
% 161.67/21.12  		bind(X5, sK2),
% 161.67/21.12  		bind(X6, sK0),
% 161.67/21.12  		bind(X7, sK3),
% 161.67/21.12  		bind(X8, sK1)
% 161.67/21.12  	],
% 161.67/21.12  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 161.67/21.12  
% 161.67/21.12  % SZS output end IncompleteProof
%------------------------------------------------------------------------------