%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : FLD071-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 : 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 : Sat Jul 16 02:16:05 EDT 2022

% Result   : Unsatisfiable 0.15s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : FLD071-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.15  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.36  % Computer : n028.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Mon Jun  6 14:27:29 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.15/0.37  % SZS status Unsatisfiable
% 0.15/0.37  % SZS output begin IncompleteProof
% 0.15/0.37  cnf(c0, axiom,
% 0.15/0.37  	less_or_equal(additive_identity,b)).
% 0.15/0.37  cnf(c1, plain,
% 0.15/0.37  	less_or_equal(additive_identity,b),
% 0.15/0.37  	inference(start, [], [c0])).
% 0.15/0.37  
% 0.15/0.37  cnf(c2, axiom,
% 0.15/0.37  	~less_or_equal(additive_identity,X0) | ~less_or_equal(additive_identity,X1) | less_or_equal(additive_identity,multiply(X1,X0))).
% 0.15/0.37  cnf(a0, assumption,
% 0.15/0.37  	additive_identity = additive_identity).
% 0.15/0.37  cnf(a1, assumption,
% 0.15/0.37  	b = X0).
% 0.15/0.37  cnf(c3, plain,
% 0.15/0.37  	$false,
% 0.15/0.37  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.15/0.37  cnf(c4, plain,
% 0.15/0.37  	~less_or_equal(additive_identity,X1) | less_or_equal(additive_identity,multiply(X1,X0)),
% 0.15/0.37  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.15/0.37  
% 0.15/0.37  cnf(c5, axiom,
% 0.15/0.37  	less_or_equal(additive_identity,a)).
% 0.15/0.37  cnf(a2, assumption,
% 0.15/0.37  	additive_identity = additive_identity).
% 0.15/0.37  cnf(a3, assumption,
% 0.15/0.37  	X1 = a).
% 0.15/0.37  cnf(c6, plain,
% 0.15/0.37  	less_or_equal(additive_identity,multiply(X1,X0)),
% 0.15/0.37  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.15/0.37  cnf(c7, plain,
% 0.15/0.37  	$false,
% 0.15/0.37  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.15/0.37  
% 0.15/0.37  cnf(c8, axiom,
% 0.15/0.37  	~less_or_equal(additive_identity,multiply(a,b))).
% 0.15/0.37  cnf(a4, assumption,
% 0.15/0.37  	additive_identity = additive_identity).
% 0.15/0.37  cnf(a5, assumption,
% 0.15/0.37  	multiply(X1,X0) = multiply(a,b)).
% 0.15/0.37  cnf(c9, plain,
% 0.15/0.37  	$false,
% 0.15/0.37  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.15/0.37  cnf(c10, plain,
% 0.15/0.37  	$false,
% 0.15/0.37  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.15/0.37  
% 0.15/0.37  cnf(c11, plain,
% 0.15/0.37  	$false,
% 0.15/0.37  	inference(constraint_solving, [
% 0.15/0.37  		bind(X0, b),
% 0.15/0.37  		bind(X1, a)
% 0.15/0.37  	],
% 0.15/0.37  	[a0, a1, a2, a3, a4, a5])).
% 0.15/0.37  
% 0.15/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------