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

View Problem - Process Solution

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

% Computer : n006.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:07:55 EDT 2022

% Result   : Theorem 5.09s 0.99s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n006.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Tue Jul 12 05:32:35 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 5.09/0.99  % SZS status Theorem
% 5.09/0.99  % SZS output begin IncompleteProof
% 5.09/0.99  cnf(c0, axiom,
% 5.09/0.99  	sK5(X0) = X0 | sP0(sK5(X0))).
% 5.09/0.99  cnf(c1, plain,
% 5.09/0.99  	sK5(X0) = X0 | sP0(sK5(X0)),
% 5.09/0.99  	inference(start, [], [c0])).
% 5.09/0.99  
% 5.09/0.99  cnf(c2, axiom,
% 5.09/0.99  	sK5(X1) != X1 | ~sP0(sK5(X1))).
% 5.09/0.99  cnf(a0, assumption,
% 5.09/0.99  	sK5(X1) = sK5(X0)).
% 5.09/0.99  cnf(c3, plain,
% 5.09/0.99  	sP0(sK5(X0)),
% 5.09/0.99  	inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 5.09/0.99  cnf(c4, plain,
% 5.09/0.99  	sK5(X1) != X1,
% 5.09/0.99  	inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 5.09/0.99  cnf(c5, plain,
% 5.09/0.99  	~sP0(X0),
% 5.09/0.99  	inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 5.09/0.99  
% 5.09/0.99  cnf(c6, axiom,
% 5.09/0.99  	sP0(X2) | sK3(X2,X3) = X3 | big_f(sK3(X2,X3),X2)).
% 5.09/0.99  cnf(a1, assumption,
% 5.09/0.99  	X0 = X2).
% 5.09/0.99  cnf(c7, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a1])], [c5, c6])).
% 5.09/0.99  cnf(c8, plain,
% 5.09/0.99  	sK3(X2,X3) = X3 | big_f(sK3(X2,X3),X2),
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a1])], [c5, c6])).
% 5.09/0.99  
% 5.09/0.99  cnf(c9, axiom,
% 5.09/0.99  	sP0(X4) | sK3(X4,X5) != X5 | ~big_f(sK3(X4,X5),X4)).
% 5.09/0.99  cnf(a2, assumption,
% 5.09/0.99  	sK3(X4,X5) = sK3(X2,X3)).
% 5.09/0.99  cnf(c10, plain,
% 5.09/0.99  	big_f(sK3(X2,X3),X2),
% 5.09/0.99  	inference(strict_subterm_extension, [assumptions([a2])], [c8, c9])).
% 5.09/0.99  cnf(c11, plain,
% 5.09/0.99  	sP0(X4) | ~big_f(sK3(X4,X5),X4),
% 5.09/0.99  	inference(strict_subterm_extension, [assumptions([a2])], [c8, c9])).
% 5.09/0.99  cnf(c12, plain,
% 5.09/0.99  	X3 != X5,
% 5.09/0.99  	inference(strict_subterm_extension, [assumptions([a2])], [c8, c9])).
% 5.09/0.99  
% 5.09/0.99  cnf(a3, assumption,
% 5.09/0.99  	X3 = X5).
% 5.09/0.99  cnf(c13, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(reflexivity, [assumptions([a3])], [c12])).
% 5.09/0.99  
% 5.09/0.99  cnf(c14, plain,
% 5.09/0.99  	~sP0(X0)).
% 5.09/0.99  cnf(a4, assumption,
% 5.09/0.99  	X4 = X0).
% 5.09/0.99  cnf(c15, plain,
% 5.09/0.99  	~big_f(sK3(X4,X5),X4),
% 5.09/0.99  	inference(predicate_reduction, [assumptions([a4])], [c11, c14])).
% 5.09/0.99  
% 5.09/0.99  cnf(c16, plain,
% 5.09/0.99  	sK3(X2,X3) = X3).
% 5.09/0.99  cnf(a5, assumption,
% 5.09/0.99  	sK3(X4,X5) = sK3(X2,X3)).
% 5.09/0.99  cnf(c17, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(equality_reduction, [assumptions([a5])], [c15, c16])).
% 5.09/0.99  cnf(c18, plain,
% 5.09/0.99  	~big_f(X3,X4),
% 5.09/0.99  	inference(equality_reduction, [assumptions([a5])], [c15, c16])).
% 5.09/0.99  
% 5.09/0.99  cnf(c19, axiom,
% 5.09/0.99  	big_f(sK1,sK2)).
% 5.09/0.99  cnf(a6, assumption,
% 5.09/0.99  	X3 = sK1).
% 5.09/0.99  cnf(a7, assumption,
% 5.09/0.99  	X4 = sK2).
% 5.09/0.99  cnf(c20, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c18, c19])).
% 5.09/0.99  cnf(c21, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c18, c19])).
% 5.09/0.99  
% 5.09/0.99  cnf(c22, axiom,
% 5.09/0.99  	sK1 = X6 | ~big_f(X6,X7)).
% 5.09/0.99  cnf(a8, assumption,
% 5.09/0.99  	sK3(X2,X3) = X6).
% 5.09/0.99  cnf(a9, assumption,
% 5.09/0.99  	X2 = X7).
% 5.09/0.99  cnf(c23, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c10, c22])).
% 5.09/0.99  cnf(c24, plain,
% 5.09/0.99  	sK1 = X6,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c10, c22])).
% 5.09/0.99  
% 5.09/0.99  cnf(c25, plain,
% 5.09/0.99  	sK3(X2,X3) != X3).
% 5.09/0.99  cnf(a10, assumption,
% 5.09/0.99  	sK3(X2,X3) = X6).
% 5.09/0.99  cnf(a11, assumption,
% 5.09/0.99  	sK1 = X8).
% 5.09/0.99  cnf(c26, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(subterm_reduction, [assumptions([a10, a11])], [c24, c25])).
% 5.09/0.99  cnf(c27, plain,
% 5.09/0.99  	X8 != X3,
% 5.09/0.99  	inference(subterm_reduction, [assumptions([a10, a11])], [c24, c25])).
% 5.09/0.99  
% 5.09/0.99  cnf(a12, assumption,
% 5.09/0.99  	X8 = X3).
% 5.09/0.99  cnf(c28, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(reflexivity, [assumptions([a12])], [c27])).
% 5.09/0.99  
% 5.09/0.99  cnf(c29, plain,
% 5.09/0.99  	sK5(X0) = X0).
% 5.09/0.99  cnf(a13, assumption,
% 5.09/0.99  	sK5(X1) = sK5(X0)).
% 5.09/0.99  cnf(c30, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(equality_reduction, [assumptions([a13])], [c4, c29])).
% 5.09/0.99  cnf(c31, plain,
% 5.09/0.99  	X0 != X1,
% 5.09/0.99  	inference(equality_reduction, [assumptions([a13])], [c4, c29])).
% 5.09/0.99  
% 5.09/0.99  cnf(a14, assumption,
% 5.09/0.99  	X0 = X1).
% 5.09/0.99  cnf(c32, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(reflexivity, [assumptions([a14])], [c31])).
% 5.09/0.99  
% 5.09/0.99  cnf(c33, axiom,
% 5.09/0.99  	big_f(sK4(X9),X9) | ~sP0(X9)).
% 5.09/0.99  cnf(a15, assumption,
% 5.09/0.99  	sK5(X0) = X9).
% 5.09/0.99  cnf(c34, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a15])], [c3, c33])).
% 5.09/0.99  cnf(c35, plain,
% 5.09/0.99  	big_f(sK4(X9),X9),
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a15])], [c3, c33])).
% 5.09/0.99  
% 5.09/0.99  cnf(c36, axiom,
% 5.09/0.99  	sK2 = X10 | ~big_f(X11,X10)).
% 5.09/0.99  cnf(a16, assumption,
% 5.09/0.99  	sK4(X9) = X11).
% 5.09/0.99  cnf(a17, assumption,
% 5.09/0.99  	X9 = X10).
% 5.09/0.99  cnf(c37, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c35, c36])).
% 5.09/0.99  cnf(c38, plain,
% 5.09/0.99  	sK2 = X10,
% 5.09/0.99  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c35, c36])).
% 5.09/0.99  
% 5.09/0.99  cnf(c39, plain,
% 5.09/0.99  	sK5(X0) != X0).
% 5.09/0.99  cnf(a18, assumption,
% 5.09/0.99  	sK5(X0) = X10).
% 5.09/0.99  cnf(a19, assumption,
% 5.09/0.99  	sK2 = X12).
% 5.09/0.99  cnf(c40, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(subterm_reduction, [assumptions([a18, a19])], [c38, c39])).
% 5.09/0.99  cnf(c41, plain,
% 5.09/0.99  	X12 != X0,
% 5.09/0.99  	inference(subterm_reduction, [assumptions([a18, a19])], [c38, c39])).
% 5.09/0.99  
% 5.09/0.99  cnf(a20, assumption,
% 5.09/0.99  	X12 = X0).
% 5.09/0.99  cnf(c42, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(reflexivity, [assumptions([a20])], [c41])).
% 5.09/0.99  
% 5.09/0.99  cnf(c43, plain,
% 5.09/0.99  	$false,
% 5.09/0.99  	inference(constraint_solving, [
% 5.09/0.99  		bind(X0, sK2),
% 5.09/0.99  		bind(X1, sK2),
% 5.09/0.99  		bind(X2, sK2),
% 5.09/0.99  		bind(X3, sK1),
% 5.09/0.99  		bind(X4, sK2),
% 5.09/0.99  		bind(X5, sK1),
% 5.09/0.99  		bind(X6, sK3(X2,X3)),
% 5.09/0.99  		bind(X7, sK2),
% 5.09/0.99  		bind(X8, sK1),
% 5.09/0.99  		bind(X9, sK5(X0)),
% 5.09/0.99  		bind(X10, sK5(X0)),
% 5.09/0.99  		bind(X11, sK4(X9)),
% 5.09/0.99  		bind(X12, sK2)
% 5.09/0.99  	],
% 5.09/0.99  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 5.09/0.99  
% 5.09/0.99  % SZS output end IncompleteProof
%------------------------------------------------------------------------------