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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n010.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 : Wed Jul 20 19:46:50 EDT 2022

% Result   : Theorem 4.49s 0.93s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV417+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n010.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 : Wed Jun 15 09:27:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 4.49/0.93  % SZS status Theorem
% 4.49/0.93  % SZS output begin IncompleteProof
% 4.49/0.93  cnf(c0, axiom,
% 4.49/0.93  	phi(findmin_cpq_eff(triple(sK5,sK6,sK7)))).
% 4.49/0.93  cnf(c1, plain,
% 4.49/0.93  	phi(findmin_cpq_eff(triple(sK5,sK6,sK7))),
% 4.49/0.93  	inference(start, [], [c0])).
% 4.49/0.93  
% 4.49/0.93  cnf(c2, axiom,
% 4.49/0.93  	pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))) | ~phi(findmin_cpq_eff(triple(X0,X1,X2)))).
% 4.49/0.93  cnf(a0, assumption,
% 4.49/0.93  	findmin_cpq_eff(triple(sK5,sK6,sK7)) = findmin_cpq_eff(triple(X0,X1,X2))).
% 4.49/0.93  cnf(c3, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 4.49/0.93  cnf(c4, plain,
% 4.49/0.93  	pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))),
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 4.49/0.93  
% 4.49/0.93  cnf(c5, axiom,
% 4.49/0.93  	issmallestelement_pq(X3,X4) | ~pi_sharp_find_min(X3,X4)).
% 4.49/0.93  cnf(a1, assumption,
% 4.49/0.93  	i(triple(X0,X1,X2)) = X3).
% 4.49/0.93  cnf(a2, assumption,
% 4.49/0.93  	removemin_cpq_res(triple(X0,X1,X2)) = X4).
% 4.49/0.93  cnf(c6, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 4.49/0.93  cnf(c7, plain,
% 4.49/0.93  	issmallestelement_pq(X3,X4),
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 4.49/0.93  
% 4.49/0.93  cnf(c8, axiom,
% 4.49/0.93  	findmin_pq_res(X5,X6) = X6 | ~issmallestelement_pq(X5,X6) | ~contains_pq(X5,X6)).
% 4.49/0.93  cnf(a3, assumption,
% 4.49/0.93  	X3 = X5).
% 4.49/0.93  cnf(a4, assumption,
% 4.49/0.93  	X4 = X6).
% 4.49/0.93  cnf(c9, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 4.49/0.93  cnf(c10, plain,
% 4.49/0.93  	findmin_pq_res(X5,X6) = X6 | ~contains_pq(X5,X6),
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 4.49/0.93  
% 4.49/0.93  cnf(c11, axiom,
% 4.49/0.93  	findmin_pq_res(i(triple(sK5,sK6,sK7)),X7) != removemin_cpq_res(triple(sK5,sK6,sK7)) | ~pi_sharp_find_min(i(triple(sK5,sK6,sK7)),X7)).
% 4.49/0.93  cnf(a5, assumption,
% 4.49/0.93  	findmin_pq_res(i(triple(sK5,sK6,sK7)),X7) = findmin_pq_res(X5,X6)).
% 4.49/0.93  cnf(c12, plain,
% 4.49/0.93  	~contains_pq(X5,X6),
% 4.49/0.93  	inference(strict_subterm_extension, [assumptions([a5])], [c10, c11])).
% 4.49/0.93  cnf(c13, plain,
% 4.49/0.93  	~pi_sharp_find_min(i(triple(sK5,sK6,sK7)),X7),
% 4.49/0.93  	inference(strict_subterm_extension, [assumptions([a5])], [c10, c11])).
% 4.49/0.93  cnf(c14, plain,
% 4.49/0.93  	X6 != removemin_cpq_res(triple(sK5,sK6,sK7)),
% 4.49/0.93  	inference(strict_subterm_extension, [assumptions([a5])], [c10, c11])).
% 4.49/0.93  
% 4.49/0.93  cnf(a6, assumption,
% 4.49/0.93  	X6 = removemin_cpq_res(triple(sK5,sK6,sK7))).
% 4.49/0.93  cnf(c15, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(reflexivity, [assumptions([a6])], [c14])).
% 4.49/0.93  
% 4.49/0.93  cnf(c16, plain,
% 4.49/0.93  	pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))).
% 4.49/0.93  cnf(a7, assumption,
% 4.49/0.93  	i(triple(sK5,sK6,sK7)) = i(triple(X0,X1,X2))).
% 4.49/0.93  cnf(a8, assumption,
% 4.49/0.93  	X7 = removemin_cpq_res(triple(X0,X1,X2))).
% 4.49/0.93  cnf(c17, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(predicate_reduction, [assumptions([a7, a8])], [c13, c16])).
% 4.49/0.93  
% 4.49/0.93  cnf(c18, axiom,
% 4.49/0.93  	contains_pq(X8,X9) | ~pi_sharp_find_min(X8,X9)).
% 4.49/0.93  cnf(a9, assumption,
% 4.49/0.93  	X5 = X8).
% 4.49/0.93  cnf(a10, assumption,
% 4.49/0.93  	X6 = X9).
% 4.49/0.93  cnf(c19, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c18])).
% 4.49/0.93  cnf(c20, plain,
% 4.49/0.93  	~pi_sharp_find_min(X8,X9),
% 4.49/0.93  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c12, c18])).
% 4.49/0.93  
% 4.49/0.93  cnf(c21, plain,
% 4.49/0.93  	pi_sharp_find_min(i(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))).
% 4.49/0.93  cnf(a11, assumption,
% 4.49/0.93  	X8 = i(triple(X0,X1,X2))).
% 4.49/0.93  cnf(a12, assumption,
% 4.49/0.93  	X9 = removemin_cpq_res(triple(X0,X1,X2))).
% 4.49/0.93  cnf(c22, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(predicate_reduction, [assumptions([a11, a12])], [c20, c21])).
% 4.49/0.93  
% 4.49/0.93  cnf(c23, plain,
% 4.49/0.93  	$false,
% 4.49/0.93  	inference(constraint_solving, [
% 4.49/0.93  		bind(X0, sK5),
% 4.49/0.93  		bind(X1, sK6),
% 4.49/0.93  		bind(X2, sK7),
% 4.49/0.93  		bind(X3, i(triple(X0,X1,X2))),
% 4.49/0.93  		bind(X4, removemin_cpq_res(triple(X0,X1,X2))),
% 4.49/0.93  		bind(X5, i(triple(X0,X1,X2))),
% 4.49/0.93  		bind(X6, removemin_cpq_res(triple(X0,X1,X2))),
% 4.49/0.93  		bind(X7, removemin_cpq_res(triple(X0,X1,X2))),
% 4.49/0.93  		bind(X8, i(triple(X0,X1,X2))),
% 4.49/0.93  		bind(X9, removemin_cpq_res(triple(X0,X1,X2)))
% 4.49/0.93  	],
% 4.49/0.93  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])).
% 4.49/0.93  
% 4.49/0.93  % SZS output end IncompleteProof
%------------------------------------------------------------------------------