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

% Computer : n027.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 : Sat Jul 16 02:16:00 EDT 2022

% Result   : Unsatisfiable 0.14s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : FLD056-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n027.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 : Mon Jun  6 15:43:39 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  % SZS status Unsatisfiable
% 0.14/0.35  % SZS output begin IncompleteProof
% 0.14/0.35  cnf(c0, axiom,
% 0.14/0.35  	~less_or_equal(a,a)).
% 0.14/0.35  cnf(c1, plain,
% 0.14/0.35  	~less_or_equal(a,a),
% 0.14/0.35  	inference(start, [], [c0])).
% 0.14/0.35  
% 0.14/0.35  cnf(c2, axiom,
% 0.14/0.35  	~defined(X0) | ~defined(X1) | less_or_equal(X0,X1) | less_or_equal(X1,X0)).
% 0.14/0.35  cnf(a0, assumption,
% 0.14/0.35  	a = X0).
% 0.14/0.35  cnf(a1, assumption,
% 0.14/0.35  	a = X1).
% 0.14/0.35  cnf(c3, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35  cnf(c4, plain,
% 0.14/0.35  	~defined(X0) | ~defined(X1) | less_or_equal(X1,X0),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.35  
% 0.14/0.35  cnf(c5, axiom,
% 0.14/0.35  	defined(a)).
% 0.14/0.35  cnf(a2, assumption,
% 0.14/0.35  	X0 = a).
% 0.14/0.35  cnf(c6, plain,
% 0.14/0.35  	~defined(X1) | less_or_equal(X1,X0),
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.35  cnf(c7, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 0.14/0.35  
% 0.14/0.35  cnf(c8, plain,
% 0.14/0.35  	defined(X0)).
% 0.14/0.35  cnf(a3, assumption,
% 0.14/0.35  	X1 = X0).
% 0.14/0.35  cnf(c9, plain,
% 0.14/0.35  	less_or_equal(X1,X0),
% 0.14/0.35  	inference(predicate_reduction, [assumptions([a3])], [c6, c8])).
% 0.14/0.35  
% 0.14/0.35  cnf(c10, plain,
% 0.14/0.35  	~less_or_equal(a,a)).
% 0.14/0.35  cnf(a4, assumption,
% 0.14/0.35  	X1 = a).
% 0.14/0.35  cnf(a5, assumption,
% 0.14/0.35  	X0 = a).
% 0.14/0.35  cnf(c11, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(predicate_reduction, [assumptions([a4, a5])], [c9, c10])).
% 0.14/0.35  
% 0.14/0.35  cnf(c12, plain,
% 0.14/0.35  	$false,
% 0.14/0.35  	inference(constraint_solving, [
% 0.14/0.35  		bind(X0, a),
% 0.14/0.35  		bind(X1, a)
% 0.14/0.35  	],
% 0.14/0.35  	[a0, a1, a2, a3, a4, a5])).
% 0.14/0.35  
% 0.14/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------