TSTP Solution File: GEO261+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : GEO261+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n029.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:25 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO261+3 : TPTP v8.1.0. Released v4.0.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 : n029.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:37:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 % SZS output begin IncompleteProof
% 0.13/0.36 cnf(c0, axiom,
% 0.13/0.36 convergent_lines(sK5,sK6)).
% 0.13/0.36 cnf(c1, plain,
% 0.13/0.36 convergent_lines(sK5,sK6),
% 0.13/0.36 inference(start, [], [c0])).
% 0.13/0.36
% 0.13/0.36 cnf(c2, axiom,
% 0.13/0.36 unequally_directed_opposite_lines(X0,X1) | ~convergent_lines(X0,X1)).
% 0.13/0.36 cnf(a0, assumption,
% 0.13/0.36 sK5 = X0).
% 0.13/0.36 cnf(a1, assumption,
% 0.13/0.36 sK6 = X1).
% 0.13/0.36 cnf(c3, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.36 cnf(c4, plain,
% 0.13/0.36 unequally_directed_opposite_lines(X0,X1),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.36
% 0.13/0.36 cnf(c5, axiom,
% 0.13/0.36 unequally_directed_lines(X2,reverse_line(X3)) | ~unequally_directed_opposite_lines(X2,X3)).
% 0.13/0.36 cnf(a2, assumption,
% 0.13/0.36 X0 = X2).
% 0.13/0.36 cnf(a3, assumption,
% 0.13/0.36 X1 = X3).
% 0.13/0.36 cnf(c6, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.36 cnf(c7, plain,
% 0.13/0.36 unequally_directed_lines(X2,reverse_line(X3)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.36
% 0.13/0.36 cnf(c8, axiom,
% 0.13/0.36 left_convergent_lines(X4,reverse_line(X5)) | left_convergent_lines(X4,X5) | ~unequally_directed_lines(X4,reverse_line(X5)) | ~unequally_directed_lines(X4,X5)).
% 0.13/0.36 cnf(a4, assumption,
% 0.13/0.36 X2 = X4).
% 0.13/0.36 cnf(a5, assumption,
% 0.13/0.36 reverse_line(X3) = reverse_line(X5)).
% 0.13/0.36 cnf(c9, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 left_convergent_lines(X4,reverse_line(X5)) | left_convergent_lines(X4,X5) | ~unequally_directed_lines(X4,X5),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, axiom,
% 0.13/0.36 ~left_convergent_lines(X6,reverse_line(X7))).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 X4 = X6).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 reverse_line(X5) = reverse_line(X7)).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 left_convergent_lines(X4,X5) | ~unequally_directed_lines(X4,X5),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.13/0.36 cnf(c13, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c14, axiom,
% 0.13/0.36 ~left_convergent_lines(X8,X9)).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 X4 = X8).
% 0.13/0.36 cnf(a9, assumption,
% 0.13/0.36 X5 = X9).
% 0.13/0.36 cnf(c15, plain,
% 0.13/0.36 ~unequally_directed_lines(X4,X5),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.13/0.36 cnf(c16, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])).
% 0.13/0.36
% 0.13/0.36 cnf(c17, axiom,
% 0.13/0.36 unequally_directed_lines(X10,X11) | ~convergent_lines(X10,X11)).
% 0.13/0.36 cnf(a10, assumption,
% 0.13/0.36 X4 = X10).
% 0.13/0.36 cnf(a11, assumption,
% 0.13/0.36 X5 = X11).
% 0.13/0.36 cnf(c18, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.13/0.36 cnf(c19, plain,
% 0.13/0.36 ~convergent_lines(X10,X11),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.13/0.36
% 0.13/0.36 cnf(c20, plain,
% 0.13/0.36 convergent_lines(sK5,sK6)).
% 0.13/0.36 cnf(a12, assumption,
% 0.13/0.36 X10 = sK5).
% 0.13/0.36 cnf(a13, assumption,
% 0.13/0.36 X11 = sK6).
% 0.13/0.36 cnf(c21, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])).
% 0.13/0.36
% 0.13/0.36 cnf(c22, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, sK5),
% 0.13/0.36 bind(X1, sK6),
% 0.13/0.36 bind(X2, sK5),
% 0.13/0.36 bind(X3, sK6),
% 0.13/0.36 bind(X4, sK5),
% 0.13/0.36 bind(X5, sK6),
% 0.13/0.36 bind(X6, sK5),
% 0.13/0.36 bind(X7, sK6),
% 0.13/0.36 bind(X8, sK5),
% 0.13/0.36 bind(X9, sK6),
% 0.13/0.36 bind(X10, sK5),
% 0.13/0.36 bind(X11, sK6)
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------