TSTP Solution File: GEO185+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO185+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 : n016.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.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO185+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n016.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 : Sat Jun 18 18:28:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 apart_point_and_line(sK0,sK3) | apart_point_and_line(sK0,sK2)).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 apart_point_and_line(sK0,sK3) | apart_point_and_line(sK0,sK2),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 distinct_points(X0,intersection_point(X1,X2)) | ~apart_point_and_line(X0,X2) | ~convergent_lines(X1,X2)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 sK0 = X0).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 sK3 = X2).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 apart_point_and_line(sK0,sK2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 distinct_points(X0,intersection_point(X1,X2)) | ~convergent_lines(X1,X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 ~distinct_points(sK0,intersection_point(sK2,sK3))).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X0 = sK0).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 intersection_point(X1,X2) = intersection_point(sK2,sK3)).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 ~convergent_lines(X1,X2),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 convergent_lines(sK2,sK3)).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X1 = sK2).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X2 = sK3).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 distinct_points(X3,intersection_point(X4,X5)) | ~apart_point_and_line(X3,X4) | ~convergent_lines(X4,X5)).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 sK0 = X3).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 sK2 = X4).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 distinct_points(X3,intersection_point(X4,X5)) | ~convergent_lines(X4,X5),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, plain,
% 0.13/0.35 ~distinct_points(X0,intersection_point(X1,X2))).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 X3 = X0).
% 0.13/0.35 cnf(a9, assumption,
% 0.13/0.35 intersection_point(X4,X5) = intersection_point(X1,X2)).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 ~convergent_lines(X4,X5),
% 0.13/0.35 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 convergent_lines(X1,X2)).
% 0.13/0.35 cnf(a10, assumption,
% 0.13/0.35 X4 = X1).
% 0.13/0.35 cnf(a11, assumption,
% 0.13/0.35 X5 = X2).
% 0.13/0.35 cnf(c17, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a10, a11])], [c15, c16])).
% 0.13/0.35
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sK0),
% 0.13/0.35 bind(X1, sK2),
% 0.13/0.35 bind(X2, sK3),
% 0.13/0.35 bind(X3, sK0),
% 0.13/0.35 bind(X4, sK2),
% 0.13/0.35 bind(X5, sK3)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------