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