TSTP Solution File: GEO186+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO186+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 : n022.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:42 EDT 2022
% Result : Theorem 0.12s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 16:59:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 % SZS output begin IncompleteProof
% 0.12/0.36 cnf(c0, axiom,
% 0.12/0.36 ~apart_point_and_line(sK0,sK2)).
% 0.12/0.36 cnf(c1, plain,
% 0.12/0.36 ~apart_point_and_line(sK0,sK2),
% 0.12/0.36 inference(start, [], [c0])).
% 0.12/0.36
% 0.12/0.36 cnf(c2, axiom,
% 0.12/0.36 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)).
% 0.12/0.36 cnf(a0, assumption,
% 0.12/0.36 sK0 = X3).
% 0.12/0.36 cnf(a1, assumption,
% 0.12/0.36 sK2 = X1).
% 0.12/0.36 cnf(c3, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.36 cnf(c4, plain,
% 0.12/0.36 apart_point_and_line(X0,X1) | apart_point_and_line(X0,X2) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1) | ~distinct_points(X3,X0),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.36
% 0.12/0.36 cnf(c5, axiom,
% 0.12/0.36 ~apart_point_and_line(intersection_point(X4,X5),X4) | ~convergent_lines(X4,X5)).
% 0.12/0.36 cnf(a2, assumption,
% 0.12/0.36 X0 = intersection_point(X4,X5)).
% 0.12/0.36 cnf(a3, assumption,
% 0.12/0.36 X1 = X4).
% 0.12/0.36 cnf(c6, plain,
% 0.12/0.36 apart_point_and_line(X0,X2) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1) | ~distinct_points(X3,X0),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.36 cnf(c7, plain,
% 0.12/0.36 ~convergent_lines(X4,X5),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.12/0.36
% 0.12/0.36 cnf(c8, axiom,
% 0.12/0.36 convergent_lines(sK2,sK3)).
% 0.12/0.36 cnf(a4, assumption,
% 0.12/0.36 X4 = sK2).
% 0.12/0.36 cnf(a5, assumption,
% 0.12/0.36 X5 = sK3).
% 0.12/0.36 cnf(c9, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.36 cnf(c10, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.12/0.36
% 0.12/0.36 cnf(c11, axiom,
% 0.12/0.36 ~apart_point_and_line(intersection_point(X6,X7),X7) | ~convergent_lines(X6,X7)).
% 0.12/0.36 cnf(a6, assumption,
% 0.12/0.36 X0 = intersection_point(X6,X7)).
% 0.12/0.36 cnf(a7, assumption,
% 0.12/0.36 X2 = X7).
% 0.12/0.36 cnf(c12, plain,
% 0.12/0.36 apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1) | ~distinct_points(X3,X0),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 0.12/0.36 cnf(c13, plain,
% 0.12/0.36 ~convergent_lines(X6,X7),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])).
% 0.12/0.36
% 0.12/0.36 cnf(c14, plain,
% 0.12/0.36 convergent_lines(X4,X5)).
% 0.12/0.36 cnf(a8, assumption,
% 0.12/0.36 X6 = X4).
% 0.12/0.36 cnf(a9, assumption,
% 0.12/0.36 X7 = X5).
% 0.12/0.36 cnf(c15, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 0.12/0.36
% 0.12/0.36 cnf(c16, axiom,
% 0.12/0.36 ~apart_point_and_line(sK0,sK3)).
% 0.12/0.36 cnf(a10, assumption,
% 0.12/0.36 X3 = sK0).
% 0.12/0.36 cnf(a11, assumption,
% 0.12/0.36 X2 = sK3).
% 0.12/0.36 cnf(c17, plain,
% 0.12/0.36 ~distinct_lines(X2,X1) | ~distinct_points(X3,X0),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 0.12/0.36 cnf(c18, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])).
% 0.12/0.36
% 0.12/0.36 cnf(c19, axiom,
% 0.12/0.36 convergent_lines(X8,X9) | distinct_lines(X10,X9) | ~convergent_lines(X8,X10)).
% 0.12/0.36 cnf(a12, assumption,
% 0.12/0.36 X2 = X10).
% 0.12/0.36 cnf(a13, assumption,
% 0.12/0.36 X1 = X9).
% 0.12/0.36 cnf(c20, plain,
% 0.12/0.36 ~distinct_points(X3,X0),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.12/0.36 cnf(c21, plain,
% 0.12/0.36 convergent_lines(X8,X9) | ~convergent_lines(X8,X10),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])).
% 0.12/0.36
% 0.12/0.36 cnf(c22, axiom,
% 0.12/0.36 ~convergent_lines(X11,X11)).
% 0.12/0.36 cnf(a14, assumption,
% 0.12/0.36 X8 = X11).
% 0.12/0.36 cnf(a15, assumption,
% 0.12/0.36 X9 = X11).
% 0.12/0.36 cnf(c23, plain,
% 0.12/0.36 ~convergent_lines(X8,X10),
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 0.12/0.36 cnf(c24, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 0.12/0.36
% 0.12/0.36 cnf(c25, plain,
% 0.12/0.36 convergent_lines(X4,X5)).
% 0.12/0.36 cnf(a16, assumption,
% 0.12/0.36 X8 = X4).
% 0.12/0.36 cnf(a17, assumption,
% 0.12/0.36 X10 = X5).
% 0.12/0.36 cnf(c26, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(predicate_reduction, [assumptions([a16, a17])], [c23, c25])).
% 0.12/0.36
% 0.12/0.36 cnf(c27, axiom,
% 0.12/0.36 distinct_points(sK0,intersection_point(sK2,sK3))).
% 0.12/0.36 cnf(a18, assumption,
% 0.12/0.36 X3 = sK0).
% 0.12/0.36 cnf(a19, assumption,
% 0.12/0.36 X0 = intersection_point(sK2,sK3)).
% 0.12/0.36 cnf(c28, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a18, a19])], [c20, c27])).
% 0.12/0.36 cnf(c29, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(strict_predicate_extension, [assumptions([a18, a19])], [c20, c27])).
% 0.12/0.36
% 0.12/0.36 cnf(c30, plain,
% 0.12/0.36 $false,
% 0.12/0.36 inference(constraint_solving, [
% 0.12/0.36 bind(X0, intersection_point(X4,X5)),
% 0.12/0.36 bind(X1, sK2),
% 0.12/0.36 bind(X2, sK3),
% 0.12/0.36 bind(X3, sK0),
% 0.12/0.36 bind(X4, sK2),
% 0.12/0.36 bind(X5, sK3),
% 0.12/0.36 bind(X6, sK2),
% 0.12/0.36 bind(X7, sK3),
% 0.12/0.36 bind(X8, sK2),
% 0.12/0.36 bind(X9, sK2),
% 0.12/0.36 bind(X10, sK3),
% 0.12/0.36 bind(X11, sK2)
% 0.12/0.36 ],
% 0.12/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 0.12/0.36
% 0.12/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------