TSTP Solution File: GRP182-1 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n006.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 10:09:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP182-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun 14 03:17:41 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % SZS status Unsatisfiable
% 0.12/0.35  % SZS output begin IncompleteProof
% 0.12/0.35  cnf(c0, axiom,
% 0.12/0.35  	identity != least_upper_bound(identity,greatest_lower_bound(a,identity))).
% 0.12/0.35  cnf(c1, plain,
% 0.12/0.35  	identity != least_upper_bound(identity,greatest_lower_bound(a,identity)),
% 0.12/0.35  	inference(start, [], [c0])).
% 0.12/0.35  
% 0.12/0.35  cnf(c2, axiom,
% 0.12/0.35  	greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0)).
% 0.12/0.35  cnf(a0, assumption,
% 0.12/0.35  	greatest_lower_bound(a,identity) = greatest_lower_bound(X0,X1)).
% 0.12/0.35  cnf(c3, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  cnf(c4, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  cnf(c5, plain,
% 0.12/0.35  	X2 != greatest_lower_bound(X1,X0) | identity != least_upper_bound(identity,X2),
% 0.12/0.35  	inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  
% 0.12/0.35  cnf(a1, assumption,
% 0.12/0.35  	X2 = greatest_lower_bound(X1,X0)).
% 0.12/0.35  cnf(c6, plain,
% 0.12/0.35  	identity != least_upper_bound(identity,X2),
% 0.12/0.35  	inference(reflexivity, [assumptions([a1])], [c5])).
% 0.12/0.35  
% 0.12/0.35  cnf(c7, axiom,
% 0.12/0.35  	least_upper_bound(X3,greatest_lower_bound(X3,X4)) = X3).
% 0.12/0.35  cnf(a2, assumption,
% 0.12/0.35  	least_upper_bound(identity,X2) = least_upper_bound(X3,greatest_lower_bound(X3,X4))).
% 0.12/0.35  cnf(c8, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.12/0.35  cnf(c9, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.12/0.35  cnf(c10, plain,
% 0.12/0.35  	X5 != X3 | identity != X5,
% 0.12/0.35  	inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 0.12/0.35  
% 0.12/0.35  cnf(a3, assumption,
% 0.12/0.35  	X5 = X3).
% 0.12/0.35  cnf(c11, plain,
% 0.12/0.35  	identity != X5,
% 0.12/0.35  	inference(reflexivity, [assumptions([a3])], [c10])).
% 0.12/0.35  
% 0.12/0.35  cnf(a4, assumption,
% 0.12/0.35  	identity = X5).
% 0.12/0.35  cnf(c12, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(reflexivity, [assumptions([a4])], [c11])).
% 0.12/0.35  
% 0.12/0.35  cnf(c13, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(constraint_solving, [
% 0.12/0.35  		bind(X0, a),
% 0.12/0.35  		bind(X1, identity),
% 0.12/0.35  		bind(X2, greatest_lower_bound(X1,X0)),
% 0.12/0.35  		bind(X3, identity),
% 0.12/0.35  		bind(X4, a),
% 0.12/0.35  		bind(X5, identity)
% 0.12/0.35  	],
% 0.12/0.35  	[a0, a1, a2, a3, a4])).
% 0.12/0.35  
% 0.12/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------