TSTP Solution File: GEO210+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO210+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 05:00:00 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO210+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 05:54:04 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % SZS status Theorem
% 0.14/0.37 % SZS output begin IncompleteProof
% 0.14/0.37 cnf(c0, axiom,
% 0.14/0.37 ~unorthogonal_lines(sK2,sK3)).
% 0.14/0.37 cnf(c1, plain,
% 0.14/0.37 ~unorthogonal_lines(sK2,sK3),
% 0.14/0.37 inference(start, [], [c0])).
% 0.14/0.37
% 0.14/0.37 cnf(c2, axiom,
% 0.14/0.37 unorthogonal_lines(X0,X1) | unorthogonal_lines(X2,X1) | apart_point_and_line(X3,X0) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X0)).
% 0.14/0.37 cnf(a0, assumption,
% 0.14/0.37 sK2 = X2).
% 0.14/0.37 cnf(a1, assumption,
% 0.14/0.37 sK3 = X1).
% 0.14/0.37 cnf(c3, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37 cnf(c4, plain,
% 0.14/0.37 unorthogonal_lines(X0,X1) | apart_point_and_line(X3,X0) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X0),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.37
% 0.14/0.37 cnf(c5, axiom,
% 0.14/0.37 ~unorthogonal_lines(orthogonal_through_point(X4,X5),X4)).
% 0.14/0.37 cnf(a2, assumption,
% 0.14/0.37 X0 = orthogonal_through_point(X4,X5)).
% 0.14/0.37 cnf(a3, assumption,
% 0.14/0.37 X1 = X4).
% 0.14/0.37 cnf(c6, plain,
% 0.14/0.37 apart_point_and_line(X3,X0) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X0),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.37 cnf(c7, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.37
% 0.14/0.37 cnf(c8, axiom,
% 0.14/0.37 ~apart_point_and_line(X6,orthogonal_through_point(X7,X6))).
% 0.14/0.37 cnf(a4, assumption,
% 0.14/0.37 X3 = X6).
% 0.14/0.37 cnf(a5, assumption,
% 0.14/0.37 X0 = orthogonal_through_point(X7,X6)).
% 0.14/0.37 cnf(c9, plain,
% 0.14/0.37 apart_point_and_line(X3,X2) | ~distinct_lines(X2,X0),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.14/0.37 cnf(c10, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.14/0.37
% 0.14/0.37 cnf(c11, axiom,
% 0.14/0.37 ~apart_point_and_line(sK1,sK2)).
% 0.14/0.37 cnf(a6, assumption,
% 0.14/0.37 X3 = sK1).
% 0.14/0.37 cnf(a7, assumption,
% 0.14/0.37 X2 = sK2).
% 0.14/0.37 cnf(c12, plain,
% 0.14/0.37 ~distinct_lines(X2,X0),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.14/0.37 cnf(c13, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.14/0.37
% 0.14/0.37 cnf(c14, axiom,
% 0.14/0.37 distinct_lines(sK2,orthogonal_through_point(sK3,sK1))).
% 0.14/0.37 cnf(a8, assumption,
% 0.14/0.37 X2 = sK2).
% 0.14/0.37 cnf(a9, assumption,
% 0.14/0.37 X0 = orthogonal_through_point(sK3,sK1)).
% 0.14/0.37 cnf(c15, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.14/0.37 cnf(c16, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.14/0.37
% 0.14/0.37 cnf(c17, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(constraint_solving, [
% 0.14/0.37 bind(X0, orthogonal_through_point(X4,X5)),
% 0.14/0.37 bind(X1, sK3),
% 0.14/0.37 bind(X2, sK2),
% 0.14/0.37 bind(X3, sK1),
% 0.14/0.37 bind(X4, sK3),
% 0.14/0.37 bind(X5, sK1),
% 0.14/0.37 bind(X6, sK1),
% 0.14/0.37 bind(X7, sK3)
% 0.14/0.37 ],
% 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.14/0.37
% 0.14/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------