TSTP Solution File: GEO192+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO192+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 : n026.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:47 EDT 2022
% Result : Theorem 0.21s 0.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO192+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n026.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 : Fri Jun 17 16:13:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.54 % SZS status Theorem
% 0.21/0.54 % SZS output begin IncompleteProof
% 0.21/0.54 cnf(c0, axiom,
% 0.21/0.54 apart_point_and_line(intersection_point(sK0,sK1),sK2)).
% 0.21/0.54 cnf(c1, plain,
% 0.21/0.54 apart_point_and_line(intersection_point(sK0,sK1),sK2),
% 0.21/0.54 inference(start, [], [c0])).
% 0.21/0.54
% 0.21/0.54 cnf(c2, axiom,
% 0.21/0.54 apart_point_and_line(X0,X1) | distinct_lines(X2,X1) | ~apart_point_and_line(X0,X2)).
% 0.21/0.54 cnf(a0, assumption,
% 0.21/0.54 intersection_point(sK0,sK1) = X0).
% 0.21/0.54 cnf(a1, assumption,
% 0.21/0.54 sK2 = X2).
% 0.21/0.54 cnf(c3, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.54 cnf(c4, plain,
% 0.21/0.54 apart_point_and_line(X0,X1) | distinct_lines(X2,X1),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.21/0.54
% 0.21/0.54 cnf(c5, axiom,
% 0.21/0.54 distinct_points(X3,intersection_point(X4,X5)) | ~apart_point_and_line(X3,X4) | ~convergent_lines(X4,X5)).
% 0.21/0.54 cnf(a2, assumption,
% 0.21/0.54 X0 = X3).
% 0.21/0.54 cnf(a3, assumption,
% 0.21/0.54 X1 = X4).
% 0.21/0.54 cnf(c6, plain,
% 0.21/0.54 distinct_lines(X2,X1),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.54 cnf(c7, plain,
% 0.21/0.54 distinct_points(X3,intersection_point(X4,X5)) | ~convergent_lines(X4,X5),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.21/0.54
% 0.21/0.54 cnf(c8, axiom,
% 0.21/0.54 ~distinct_points(X6,X6)).
% 0.21/0.54 cnf(a4, assumption,
% 0.21/0.54 X3 = X6).
% 0.21/0.54 cnf(a5, assumption,
% 0.21/0.54 intersection_point(X4,X5) = X6).
% 0.21/0.54 cnf(c9, plain,
% 0.21/0.54 ~convergent_lines(X4,X5),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.54 cnf(c10, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.21/0.54
% 0.21/0.54 cnf(c11, axiom,
% 0.21/0.54 convergent_lines(sK0,sK1)).
% 0.21/0.54 cnf(a6, assumption,
% 0.21/0.54 X4 = sK0).
% 0.21/0.54 cnf(a7, assumption,
% 0.21/0.54 X5 = sK1).
% 0.21/0.54 cnf(c12, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.21/0.54 cnf(c13, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.21/0.54
% 0.21/0.54 cnf(c14, axiom,
% 0.21/0.54 distinct_lines(X7,X8) | distinct_lines(X9,X8) | ~distinct_lines(X9,X7)).
% 0.21/0.54 cnf(a8, assumption,
% 0.21/0.54 X2 = X9).
% 0.21/0.54 cnf(a9, assumption,
% 0.21/0.54 X1 = X7).
% 0.21/0.54 cnf(c15, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.21/0.54 cnf(c16, plain,
% 0.21/0.54 distinct_lines(X7,X8) | distinct_lines(X9,X8),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.21/0.54
% 0.21/0.54 cnf(c17, axiom,
% 0.21/0.54 ~distinct_lines(sK1,sK2) | ~distinct_lines(sK0,sK2)).
% 0.21/0.54 cnf(a10, assumption,
% 0.21/0.54 X7 = sK0).
% 0.21/0.54 cnf(a11, assumption,
% 0.21/0.54 X8 = sK2).
% 0.21/0.54 cnf(c18, plain,
% 0.21/0.54 distinct_lines(X9,X8),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 0.21/0.54 cnf(c19, plain,
% 0.21/0.54 ~distinct_lines(sK1,sK2),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 0.21/0.54
% 0.21/0.54 cnf(c20, axiom,
% 0.21/0.54 distinct_lines(X10,X11) | distinct_lines(X12,X11) | ~distinct_lines(X12,X10)).
% 0.21/0.54 cnf(a12, assumption,
% 0.21/0.54 sK1 = X10).
% 0.21/0.54 cnf(a13, assumption,
% 0.21/0.54 sK2 = X11).
% 0.21/0.54 cnf(c21, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.21/0.54 cnf(c22, plain,
% 0.21/0.54 distinct_lines(X12,X11) | ~distinct_lines(X12,X10),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.21/0.54
% 0.21/0.54 cnf(c23, axiom,
% 0.21/0.54 ~distinct_lines(X13,X13)).
% 0.21/0.54 cnf(a14, assumption,
% 0.21/0.54 X12 = X13).
% 0.21/0.54 cnf(a15, assumption,
% 0.21/0.54 X11 = X13).
% 0.21/0.54 cnf(c24, plain,
% 0.21/0.54 ~distinct_lines(X12,X10),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 0.21/0.54 cnf(c25, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 0.21/0.54
% 0.21/0.54 cnf(c26, axiom,
% 0.21/0.54 apart_point_and_line(X14,X15) | distinct_lines(X16,X15) | ~apart_point_and_line(X14,X16)).
% 0.21/0.54 cnf(a16, assumption,
% 0.21/0.54 X12 = X16).
% 0.21/0.54 cnf(a17, assumption,
% 0.21/0.54 X10 = X15).
% 0.21/0.54 cnf(c27, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])).
% 0.21/0.54 cnf(c28, plain,
% 0.21/0.54 apart_point_and_line(X14,X15) | ~apart_point_and_line(X14,X16),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])).
% 0.21/0.54
% 0.21/0.54 cnf(c29, axiom,
% 0.21/0.54 distinct_points(X17,intersection_point(X18,X19)) | ~apart_point_and_line(X17,X19) | ~convergent_lines(X18,X19)).
% 0.21/0.54 cnf(a18, assumption,
% 0.21/0.54 X14 = X17).
% 0.21/0.54 cnf(a19, assumption,
% 0.21/0.54 X15 = X19).
% 0.21/0.54 cnf(c30, plain,
% 0.21/0.54 ~apart_point_and_line(X14,X16),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a18, a19])], [c28, c29])).
% 0.21/0.54 cnf(c31, plain,
% 0.21/0.54 distinct_points(X17,intersection_point(X18,X19)) | ~convergent_lines(X18,X19),
% 0.21/0.54 inference(strict_predicate_extension, [assumptions([a18, a19])], [c28, c29])).
% 0.21/0.54
% 0.21/0.54 cnf(c32, plain,
% 0.21/0.54 ~distinct_points(X3,intersection_point(X4,X5))).
% 0.21/0.54 cnf(a20, assumption,
% 0.21/0.54 X17 = X3).
% 0.21/0.54 cnf(a21, assumption,
% 0.21/0.54 intersection_point(X18,X19) = intersection_point(X4,X5)).
% 0.21/0.54 cnf(c33, plain,
% 0.21/0.54 ~convergent_lines(X18,X19),
% 0.21/0.54 inference(predicate_reduction, [assumptions([a20, a21])], [c31, c32])).
% 0.21/0.54
% 0.21/0.54 cnf(c34, plain,
% 0.21/0.54 convergent_lines(X4,X5)).
% 0.21/0.54 cnf(a22, assumption,
% 0.21/0.54 X18 = X4).
% 0.21/0.54 cnf(a23, assumption,
% 0.21/0.54 X19 = X5).
% 0.21/0.54 cnf(c35, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(predicate_reduction, [assumptions([a22, a23])], [c33, c34])).
% 0.21/0.54
% 0.21/0.54 cnf(c36, plain,
% 0.21/0.54 apart_point_and_line(intersection_point(sK0,sK1),sK2)).
% 0.21/0.54 cnf(a24, assumption,
% 0.21/0.54 X14 = intersection_point(sK0,sK1)).
% 0.21/0.54 cnf(a25, assumption,
% 0.21/0.54 X16 = sK2).
% 0.21/0.54 cnf(c37, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(predicate_reduction, [assumptions([a24, a25])], [c30, c36])).
% 0.21/0.54
% 0.21/0.54 cnf(c38, plain,
% 0.21/0.54 ~distinct_lines(X12,X11)).
% 0.21/0.54 cnf(a26, assumption,
% 0.21/0.54 X9 = X12).
% 0.21/0.54 cnf(a27, assumption,
% 0.21/0.54 X8 = X11).
% 0.21/0.54 cnf(c39, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(predicate_reduction, [assumptions([a26, a27])], [c18, c38])).
% 0.21/0.54
% 0.21/0.54 cnf(c40, plain,
% 0.21/0.54 $false,
% 0.21/0.54 inference(constraint_solving, [
% 0.21/0.54 bind(X0, intersection_point(sK0,sK1)),
% 0.21/0.54 bind(X1, sK0),
% 0.21/0.54 bind(X2, sK2),
% 0.21/0.54 bind(X3, intersection_point(sK0,sK1)),
% 0.21/0.54 bind(X4, sK0),
% 0.21/0.54 bind(X5, sK1),
% 0.21/0.54 bind(X6, intersection_point(sK0,sK1)),
% 0.21/0.54 bind(X7, sK0),
% 0.21/0.54 bind(X8, sK2),
% 0.21/0.54 bind(X9, sK2),
% 0.21/0.54 bind(X10, sK1),
% 0.21/0.54 bind(X11, sK2),
% 0.21/0.54 bind(X12, sK2),
% 0.21/0.54 bind(X13, sK2),
% 0.21/0.54 bind(X14, intersection_point(sK0,sK1)),
% 0.21/0.54 bind(X15, sK1),
% 0.21/0.54 bind(X16, sK2),
% 0.21/0.54 bind(X17, intersection_point(sK0,sK1)),
% 0.21/0.54 bind(X18, sK0),
% 0.21/0.54 bind(X19, sK1)
% 0.21/0.54 ],
% 0.21/0.54 [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])).
% 0.21/0.54
% 0.21/0.54 % SZS output end IncompleteProof
%------------------------------------------------------------------------------