%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR107+7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n022.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 : Fri Jul 15 20:37:17 EDT 2022

% Result   : Theorem 2.57s 2.30s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR107+7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35  % Computer : n022.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Sat Jun 11 04:17:49 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 2.57/2.30  % SZS status Theorem
% 2.57/2.30  % SZS output begin IncompleteProof
% 2.57/2.30  cnf(c0, axiom,
% 2.57/2.30  	~s__overlapsTemporally(s__TimeInterval38_3,X0) | ~s__overlapsTemporally(s__TimeInterval38_3,X1)).
% 2.57/2.30  cnf(c1, plain,
% 2.57/2.30  	~s__overlapsTemporally(s__TimeInterval38_3,X0) | ~s__overlapsTemporally(s__TimeInterval38_3,X1),
% 2.57/2.30  	inference(start, [], [c0])).
% 2.57/2.30  
% 2.57/2.30  cnf(c2, axiom,
% 2.57/2.30  	s__overlapsTemporally(X2,X2) | ~s__instance(X2,s__TimeInterval)).
% 2.57/2.30  cnf(a0, assumption,
% 2.57/2.30  	s__TimeInterval38_3 = X2).
% 2.57/2.30  cnf(a1, assumption,
% 2.57/2.30  	X0 = X2).
% 2.57/2.30  cnf(c3, plain,
% 2.57/2.30  	~s__overlapsTemporally(s__TimeInterval38_3,X1),
% 2.57/2.30  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.57/2.30  cnf(c4, plain,
% 2.57/2.30  	~s__instance(X2,s__TimeInterval),
% 2.57/2.30  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.57/2.30  
% 2.57/2.30  cnf(c5, axiom,
% 2.57/2.30  	s__instance(s__TimeInterval38_3,s__TimeInterval)).
% 2.57/2.30  cnf(a2, assumption,
% 2.57/2.30  	X2 = s__TimeInterval38_3).
% 2.57/2.30  cnf(a3, assumption,
% 2.57/2.30  	s__TimeInterval = s__TimeInterval).
% 2.57/2.30  cnf(c6, plain,
% 2.57/2.30  	$false,
% 2.57/2.30  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.57/2.30  cnf(c7, plain,
% 2.57/2.30  	$false,
% 2.57/2.30  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.57/2.30  
% 2.57/2.30  cnf(c8, plain,
% 2.57/2.30  	s__overlapsTemporally(s__TimeInterval38_3,X0)).
% 2.57/2.30  cnf(a4, assumption,
% 2.57/2.30  	s__TimeInterval38_3 = s__TimeInterval38_3).
% 2.57/2.30  cnf(a5, assumption,
% 2.57/2.30  	X1 = X0).
% 2.57/2.30  cnf(c9, plain,
% 2.57/2.30  	$false,
% 2.57/2.30  	inference(predicate_reduction, [assumptions([a4, a5])], [c3, c8])).
% 2.57/2.30  
% 2.57/2.30  cnf(c10, plain,
% 2.57/2.30  	$false,
% 2.57/2.30  	inference(constraint_solving, [
% 2.57/2.30  		bind(X0, s__TimeInterval38_3),
% 2.57/2.30  		bind(X1, s__TimeInterval38_3),
% 2.57/2.30  		bind(X2, s__TimeInterval38_3)
% 2.57/2.30  	],
% 2.57/2.30  	[a0, a1, a2, a3, a4, a5])).
% 2.57/2.30  
% 2.57/2.30  % SZS output end IncompleteProof
%------------------------------------------------------------------------------