TSTP Solution File: CSR044+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR044+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 : n018.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 : Fri Jul 15 20:36:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jun 10 07:09:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % SZS status Theorem
% 0.12/0.35  % SZS output begin IncompleteProof
% 0.12/0.35  cnf(c0, axiom,
% 0.12/0.35  	~tptpcol_16_29490(X0) | ~tptp_9_720(c_tptpexecutionbyfiringsquad_90,X0)).
% 0.12/0.35  cnf(c1, plain,
% 0.12/0.35  	~tptpcol_16_29490(X0) | ~tptp_9_720(c_tptpexecutionbyfiringsquad_90,X0),
% 0.12/0.35  	inference(start, [], [c0])).
% 0.12/0.35  
% 0.12/0.35  cnf(c2, axiom,
% 0.12/0.35  	tptpcol_16_29490(X1) | ~isa(X1,c_tptpcol_16_29490)).
% 0.12/0.35  cnf(a0, assumption,
% 0.12/0.35  	X0 = X1).
% 0.12/0.35  cnf(c3, plain,
% 0.12/0.35  	~tptp_9_720(c_tptpexecutionbyfiringsquad_90,X0),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  cnf(c4, plain,
% 0.12/0.35  	~isa(X1,c_tptpcol_16_29490),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  
% 0.12/0.35  cnf(c5, axiom,
% 0.12/0.35  	isa(f_relationallexistsfn(X2,X3,X4,X5),X5) | ~relationallexists(X3,X4,X5) | ~isa(X2,X4)).
% 0.12/0.35  cnf(a1, assumption,
% 0.12/0.35  	X1 = f_relationallexistsfn(X2,X3,X4,X5)).
% 0.12/0.35  cnf(a2, assumption,
% 0.12/0.35  	c_tptpcol_16_29490 = X5).
% 0.12/0.35  cnf(c6, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.12/0.35  cnf(c7, plain,
% 0.12/0.35  	~relationallexists(X3,X4,X5) | ~isa(X2,X4),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.12/0.35  
% 0.12/0.35  cnf(c8, axiom,
% 0.12/0.35  	relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) | ~mtvisible(c_cyclistsmt)).
% 0.12/0.35  cnf(a3, assumption,
% 0.12/0.35  	X3 = c_tptp_9_720).
% 0.12/0.35  cnf(a4, assumption,
% 0.12/0.35  	X4 = c_executionbyfiringsquad).
% 0.12/0.35  cnf(a5, assumption,
% 0.12/0.35  	X5 = c_tptpcol_16_29490).
% 0.12/0.35  cnf(c9, plain,
% 0.12/0.35  	~isa(X2,X4),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c7, c8])).
% 0.12/0.35  cnf(c10, plain,
% 0.12/0.35  	~mtvisible(c_cyclistsmt),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c7, c8])).
% 0.12/0.35  
% 0.12/0.35  cnf(c11, axiom,
% 0.12/0.35  	mtvisible(X6) | ~genlmt(X7,X6) | ~mtvisible(X7)).
% 0.12/0.35  cnf(a6, assumption,
% 0.12/0.35  	c_cyclistsmt = X6).
% 0.12/0.35  cnf(c12, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 0.12/0.35  cnf(c13, plain,
% 0.12/0.35  	~genlmt(X7,X6) | ~mtvisible(X7),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 0.12/0.35  
% 0.12/0.35  cnf(c14, axiom,
% 0.12/0.35  	genlmt(X8,X9) | ~genlmt(X10,X9) | ~genlmt(X8,X10)).
% 0.12/0.35  cnf(a7, assumption,
% 0.12/0.35  	X7 = X8).
% 0.12/0.35  cnf(a8, assumption,
% 0.12/0.35  	X6 = X9).
% 0.12/0.35  cnf(c15, plain,
% 0.12/0.35  	~mtvisible(X7),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.12/0.35  cnf(c16, plain,
% 0.12/0.35  	~genlmt(X10,X9) | ~genlmt(X8,X10),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 0.12/0.35  
% 0.12/0.35  cnf(c17, axiom,
% 0.12/0.35  	genlmt(c_tptp_spindleheadmt,c_cyclistsmt)).
% 0.12/0.35  cnf(a9, assumption,
% 0.12/0.35  	X10 = c_tptp_spindleheadmt).
% 0.12/0.35  cnf(a10, assumption,
% 0.12/0.35  	X9 = c_cyclistsmt).
% 0.12/0.35  cnf(c18, plain,
% 0.12/0.35  	~genlmt(X8,X10),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 0.12/0.35  cnf(c19, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c17])).
% 0.12/0.35  
% 0.12/0.35  cnf(c20, axiom,
% 0.12/0.35  	genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt)).
% 0.12/0.35  cnf(a11, assumption,
% 0.12/0.35  	X8 = c_tptp_member3633_mt).
% 0.12/0.35  cnf(a12, assumption,
% 0.12/0.35  	X10 = c_tptp_spindleheadmt).
% 0.12/0.35  cnf(c21, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c20])).
% 0.12/0.35  cnf(c22, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c20])).
% 0.12/0.35  
% 0.12/0.35  cnf(c23, axiom,
% 0.12/0.35  	mtvisible(c_tptp_member3633_mt)).
% 0.12/0.35  cnf(a13, assumption,
% 0.12/0.35  	X7 = c_tptp_member3633_mt).
% 0.12/0.35  cnf(c24, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a13])], [c15, c23])).
% 0.12/0.35  cnf(c25, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a13])], [c15, c23])).
% 0.12/0.35  
% 0.12/0.35  cnf(c26, axiom,
% 0.12/0.35  	isa(X11,c_executionbyfiringsquad) | ~executionbyfiringsquad(X11)).
% 0.12/0.35  cnf(a14, assumption,
% 0.12/0.35  	X2 = X11).
% 0.12/0.35  cnf(a15, assumption,
% 0.12/0.35  	X4 = c_executionbyfiringsquad).
% 0.12/0.35  cnf(c27, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c9, c26])).
% 0.12/0.35  cnf(c28, plain,
% 0.12/0.35  	~executionbyfiringsquad(X11),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c9, c26])).
% 0.12/0.35  
% 0.12/0.35  cnf(c29, axiom,
% 0.12/0.35  	executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90)).
% 0.12/0.35  cnf(a16, assumption,
% 0.12/0.35  	X11 = c_tptpexecutionbyfiringsquad_90).
% 0.12/0.35  cnf(c30, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a16])], [c28, c29])).
% 0.12/0.35  cnf(c31, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a16])], [c28, c29])).
% 0.12/0.35  
% 0.12/0.35  cnf(c32, axiom,
% 0.12/0.35  	tptp_9_720(X12,f_relationallexistsfn(X12,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) | ~executionbyfiringsquad(X12) | ~mtvisible(c_cyclistsmt)).
% 0.12/0.35  cnf(a17, assumption,
% 0.12/0.35  	c_tptpexecutionbyfiringsquad_90 = X12).
% 0.12/0.35  cnf(a18, assumption,
% 0.12/0.35  	X0 = f_relationallexistsfn(X12,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)).
% 0.12/0.35  cnf(c33, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c3, c32])).
% 0.12/0.35  cnf(c34, plain,
% 0.12/0.35  	~executionbyfiringsquad(X12) | ~mtvisible(c_cyclistsmt),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a17, a18])], [c3, c32])).
% 0.12/0.35  
% 0.12/0.35  cnf(c35, plain,
% 0.12/0.35  	executionbyfiringsquad(X11)).
% 0.12/0.35  cnf(a19, assumption,
% 0.12/0.35  	X12 = X11).
% 0.12/0.35  cnf(c36, plain,
% 0.12/0.35  	~mtvisible(c_cyclistsmt),
% 0.12/0.35  	inference(predicate_reduction, [assumptions([a19])], [c34, c35])).
% 0.12/0.35  
% 0.12/0.35  cnf(c37, plain,
% 0.12/0.35  	mtvisible(c_cyclistsmt)).
% 0.12/0.35  cnf(a20, assumption,
% 0.12/0.35  	c_cyclistsmt = c_cyclistsmt).
% 0.12/0.35  cnf(c38, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(predicate_reduction, [assumptions([a20])], [c36, c37])).
% 0.12/0.35  
% 0.12/0.35  cnf(c39, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(constraint_solving, [
% 0.12/0.35  		bind(X0, f_relationallexistsfn(X2,X3,X4,X5)),
% 0.12/0.35  		bind(X1, f_relationallexistsfn(X2,X3,X4,X5)),
% 0.12/0.35  		bind(X2, c_tptpexecutionbyfiringsquad_90),
% 0.12/0.35  		bind(X3, c_tptp_9_720),
% 0.12/0.35  		bind(X4, c_executionbyfiringsquad),
% 0.12/0.35  		bind(X5, c_tptpcol_16_29490),
% 0.12/0.35  		bind(X6, c_cyclistsmt),
% 0.12/0.35  		bind(X7, c_tptp_member3633_mt),
% 0.12/0.35  		bind(X8, c_tptp_member3633_mt),
% 0.12/0.35  		bind(X9, c_cyclistsmt),
% 0.12/0.35  		bind(X10, c_tptp_spindleheadmt),
% 0.12/0.35  		bind(X11, c_tptpexecutionbyfiringsquad_90),
% 0.12/0.35  		bind(X12, c_tptpexecutionbyfiringsquad_90)
% 0.12/0.35  	],
% 0.12/0.35  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.12/0.35  
% 0.12/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------