↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : GRP145-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 : n019.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:22 EDT 2022

% Result   : Unsatisfiable 0.11s 0.33s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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