TSTP Solution File: GEO191+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO191+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 : n010.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:46 EDT 2022
% Result : Theorem 14.15s 2.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.16/0.36 % Computer : n010.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Sat Jun 18 01:30:23 EDT 2022
% 0.16/0.36 % CPUTime :
% 14.15/2.44 % SZS status Theorem
% 14.15/2.44 % SZS output begin IncompleteProof
% 14.15/2.44 cnf(c0, axiom,
% 14.15/2.44 convergent_lines(sK0,sK1)).
% 14.15/2.44 cnf(c1, plain,
% 14.15/2.44 convergent_lines(sK0,sK1),
% 14.15/2.44 inference(start, [], [c0])).
% 14.15/2.44
% 14.15/2.44 cnf(c2, axiom,
% 14.15/2.44 distinct_lines(X0,X1) | ~convergent_lines(X0,X1)).
% 14.15/2.44 cnf(a0, assumption,
% 14.15/2.44 sK0 = X0).
% 14.15/2.44 cnf(a1, assumption,
% 14.15/2.44 sK1 = X1).
% 14.15/2.44 cnf(c3, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 14.15/2.44 cnf(c4, plain,
% 14.15/2.44 distinct_lines(X0,X1),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 14.15/2.44
% 14.15/2.44 cnf(c5, axiom,
% 14.15/2.44 apart_point_and_line(X2,X3) | apart_point_and_line(X2,X4) | apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2)).
% 14.15/2.44 cnf(a2, assumption,
% 14.15/2.44 X0 = X4).
% 14.15/2.44 cnf(a3, assumption,
% 14.15/2.44 X1 = X3).
% 14.15/2.44 cnf(c6, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 14.15/2.44 cnf(c7, plain,
% 14.15/2.44 apart_point_and_line(X2,X3) | apart_point_and_line(X2,X4) | apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_points(X5,X2),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 14.15/2.44
% 14.15/2.44 cnf(c8, axiom,
% 14.15/2.44 ~apart_point_and_line(intersection_point(sK2,sK3),sK1)).
% 14.15/2.44 cnf(a4, assumption,
% 14.15/2.44 X2 = intersection_point(sK2,sK3)).
% 14.15/2.44 cnf(a5, assumption,
% 14.15/2.44 X3 = sK1).
% 14.15/2.44 cnf(c9, plain,
% 14.15/2.44 apart_point_and_line(X2,X4) | apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_points(X5,X2),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 14.15/2.44 cnf(c10, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 14.15/2.44
% 14.15/2.44 cnf(c11, axiom,
% 14.15/2.44 ~apart_point_and_line(intersection_point(sK2,sK3),sK0)).
% 14.15/2.44 cnf(a6, assumption,
% 14.15/2.44 X2 = intersection_point(sK2,sK3)).
% 14.15/2.44 cnf(a7, assumption,
% 14.15/2.44 X4 = sK0).
% 14.15/2.44 cnf(c12, plain,
% 14.15/2.44 apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_points(X5,X2),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 14.15/2.44 cnf(c13, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 14.15/2.44
% 14.15/2.44 cnf(c14, axiom,
% 14.15/2.44 distinct_points(X6,intersection_point(X7,X8)) | ~apart_point_and_line(X6,X8) | ~convergent_lines(X7,X8)).
% 14.15/2.44 cnf(a8, assumption,
% 14.15/2.44 X5 = X6).
% 14.15/2.44 cnf(a9, assumption,
% 14.15/2.44 X3 = X8).
% 14.15/2.44 cnf(c15, plain,
% 14.15/2.44 apart_point_and_line(X5,X4) | ~distinct_points(X5,X2),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 14.15/2.44 cnf(c16, plain,
% 14.15/2.44 distinct_points(X6,intersection_point(X7,X8)) | ~convergent_lines(X7,X8),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 14.15/2.44
% 14.15/2.44 cnf(c17, axiom,
% 14.15/2.44 ~distinct_points(X9,X9)).
% 14.15/2.44 cnf(a10, assumption,
% 14.15/2.44 X6 = X9).
% 14.15/2.44 cnf(a11, assumption,
% 14.15/2.44 intersection_point(X7,X8) = X9).
% 14.15/2.44 cnf(c18, plain,
% 14.15/2.44 ~convergent_lines(X7,X8),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 14.15/2.44 cnf(c19, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 14.15/2.44
% 14.15/2.44 cnf(c20, plain,
% 14.15/2.44 convergent_lines(sK0,sK1)).
% 14.15/2.44 cnf(a12, assumption,
% 14.15/2.44 X7 = sK0).
% 14.15/2.44 cnf(a13, assumption,
% 14.15/2.44 X8 = sK1).
% 14.15/2.44 cnf(c21, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(predicate_reduction, [assumptions([a12, a13])], [c18, c20])).
% 14.15/2.44
% 14.15/2.44 cnf(c22, axiom,
% 14.15/2.44 distinct_points(X10,intersection_point(X11,X12)) | ~apart_point_and_line(X10,X11) | ~convergent_lines(X11,X12)).
% 14.15/2.44 cnf(a14, assumption,
% 14.15/2.44 X5 = X10).
% 14.15/2.44 cnf(a15, assumption,
% 14.15/2.44 X4 = X11).
% 14.15/2.44 cnf(c23, plain,
% 14.15/2.44 ~distinct_points(X5,X2),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a14, a15])], [c15, c22])).
% 14.15/2.44 cnf(c24, plain,
% 14.15/2.44 distinct_points(X10,intersection_point(X11,X12)) | ~convergent_lines(X11,X12),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a14, a15])], [c15, c22])).
% 14.15/2.44
% 14.15/2.44 cnf(c25, plain,
% 14.15/2.44 ~distinct_points(X6,intersection_point(X7,X8))).
% 14.15/2.44 cnf(a16, assumption,
% 14.15/2.44 X10 = X6).
% 14.15/2.44 cnf(a17, assumption,
% 14.15/2.44 intersection_point(X11,X12) = intersection_point(X7,X8)).
% 14.15/2.44 cnf(c26, plain,
% 14.15/2.44 ~convergent_lines(X11,X12),
% 14.15/2.44 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 14.15/2.44
% 14.15/2.44 cnf(c27, plain,
% 14.15/2.44 convergent_lines(sK0,sK1)).
% 14.15/2.44 cnf(a18, assumption,
% 14.15/2.44 X11 = sK0).
% 14.15/2.44 cnf(a19, assumption,
% 14.15/2.44 X12 = sK1).
% 14.15/2.44 cnf(c28, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(predicate_reduction, [assumptions([a18, a19])], [c26, c27])).
% 14.15/2.44
% 14.15/2.44 cnf(c29, axiom,
% 14.15/2.44 distinct_points(X13,intersection_point(X14,X15)) | ~apart_point_and_line(X13,X15) | ~convergent_lines(X14,X15)).
% 14.15/2.44 cnf(a20, assumption,
% 14.15/2.44 X5 = X13).
% 14.15/2.44 cnf(a21, assumption,
% 14.15/2.44 X2 = intersection_point(X14,X15)).
% 14.15/2.44 cnf(c30, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a20, a21])], [c23, c29])).
% 14.15/2.44 cnf(c31, plain,
% 14.15/2.44 ~apart_point_and_line(X13,X15) | ~convergent_lines(X14,X15),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a20, a21])], [c23, c29])).
% 14.15/2.44
% 14.15/2.44 cnf(c32, axiom,
% 14.15/2.44 apart_point_and_line(intersection_point(sK0,sK1),sK3) | apart_point_and_line(intersection_point(sK0,sK1),sK2)).
% 14.15/2.44 cnf(a22, assumption,
% 14.15/2.44 X13 = intersection_point(sK0,sK1)).
% 14.15/2.44 cnf(a23, assumption,
% 14.15/2.44 X15 = sK3).
% 14.15/2.44 cnf(c33, plain,
% 14.15/2.44 ~convergent_lines(X14,X15),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c32])).
% 14.15/2.44 cnf(c34, plain,
% 14.15/2.44 apart_point_and_line(intersection_point(sK0,sK1),sK2),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c32])).
% 14.15/2.44
% 14.15/2.44 cnf(c35, axiom,
% 14.15/2.44 distinct_points(X16,intersection_point(X17,X18)) | ~apart_point_and_line(X16,X17) | ~convergent_lines(X17,X18)).
% 14.15/2.44 cnf(a24, assumption,
% 14.15/2.44 intersection_point(sK0,sK1) = X16).
% 14.15/2.44 cnf(a25, assumption,
% 14.15/2.44 sK2 = X17).
% 14.15/2.44 cnf(c36, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c35])).
% 14.15/2.44 cnf(c37, plain,
% 14.15/2.44 distinct_points(X16,intersection_point(X17,X18)) | ~convergent_lines(X17,X18),
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c35])).
% 14.15/2.44
% 14.15/2.44 cnf(c38, plain,
% 14.15/2.44 ~distinct_points(X5,X2)).
% 14.15/2.44 cnf(a26, assumption,
% 14.15/2.44 X16 = X5).
% 14.15/2.44 cnf(a27, assumption,
% 14.15/2.44 intersection_point(X17,X18) = X2).
% 14.15/2.44 cnf(c39, plain,
% 14.15/2.44 ~convergent_lines(X17,X18),
% 14.15/2.44 inference(predicate_reduction, [assumptions([a26, a27])], [c37, c38])).
% 14.15/2.44
% 14.15/2.44 cnf(c40, axiom,
% 14.15/2.44 convergent_lines(sK2,sK3)).
% 14.15/2.44 cnf(a28, assumption,
% 14.15/2.44 X17 = sK2).
% 14.15/2.44 cnf(a29, assumption,
% 14.15/2.44 X18 = sK3).
% 14.15/2.44 cnf(c41, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a28, a29])], [c39, c40])).
% 14.15/2.44 cnf(c42, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(strict_predicate_extension, [assumptions([a28, a29])], [c39, c40])).
% 14.15/2.44
% 14.15/2.44 cnf(c43, plain,
% 14.15/2.44 convergent_lines(X17,X18)).
% 14.15/2.44 cnf(a30, assumption,
% 14.15/2.44 X14 = X17).
% 14.15/2.44 cnf(a31, assumption,
% 14.15/2.44 X15 = X18).
% 14.15/2.44 cnf(c44, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(predicate_reduction, [assumptions([a30, a31])], [c33, c43])).
% 14.15/2.44
% 14.15/2.44 cnf(c45, plain,
% 14.15/2.44 $false,
% 14.15/2.44 inference(constraint_solving, [
% 14.15/2.44 bind(X0, sK0),
% 14.15/2.44 bind(X1, sK1),
% 14.15/2.44 bind(X2, intersection_point(sK2,sK3)),
% 14.15/2.44 bind(X3, sK1),
% 14.15/2.44 bind(X4, sK0),
% 14.15/2.44 bind(X5, intersection_point(X7,X8)),
% 14.15/2.44 bind(X6, intersection_point(X7,X8)),
% 14.15/2.44 bind(X7, sK0),
% 14.15/2.44 bind(X8, sK1),
% 14.15/2.44 bind(X9, intersection_point(X7,X8)),
% 14.15/2.44 bind(X10, intersection_point(X7,X8)),
% 14.15/2.44 bind(X11, sK0),
% 14.15/2.44 bind(X12, sK1),
% 14.15/2.44 bind(X13, intersection_point(X7,X8)),
% 14.15/2.44 bind(X14, sK2),
% 14.15/2.44 bind(X15, sK3),
% 14.15/2.44 bind(X16, intersection_point(sK0,sK1)),
% 14.15/2.44 bind(X17, sK2),
% 14.15/2.44 bind(X18, sK3)
% 14.15/2.44 ],
% 14.15/2.44 [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])).
% 14.15/2.44
% 14.15/2.44 % SZS output end IncompleteProof
%------------------------------------------------------------------------------