TSTP Solution File: GEO203+3 by lazyCoP---0.1

View Problem - Process Solution

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

% Computer : n009.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:56 EDT 2022

% Result   : Theorem 2.22s 0.65s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO203+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jun 17 18:39:52 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 2.22/0.65  % SZS status Theorem
% 2.22/0.65  % SZS output begin IncompleteProof
% 2.22/0.65  cnf(c0, axiom,
% 2.22/0.65  	distinct_points(intersection_point(sK2,sK3),intersection_point(sK2,sK4))).
% 2.22/0.65  cnf(c1, plain,
% 2.22/0.65  	distinct_points(intersection_point(sK2,sK3),intersection_point(sK2,sK4)),
% 2.22/0.65  	inference(start, [], [c0])).
% 2.22/0.65  
% 2.22/0.65  cnf(c2, axiom,
% 2.22/0.65  	apart_point_and_line(X0,X1) | apart_point_and_line(X0,X2) | apart_point_and_line(X3,X1) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1) | ~distinct_points(X3,X0)).
% 2.22/0.65  cnf(a0, assumption,
% 2.22/0.65  	intersection_point(sK2,sK3) = X3).
% 2.22/0.65  cnf(a1, assumption,
% 2.22/0.65  	intersection_point(sK2,sK4) = X0).
% 2.22/0.65  cnf(c3, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.22/0.65  cnf(c4, plain,
% 2.22/0.65  	apart_point_and_line(X0,X1) | apart_point_and_line(X0,X2) | apart_point_and_line(X3,X1) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.22/0.65  
% 2.22/0.65  cnf(c5, axiom,
% 2.22/0.65  	~apart_point_and_line(intersection_point(X4,X5),X4) | ~convergent_lines(X4,X5)).
% 2.22/0.65  cnf(a2, assumption,
% 2.22/0.65  	X0 = intersection_point(X4,X5)).
% 2.22/0.65  cnf(a3, assumption,
% 2.22/0.65  	X1 = X4).
% 2.22/0.65  cnf(c6, plain,
% 2.22/0.65  	apart_point_and_line(X0,X2) | apart_point_and_line(X3,X1) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.22/0.65  cnf(c7, plain,
% 2.22/0.65  	~convergent_lines(X4,X5),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.22/0.65  
% 2.22/0.65  cnf(c8, axiom,
% 2.22/0.65  	convergent_lines(sK2,sK4)).
% 2.22/0.65  cnf(a4, assumption,
% 2.22/0.65  	X4 = sK2).
% 2.22/0.65  cnf(a5, assumption,
% 2.22/0.65  	X5 = sK4).
% 2.22/0.65  cnf(c9, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.22/0.65  cnf(c10, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 2.22/0.65  
% 2.22/0.65  cnf(c11, axiom,
% 2.22/0.65  	~apart_point_and_line(X6,line_connecting(X7,X6)) | ~distinct_points(X7,X6)).
% 2.22/0.65  cnf(a6, assumption,
% 2.22/0.65  	X0 = X6).
% 2.22/0.65  cnf(a7, assumption,
% 2.22/0.65  	X2 = line_connecting(X7,X6)).
% 2.22/0.65  cnf(c12, plain,
% 2.22/0.65  	apart_point_and_line(X3,X1) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 2.22/0.65  cnf(c13, plain,
% 2.22/0.65  	~distinct_points(X7,X6),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 2.22/0.65  
% 2.22/0.65  cnf(c14, plain,
% 2.22/0.65  	distinct_points(intersection_point(sK2,sK3),intersection_point(sK2,sK4))).
% 2.22/0.65  cnf(a8, assumption,
% 2.22/0.65  	X7 = intersection_point(sK2,sK3)).
% 2.22/0.65  cnf(a9, assumption,
% 2.22/0.65  	X6 = intersection_point(sK2,sK4)).
% 2.22/0.65  cnf(c15, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 2.22/0.65  
% 2.22/0.65  cnf(c16, axiom,
% 2.22/0.65  	~apart_point_and_line(intersection_point(X8,X9),X8) | ~convergent_lines(X8,X9)).
% 2.22/0.65  cnf(a10, assumption,
% 2.22/0.65  	X3 = intersection_point(X8,X9)).
% 2.22/0.65  cnf(a11, assumption,
% 2.22/0.65  	X1 = X8).
% 2.22/0.65  cnf(c17, plain,
% 2.22/0.65  	apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 2.22/0.65  cnf(c18, plain,
% 2.22/0.65  	~convergent_lines(X8,X9),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 2.22/0.65  
% 2.22/0.65  cnf(c19, axiom,
% 2.22/0.65  	convergent_lines(sK2,sK3)).
% 2.22/0.65  cnf(a12, assumption,
% 2.22/0.65  	X8 = sK2).
% 2.22/0.65  cnf(a13, assumption,
% 2.22/0.65  	X9 = sK3).
% 2.22/0.65  cnf(c20, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 2.22/0.65  cnf(c21, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 2.22/0.65  
% 2.22/0.65  cnf(c22, axiom,
% 2.22/0.65  	~apart_point_and_line(X10,line_connecting(X10,X11)) | ~distinct_points(X10,X11)).
% 2.22/0.65  cnf(a14, assumption,
% 2.22/0.65  	X3 = X10).
% 2.22/0.65  cnf(a15, assumption,
% 2.22/0.65  	X2 = line_connecting(X10,X11)).
% 2.22/0.65  cnf(c23, plain,
% 2.22/0.65  	~distinct_lines(X2,X1),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c22])).
% 2.22/0.65  cnf(c24, plain,
% 2.22/0.65  	~distinct_points(X10,X11),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c22])).
% 2.22/0.65  
% 2.22/0.65  cnf(c25, plain,
% 2.22/0.65  	distinct_points(intersection_point(sK2,sK3),intersection_point(sK2,sK4))).
% 2.22/0.65  cnf(a16, assumption,
% 2.22/0.65  	X10 = intersection_point(sK2,sK3)).
% 2.22/0.65  cnf(a17, assumption,
% 2.22/0.65  	X11 = intersection_point(sK2,sK4)).
% 2.22/0.65  cnf(c26, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 2.22/0.65  
% 2.22/0.65  cnf(c27, axiom,
% 2.22/0.65  	equal_lines(X12,X13) | distinct_lines(X12,X13)).
% 2.22/0.65  cnf(a18, assumption,
% 2.22/0.65  	X2 = X12).
% 2.22/0.65  cnf(a19, assumption,
% 2.22/0.65  	X1 = X13).
% 2.22/0.65  cnf(c28, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])).
% 2.22/0.65  cnf(c29, plain,
% 2.22/0.65  	equal_lines(X12,X13),
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])).
% 2.22/0.65  
% 2.22/0.65  cnf(c30, axiom,
% 2.22/0.65  	~equal_lines(line_connecting(intersection_point(sK2,sK3),intersection_point(sK2,sK4)),sK2)).
% 2.22/0.65  cnf(a20, assumption,
% 2.22/0.65  	X12 = line_connecting(intersection_point(sK2,sK3),intersection_point(sK2,sK4))).
% 2.22/0.65  cnf(a21, assumption,
% 2.22/0.65  	X13 = sK2).
% 2.22/0.65  cnf(c31, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 2.22/0.65  cnf(c32, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])).
% 2.22/0.65  
% 2.22/0.65  cnf(c33, plain,
% 2.22/0.65  	$false,
% 2.22/0.65  	inference(constraint_solving, [
% 2.22/0.65  		bind(X0, intersection_point(sK2,sK4)),
% 2.22/0.65  		bind(X1, sK2),
% 2.22/0.65  		bind(X2, line_connecting(X7,X6)),
% 2.22/0.65  		bind(X3, intersection_point(sK2,sK3)),
% 2.22/0.65  		bind(X4, sK2),
% 2.22/0.65  		bind(X5, sK4),
% 2.22/0.65  		bind(X6, intersection_point(sK2,sK4)),
% 2.22/0.65  		bind(X7, intersection_point(sK2,sK3)),
% 2.22/0.65  		bind(X8, sK2),
% 2.22/0.65  		bind(X9, sK3),
% 2.22/0.65  		bind(X10, intersection_point(sK2,sK3)),
% 2.22/0.65  		bind(X11, intersection_point(sK2,sK4)),
% 2.22/0.65  		bind(X12, line_connecting(X7,X6)),
% 2.22/0.65  		bind(X13, sK2)
% 2.22/0.65  	],
% 2.22/0.65  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 2.22/0.65  
% 2.22/0.65  % SZS output end IncompleteProof
%------------------------------------------------------------------------------