TSTP Solution File: GEO205+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO205+1 : 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 : n014.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:57 EDT 2022
% Result : Theorem 25.27s 3.67s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO205+1 : 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.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 16:23:04 EDT 2022
% 0.14/0.35 % CPUTime :
% 25.27/3.67 % SZS status Theorem
% 25.27/3.67 % SZS output begin IncompleteProof
% 25.27/3.67 cnf(c0, axiom,
% 25.27/3.67 ~distinct_lines(sK1,sK2)).
% 25.27/3.67 cnf(c1, plain,
% 25.27/3.67 ~distinct_lines(sK1,sK2),
% 25.27/3.67 inference(start, [], [c0])).
% 25.27/3.67
% 25.27/3.67 cnf(c2, axiom,
% 25.27/3.67 convergent_lines(X0,X1) | distinct_lines(X2,X1) | ~convergent_lines(X0,X2)).
% 25.27/3.67 cnf(a0, assumption,
% 25.27/3.67 sK1 = X2).
% 25.27/3.67 cnf(a1, assumption,
% 25.27/3.67 sK2 = X1).
% 25.27/3.67 cnf(c3, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 25.27/3.67 cnf(c4, plain,
% 25.27/3.67 convergent_lines(X0,X1) | ~convergent_lines(X0,X2),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 25.27/3.67
% 25.27/3.67 cnf(c5, axiom,
% 25.27/3.67 ~apart_point_and_line(intersection_point(X3,X4),X3) | ~convergent_lines(X3,X4)).
% 25.27/3.67 cnf(a2, assumption,
% 25.27/3.67 X0 = X3).
% 25.27/3.67 cnf(a3, assumption,
% 25.27/3.67 X1 = X4).
% 25.27/3.67 cnf(c6, plain,
% 25.27/3.67 ~convergent_lines(X0,X2),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 25.27/3.67 cnf(c7, plain,
% 25.27/3.67 ~apart_point_and_line(intersection_point(X3,X4),X3),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 25.27/3.67
% 25.27/3.67 cnf(c8, axiom,
% 25.27/3.67 apart_point_and_line(X5,X6) | apart_point_and_line(X5,X7) | apart_point_and_line(X8,X6) | apart_point_and_line(X8,X7) | ~distinct_lines(X7,X6) | ~distinct_points(X8,X5)).
% 25.27/3.67 cnf(a4, assumption,
% 25.27/3.67 intersection_point(X3,X4) = X5).
% 25.27/3.67 cnf(a5, assumption,
% 25.27/3.67 X3 = X6).
% 25.27/3.67 cnf(c9, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 25.27/3.67 cnf(c10, plain,
% 25.27/3.67 apart_point_and_line(X5,X7) | apart_point_and_line(X8,X6) | apart_point_and_line(X8,X7) | ~distinct_lines(X7,X6) | ~distinct_points(X8,X5),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 25.27/3.67
% 25.27/3.67 cnf(c11, axiom,
% 25.27/3.67 apart_point_and_line(X9,X10) | distinct_lines(X11,X10) | ~apart_point_and_line(X9,X11)).
% 25.27/3.67 cnf(a6, assumption,
% 25.27/3.67 X5 = X9).
% 25.27/3.67 cnf(a7, assumption,
% 25.27/3.67 X7 = X11).
% 25.27/3.67 cnf(c12, plain,
% 25.27/3.67 apart_point_and_line(X8,X6) | apart_point_and_line(X8,X7) | ~distinct_lines(X7,X6) | ~distinct_points(X8,X5),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 25.27/3.67 cnf(c13, plain,
% 25.27/3.67 apart_point_and_line(X9,X10) | distinct_lines(X11,X10),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 25.27/3.67
% 25.27/3.67 cnf(c14, axiom,
% 25.27/3.67 ~apart_point_and_line(intersection_point(X12,X13),X13) | ~convergent_lines(X12,X13)).
% 25.27/3.67 cnf(a8, assumption,
% 25.27/3.67 X9 = intersection_point(X12,X13)).
% 25.27/3.67 cnf(a9, assumption,
% 25.27/3.67 X10 = X13).
% 25.27/3.67 cnf(c15, plain,
% 25.27/3.67 distinct_lines(X11,X10),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 25.27/3.67 cnf(c16, plain,
% 25.27/3.67 ~convergent_lines(X12,X13),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 25.27/3.67
% 25.27/3.67 cnf(c17, plain,
% 25.27/3.67 convergent_lines(X0,X1)).
% 25.27/3.67 cnf(a10, assumption,
% 25.27/3.67 X12 = X0).
% 25.27/3.67 cnf(a11, assumption,
% 25.27/3.67 X13 = X1).
% 25.27/3.67 cnf(c18, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])).
% 25.27/3.67
% 25.27/3.67 cnf(c19, plain,
% 25.27/3.67 ~distinct_lines(sK1,sK2)).
% 25.27/3.67 cnf(a12, assumption,
% 25.27/3.67 X11 = sK1).
% 25.27/3.67 cnf(a13, assumption,
% 25.27/3.67 X10 = sK2).
% 25.27/3.67 cnf(c20, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(predicate_reduction, [assumptions([a12, a13])], [c15, c19])).
% 25.27/3.67
% 25.27/3.67 cnf(c21, axiom,
% 25.27/3.67 ~apart_point_and_line(intersection_point(X14,X15),X14) | ~convergent_lines(X14,X15)).
% 25.27/3.67 cnf(a14, assumption,
% 25.27/3.67 X8 = intersection_point(X14,X15)).
% 25.27/3.67 cnf(a15, assumption,
% 25.27/3.67 X6 = X14).
% 25.27/3.67 cnf(c22, plain,
% 25.27/3.67 apart_point_and_line(X8,X7) | ~distinct_lines(X7,X6) | ~distinct_points(X8,X5),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a14, a15])], [c12, c21])).
% 25.27/3.67 cnf(c23, plain,
% 25.27/3.67 ~convergent_lines(X14,X15),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a14, a15])], [c12, c21])).
% 25.27/3.67
% 25.27/3.67 cnf(c24, axiom,
% 25.27/3.67 convergent_lines(sK0,sK1)).
% 25.27/3.67 cnf(a16, assumption,
% 25.27/3.67 X14 = sK0).
% 25.27/3.67 cnf(a17, assumption,
% 25.27/3.67 X15 = sK1).
% 25.27/3.67 cnf(c25, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 25.27/3.67 cnf(c26, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])).
% 25.27/3.67
% 25.27/3.67 cnf(c27, axiom,
% 25.27/3.67 ~apart_point_and_line(intersection_point(X16,X17),X17) | ~convergent_lines(X16,X17)).
% 25.27/3.67 cnf(a18, assumption,
% 25.27/3.67 X8 = intersection_point(X16,X17)).
% 25.27/3.67 cnf(a19, assumption,
% 25.27/3.67 X7 = X17).
% 25.27/3.67 cnf(c28, plain,
% 25.27/3.67 ~distinct_lines(X7,X6) | ~distinct_points(X8,X5),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a18, a19])], [c22, c27])).
% 25.27/3.67 cnf(c29, plain,
% 25.27/3.67 ~convergent_lines(X16,X17),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a18, a19])], [c22, c27])).
% 25.27/3.67
% 25.27/3.67 cnf(c30, plain,
% 25.27/3.67 convergent_lines(X14,X15)).
% 25.27/3.67 cnf(a20, assumption,
% 25.27/3.67 X16 = X14).
% 25.27/3.67 cnf(a21, assumption,
% 25.27/3.67 X17 = X15).
% 25.27/3.67 cnf(c31, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(predicate_reduction, [assumptions([a20, a21])], [c29, c30])).
% 25.27/3.67
% 25.27/3.67 cnf(c32, axiom,
% 25.27/3.67 convergent_lines(X18,X19) | distinct_lines(X20,X19) | ~convergent_lines(X18,X20)).
% 25.27/3.67 cnf(a22, assumption,
% 25.27/3.67 X7 = X20).
% 25.27/3.67 cnf(a23, assumption,
% 25.27/3.67 X6 = X19).
% 25.27/3.67 cnf(c33, plain,
% 25.27/3.67 ~distinct_points(X8,X5),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a22, a23])], [c28, c32])).
% 25.27/3.67 cnf(c34, plain,
% 25.27/3.67 convergent_lines(X18,X19) | ~convergent_lines(X18,X20),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a22, a23])], [c28, c32])).
% 25.27/3.67
% 25.27/3.67 cnf(c35, axiom,
% 25.27/3.67 ~convergent_lines(X21,X21)).
% 25.27/3.67 cnf(a24, assumption,
% 25.27/3.67 X18 = X21).
% 25.27/3.67 cnf(a25, assumption,
% 25.27/3.67 X19 = X21).
% 25.27/3.67 cnf(c36, plain,
% 25.27/3.67 ~convergent_lines(X18,X20),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c35])).
% 25.27/3.67 cnf(c37, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a24, a25])], [c34, c35])).
% 25.27/3.67
% 25.27/3.67 cnf(c38, plain,
% 25.27/3.67 convergent_lines(X14,X15)).
% 25.27/3.67 cnf(a26, assumption,
% 25.27/3.67 X18 = X14).
% 25.27/3.67 cnf(a27, assumption,
% 25.27/3.67 X20 = X15).
% 25.27/3.67 cnf(c39, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(predicate_reduction, [assumptions([a26, a27])], [c36, c38])).
% 25.27/3.67
% 25.27/3.67 cnf(c40, axiom,
% 25.27/3.67 distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)) | ~convergent_lines(sK0,sK2)).
% 25.27/3.67 cnf(a28, assumption,
% 25.27/3.67 X8 = intersection_point(sK0,sK1)).
% 25.27/3.67 cnf(a29, assumption,
% 25.27/3.67 X5 = intersection_point(sK0,sK2)).
% 25.27/3.67 cnf(c41, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a28, a29])], [c33, c40])).
% 25.27/3.67 cnf(c42, plain,
% 25.27/3.67 ~convergent_lines(sK0,sK2),
% 25.27/3.67 inference(strict_predicate_extension, [assumptions([a28, a29])], [c33, c40])).
% 25.27/3.67
% 25.27/3.67 cnf(c43, plain,
% 25.27/3.67 convergent_lines(X0,X1)).
% 25.27/3.67 cnf(a30, assumption,
% 25.27/3.67 sK0 = X0).
% 25.27/3.67 cnf(a31, assumption,
% 25.27/3.67 sK2 = X1).
% 25.27/3.67 cnf(c44, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(predicate_reduction, [assumptions([a30, a31])], [c42, c43])).
% 25.27/3.67
% 25.27/3.67 cnf(c45, plain,
% 25.27/3.67 convergent_lines(X14,X15)).
% 25.27/3.67 cnf(a32, assumption,
% 25.27/3.67 X0 = X14).
% 25.27/3.67 cnf(a33, assumption,
% 25.27/3.67 X2 = X15).
% 25.27/3.67 cnf(c46, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(predicate_reduction, [assumptions([a32, a33])], [c6, c45])).
% 25.27/3.67
% 25.27/3.67 cnf(c47, plain,
% 25.27/3.67 $false,
% 25.27/3.67 inference(constraint_solving, [
% 25.27/3.67 bind(X0, sK0),
% 25.27/3.67 bind(X1, sK2),
% 25.27/3.67 bind(X2, sK1),
% 25.27/3.67 bind(X3, sK0),
% 25.27/3.67 bind(X4, sK2),
% 25.27/3.67 bind(X5, intersection_point(X3,X4)),
% 25.27/3.67 bind(X6, sK0),
% 25.27/3.67 bind(X7, sK1),
% 25.27/3.67 bind(X8, intersection_point(X14,X15)),
% 25.27/3.67 bind(X9, intersection_point(X3,X4)),
% 25.27/3.67 bind(X10, sK2),
% 25.27/3.67 bind(X11, sK1),
% 25.27/3.67 bind(X12, sK0),
% 25.27/3.67 bind(X13, sK2),
% 25.27/3.67 bind(X14, sK0),
% 25.27/3.67 bind(X15, sK1),
% 25.27/3.67 bind(X16, sK0),
% 25.27/3.67 bind(X17, sK1),
% 25.27/3.67 bind(X18, sK0),
% 25.27/3.67 bind(X19, sK0),
% 25.27/3.67 bind(X20, sK1),
% 25.27/3.67 bind(X21, sK0)
% 25.27/3.67 ],
% 25.27/3.67 [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])).
% 25.27/3.67
% 25.27/3.67 % SZS output end IncompleteProof
%------------------------------------------------------------------------------