%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYN370+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 : 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:10:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN370+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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 18:26:44 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  	~big_p(X0,sK0(X0),X1)).
% 0.12/0.34  cnf(c1, plain,
% 0.12/0.34  	~big_p(X0,sK0(X0),X1),
% 0.12/0.34  	inference(start, [], [c0])).
% 0.12/0.34  
% 0.12/0.34  cnf(c2, axiom,
% 0.12/0.34  	big_p(X2,sK0(X2),f(sK0(X2))) | big_p(a,sK0(X2),h(sK0(X2)))).
% 0.12/0.34  cnf(a0, assumption,
% 0.12/0.34  	X0 = X2).
% 0.12/0.34  cnf(a1, assumption,
% 0.12/0.34  	sK0(X0) = sK0(X2)).
% 0.12/0.34  cnf(a2, assumption,
% 0.12/0.34  	X1 = f(sK0(X2))).
% 0.12/0.34  cnf(c3, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34  cnf(c4, plain,
% 0.12/0.34  	big_p(a,sK0(X2),h(sK0(X2))),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34  
% 0.12/0.34  cnf(c5, axiom,
% 0.12/0.34  	~big_p(X3,sK0(X3),X4)).
% 0.12/0.34  cnf(a3, assumption,
% 0.12/0.34  	a = X3).
% 0.12/0.34  cnf(a4, assumption,
% 0.12/0.34  	sK0(X2) = sK0(X3)).
% 0.12/0.34  cnf(a5, assumption,
% 0.12/0.34  	h(sK0(X2)) = X4).
% 0.12/0.34  cnf(c6, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.12/0.34  cnf(c7, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.12/0.34  
% 0.12/0.34  cnf(c8, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(constraint_solving, [
% 0.12/0.34  		bind(X0, a),
% 0.12/0.34  		bind(X1, f(sK0(X2))),
% 0.12/0.34  		bind(X2, a),
% 0.12/0.34  		bind(X3, a),
% 0.12/0.34  		bind(X4, h(sK0(X2)))
% 0.12/0.34  	],
% 0.12/0.34  	[a0, a1, a2, a3, a4, a5])).
% 0.12/0.34  
% 0.12/0.34  % SZS output end IncompleteProof
%------------------------------------------------------------------------------