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