TSTP Solution File: GEO199+2 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : GEO199+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n022.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:59:52 EDT 2022

% Result   : Timeout 290.15s 37.87s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO199+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 18 01:42:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 290.15/37.87  % SZS status Theorem
% 290.15/37.87  % SZS output begin IncompleteProof
% 290.15/37.87  cnf(c0, axiom,
% 290.15/37.87  	apart_point_and_line(intersection_point(sK1,sK0),sK2)).
% 290.15/37.87  cnf(c1, plain,
% 290.15/37.87  	apart_point_and_line(intersection_point(sK1,sK0),sK2),
% 290.15/37.87  	inference(start, [], [c0])).
% 290.15/37.87  
% 290.15/37.87  cnf(c2, axiom,
% 290.15/37.87  	apart_point_and_line(X0,X1) | distinct_points(X2,X0) | ~apart_point_and_line(X2,X1)).
% 290.15/37.87  cnf(a0, assumption,
% 290.15/37.87  	intersection_point(sK1,sK0) = X2).
% 290.15/37.87  cnf(a1, assumption,
% 290.15/37.87  	sK2 = X1).
% 290.15/37.87  cnf(c3, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 290.15/37.87  cnf(c4, plain,
% 290.15/37.87  	apart_point_and_line(X0,X1) | distinct_points(X2,X0),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 290.15/37.87  
% 290.15/37.87  cnf(c5, axiom,
% 290.15/37.87  	~apart_point_and_line(intersection_point(sK0,sK1),sK2)).
% 290.15/37.87  cnf(a2, assumption,
% 290.15/37.87  	X0 = intersection_point(sK0,sK1)).
% 290.15/37.87  cnf(a3, assumption,
% 290.15/37.87  	X1 = sK2).
% 290.15/37.87  cnf(c6, plain,
% 290.15/37.87  	distinct_points(X2,X0),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 290.15/37.87  cnf(c7, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 290.15/37.87  
% 290.15/37.87  cnf(c8, axiom,
% 290.15/37.87  	apart_point_and_line(X3,X4) | apart_point_and_line(X3,X5) | apart_point_and_line(X6,X4) | apart_point_and_line(X6,X5) | ~distinct_lines(X5,X4) | ~distinct_points(X6,X3)).
% 290.15/37.87  cnf(a4, assumption,
% 290.15/37.87  	X2 = X6).
% 290.15/37.87  cnf(a5, assumption,
% 290.15/37.87  	X0 = X3).
% 290.15/37.87  cnf(c9, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 290.15/37.87  cnf(c10, plain,
% 290.15/37.87  	apart_point_and_line(X3,X4) | apart_point_and_line(X3,X5) | apart_point_and_line(X6,X4) | apart_point_and_line(X6,X5) | ~distinct_lines(X5,X4),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 290.15/37.87  
% 290.15/37.87  cnf(c11, axiom,
% 290.15/37.87  	distinct_points(X7,intersection_point(X8,X9)) | ~apart_point_and_line(X7,X8) | ~convergent_lines(X8,X9)).
% 290.15/37.87  cnf(a6, assumption,
% 290.15/37.87  	X3 = X7).
% 290.15/37.87  cnf(a7, assumption,
% 290.15/37.87  	X4 = X8).
% 290.15/37.87  cnf(c12, plain,
% 290.15/37.87  	apart_point_and_line(X3,X5) | apart_point_and_line(X6,X4) | apart_point_and_line(X6,X5) | ~distinct_lines(X5,X4),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 290.15/37.87  cnf(c13, plain,
% 290.15/37.87  	distinct_points(X7,intersection_point(X8,X9)) | ~convergent_lines(X8,X9),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 290.15/37.87  
% 290.15/37.87  cnf(c14, axiom,
% 290.15/37.87  	~distinct_points(X10,X10)).
% 290.15/37.87  cnf(a8, assumption,
% 290.15/37.87  	X7 = X10).
% 290.15/37.87  cnf(a9, assumption,
% 290.15/37.87  	intersection_point(X8,X9) = X10).
% 290.15/37.87  cnf(c15, plain,
% 290.15/37.87  	~convergent_lines(X8,X9),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 290.15/37.87  cnf(c16, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 290.15/37.87  
% 290.15/37.87  cnf(c17, axiom,
% 290.15/37.87  	convergent_lines(sK0,sK1)).
% 290.15/37.87  cnf(a10, assumption,
% 290.15/37.87  	X8 = sK0).
% 290.15/37.87  cnf(a11, assumption,
% 290.15/37.87  	X9 = sK1).
% 290.15/37.87  cnf(c18, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 290.15/37.87  cnf(c19, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 290.15/37.87  
% 290.15/37.87  cnf(c20, axiom,
% 290.15/37.87  	distinct_points(X11,intersection_point(X12,X13)) | ~apart_point_and_line(X11,X13) | ~convergent_lines(X12,X13)).
% 290.15/37.87  cnf(a12, assumption,
% 290.15/37.87  	X3 = X11).
% 290.15/37.87  cnf(a13, assumption,
% 290.15/37.87  	X5 = X13).
% 290.15/37.87  cnf(c21, plain,
% 290.15/37.87  	apart_point_and_line(X6,X4) | apart_point_and_line(X6,X5) | ~distinct_lines(X5,X4),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c12, c20])).
% 290.15/37.87  cnf(c22, plain,
% 290.15/37.87  	distinct_points(X11,intersection_point(X12,X13)) | ~convergent_lines(X12,X13),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c12, c20])).
% 290.15/37.87  
% 290.15/37.87  cnf(c23, plain,
% 290.15/37.87  	~distinct_points(X7,intersection_point(X8,X9))).
% 290.15/37.87  cnf(a14, assumption,
% 290.15/37.87  	X11 = X7).
% 290.15/37.87  cnf(a15, assumption,
% 290.15/37.87  	intersection_point(X12,X13) = intersection_point(X8,X9)).
% 290.15/37.87  cnf(c24, plain,
% 290.15/37.87  	~convergent_lines(X12,X13),
% 290.15/37.87  	inference(predicate_reduction, [assumptions([a14, a15])], [c22, c23])).
% 290.15/37.87  
% 290.15/37.87  cnf(c25, plain,
% 290.15/37.87  	convergent_lines(X8,X9)).
% 290.15/37.87  cnf(a16, assumption,
% 290.15/37.87  	X12 = X8).
% 290.15/37.87  cnf(a17, assumption,
% 290.15/37.87  	X13 = X9).
% 290.15/37.87  cnf(c26, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 290.15/37.87  
% 290.15/37.87  cnf(c27, axiom,
% 290.15/37.87  	distinct_points(X14,intersection_point(X15,X16)) | ~apart_point_and_line(X14,X16) | ~convergent_lines(X15,X16)).
% 290.15/37.87  cnf(a18, assumption,
% 290.15/37.87  	X6 = X14).
% 290.15/37.87  cnf(a19, assumption,
% 290.15/37.87  	X4 = X16).
% 290.15/37.87  cnf(c28, plain,
% 290.15/37.87  	apart_point_and_line(X6,X5) | ~distinct_lines(X5,X4),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c21, c27])).
% 290.15/37.87  cnf(c29, plain,
% 290.15/37.87  	distinct_points(X14,intersection_point(X15,X16)) | ~convergent_lines(X15,X16),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c21, c27])).
% 290.15/37.87  
% 290.15/37.87  cnf(c30, axiom,
% 290.15/37.87  	~distinct_points(X17,X17)).
% 290.15/37.87  cnf(a20, assumption,
% 290.15/37.87  	X14 = X17).
% 290.15/37.87  cnf(a21, assumption,
% 290.15/37.87  	intersection_point(X15,X16) = X17).
% 290.15/37.87  cnf(c31, plain,
% 290.15/37.87  	~convergent_lines(X15,X16),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 290.15/37.87  cnf(c32, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 290.15/37.87  
% 290.15/37.87  cnf(c33, axiom,
% 290.15/37.87  	convergent_lines(X18,X19) | convergent_lines(X20,X19) | ~convergent_lines(X20,X18)).
% 290.15/37.87  cnf(a22, assumption,
% 290.15/37.87  	X15 = X18).
% 290.15/37.87  cnf(a23, assumption,
% 290.15/37.87  	X16 = X19).
% 290.15/37.87  cnf(c34, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c33])).
% 290.15/37.87  cnf(c35, plain,
% 290.15/37.87  	convergent_lines(X20,X19) | ~convergent_lines(X20,X18),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c33])).
% 290.15/37.87  
% 290.15/37.87  cnf(c36, axiom,
% 290.15/37.87  	~convergent_lines(X21,X21)).
% 290.15/37.87  cnf(a24, assumption,
% 290.15/37.87  	X20 = X21).
% 290.15/37.87  cnf(a25, assumption,
% 290.15/37.87  	X19 = X21).
% 290.15/37.87  cnf(c37, plain,
% 290.15/37.87  	~convergent_lines(X20,X18),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])).
% 290.15/37.87  cnf(c38, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])).
% 290.15/37.87  
% 290.15/37.87  cnf(c39, plain,
% 290.15/37.87  	convergent_lines(X8,X9)).
% 290.15/37.87  cnf(a26, assumption,
% 290.15/37.87  	X20 = X8).
% 290.15/37.87  cnf(a27, assumption,
% 290.15/37.87  	X18 = X9).
% 290.15/37.87  cnf(c40, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(predicate_reduction, [assumptions([a26, a27])], [c37, c39])).
% 290.15/37.87  
% 290.15/37.87  cnf(c41, axiom,
% 290.15/37.87  	distinct_points(X22,intersection_point(X23,X24)) | ~apart_point_and_line(X22,X23) | ~convergent_lines(X23,X24)).
% 290.15/37.87  cnf(a28, assumption,
% 290.15/37.87  	X6 = X22).
% 290.15/37.87  cnf(a29, assumption,
% 290.15/37.87  	X5 = X23).
% 290.15/37.87  cnf(c42, plain,
% 290.15/37.87  	~distinct_lines(X5,X4),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c28, c41])).
% 290.15/37.87  cnf(c43, plain,
% 290.15/37.87  	distinct_points(X22,intersection_point(X23,X24)) | ~convergent_lines(X23,X24),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a28, a29])], [c28, c41])).
% 290.15/37.87  
% 290.15/37.87  cnf(c44, plain,
% 290.15/37.87  	~distinct_points(X14,intersection_point(X15,X16))).
% 290.15/37.87  cnf(a30, assumption,
% 290.15/37.87  	X22 = X14).
% 290.15/37.87  cnf(a31, assumption,
% 290.15/37.87  	intersection_point(X23,X24) = intersection_point(X15,X16)).
% 290.15/37.87  cnf(c45, plain,
% 290.15/37.87  	~convergent_lines(X23,X24),
% 290.15/37.87  	inference(predicate_reduction, [assumptions([a30, a31])], [c43, c44])).
% 290.15/37.87  
% 290.15/37.87  cnf(c46, plain,
% 290.15/37.87  	convergent_lines(X15,X16)).
% 290.15/37.87  cnf(a32, assumption,
% 290.15/37.87  	X23 = X15).
% 290.15/37.87  cnf(a33, assumption,
% 290.15/37.87  	X24 = X16).
% 290.15/37.87  cnf(c47, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(predicate_reduction, [assumptions([a32, a33])], [c45, c46])).
% 290.15/37.87  
% 290.15/37.87  cnf(c48, axiom,
% 290.15/37.87  	distinct_lines(X25,X26) | ~convergent_lines(X25,X26)).
% 290.15/37.87  cnf(a34, assumption,
% 290.15/37.87  	X5 = X25).
% 290.15/37.87  cnf(a35, assumption,
% 290.15/37.87  	X4 = X26).
% 290.15/37.87  cnf(c49, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a34, a35])], [c42, c48])).
% 290.15/37.87  cnf(c50, plain,
% 290.15/37.87  	~convergent_lines(X25,X26),
% 290.15/37.87  	inference(strict_predicate_extension, [assumptions([a34, a35])], [c42, c48])).
% 290.15/37.87  
% 290.15/37.87  cnf(c51, plain,
% 290.15/37.87  	convergent_lines(X15,X16)).
% 290.15/37.87  cnf(a36, assumption,
% 290.15/37.87  	X25 = X15).
% 290.15/37.87  cnf(a37, assumption,
% 290.15/37.87  	X26 = X16).
% 290.15/37.87  cnf(c52, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(predicate_reduction, [assumptions([a36, a37])], [c50, c51])).
% 290.15/37.87  
% 290.15/37.87  cnf(c53, plain,
% 290.15/37.87  	$false,
% 290.15/37.87  	inference(constraint_solving, [
% 290.15/37.87  		bind(X0, intersection_point(sK0,sK1)),
% 290.15/37.87  		bind(X1, sK2),
% 290.15/37.87  		bind(X2, intersection_point(sK1,sK0)),
% 290.15/37.87  		bind(X3, intersection_point(sK0,sK1)),
% 290.15/37.87  		bind(X4, sK0),
% 290.15/37.87  		bind(X5, sK1),
% 290.15/37.87  		bind(X6, intersection_point(sK1,sK0)),
% 290.15/37.87  		bind(X7, intersection_point(sK0,sK1)),
% 290.15/37.87  		bind(X8, sK0),
% 290.15/37.87  		bind(X9, sK1),
% 290.15/37.87  		bind(X10, intersection_point(sK0,sK1)),
% 290.15/37.87  		bind(X11, intersection_point(sK0,sK1)),
% 290.15/37.87  		bind(X12, sK0),
% 290.15/37.87  		bind(X13, sK1),
% 290.15/37.87  		bind(X14, intersection_point(sK1,sK0)),
% 290.15/37.87  		bind(X15, sK1),
% 290.15/37.87  		bind(X16, sK0),
% 290.15/37.87  		bind(X17, intersection_point(sK1,sK0)),
% 290.15/37.87  		bind(X18, sK1),
% 290.15/37.87  		bind(X19, sK0),
% 290.15/37.87  		bind(X20, sK0),
% 290.15/37.87  		bind(X21, sK0),
% 290.15/37.87  		bind(X22, intersection_point(sK1,sK0)),
% 290.15/37.87  		bind(X23, sK1),
% 290.15/37.87  		bind(X24, sK0),
% 290.15/37.87  		bind(X25, sK1),
% 290.15/37.87  		bind(X26, sK0)
% 290.15/37.87  	],
% 290.15/37.87  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37])).
% 290.15/37.87  
% 290.15/37.87  % SZS output end IncompleteProof
%------------------------------------------------------------------------------