TSTP Solution File: GEO065-3 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : GEO065-3 : 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 : n032.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 04:58:43 EDT 2022

% Result   : Unsatisfiable 0.10s 0.29s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : GEO065-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.05/0.10  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Sat Jun 18 04:17:01 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.10/0.29  % SZS status Unsatisfiable
% 0.10/0.29  % SZS output begin IncompleteProof
% 0.10/0.29  cnf(c0, axiom,
% 0.10/0.29  	~colinear(u,v,w)).
% 0.10/0.29  cnf(c1, plain,
% 0.10/0.29  	~colinear(u,v,w),
% 0.10/0.29  	inference(start, [], [c0])).
% 0.10/0.29  
% 0.10/0.29  cnf(c2, axiom,
% 0.10/0.29  	colinear(X0,X1,X2) | ~between(X1,X2,X0)).
% 0.10/0.29  cnf(a0, assumption,
% 0.10/0.29  	u = X0).
% 0.10/0.29  cnf(a1, assumption,
% 0.10/0.29  	v = X1).
% 0.10/0.29  cnf(a2, assumption,
% 0.10/0.29  	w = X2).
% 0.10/0.29  cnf(c3, plain,
% 0.10/0.29  	$false,
% 0.10/0.29  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.10/0.29  cnf(c4, plain,
% 0.10/0.29  	~between(X1,X2,X0),
% 0.10/0.29  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.10/0.29  
% 0.10/0.29  cnf(c5, axiom,
% 0.10/0.29  	between(X3,X4,X5) | ~between(X5,X4,X3)).
% 0.10/0.29  cnf(a3, assumption,
% 0.10/0.29  	X1 = X3).
% 0.10/0.29  cnf(a4, assumption,
% 0.10/0.29  	X2 = X4).
% 0.10/0.29  cnf(a5, assumption,
% 0.10/0.29  	X0 = X5).
% 0.10/0.29  cnf(c6, plain,
% 0.10/0.29  	$false,
% 0.10/0.29  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.10/0.29  cnf(c7, plain,
% 0.10/0.29  	~between(X5,X4,X3),
% 0.10/0.29  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.10/0.29  
% 0.10/0.29  cnf(c8, axiom,
% 0.10/0.29  	between(u,w,v)).
% 0.10/0.29  cnf(a6, assumption,
% 0.10/0.29  	X5 = u).
% 0.10/0.29  cnf(a7, assumption,
% 0.10/0.29  	X4 = w).
% 0.10/0.29  cnf(a8, assumption,
% 0.10/0.29  	X3 = v).
% 0.10/0.29  cnf(c9, plain,
% 0.10/0.29  	$false,
% 0.10/0.29  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.10/0.29  cnf(c10, plain,
% 0.10/0.29  	$false,
% 0.10/0.29  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 0.10/0.29  
% 0.10/0.29  cnf(c11, plain,
% 0.10/0.29  	$false,
% 0.10/0.29  	inference(constraint_solving, [
% 0.10/0.30  		bind(X0, u),
% 0.10/0.30  		bind(X1, v),
% 0.10/0.30  		bind(X2, w),
% 0.10/0.30  		bind(X3, v),
% 0.10/0.30  		bind(X4, w),
% 0.10/0.30  		bind(X5, u)
% 0.10/0.30  	],
% 0.10/0.30  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.10/0.30  
% 0.10/0.30  % SZS output end IncompleteProof
%------------------------------------------------------------------------------