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

View Problem - Process Solution

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

% Computer : n028.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 21 08:14:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN966+1 : TPTP v8.1.0. Released v3.1.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 : n028.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 19:51:59 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % SZS status Theorem
% 0.12/0.34  % SZS output begin IncompleteProof
% 0.12/0.34  cnf(c0, axiom,
% 0.12/0.34  	eq(X0,X1) | ~sP0(X1,X0)).
% 0.12/0.34  cnf(c1, plain,
% 0.12/0.34  	eq(X0,X1) | ~sP0(X1,X0),
% 0.12/0.34  	inference(start, [], [c0])).
% 0.12/0.34  
% 0.12/0.34  cnf(c2, axiom,
% 0.12/0.34  	~eq(sK3,sK2)).
% 0.12/0.34  cnf(a0, assumption,
% 0.12/0.34  	X0 = sK3).
% 0.12/0.34  cnf(a1, assumption,
% 0.12/0.34  	X1 = sK2).
% 0.12/0.34  cnf(c3, plain,
% 0.12/0.34  	~sP0(X1,X0),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34  cnf(c4, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34  
% 0.12/0.34  cnf(c5, axiom,
% 0.12/0.34  	sP0(X2,X3) | a_member_of(sK1(X2,X3),X2) | a_member_of(sK1(X2,X3),X3)).
% 0.12/0.34  cnf(a2, assumption,
% 0.12/0.34  	X1 = X2).
% 0.12/0.34  cnf(a3, assumption,
% 0.12/0.34  	X0 = X3).
% 0.12/0.34  cnf(c6, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.12/0.34  cnf(c7, plain,
% 0.12/0.34  	a_member_of(sK1(X2,X3),X2) | a_member_of(sK1(X2,X3),X3),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.12/0.34  
% 0.12/0.34  cnf(c8, axiom,
% 0.12/0.34  	a_member_of(X4,X5) | ~a_member_of(X4,X6) | ~sP0(X5,X6)).
% 0.12/0.34  cnf(a4, assumption,
% 0.12/0.34  	sK1(X2,X3) = X4).
% 0.12/0.34  cnf(a5, assumption,
% 0.12/0.34  	X2 = X6).
% 0.12/0.34  cnf(c9, plain,
% 0.12/0.34  	a_member_of(sK1(X2,X3),X3),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.34  cnf(c10, plain,
% 0.12/0.34  	a_member_of(X4,X5) | ~sP0(X5,X6),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.34  
% 0.12/0.34  cnf(c11, axiom,
% 0.12/0.34  	sP0(X7,X8) | ~a_member_of(sK1(X7,X8),X7) | ~a_member_of(sK1(X7,X8),X8)).
% 0.12/0.34  cnf(a6, assumption,
% 0.12/0.34  	X4 = sK1(X7,X8)).
% 0.12/0.34  cnf(a7, assumption,
% 0.12/0.34  	X5 = X8).
% 0.12/0.34  cnf(c12, plain,
% 0.12/0.34  	~sP0(X5,X6),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.12/0.34  cnf(c13, plain,
% 0.12/0.34  	sP0(X7,X8) | ~a_member_of(sK1(X7,X8),X7),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.12/0.34  
% 0.12/0.34  cnf(c14, plain,
% 0.12/0.34  	~sP0(X1,X0)).
% 0.12/0.34  cnf(a8, assumption,
% 0.12/0.34  	X7 = X1).
% 0.12/0.34  cnf(a9, assumption,
% 0.12/0.34  	X8 = X0).
% 0.12/0.34  cnf(c15, plain,
% 0.12/0.34  	~a_member_of(sK1(X7,X8),X7),
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 0.12/0.34  
% 0.12/0.34  cnf(c16, plain,
% 0.12/0.34  	a_member_of(sK1(X2,X3),X2)).
% 0.12/0.34  cnf(a10, assumption,
% 0.12/0.34  	sK1(X7,X8) = sK1(X2,X3)).
% 0.12/0.34  cnf(a11, assumption,
% 0.12/0.34  	X7 = X2).
% 0.12/0.34  cnf(c17, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a10, a11])], [c15, c16])).
% 0.12/0.34  
% 0.12/0.34  cnf(c18, axiom,
% 0.12/0.34  	sP0(X9,X10) | ~eq(X10,X9)).
% 0.12/0.34  cnf(a12, assumption,
% 0.12/0.34  	X5 = X9).
% 0.12/0.34  cnf(a13, assumption,
% 0.12/0.34  	X6 = X10).
% 0.12/0.34  cnf(c19, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c12, c18])).
% 0.12/0.34  cnf(c20, plain,
% 0.12/0.34  	~eq(X10,X9),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c12, c18])).
% 0.12/0.34  
% 0.12/0.34  cnf(c21, axiom,
% 0.12/0.34  	eq(sK2,sK3)).
% 0.12/0.34  cnf(a14, assumption,
% 0.12/0.34  	X10 = sK2).
% 0.12/0.34  cnf(a15, assumption,
% 0.12/0.34  	X9 = sK3).
% 0.12/0.34  cnf(c22, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])).
% 0.12/0.34  cnf(c23, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c20, c21])).
% 0.12/0.34  
% 0.12/0.34  cnf(c24, axiom,
% 0.12/0.34  	a_member_of(X11,X12) | ~a_member_of(X11,X13) | ~sP0(X13,X12)).
% 0.12/0.34  cnf(a16, assumption,
% 0.12/0.34  	sK1(X2,X3) = X11).
% 0.12/0.34  cnf(a17, assumption,
% 0.12/0.34  	X3 = X13).
% 0.12/0.34  cnf(c25, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c9, c24])).
% 0.12/0.34  cnf(c26, plain,
% 0.12/0.34  	a_member_of(X11,X12) | ~sP0(X13,X12),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c9, c24])).
% 0.12/0.34  
% 0.12/0.34  cnf(c27, plain,
% 0.12/0.34  	~a_member_of(sK1(X2,X3),X2)).
% 0.12/0.34  cnf(a18, assumption,
% 0.12/0.34  	X11 = sK1(X2,X3)).
% 0.12/0.34  cnf(a19, assumption,
% 0.12/0.34  	X12 = X2).
% 0.12/0.34  cnf(c28, plain,
% 0.12/0.34  	~sP0(X13,X12),
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a18, a19])], [c26, c27])).
% 0.12/0.34  
% 0.12/0.34  cnf(c29, plain,
% 0.12/0.34  	sP0(X5,X6)).
% 0.12/0.34  cnf(a20, assumption,
% 0.12/0.34  	X13 = X5).
% 0.12/0.34  cnf(a21, assumption,
% 0.12/0.34  	X12 = X6).
% 0.12/0.34  cnf(c30, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a20, a21])], [c28, c29])).
% 0.12/0.34  
% 0.12/0.34  cnf(c31, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(constraint_solving, [
% 0.12/0.34  		bind(X0, sK3),
% 0.12/0.34  		bind(X1, sK2),
% 0.12/0.34  		bind(X2, sK2),
% 0.12/0.34  		bind(X3, sK3),
% 0.12/0.34  		bind(X4, sK1(X2,X3)),
% 0.12/0.34  		bind(X5, sK3),
% 0.12/0.34  		bind(X6, sK2),
% 0.12/0.34  		bind(X7, sK2),
% 0.12/0.34  		bind(X8, sK3),
% 0.12/0.34  		bind(X9, sK3),
% 0.12/0.34  		bind(X10, sK2),
% 0.12/0.34  		bind(X11, sK1(X2,X3)),
% 0.12/0.34  		bind(X12, sK2),
% 0.12/0.34  		bind(X13, sK3)
% 0.12/0.34  	],
% 0.12/0.34  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 0.12/0.34  
% 0.12/0.34  % SZS output end IncompleteProof
%------------------------------------------------------------------------------