%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYN380+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 : n013.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:14 EDT 2022

% Result   : Theorem 0.13s 0.33s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN380+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.32  % Computer : n013.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 600
% 0.13/0.32  % DateTime : Tue Jul 12 04:28:14 EDT 2022
% 0.13/0.32  % CPUTime  : 
% 0.13/0.33  % SZS status Theorem
% 0.13/0.33  % SZS output begin IncompleteProof
% 0.13/0.33  cnf(c0, axiom,
% 0.13/0.33  	~big_r(X0,X0)).
% 0.13/0.33  cnf(c1, plain,
% 0.13/0.33  	~big_r(X0,X0),
% 0.13/0.33  	inference(start, [], [c0])).
% 0.13/0.33  
% 0.13/0.33  cnf(c2, axiom,
% 0.13/0.33  	~big_q(sK0,sK0) | big_r(X1,X2)).
% 0.13/0.33  cnf(a0, assumption,
% 0.13/0.33  	X0 = X1).
% 0.13/0.33  cnf(a1, assumption,
% 0.13/0.33  	X0 = X2).
% 0.13/0.33  cnf(c3, plain,
% 0.13/0.33  	$false,
% 0.13/0.33  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.33  cnf(c4, plain,
% 0.13/0.33  	~big_q(sK0,sK0),
% 0.13/0.33  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.33  
% 0.13/0.33  cnf(c5, axiom,
% 0.13/0.33  	big_q(X3,X4) | big_r(X4,X3)).
% 0.13/0.33  cnf(a2, assumption,
% 0.13/0.33  	sK0 = X3).
% 0.13/0.33  cnf(a3, assumption,
% 0.13/0.33  	sK0 = X4).
% 0.13/0.33  cnf(c6, plain,
% 0.13/0.33  	$false,
% 0.13/0.33  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.33  cnf(c7, plain,
% 0.13/0.33  	big_r(X4,X3),
% 0.13/0.33  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.33  
% 0.13/0.33  cnf(c8, plain,
% 0.13/0.33  	~big_r(X0,X0)).
% 0.13/0.33  cnf(a4, assumption,
% 0.13/0.33  	X4 = X0).
% 0.13/0.33  cnf(a5, assumption,
% 0.13/0.33  	X3 = X0).
% 0.13/0.33  cnf(c9, plain,
% 0.13/0.33  	$false,
% 0.13/0.33  	inference(predicate_reduction, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.33  
% 0.13/0.33  cnf(c10, plain,
% 0.13/0.33  	$false,
% 0.13/0.33  	inference(constraint_solving, [
% 0.13/0.33  		bind(X0, sK0),
% 0.13/0.33  		bind(X1, sK0),
% 0.13/0.33  		bind(X2, sK0),
% 0.13/0.33  		bind(X3, sK0),
% 0.13/0.33  		bind(X4, sK0)
% 0.13/0.33  	],
% 0.13/0.33  	[a0, a1, a2, a3, a4, a5])).
% 0.13/0.33  
% 0.13/0.33  % SZS output end IncompleteProof
%------------------------------------------------------------------------------