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

% Computer : n021.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 00:45:37 EDT 2022

% Result   : Theorem 0.84s 1.00s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWW302+1 : TPTP v8.1.0. Released v5.2.0.
% 0.04/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun  4 12:53:49 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.84/1.00  % SZS status Theorem
% 0.84/1.00  % SZS output begin IncompleteProof
% 0.84/1.00  cnf(c0, axiom,
% 0.84/1.00  	v_Q_H(X0,sK1064) | ~v_P(X0,sK1063)).
% 0.84/1.00  cnf(c1, plain,
% 0.84/1.00  	v_Q_H(X0,sK1064) | ~v_P(X0,sK1063),
% 0.84/1.00  	inference(start, [], [c0])).
% 0.84/1.00  
% 0.84/1.00  cnf(c2, axiom,
% 0.84/1.00  	v_Q(X1,X2) | ~v_Q_H(X1,X2)).
% 0.84/1.00  cnf(a0, assumption,
% 0.84/1.00  	X0 = X1).
% 0.84/1.00  cnf(a1, assumption,
% 0.84/1.00  	sK1064 = X2).
% 0.84/1.00  cnf(c3, plain,
% 0.84/1.00  	~v_P(X0,sK1063),
% 0.84/1.00  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.84/1.00  cnf(c4, plain,
% 0.84/1.00  	v_Q(X1,X2),
% 0.84/1.00  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.84/1.00  
% 0.84/1.00  cnf(c5, axiom,
% 0.84/1.00  	~v_Q(sK1062,sK1064)).
% 0.84/1.00  cnf(a2, assumption,
% 0.84/1.00  	X1 = sK1062).
% 0.84/1.00  cnf(a3, assumption,
% 0.84/1.00  	X2 = sK1064).
% 0.84/1.00  cnf(c6, plain,
% 0.84/1.00  	$false,
% 0.84/1.00  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.84/1.00  cnf(c7, plain,
% 0.84/1.00  	$false,
% 0.84/1.00  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.84/1.00  
% 0.84/1.00  cnf(c8, axiom,
% 0.84/1.00  	v_P(sK1062,sK1063)).
% 0.84/1.00  cnf(a4, assumption,
% 0.84/1.00  	X0 = sK1062).
% 0.84/1.00  cnf(a5, assumption,
% 0.84/1.00  	sK1063 = sK1063).
% 0.84/1.00  cnf(c9, plain,
% 0.84/1.00  	$false,
% 0.84/1.00  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c3, c8])).
% 0.84/1.00  cnf(c10, plain,
% 0.84/1.00  	$false,
% 0.84/1.00  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c3, c8])).
% 0.84/1.00  
% 0.84/1.00  cnf(c11, plain,
% 0.84/1.00  	$false,
% 0.84/1.00  	inference(constraint_solving, [
% 0.84/1.00  		bind(X0, sK1062),
% 0.84/1.00  		bind(X1, sK1062),
% 0.84/1.00  		bind(X2, sK1064)
% 0.84/1.00  	],
% 0.84/1.00  	[a0, a1, a2, a3, a4, a5])).
% 0.84/1.00  
% 0.84/1.00  % SZS output end IncompleteProof
%------------------------------------------------------------------------------